Skip to main content

mmWave MIMO Channel Estimation


This tutorial walks through the derivation of the Equivalent Sensing Matrix and how the mmWave MIMO channel estimation problem can be expressed as a compressed sensing model. A numerical example is included for clarity.



The mmWave MIMO System Model

In a hybrid beamforming setup, the received signal is:

\[ \mathbf{y} = \sqrt{P}\, \mathbf{W}^H \mathbf{H} \mathbf{F} \mathbf{s} + \tilde{\mathbf{n}} \]

Where:

SymbolMeaning
\( P \)Transmit power
\( \mathbf{W} = \mathbf{W}_{RF}\mathbf{W}_{BB} \)Receiver hybrid combiner
\( \mathbf{F} = \mathbf{F}_{RF}\mathbf{F}_{BB} \)Transmitter hybrid precoder
\( \mathbf{s} \)Training / pilot vector
\( \tilde{\mathbf{n}} \)Noise vector
\( \mathbf{H} \)mmWave channel matrix


Sparse Channel Representation

The physical mmWave channel can be expressed using array response matrices:

\[ \mathbf{H} = \mathbf{A}_R \mathbf{H}_b \mathbf{A}_T^* \]

Where:

  • \( \mathbf{A}_R \): receive array response matrix
  • \( \mathbf{A}_T \): transmit array response matrix
  • \( \mathbf{H}_b \): beamspace (sparse) channel matrix

The vectorized form is:

\[ \text{vec}(\mathbf{H}) = (\mathbf{A}_T^* \otimes \mathbf{A}_R)\mathbf{h}_b \]
where \( \mathbf{h}_b = \text{vec}(\mathbf{H}_b) \).


Substituting the Channel into the System Model

\[ \mathbf{y} = \sqrt{P}\, \mathbf{W}^H \mathbf{A}_R \mathbf{H}_b \mathbf{A}_T^* \mathbf{F} \mathbf{s} + \tilde{\mathbf{n}} \]
Since \( \mathbf{s} \) is known during training, we absorb it into \( \mathbf{F} \).


Vectorization using the Kronecker Product

We use the identity:

\[ \text{vec}(\mathbf{A}\mathbf{X}\mathbf{B}) = (\mathbf{B}^T \otimes \mathbf{A})\text{vec}(\mathbf{X}) \]

Applying this gives:

\[ \text{vec}(\mathbf{W}^H \mathbf{A}_R \mathbf{H}_b \mathbf{A}_T^* \mathbf{F}) = ((\mathbf{A}_T^* \mathbf{F})^T \otimes \mathbf{W}^H \mathbf{A}_R)\, \mathbf{h}_b \]
Therefore:
\[ \mathbf{y} = \sqrt{P}\, ((\mathbf{A}_T^* \mathbf{F})^T \otimes \mathbf{W}^H \mathbf{A}_R)\, \mathbf{h}_b + \tilde{\mathbf{n}} \]


Substitute Hybrid Beamformers

Using \( \mathbf{F} = \mathbf{F}_{RF}\mathbf{F}_{BB} \) and \( \mathbf{W} = \mathbf{W}_{RF}\mathbf{W}_{BB} \):

\[ \mathbf{y} = \sqrt{P}\, ((\mathbf{A}_T^* \mathbf{F}_{RF}\mathbf{F}_{BB})^T \otimes \mathbf{W}_{BB}^H \mathbf{W}_{RF}^H \mathbf{A}_R)\, \mathbf{h}_b + \tilde{\mathbf{n}} \]
Simplifying the transpose:
\[ (\mathbf{A}_T^* \mathbf{F}_{RF}\mathbf{F}_{BB})^T = \mathbf{F}_{BB}^T \mathbf{F}_{RF}^T \mathbf{A}_T^* \]
So:
\[ \boxed{ \mathbf{y} = \sqrt{P}\, (\mathbf{F}_{BB}^T \mathbf{F}_{RF}^T \mathbf{A}_T^* \otimes \mathbf{W}_{BB}^H \mathbf{W}_{RF}^H \mathbf{A}_R)\mathbf{h}_b + \tilde{\mathbf{n}} } \]


Defining the Equivalent Sensing Matrix

We define:

