Skip to main content

Relationship between Gaussian and Rayleigh distributions



 
The Rayleigh distribution in classical fading models (like wireless communication) arises from modeling the real and imaginary parts of a complex baseband signal as independent, zero-mean Gaussian random variables — under specific assumptions.

1. Gaussian Distribution 

The Gaussian distribution has a lot of applications in wireless communication. Since noise in wireless communication systems is unpredictable, we frequently assume that it has a Gaussian distribution. Any wireless communication diagram will show the addition of AWGN noise as the signal travels through the channel. Due to its independence from operating frequency, it is known as AWGN, or additive white Gaussian noise. To determine the noise in a signal, we compute noise power density, or noise power / Hz (here, bandwidth in Hz). It mostly serves to represent real-valued random variables whose distributions are unknown in the scientific and social sciences.
It has a bell shape. According to the theory of a Gaussian random variable, under certain circumstances, the average of numerous samples (observations) of a random variable with a finite mean and variance is itself a random variable, whose distribution tends to become more normal as the number of samples rises. [Read More] about Gaussian Random Variable and Its PDF (Probability Distribution Function)  

2. Relationship between Gaussian & Rayleigh Distribution

To compute the distribution of two independent random variables, Rayleigh is essentially employed. Let me give you a typical wireless communication example. Multi-path is something we see in wireless communication. These multiple pathways are time-delayed variations of the identical signal that the receiver relayed. The distribution becomes Rayleigh when the receiver receives these signals with a different time delay. because the same signal's time-delayed received impulses are unrelated, independent by nature. Therefore, we see that the distribution of channel gains in wireless communication, especially for multi-antenna communication systems, is Rayleigh distributed. Keep in mind that the Rayleigh distribution is primarily Gaussian. Books typically describe channel noise as a Gaussian distribution with a zero mean and a specified standard deviation. The Rayleigh distribution typically represents the distribution of magnitudes of a two-dimensional vector whose components are independent and identically distributed Gaussian variables.

The mean of a Rayleigh distribution is not zero; it's actually related to a parameter σ (scale parameter), and it's equal to σ√(Ï€/2). So, the mean of a Rayleigh distribution is finite and dependent on this parameter.

If you're implying that the mean changes from zero to a finite value due to the distribution involving at least two random variables, that's not entirely accurate. The mean of the Rayleigh distribution is not zero to begin with. It's a characteristic of the distribution itself, irrespective of the number of variables involved.

 
 
 
Fig 1: Effect of AWGN and Rayleigh Fading in Wireless Communication (MATLAB Code) 


How to mitigate Rayleigh fading?

Mitigating Rayleigh fading in wireless communication involves various techniques designed to counter the rapid fluctuations in signal strength caused by multipath propagation. Some of the most common methods include: 1. Diversity Techniques (Antenna Diversity, Time Diversity, Frequency Diversity, and Space Diversity), 2. Equalization, 3. Channel Coding, etc.

Equalizer to reduce Rayleigh Fading (or Multi-path Effects)

Adaptive Equalization: Compensates for the effects of multipath fading by adjusting the signal at the receiver. Equalizers can dynamically change to combat time-varying channel conditions caused by Rayleigh fading. (Read more ...)


 
 
 
 

 This is a simulation of a typical wireless communication system with 4 multipath components spaced 1 ms apart, using BPSK modulation at a bitrate of 100 bps

 
 
 
 







 

 

 

 

Further Reading

📊 MATLAB & ONLINE SIMULATIONS (Web-Based)
🎓 GATE & UGC - NET SOLUTIONS
📡 WIRELESS & SIGNAL PROCESSING


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...
Read more

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...
Read more

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 ...
Read more

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 ...
Read more

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 ...
Read more

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

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....
Read more