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

Q-function in BER vs SNR Calculation (with Simulation)

Q-function in BER vs. SNR Calculation In digital communications and signal processing, the Q-function plays a significant role in predicting system reliability. It allows engineers to quantify the probability that Gaussian noise will exceed a specific threshold, causing a bit error. What is the Q-function? The Q-function is a mathematical function representing the tail probability of the standard normal (Gaussian) distribution. It is the complementary cumulative distribution function (CCDF) of a standard Gaussian distribution. Q(x) = (1 / √(2Ï€)) ∫â‚“∞ e^(-t² / 2) dt Q-Function Interactive Simulator Move the slider to see how the "Tail Probability" (the area in red) changes. This area represents the Probability of Error (BER) . Threshold Distance ( x ) — (Simulates Increasing SNR) x = 1.0 Q(x) = 0.1587 ...

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

RMS Delay Spread, Excess Delay Spread and Multi-path ...(with MATLAB + Simulator)

📘 Overview of Delay Spread and Multi-path 🧮 Excess Delay spread 🧮 Power delay Profile 🧮 RMS Delay Spread 📚 Further Reading 📂 Other Topics on RMS Delay Spread, Excess Delay ... 🧮 Multipath Components or MPCs 🧮 Online Simulator for Calculating RMS Delay Spread 🧮 Why is there significant multipath in the case of very high frequencies? 🧮 Why RMS Delay Spread is essential for wireless communication? 🧮 Why the Power Delay Profile is essential? 🧮 MATLAB Codes for Calculating Different Types of delay Spreads Delay Spread, Excess Delay Spread, and Multipath (MPCs) The fundamental distinction between wireless and wired connections is that in wireless connections signal reaches at receiver thru multipath signal propagation rather than directed transmission like co-axial cable. Wireless Communication has no set communication path between the transmitter and the receiver. The line...

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} \] ...

OFDM Symbols and Subcarriers Explained

This article explains how OFDM (Orthogonal Frequency Division Multiplexing) symbols and subcarriers work. It covers modulation, mapping symbols to subcarriers, subcarrier frequency spacing, IFFT synthesis, cyclic prefix, and transmission. Step 1: Modulation First, modulate the input bitstream. For example, with 16-QAM , each group of 4 bits maps to one QAM symbol. Suppose we generate a sequence of QAM symbols: s0, s1, s2, s3, s4, s5, …, s63 Step 2: Mapping Symbols to Subcarriers Assume N sub = 8 subcarriers. Each OFDM symbol in the frequency domain contains 8 QAM symbols (one per subcarrier): Mapping (example) OFDM symbol 1 → s0, s1, s2, s3, s4, s5, s6, s7 OFDM symbol 2 → s8, s9, s10, s11, s12, s13, s14, s15 … OFDM sym...

Orthogonal Time Frequency Space (OTFS) (with MATLAB)

In OTFS (Orthogonal Time Frequency Space) modulation — a scheme designed for high-Doppler and time-varying wireless channels — the terms ISFFT and SFFT are key mathematical transformations used to move between different representation domains. Figure: OTFS block diagram 1. ISFFT — Inverse Symplectic Finite Fourier Transform Purpose: Transforms data symbols from the delay-Doppler domain to the time-frequency domain . \[ X[n, m] = \frac{1}{\sqrt{NM}} \sum_{k=0}^{N-1} \sum_{l=0}^{M-1} x[k, l] \, e^{j2\pi \left( \frac{nk}{N} - \frac{ml}{M} \right)} \] Here, \( N \) is the number of Doppler bins (time slots), and \( M \) is the number of delay bins (subcarriers). The ISFFT maps each data symbol from the delay-Doppler grid (where the channel is sparse and easier to equalize) to the time-frequency grid (where standard multicarrier modulation like OFDM can be applied). 2. SFFT — Symplectic Finite Fourier Transform Purpose: Performs the reverse operation ...

Choke Input Filter Explained

  Choke Input Filter Choke Input Filter A well-designed choke input filter is a type of power supply filter used to smooth the output of a rectifier (like in DC power supplies). It uses an inductor (choke) as the first component right after the rectifier, followed by a capacitor. Basic Structure Rectifier → Choke (L) → Capacitor (C) → Load What Makes It Well-Designed? Critical Inductance is satisfied: The choke must have enough inductance to keep current flowing continuously. This minimum value is called critical inductance. Low ripple output: A good design significantly reduces AC ripple in the DC output. The choke resists sudden changes in current. Proper load current: Works best when the load current is above a certain minimum level. Too light a load results in poor filter...