\[ \boxed{ \mathbf{Q} = \sqrt{P} \, (\mathbf{F}_{BB}^T \mathbf{F}_{RF}^T \mathbf{A}_T^*) \otimes (\mathbf{W}_{BB}^H \mathbf{W}_{RF}^H \mathbf{A}_R) } \]
Then the model simplifies beautifully to:
\[ \boxed{\mathbf{y} = \mathbf{Q}\mathbf{h}_b + \tilde{\mathbf{n}}} \]
---


Dimensions

In a practical example (from Prof. Jagannatham’s slides):

ParameterValue
\( N_T^{Beam} = N_R^{Beam} = 24 \)\( 576 \) measurements
\( G = 32 \)\( G^2 = 1024 \) unknowns

So \( \mathbf{Q} \in \mathbb{C}^{576 \times 1024} \) — an underdetermined system.



Numerical Example (2×2 System)

Setup

QuantityValue
Transmit antennas \( N_T \)2
Receive antennas \( N_R \)2
Grid size \( G \)2
Power \( P \)1

Channel Basis

\[ \mathbf{A}_T = \mathbf{A}_R = \begin{bmatrix} 1 & 1 \\ 1 & -1 \end{bmatrix} \]

Beamspace Channel

\[ \mathbf{H}_b = \begin{bmatrix} 1 & 0 \\ 0 & 0.5 \end{bmatrix}, \quad \mathbf{h}_b = \begin{bmatrix} 1 \\ 0 \\ 0 \\ 0.5 \end{bmatrix} \]

RF/Baseband Matrices

\[ \mathbf{F}_{RF} = \mathbf{W}_{RF} = \frac{1}{\sqrt{2}} \begin{bmatrix} 1 & 1 \\ 1 & -1 \end{bmatrix}, \quad \mathbf{F}_{BB} = \mathbf{W}_{BB} = \mathbf{I}_2 \]

Compute Q

The transmit and receive terms each simplify to \( \sqrt{2}\mathbf{I}_2 \), giving:

\[ \mathbf{Q} = (\sqrt{2}\mathbf{I}_2) \otimes (\sqrt{2}\mathbf{I}_2) = 2\mathbf{I}_4 \]

Compute Output

\[ \mathbf{y} = \mathbf{Q}\mathbf{h}_b = 2\mathbf{h}_b = \begin{bmatrix} 2 \\ 0 \\ 0 \\ 1 \end{bmatrix} \]

If noise is added: \[ \mathbf{y} = \begin{bmatrix} 2 \\ 0 \\ 0 \\ 1 \end{bmatrix} + \tilde{\mathbf{n}} \]



Sparse Recovery

Since the system is underdetermined (\( 576 < 1024 \)), we use Compressed Sensing techniques to estimate \( \mathbf{h}_b \):

\[ \min_{\mathbf{h}_b} \|\mathbf{y} - \mathbf{Q}\mathbf{h}_b\|_2^2 \quad \text{s.t. } \mathbf{h}_b \text{ is sparse} \]

Algorithms:

  • OMP (Orthogonal Matching Pursuit)
  • Basis Pursuit / LASSO
  • Sparse Bayesian Learning
Finally, reconstruct the full channel:
\[ \mathbf{H} = \mathbf{A}_R \, \text{mat}(\hat{\mathbf{h}}_b) \, \mathbf{A}_T^* \]


Summary

StepDescription
1Start with \( \mathbf{y} = \sqrt{P}\mathbf{W}^H \mathbf{H}\mathbf{F}\mathbf{s} + \tilde{\mathbf{n}} \)
2Express \( \mathbf{H} = \mathbf{A}_R \mathbf{H}_b \mathbf{A}_T^* \)
3Vectorize using the Kronecker identity
4Define the equivalent sensing matrix \( \mathbf{Q} \)
5Obtain \( \mathbf{y} = \mathbf{Q}\mathbf{h}_b + \tilde{\mathbf{n}} \)
6Estimate sparse \( \mathbf{h}_b \) using compressed sensing
7Reconstruct full channel \( \mathbf{H} \)


Further Reading



Contact Us

Name

Email *

Message *

Popular Posts

CMOS Logic Gates: Inverter, NAND, and NOR

