Skip to main content

Antenna Gain-Combining Methods - EGC, MRC, SC, and RMSGC



 There are different antenna gain-combining methods. They are as follows.


1. Equal gain combining (EGC)

2. Maximum ratio combining (MRC)

3. Selective combining (SC)

4. Root mean square gain combining (RMSGC)

5. Zero-Forcing (ZF) Combining 


1. Equal gain combining method

Equal Gain Combining (EGC) is a diversity combining technique in which the receiver aligns the phase of the received signals from multiple antennas (or channels) but gives them equal amplitude weight before summing.

This means each received signal is phase-corrected to be coherent with others, but no scaling is applied based on signal strength or channel quality (unlike MRC).

Mathematically, for received signals y1, y2, ..., yN with complex channel gains h1, h2, ..., hN, the EGC output is:

yegc = ∑i=1N (hi* / |hi|) · yi

Here:

  • hi is the complex channel gain
  • hi* / |hi| is a unit-magnitude phasor that corrects the phase of each path
  • All corrected signals are added with equal magnitude

2. Maximum ratio combining method

Maximum Ratio Combining (MRC) multiplies each received signal by the complex conjugate of its corresponding channel coefficient. This corrects the phase distortion introduced by the channel and gives more weight to signals with higher power (|h|2).

For example, if y1 and y2 are received signals, and h1, h2 are the complex channel gains, then:

ymrc = h1* · y1 + h2* · y2

MATLAB Code for Maximum Ratio Combining (MRC)


3. Selective combining method

In the selective combing method, we select a few data streamwise with higher SNR values than others. Then we combine them.


4. Root mean square gain combining method. 


We first take the square of individual data stream in the root mean square combining method. Then we sum them. And finally, we take the square root values of the composite data streams. This method shows the near-optimal performance as the maximum ratio combining, as some researcher claims.

5. Zero Forcing Combining

Zero Forcing is a linear combining technique used in MIMO systems to nullify inter-stream interference by inverting the channel. It works under the assumption of perfect channel knowledge (CSI).

The idea:

Given: y = Hx + n
Want to recover: x
Multiply both sides by W = (HHH)-1 HH (or pinv(H) in MATLAB)
Result: x = Wy ≈ x + Wn

It forces WH ≈ I, effectively "undoing" the channel.

 

MATLAB Code for Zero Forcing Combining

%The code is written by SalimWireless.com

clc; clear; close all;

%% Parameters
Nt = 4; % Transmit antennas
Nr = 4; % Receive antennas
numBits = 1e4; % Number of bits per stream
SNRdB = 0; % SNR in dB
numRuns = 100; % Number of independent runs for averaging

%% Precompute noise standard deviation
noiseSigma = 10^(-SNRdB / 20);

%% Accumulator for total errors
totalErrors = 0;

for run = 1:numRuns
% Generate random bits for each run
bits = randi([0 1], Nt, numBits); % Size: [4 x 10000]
txSymbols = 1 - 2 * bits; % BPSK: 0→+1, 1→-1

% Generate random Rayleigh fading channel (4x4)
H = (randn(Nr, Nt) + 1j * randn(Nr, Nt)) / sqrt(2);

% Generate AWGN noise
noise = noiseSigma * (randn(Nr, numBits) + 1j * randn(Nr, numBits)) / sqrt(2);

% Received signal
y = H * txSymbols + noise;

% Zero Forcing equalizer
W_zf = pinv(H);
rxSymbols = W_zf * y;

% BPSK demodulation
rxBits = real(rxSymbols) < 0;

% Count errors
totalErrors = totalErrors + sum(rxBits(:) ~= bits(:));
end

%% Final BER
BER = totalErrors / (Nt * numBits * numRuns);
fprintf('Average BER over %d runs for 4x4 MIMO ZF at %d dB SNR: %.5f\n', numRuns, SNRdB, BER);
web('https://www.salimwireless.com/search?q=antenna%20combining%20methods', '-browser');

Comparison of Diversity Combining Techniques

Method Complexity Performance Key Characteristic
SC Low Poor Selects only the strongest branch.
EGC Medium Moderate Phase alignment without amplitude scaling.
MRC High Optimal Maximizes SNR (Best for Rayleigh Fading).
ZF High Variable Eliminates interference in MIMO systems.

