Skip to main content

Sender, Source & Channel Coding, Channel, Receiver in wireless communication - step by step



Mechanism of wireless communication - step by step:

Example: 

 

 Original Analog Message signal

 
 Sampled Message Signal (Digitalized Signal)
 
Quantized Message Signal (Mapped to Finite Signal Levels)


Encoded Signal (after Source Coding)

 
 
Then we perform channel coding to enable error correction during transmission. Then, we apply modulation and transmit the signal through a wireless medium. After receiving the signal, we first demodulate it, then apply channel decoding followed by source decoding, and finally retrieve the original message signal. 
In our case, the source message signal is analog, not digital. However, the process discussed here is applicable to Pulse Code Modulation (PCM) signal. For analog signal transmission, we simply modulate the signal with a higher frequency and then transmit it. On the receiver side, we apply the demodulation process to the received signal and retrieve the original analog message signal. 
 
 
 
 





Modern Wireless Communication Process:

 


 

Fig: Process of wireless communication

 

In the above figures, a typical wireless communication system is illustrated. The original message signal—such as digitized computer data (a bit stream of 0s and 1s)—is first sampled and then quantized. After quantization, the signal undergoes source coding, where it is efficiently encoded into binary form. To transmit this signal over a wireless medium, the binary bits are modulated using an appropriate modulation scheme.

At the receiver end, the signal is first demodulated, followed by source decoding and any additional processing needed to reconstruct the original message signal (e.g., audio). Channel coding, which is typically applied after source coding, enables error detection and correction to combat impairments like attenuation and multi-path fading introduced during transmission.

 

Wireless communication is a method of communication in which the transmitter and receiver communicate over the air or free space. Between the transmitter and the receiver, there is no wiring for wireless communication. The communication path, which is air or free space in this case, is referred to as a channel. The electrical signal is converted by the transmitter as '0' and '1'. The electric signal then transmits via the channel (air or free space) after a successful modulation procedure. The signal is then received by the receiver. It is practically difficult to recover the same signal that the transmitter sends. Due to attenuation or distortion, the signal becomes corrupted while travelling across the channel. A wireless communication system's fundamentals are as follows.

The following is a list of the various elements involved in the wireless communication process

1.Sender
2.Message
3.Encoding (source & channel coding)
4.Channel
5.Receiver
6.Decoding
7.Acknowlegement / Feedback



Sender:


Here, in communication process sender is who sends messages, files, audio, etc. to indented receiver. Here, sender send his message from smartphones, PCs, etc. using specific application.


Digitization of Message Signal in Communication Process (sampling + quantization):

In general, message signal's source is analogue in nature. Now, the analogue signal is turned into a digital signal (or, the original analogue signal is changed into '0' or'1' bits) by sampling and then quantization). Quantization helps to map the signal into finite levels. We convert analog signals to digital signals using the analog to digital converter (ADC).

There are also some exceptional cases where the source signal is not analog. The acquired images by radar, for example, are not analog signals because the image is a digital signal. After that, we process it and deliver it to the receivers on earth.


Source coding / encoding:


We are aware that the original message file is huge in size. Imagine how much memory is required to store a one-hour voice recording. It's likely that a few GB of memory is required. When we convert it to digital by just sampling at the very beginning of transmission procedure, it still requires a large number of memories to store. On the other hand, we always prefer to transmit a compressed signal over an uncompressed huge file if possible. So, we compress it. We use coding, also known as source coding, to compress the digitalized message signal. Source coding can reduce the size of a message signal. The message signal could be text, audio, or voice, for example. Text, voice, and audio messages can all benefit from source coding. For sending, original message without compressing it, it will take longer and result in more bit errors due to the larger file size. Popular examples of source coding are Huffman coding, LZW coding, etc.


Channel Coding:


After source coding, channel coding allows us to code the compressed message signal with various types of coding, such as forward error correcting (FEC) coding, so that we can recover the required message signal at the receiver terminal even if some bits are lost or distorted. Another illustration is the use of the CRC or cyclic coding technique in OFDM 4G-LTE communication to retrieve the original signal or measure the channel's status.


 

Simulation Results:

1. Suppose we are sending a text message signal 'Wireless'
 

Explore This Simulation

Explore Signal Processing Simulations

# Wireless channel are more prone to bit error than wired channels

Digital communication and its application and pictures


Next Page>>


Contact Us

Name

Email *

Message *

Popular Posts

Hybrid Beamforming | Page 1

Beamforming Techniques Hybrid Beamforming... Page 1 | Page 2 | Hybrid Beamforming: Hybrid beam formation was developed to address some of the limitations of digital pre-coding approaches. Every antenna element is connected to an RF chain in digital pre-coding (beam forming) method. We also know that each RF chain is in charge of providing a separate data stream between the transmitter and the receiver. We know that a larger number of independent data streams leads to higher data rates. It has a spatial multiplexing feature for MIMO. As a result, we may assume that switching from MIMO to massive MIMO will benefit us more in terms of spatial multiplexing in massive MIMO, where each antenna is coupled to a single RF chain. We'll proceed with a definition of hybrid beam forming. Overview of hybrid beam forming with example: Unlike digital beam forming, more than one antenna element is connected to a single RF chain in hybr...

MATLAB Code for 8-PSK, 16-PSK, ...