CMOS Logic Gates: Inverter, NAND, and NOR Complementary metal–oxide–semiconductor (CMOS) technology forms the backbone of modern digital IC design. Patented by Frank Wanlass in 1963 ( US patent 3,356,858 ), CMOS enables low-power, high-speed, and noise-immune logic circuits. CMOS gates, including inverters, NAND, and NOR, are widely used in both large-scale and small-scale integrated circuits due to their efficiency and versatility. CMOS Inverter A CMOS inverter consists of a complementary pair of PMOS and NMOS transistors. The PMOS transistor connects to the supply voltage V DD , while the NMOS connects to ground. The input voltage V IN controls both gates, and the output voltage V OUT is taken from the connected drains. CMOS inverters are highly energy-efficient and produce minimal heat due to their comple...

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 2026 - Question Paper Download PDF June 202...

Linear vs Circular Convolution

Linear vs Circular Convolution Linear convolution vs circular convolution Linear convolution (what nature does) If: x[n] = transmitted signal h[n] = channel impulse response (multipath) Then the received signal is: y[n] = x[n] * h[n] This means: Past symbols spill into future symbols Causes inter-symbol interference (ISI) DFT of y[n] is not a simple product Circular convolution (what DFT assumes) The DFT assumes periodic signals : y[n] = x[n] ⊛ h[n], where indices wrap around modulo N Only under circular convolution does the DFT satisfy: Y[k] = X[k] · H[k] This is what enables one-tap frequency-domain equalization . What happens in the real channel (linear convolution) The channel performs linear convolution: y[n] = Σ l=0 Lh−1 h[l] x[n-l] But because: CP absorbs the “spillover” Receiver discards CP before DFT The useful part of the received symbol becomes: y[n] = Σ l=0 Lh−1 h[l] x[(n-l) mod N] Modulo inde...

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

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 →

Design of CMOS XOR/XNOR Gates

Design of CMOS XOR/XNOR Gates The semiconductor industry has experienced rapid integration of multimedia applications into mobile electronics, leading to very high integration density in CMOS VLSI. As operating frequencies increase, power consumption, speed, silicon area, and reliability become critical considerations. The XOR-XNOR circuits are fundamental building blocks in arithmetic circuits (Full Adders, Multipliers), compressors, comparators, parity checkers, code converters, error-detecting/correcting codes, and phase detectors. Their performance directly impacts the complex circuits they are used in. Design goals include full output voltage swing, low power consumption, reduced transistor count, minimal delay, and simultaneous non-skewed outputs. Static Logic (Static CMOS) Stat...

MUSIC Algorithm Explained (with MATLAB + Simulator)

Practical Implementation of the MUSIC Algorithm The focus is on how the algorithm works computationally , not just theory, and it explains the denominator (a H E n E n H a) mathematically and intuitively. 1. Introduction The MUSIC (Multiple Signal Classification) algorithm is a high-resolution method used in signal processing and array processing to estimate the Direction of Arrival (DOA) of signals received by a sensor array. Unlike classical beamforming methods, MUSIC uses eigenvector decomposition of the covariance matrix to separate the signal subspace and noise subspace , allowing it to achieve much higher angular resolution. In practical implementations, MUSIC works by: Simulating or collecting array signals Computing the covariance matrix Performing eigenvalue decomposition Separating signal and noise subspaces Scanning possible angles using a steering vector Constructing a pseudo-spectrum where peaks indicate signal directions 2. Signal Mo...

MATLAB code for BER vs SNR for M-QAM, M-PSK, QPSK, BPSK (with Simulation)

🧮 MATLAB Code for BPSK, M-ary PSK, and M-ary QAM Together 🧮 MATLAB Code for M-ary QAM 🧮 MATLAB Code for M-ary PSK 📚 Further Reading MATLAB Script for BER vs. SNR for M-QAM, M-PSK, QPSK, BPSK % Written by Salim Wireless clc; clear; close all; snr_db = -5:2:25; psk_orders = [2, 4, 8, 16, 32]; qam_orders = [4, 16, 64, 256]; ber_psk_results = zeros(length(psk_orders), length(snr_db)); ber_qam_results = zeros(length(qam_orders), length(snr_db)); for i = 1:length(psk_orders) ber_psk_results(i, :) = berawgn(snr_db, 'psk', psk_orders(i), 'nondiff'); end for i = 1:length(qam_orders) ber_qam_results(i, :) = berawgn(snr_db, 'qam', qam_orders(i)); end figure; semilogy(snr_db, ber_psk_results(1, :), 'o-', 'LineWidth', 1.5, 'DisplayName', 'BPSK'); hold on; for i = 2:length(psk_orders) semilogy(snr_db, ber_psk_results(i, :), 'o-', 'DisplayName', sprintf('%d-PSK', psk_or...