Skip to main content

MATLAB Code for Zero-Forcing (ZF) Beamforming in 4×4 MIMO Systems


MATLAB Code for Zero-Forcing (ZF) Beamforming in 4×4 MIMO Systems


clc; clear; close all;

%% Parameters
Nt = 4; % Transmit antennas
Nr = 4; % Receive antennas (must be >= Nt for ZFBF)
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: [4 x 10000]
bits = randi([0 1], Nt, numBits);

% BPSK modulation: 0 → +1, 1 → -1
txSymbols = 1 - 2 * bits;

% Rayleigh channel matrix: [4 x 4]
H = (randn(Nr, Nt) + 1j * randn(Nr, Nt)) / sqrt(2);

%% === Zero Forcing Beamforming at Transmitter ===
W_zf = pinv(H); % Precoding matrix: [Nt x Nr]
txPrecoded = W_zf * txSymbols; % Apply ZF precoding

% Normalize transmit power (optional but useful)
txPrecoded = txPrecoded / sqrt(mean(abs(txPrecoded(:)).^2));

%% Channel transmission with AWGN
noise = noiseSigma * (randn(Nr, numBits) + 1j * randn(Nr, numBits)) / sqrt(2);
y = H * txPrecoded + noise; % Received signal: y = H * W_zf * x + n

%% Receiver directly demodulates (ideally H*W_zf ≈ I)
rxBits = real(y) < 0;

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

%% Final BER
BER = totalErrors / (Nt * numBits * numRuns);
fprintf('Average BER over %d runs for 4x4 MIMO ZF Beamforming at %d dB SNR: %.5f\n', numRuns, SNRdB, BER);

 

Output

Average BER over 100 runs for 4x4 MIMO ZF Beamforming at 0 dB SNR: 0.16115 

Mathematical Concept of Zero-Forcing (ZF)

In a MIMO (Multiple-Input Multiple-Output) system, the received signal is represented as y = Hx + n. The goal of Zero-Forcing Beamforming is to eliminate Inter-Stream Interference (ISI) by applying a weight matrix W at the transmitter.

The ZF Condition: The precoding matrix W is designed such that HW = I (the Identity Matrix).
This is achieved using the Moore-Penrose Pseudo-inverse:
W = HH(HHH)-1

By applying this at the transmitter, the receiver "sees" independent parallel channels, making demodulation as simple as a BPSK decision.

Why is Zero-Forcing not always ideal?

While ZF completely eliminates interference, it suffers from Noise Enhancement at low SNR. For a more robust system, engineers use MMSE Beamforming, which balances interference cancellation with noise suppression.



Learn how to upgrade this code to MMSE →


Contact Us

Name

Email *

Message *

Popular Posts

LDPC Encoding and Decoding Techniques

Low Density Parity Check (LDPC) Guide Comprehensive analysis of linear error-correcting block codes, Tanner graphs, and 5G-NR implementations. 📘 Overview 🧮 Encoding 🧩 Decoding 📚 Resources Theory Encoding Tech Tanner Graph 5G Encoding Decoding 'LDPC' is the abbreviation for 'low density parity check'. LDPC code H matrix contains very few amount of 1's and mostly zeroes. LDPC codes are error correcting code. Using LDPC codes, channel capacities that are close to the theoretical Shannon limit can be achieved. Low density parity check (LDPC) codes are linear error-correcting block code suitable for error correction in a large block sizes transmi...

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 →

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

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

Gaussian minimum shift keying (GMSK)

📘 Overview & Theory 🧮 Simulator for GMSK 🧮 MSK and GMSK: Understanding the Relationship 🧮 MATLAB Code for GMSK 📚 Simulation Results for GMSK 📚 Q & A and Summary 📚 Further Reading Dive into the fascinating world of GMSK modulation, where continuous phase modulation and spectral efficiency come together for robust communication systems! Core Process of GMSK Modulation Phase Accumulation (Integration of Filtered Signal) After applying Gaussian filtering to the Non-Return-to-Zero (NRZ) signal, we integrate the smoothed signal to produce a continuous phase signal. For GMSK, the modulation index is $h=0.5$, meaning a bit '1' results in a phase shift of $\pi/2$: θ(t) = 2Ī€h ∫ 0 t m filtered (Ī„) dĪ„ This integration is crucial for avoiding abrupt phase transitions, ensuring smooth and continuous phase changes. Phase Mo...

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 2025 - Question Paper Download PDF June 2025 - Sol...

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 The Role of the Q-function in BER vs. SNR The Q-function is the standard tool for calculating BER in systems like BPSK or QPSK over AWGN (Additive White Gaussian Noise) channels. For BPSK: In BPSK, we transmit +√E b (bit 1) and -√E b (bit 0). The decision boundary is set at 0 . If -√E b was sent, an error occurs if noise r > √...