Performance Analysis: BER vs. SNR

In wireless communication, the efficiency of a combining method is measured by its Bit Error Rate (BER) performance against the Signal-to-Noise Ratio (SNR).

  • MRC provides the lowest BER because it optimally weights each branch.
  • SC is the least efficient as it discards the energy available in other branches.
  • EGC is a middle-ground solution, offering better performance than SC but with simpler hardware than MRC (no need for gain amplifiers on each branch).

Applications in Modern Wireless Systems

Antenna combining methods are the backbone of modern telecommunications:

  1. 5G and LTE: Use MRC and Zero-Forcing for Massive MIMO beamforming.
  2. Wi-Fi Routers: Selective combining is often used in consumer-grade routers to switch between internal antennas.
  3. Satellite Communication: EGC is preferred in satellite links where hardware simplicity is required for space-bound receivers.

Frequently Asked Questions (FAQ)

Q: Which combining method is the best?
A: Maximum Ratio Combining (MRC) is theoretically the best because it provides the maximum possible SNR at the output.

Q: Why use EGC over MRC?
A: EGC is used to reduce hardware complexity and cost, as it does not require the estimation of channel amplitudes, only phases.

Q: What is Diversity Gain?
A: Diversity gain is the improvement in signal-to-interference ratio provided by using multiple antennas to combat fading.

Further Reading 



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

Pulse Width Modulation (PWM)

Pulse-width modulation (PWM), or pulse-duration modulation (PDM), is a method of controlling the average power delivered by an electrical signal.   Fig: An example of PWM in an idealized inductor driven by a blue line voltage source modulated as a series of sawtooth pulses, resulting in a red line current in the inductor.    Generating a PWM Signal The simplest way to generate a PWM signal is the intersection method, which requires only a sawtooth or a triangle waveform (easily generated using a simple oscillator) and a comparator. When the value of the reference signal is more than the modulation waveform, the PWM signal (magenta) is in the high state; otherwise, it is in the low state.      Duty cycle A low duty cycle equates to low power because the power is off for most of the time; the word duty cycle reflects the ratio of "on" time to the regular interval or "period" of time. The duty cycle is measured in percent, with 100% representing full o...

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

Design of CMOS Flip-Flops (SR, D, JK)

Design of CMOS Flip-Flops (SR, D, JK) A flip-flop or latch is a circuit with two stable states, used to store state information. It is the basic storage element in sequential logic and a fundamental building block in digital electronics systems, including computers and communication devices. Flip-flops and latches act as data storage elements for states, pulse counting, and synchronization of variably-timed input signals to a reference clock. Flip-flops can be transparent/opaque (latches) or clocked (synchronous, edge-triggered). Latches are level-sensitive, while flip-flops are edge-sensitive. In sequential logic, the output depends on current inputs and previous states. Fig.1 shows a sequential circuit combining a combinational block and a memory element. ...

FFT Butterfly Method Explained (with Example of 4-point DFT)

  FFT Using Butterfly Method Given: x[n] = {0, 1, 2, 3} Step 1: Split into Even & Odd Even indices: x e = {0, 2} Odd indices: x o = {1, 3} Step 2: 2-point DFT For any {a, b}: DFT = {a + b, a - b} Even Part: E = {0+2, 0-2} = {2, -2} Odd Part: O = {1+3, 1-3} = {4, -2} Step 3: Combine Using Butterfly X[k] = E[k] + W k O[k] X[k + N/2] = E[k] - W k O[k] For N = 4: W 0 = 1 W 1 = -j Final Calculations X[0] = 2 + 4 = 6 X[2] = 2 - 4 = -2 X[1] = -2 + (-j)(-2) = -2 + 2j X[3] = -2 - (-j)(-2) = -2 - 2j Final Answer: X[k] = {6, -2 + 2j, -2, -2 - 2j} Try Interactive Online Simulations Interactive FFT Online Simulator (For understanding Fundamentals)  Interactive FFT Online Simulator (Analyze .CSV, .MP3, .MP4, etc. Further Reading Fourier Transform OFDM Return to Fourier Transform 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):