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>>

People are good at skipping over material they already know!

View Related Topics to







Contact Us

Name

Email *

Message *

Popular Posts

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

📘 Overview & Theory 🧮 MATLAB Codes 📚 Further Reading Bit Error Rate (BER) Equations 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) Theoretical BER vs SNR for Amplitude Shift Keying (ASK) The theoretical Bit Error Rate (BER) for binary ASK depends on how binary bits are mapped to signal amplitudes. For typical cases: If bits are mapped to 1 and -1, the BER is: BER = Q(√(2 × SNR)) If bits are mapped to 0 and 1, the BER becomes: BER = Q(√(SNR / 2)) Where: Q(x) is the Q-function: Q(x) = 0.5 × erfc(x / √2) SNR : Signal-to-Noise Ratio N₀ : Noise Power Spectral Density Understanding the Q-F...

Simulation of ASK, FSK, and PSK using MATLAB Simulink (with Online Simulator)

📘 Overview 🧮 How to use MATLAB Simulink 🧮 Simulation of ASK using MATLAB Simulink 🧮 Simulation of FSK using MATLAB Simulink 🧮 Simulation of PSK using MATLAB Simulink 🧮 Simulator for ASK, FSK, and PSK 🧮 Digital Signal Processing Simulator 📚 Further Reading ASK, FSK & PSK HomePage MATLAB Simulation Simulation of Amplitude Shift Keying (ASK) using MATLAB Simulink In Simulink, we pick different components/elements from MATLAB Simulink Library. Then we connect the components and perform a particular operation. Result A sine wave source, a pulse generator, a product block, a mux, and a scope are shown in the diagram above. The pulse generator generates the '1' and '0' bit sequences. Sine wave sources produce a specific amplitude and frequency. The scope displays the modulated signal as well as the original bit sequence created by the pulse generator. Mux i...

BER vs SNR for M-ary QAM, M-ary PSK, QPSK, BPSK, ...(MATLAB Code + Simulator)

Bit Error Rate (BER) & SNR Guide Analyze communication system performance with our interactive simulators and MATLAB tools. 📘 Theory 🧮 Simulators 💻 MATLAB Code 📚 Resources BER Definition SNR Formula BER Calculator MATLAB Comparison 📂 Explore M-ary QAM, PSK, and QPSK Topics ▼ 🧮 Constellation Simulator: M-ary QAM 🧮 Constellation Simulator: M-ary PSK 🧮 BER calculation for ASK, FSK, and PSK 🧮 Approaches to BER vs SNR What is Bit Error Rate (BER)? The BER indicates how many corrupted bits are received compared to the total number of bits sent. It is the primary figure of merit for a...

Power Spectral Density Calculation Using FFT in MATLAB

📘 📘 Overview 🧮 🧮 Steps to calculate 💻 🧮 MATLAB Codes 📚 📚 Further Reading Power spectral density (PSD) tells us how the power of a signal is distributed across different frequency components, whereas Fourier Magnitude gives you the amplitude (or strength) of each frequency component in the signal. Steps to calculate the PSD of a signal Firstly, calculate the fast Fourier transform (FFT) of a signal. Then, calculate the Fourier magnitude (absolute value) of the signal. Square the Fourier magnitude to get the power spectrum. To calculate the Power Spectral Density (PSD), divide the squared magnitude by the product of the sampling frequency (fs) and the total number of samples (N). Formula: PSD = |FFT|^2 / (fs * N) Sampling frequency (fs): The rate at which the continuous-time signal is sampled (in Hz). ...

Online Simulator for ASK, FSK, and PSK

Try our new Digital Signal Processing Simulator!   •   Interactive ASK, FSK, and BPSK tools updated for 2025. Start Now Interactive Modulation Simulators Visualize binary modulation techniques (ASK, FSK, BPSK) in real-time with adjustable carrier and sampling parameters. 📡 ASK Simulator 📶 FSK Simulator 🎚️ BPSK Simulator 📚 More Topics ASK Modulator FSK Modulator BPSK Modulator More Topics Simulator for Binary ASK Modulation Digital Message Bits Carrier Freq (Hz) Sampling Rate (...

MATLAB Codes for Various types of beamforming | Beam Steering, Digital...

📘 How Beamforming Improves SNR 🧮 MATLAB Code 📚 Further Reading 📂 Other Topics on Beamforming in MATLAB ... MIMO / Massive MIMO Beamforming Techniques Beamforming Techniques MATLAB Codes for Beamforming... How Beamforming Improves SNR The mathematical [↗] and theoretical aspects of beamforming [↗] have already been covered. We'll talk about coding in MATLAB in this tutorial so that you may generate results for different beamforming approaches. Let's go right to the content of the article. In analog beamforming, certain codebooks are employed on the TX and RX sides to select the best beam pairs. Because of their beamforming gains, communication created through the strongest beams from both the TX and RX side enhances spectrum efficiency. Additionally, beamforming gain directly impacts SNR improvement. [Read more about Beamforming and How it improves SNR] Wireless...

Constellation Diagrams of ASK, PSK, and FSK (with MATLAB Code + Simulator)

Constellation Diagrams: ASK, FSK, and PSK Comprehensive guide to signal space representation, including interactive simulators and MATLAB implementations. 📘 Overview 🧮 Simulator ⚖️ Theory 📚 Resources Definitions Constellation Tool Key Points MATLAB Code 📂 Other Topics: M-ary PSK & QAM Diagrams ▼ 🧮 Simulator for M-ary PSK Constellation 🧮 Simulator for M-ary QAM Constellation BASK (Binary ASK) Modulation Transmits one of two signals: 0 or -√Eb, where Eb​ is the energy per bit. These signals represent binary 0 and 1. BFSK (Binary FSK) Modulation Transmits on...

Linear Predictive Coding (LPC) in Speech Processing

Linear Predictive Coding (LPC) in Speech Signal Processing What is LPC? Linear Predictive Coding (LPC) is a method that represents a speech signal using a small number of parameters. It models the speech signal as the output of a linear filter excited by a source (voice or noise). LPC is widely used in speech compression, speech synthesis, coding, and recognition. 1. Core Idea of LPC LPC assumes that the current speech sample can be approximated by a linear combination of past samples: x[n] ≈ a₁ x[n−1] + a₂ x[n−2] + ... + aₚ x[n−p] The coefficients a₁, a₂, ..., aₚ are chosen to minimize the prediction error . 2. Why This Works for Speech The human vocal tract behaves like an all-pole acoustic filter . Thus speech can be approximated by the model: x[n] = − Σ (aâ‚– x[n−k]) + G e[n] Where: aâ‚– = LPC coefficients (vocal tract shape) e[n]...