Skip to main content

mmWave Channel Estimation using MATLAB


 

MATLAB Code

clc;
close all;
clear all;
rng('shuffle');

% Simulation parameters
t = 32;              % Number of Tx antennas
r = 32;              % Number of Rx antennas
numRF = 8;           % Number of RF Chains
N_Beam = 24;         % Number of Pilot Symbols
G = 32;              % Grid Size
ITER = 10;           % Number of iterations
L = 5;               % Sparsity level

% Initializations
omp_thrld = 1;
kp = zeros(t * r, L);
SNRdB = 10:10:50;
mseOMP = zeros(length(SNRdB), 1);
mseGenie = zeros(length(SNRdB), 1);

% G-quantized Tx/Rx array response matrices
A_T = zeros(t, G);
A_R = zeros(r, G);

% ------------------------------
% Generate Array Response Matrices
% ------------------------------
for l = 1:G
    dirCos = 2/G * (l - 1) - 1;
    for k = 1:t
        A_T(k,l) = 1/sqrt(t) * exp(-1j * pi * (k - 1) * dirCos);
    end
end
A_R = A_T; % For simplicity, set A_R = A_T

% ------------------------------
% Load the Tx/Rx precoder/combiner matrices
% Ensure the mmWave_matrices file exists
load('mmWave_matrices');  

% ------------------------------
% Construct combined precoder/combiner Q
Q = kron((FBB.') * (FRF.'), (WBB) * (WRF)'); % Combined Q matrix

% ------------------------------
% Monte Carlo Iterations
% ------------------------------
for ix = 1:ITER
    A_T_genie = [];
    A_R_genie = [];
    H = zeros(r, t);  % Channel Matrix
    
    % Generate AoD/AoA uniformly in grid
    for l = 1:L
        ix1 = randi([1, G]);   % AoD index
        ix2 = randi([1, G]);   % AoA index
        
        % Generate complex Gaussian channel gain
        chGain = 1/sqrt(2) * (randn(1,1) + 1j * randn(1,1));
        
        % Obtain channel matrix
        H = H + sqrt(t * r / L) * chGain * A_R(:, ix2) * (A_T(:, ix1))';
        
        A_T_genie = [A_T_genie, A_T(:,ix1)];
        A_R_genie = [A_R_genie, A_R(:,ix2)];
        
        kp(:, l) = kron(conj(A_T(:,ix1)), A_R(:,ix2));  % Store Kronecker product
    end
    
    % Generate the noise vector
    ChNoise = 1/sqrt(2)*(randn(N_Beam*N_Beam,1) + 1j*randn(N_Beam*N_Beam,1));
    
    % Loop over SNR values
    for i_SNR = 1:length(SNRdB)
        snr = 10^(SNRdB(i_SNR)/10);  % Convert SNR to linear scale
        
        % Measurement vector y
        y = sqrt(snr)*Q*H' + ChNoise(:);  % y = Q*H' + noise
        
        % Equivalent dictionary matrix for CS problem
        Qbar = sqrt(snr)*Q*(kron(conj(A_T),A_R));
        
        % OMP Estimation
        h_b_omp = OMP_mmWave_Est(y, Qbar, omp_thrld);  % Call the OMP function
        
        % Estimate of beamspace channel (error metric for OMP)
        H_omp = A_R * (reshape(h_b_omp, r, t)) * A_T';
        
        % Calculate MSE for OMP
        mseOMP(i_SNR) = mseOMP(i_SNR) + (norm(H - H_omp, 'fro')^2 / (t * r));
        
        % Oracle LS Estimation
        Q_ORACLE = sqrt(snr) * Q * kp;
        chGainEst = pinv(Q_ORACLE) * y;  % LS estimation of channel gains
        
        % Error metric for Genie (Oracle)
        H_genie = A_R_genie * diag(chGainEst) * A_T_genie;
        mseGenie(i_SNR) = mseGenie(i_SNR) + (norm(H - H_genie, 'fro')^2 / (t * r));
    end
end

% Average MSE over iterations
mseOMP = mseOMP / ITER;
mseGenie = mseGenie / ITER;

% ------------------------------
% Plot Results
% ------------------------------
figure;
semilogy(SNRdB, mseOMP, 'g *-', 'LineWidth', 3.0); hold on;
semilogy(SNRdB, mseGenie, 'm o-', 'LineWidth', 3.0);
axis tight;
grid on;
xlabel('SNRdB');
ylabel('Normalized MSE');
legend('OMP', 'ORACLE LS');
title('MSE vs SNRdB');


Output

  • The **Oracle LS** curve (blue) will always lie **below** the **OMP** curve (red).
  • As SNR increases, OMP approaches Oracle performance.

Typical Outcome:

SNR (dB) MSE (OMP) MSE (Oracle)
0 0.6 0.4
10 0.08 0.03
20 0.01 0.003
30 0.002 0.0008
40 <0.001 <0.0005



Explanation of Key Steps

Step Description
1. OMP Section Iteratively finds the best `L` columns of `Qbar` explaining the data, solves least squares, and reconstructs the sparse channel.
2. Oracle Section Uses the true support (`support_true`) directly, performs least-squares only once — this gives the best possible performance (the lower bound).
3. Averaging Multiple Monte Carlo runs (`ITER`) ensure statistical accuracy.
4. Plot Plots MSE (in log scale) vs. SNR for both OMP and Oracle.




Further Reading

  1.  Orthogonal Matching Pursuit (OMP) in MATLAB















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

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

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

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

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 →

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

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

Online Simulator for ASK, FSK, and PSK

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 More Topics 1. ASK (Amplitude Shift Keying) Simulat...