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

UGC NET Electronic Science Previous Year Question Papers with Solutions

Download Papers and Solutions Exam Pattern Preparation Tips FAQs More Home / Engineering & Other Exams / UGC NET 2026 PYQ 📊 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 2026 - Question Paper Download PDF June 202...

Online Simulator for ASK, FSK, and PSK Signal Generation

Interactive Digital Signal Processing (DSP) Tutorial and Simulator for ASK, FSK, and BPSK modulation techniques. Try our new Digital Signal Processing Simulator!   •   Interactive ASK, FSK, and BPSK tools updated for 2025. Start Now Digital Modulation Visualizer: ASK, FSK, & BPSK Simulator Learn and visualize binary modulation techniques (ASK, FSK, BPSK) in real-time with adjustable carrier and sampling parameters. Perfect for DSP students and engineers. 📡 ASK Simulator 📶 FSK Simulator 🎚️ BPSK Simulator 📚 More Topics ASK Modulator FSK Modulator BPSK Modulator Demodulation More Topics 1. ASK (Ampli...

Flat vs Frequency Selective Online Simulator

Flat vs Frequency Selective Online Simulator Channel Type Without Fading Flat Fading Multipaths Nakagami m SNR(dB) Run Simulation Input Signal Signal After Fading Constellation Diagram BER vs SNR Explore Advanced Flat vs Frequency-Selective Fading Simulator Want to see these equations in action? Visualize it. Launch Simulator Tool Interactive Rayleigh Fading Simulator Want to see Rayleigh fading in action? Visualize it. Launch Simulator Tool Return to DSP Simulations Main Page →

AM Modulation Online Simulator

Amplitude Modulation Simulator s AM (t) = A c [1 + k a m(t)] cos(ω c t) where, ω = 2Ï€f & k a = Amplitude Sensitivity Modulation index, μ = k a A m Message Frequency (fm): Carrier Frequency (fc): Carrier Amplitude (Ac): Modulation Index (m = Am / Ac): Interactive AM Demodulation Online Simulator Want to see these equations in action? Visualize it. Launch Simulator Tool Interactive AM Power Simulator Visualize it. Launch Simulator Tool Return to DSP Simulations Main Page →

Linear vs Circular Convolution

Linear vs Circular Convolution Linear convolution vs circular convolution Linear convolution (what nature does) If: x[n] = transmitted signal h[n] = channel impulse response (multipath) Then the received signal is: y[n] = x[n] * h[n] This means: Past symbols spill into future symbols Causes inter-symbol interference (ISI) DFT of y[n] is not a simple product Circular convolution (what DFT assumes) The DFT assumes periodic signals : y[n] = x[n] ⊛ h[n], where indices wrap around modulo N Only under circular convolution does the DFT satisfy: Y[k] = X[k] · H[k] This is what enables one-tap frequency-domain equalization . What happens in the real channel (linear convolution) The channel performs linear convolution: y[n] = Σ l=0 Lh−1 h[l] x[n-l] But because: CP absorbs the “spillover” Receiver discards CP before DFT The useful part of the received symbol becomes: y[n] = Σ l=0 Lh−1 h[l] x[(n-l) mod N] Modulo inde...

Theoretical BER vs SNR for binary ASK, FSK, and PSK (with MATLAB Code + Simulator)

📘 Overview & Theory 🧮 MATLAB Codes 🧮 Q-function 📚 Further Reading Bit Error Rate (BER) Equations In ASK, noise directly affects the signal amplitude, making it the most vulnerable since the data is carried in amplitude changes. In FSK, data is represented by frequency variations, and because noise typically impacts amplitude more than frequency, FSK is more robust than ASK. In PSK, data is encoded in the signal phase, and BPSK specifically uses 180-degree phase shifts, creating the greatest separation between signal points and therefore achieving the lowest bit error rate (BER) for the same power level. BER formulas for ASK, FSK, and PSK modulation schemes. ASK BER = 0.5 × erfc(0.5 × √SNR) FSK BER = 0.5 × erfc(√(SNR / 2)) PSK BER = 0.5 × erfc(√SNR) ...

Chirp Signal Simulator

Chirp Signal Simulator Starting Frequency (Hz) Ending Frequency (Hz) Amplitude phase Up-Chirp (unchecked = Down-Chirp) Generate Chirp Demodulate Return to DSP Simulations Main Page →