📘 Overview & Theory 🧮 MATLAB Code for BPSK, QPSK, 8-PSK, 16-PSK, 32-PSK 🧮 Simulator for m-ary PSK 📚 Further Reading   MATLAB Code for BPSK, QPSK, 8-PSK, 16-PSK, 32-PSK clc; clear all; close all; rng(10) M = 8; % M = 2, 4, 8, 16, 32, etc. N_Bits = 2520; Phase = 0; data_info_bit = randi([0,1],N_Bits,1); data_temp = bi2de(reshape(data_info_bit,N_Bits/log2(M),log2(M))); modData = pskmod(data_temp,M,Phase); figure(1); scatterplot(modData); channelAWGN = 15; rxData2 = awgn(modData, channelAWGN); figure(2); scatterplot(rxData2); demodData = pskdemod(rxData2,M,Phase);   for BPSK, Constellation Size, M = 2 for QPSK, M = 4 for 8-PSK, M = 8, and so on    Output Figure: 8-PSK Modulation Figure: 8-PSK Demodulation after adding AWGN Noise Using the above MATLAB code you'll able be to modulate and demodulate 2-PSK, 4-PSK, 8-PSK, 16-PSK, 32-PSK and so on.  16-PSK   Fig: 16-PSK In this above code ' M ' is the number of the conste...

UGC NET Electronic Science Previous Year Question Papers with Solutions

Home / Engineering & Other Exams / UGC NET 2026 PYQ ⬇️ Download Papers and Solutions 📋 Exam Pattern 💡 Preparation Tips ❓ FAQs 📊 Exam Highlights: Electronic Science (88) Feature Details Junior Research Fellowship (JRF) ₹37,000 + HRA per month Eligibility M.Sc/M.Tech in Electronics (55%) Validity of Certificate JRF (3 Years) | Lectureship (Lifetime) 📥 Download UGC NET Electronics PDFs Complete collection of previous year question papers, answer keys and explanations for Subject Code 88. Start Downloading 📂 View All Question Papers June 2025 - Question Paper Download PDF June 2025 - Solved Paper + Explanation ...

How Windowing Affects Your Periodogram

The windowed periodogram is a widely used technique for estimating the Power Spectral Density (PSD) of a signal. It enhances the classical periodogram by mitigating spectral leakage through the application of a windowing function. This technique is essential in signal processing for accurate frequency-domain analysis.   Power Spectral Density (PSD) The PSD characterizes how the power of a signal is distributed across different frequency components. For a discrete-time signal, the PSD is defined as the Fourier Transform of the signal’s autocorrelation function: S x (f) = FT{R x (Ï„)} Here, R x (Ï„)}is the autocorrelation function. FT : Fourier Transform   Classical Periodogram The periodogram is a non-parametric PSD estimation method based on the Discrete Fourier Transform (DFT): P x (f) = \(\frac{1}{N}\) X(f) 2 Here: X(f): DFT of the signal x(n) N: Signal length However, the classical periodogram suffers from spectral leakage due to abrupt truncation of the ...

Advanced M-ary Modulation Simulator: Constellation, min dist, Efficiency, SER, EVM (RMS)

Advanced M-ary Communication Lab Analytical & Statistical Performance of Digital Modulation Theoretical Probability of Error (\(P_s\)) \[ P_s = Q\left(\sqrt{\frac{2 E_b}{N_0}}\right) \] Modulation (M-ary) BPSK (M=2) QPSK (M=4) 8-PSK (M=8) 16-QAM (M=16) 64-QAM (M=64) 256-QAM (M=256) SNR (\(E_b/N_0\)): 12 dB Efficiency 2 bps/Hz Min Dist (\(d_{min}\)) 1.41 Symbol Error 1.2e-5 EVM (RMS) 0.0% Constellation Diagram Noise PDF & Decision Tail 1. Geometric Mapping ...

Frequency Shift Keying (FSK) Modulation & Demodulation (with Simulation)

Frequency Shift Keying (FSK) Theoretical Foundations: Frequency Shift Keying (FSK) is a discrete frequency modulation scheme wherein the digital information is encoded via instantaneous shifts in the carrier signal's frequency. The fundamental implementation is Binary FSK (BFSK), which maps binary data onto two distinct, discrete spectral states. A binary '1' (the "mark" state) is represented by a carrier frequency \( f_1 \), while a binary '0' (the "space" state) corresponds to frequency \( f_2 \). Each symbol is sustained for a bit interval denoted by \( T_b \). FSK Transmitter Characterization: The mathematical model for the modulated BFSK output \( s(t) \) is defined as: \[ s(t) = \begin{cases} A_c \cos(2\pi f_1 t), & \text{for } m = 1 \\ A_c \cos(2\pi f_2 t), & \text{for } m = 0 \end{cases} \] ...

Galois Fields: GF(2) and GF(2m) and Primitive Polynomial

Galois Fields: GF(2) and GF(2 m ) 1. What is a Galois Field (GF)? A Galois Field (GF) is a finite set of elements in which the four basic arithmetic operations—addition, subtraction, multiplication, and division (except by zero)— are all well defined and closed. GF(q) ⇒ a field with exactly q elements 2. The Simplest Field: GF(2) GF(2) is the smallest possible finite field and forms the foundation of all digital systems. GF(2) = {0, 1} Addition in GF(2) Addition is performed modulo 2 (XOR operation): + 0 1 0 0 1 1 1 0 Multiplication in GF(2) × 0 1 0 0 0 1 0 1 GF(2) is used in binary logic, XOR operations, and simple error-control codes. 3. Meaning of GF(2 m ) GF(2 m ) is a finite field containing exactly 2 m elements . Each element represents an m-bit symbol . Field Number of Elements GF(2) 2 GF(2²) 4 GF(2³) 8 GF(2⁸) 256 Important: GF(2 m ) is not integer arithmetic modulo 2 m . It is polynomial-based arithmetic. 4....