Skip to main content

What are Precoding and Combining Weights / Matrices in a MIMO Beamforming System


Configuration of Single-User Digital Pre-coder for Millimeter-Wave Massive MIMO System
Configuration of single-user digital precoder for millimeter-wave massive MIMO system

Precoding and combining are two excellent ways to send and receive signals over a multi-antenna communication process, respectively (i.e., MIMO antenna communication). The channel matrix is the basis of both the precoding and combining matrices. Precoding matrices are typically used on the transmitter side and combining matrices on the receiving side. The two matrices allow us to generate multiple simultaneous data streams between the transmitter and receiver. The nature of the data streams is also orthogonal, which helps decrease or cancel (theoretically) interference between any two data streams.

For a MIMO system, the channel matrix can be effectively **diagonalized through techniques like Singular Value Decomposition (SVD)**. This process transforms the complex multi-path channel into an equivalent set of independent sub-channels. Let's consider a general channel matrix H:

      
        H =
        2   0   2
        0   1   2
        0   1   0
      
    

(H = Channel Matrix, in a realistic scenario, H would typically be filled with non-zero complex numbers representing channel gains between transmit and receive antennas)

For a typical wireless communication system, the signal equation for a single stream is:

      
        y = h * x + n
      
    

However, for a multi-antenna MIMO system, this becomes a matrix equation where y, x, and n are vectors:

      
        y = H * x + n
      
    

When appropriate precoding and combining matrices are applied, the effective channel becomes diagonal. Let the effective diagonal channel be D:

      
        D =
        d11   0    0
        0     d22  0
        0     0    d33
      
    

Now, the signal equation for the received data streams, after combining, can be viewed as:

      
        y_eff = D * x_tx + n_eff
      
    

Where y_eff, x_tx, and n_eff are the effective received signals, transmitted symbols, and noise vectors, respectively, after applying precoding and combining.

This makes it much simpler to retrieve all independent data streams sent from the transmitter (TX):

      
        y_eff1 = d11 * x_tx1 + n_eff1
        y_eff2 = d22 * x_tx2 + n_eff2
        y_eff3 = d33 * x_tx3 + n_eff3
      
    

If the combining matrix is W and the precoding matrix is F, then the relationship illustrating the diagonalization of the channel can be expressed as:

      
        W^H * H * F = D
      
    

This occurs when the precoding F matrix is applied on the TX side and the W matrix is applied (as a conjugate transpose or inverse, denoted by W^H) on the RX side.

Let's look at a simplified 2x2 example for clarity:
Assume a channel matrix H and ideal precoding F and combining W^H matrices are found such that:
H =

        
          1.0  0.5
          0.5  1.0
        
      
And through a process like SVD, we derive F and W^H that perfectly "diagonalize" this channel. For illustrative purposes, imagine the result is:
        
          W^H * H * F = D =
          1.5  0.0
          0.0  0.5
        
      
Here, d11 = 1.5 and d22 = 0.5. If we transmit two data streams, x_tx1 and x_tx2, the effective received signals will be approximately:
y_eff1 = 1.5 * x_tx1 + n_eff1
y_eff2 = 0.5 * x_tx2 + n_eff2
As you can see, the two data streams are now isolated and can be independently decoded without interference from each other, even though they passed through the original complex channel H.


Summary:

In an environment with many scatterers, modern wireless communication systems use spatial multiplexing to increase data flow within the system. To transmit multiple data streams over the channel, a set of precoding and combining weights is derived from the channel matrix (often via SVD). These weights transform the original channel into an equivalent set of independent sub-channels, allowing each data stream to be independently retrieved. Magnitude and phase terms are included in these weights, which are frequently utilized in digital communication.

 

Further Reading

[1] Optimal Precoding in MIMO using SVD

[2] Optimal Power Allocation in MIMO Transmission using SVD 

[3] Beamforming in MIMO 

[4] MIMO / Massive MIMO (Main Page) 

<< Previous Page


Contact Us

Name

Email *

Message *

Popular Posts

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

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

OFDM Symbols and Subcarriers Explained

This article explains how OFDM (Orthogonal Frequency Division Multiplexing) symbols and subcarriers work. It covers modulation, mapping symbols to subcarriers, subcarrier frequency spacing, IFFT synthesis, cyclic prefix, and transmission. Step 1: Modulation First, modulate the input bitstream. For example, with 16-QAM , each group of 4 bits maps to one QAM symbol. Suppose we generate a sequence of QAM symbols: s0, s1, s2, s3, s4, s5, …, s63 Step 2: Mapping Symbols to Subcarriers Assume N sub = 8 subcarriers. Each OFDM symbol in the frequency domain contains 8 QAM symbols (one per subcarrier): Mapping (example) OFDM symbol 1 → s0, s1, s2, s3, s4, s5, s6, s7 OFDM symbol 2 → s8, s9, s10, s11, s12, s13, s14, s15 … OFDM sym...

DFTs-OFDM vs OFDM: Why DFT-Spread OFDM Reduces PAPR Effectively (with MATLAB Code)

Understanding PAPR in DFT-spread OFDM vs. Standard OFDM In modern wireless communications like 4G LTE and 5G NR, managing the Peak-to-Average Power Ratio (PAPR) is critical for hardware efficiency. While OFDM is the gold standard for high-speed data, its high PAPR poses significant challenges for mobile devices. This is where DFTs-OFDM (also known as SC-FDMA) comes in. DFT-spread OFDM (DFTs-OFDM) has lower Peak-to-Average Power Ratio (PAPR) because it "spreads" the data in the frequency domain before applying IFFT, making the time-domain signal behave more like a single-carrier signal rather than a multi-carrier one like OFDM. Deeper Explanation: Aspect OFDM DFTs-OFDM Signal Type Multi-carrier Single-carrier-like Process IFFT of QAM directly QAM → DFT → IFFT PAPR Level High (due to many...

Constellation Diagrams of ASK, PSK, and FSK (with MATLAB Code + Simulator)

Constellation Diagrams: ASK, FSK, and PSK Comprehensive guide to signal space representation, including interactive simulators and MATLAB implementations. 📘 Overview 🧮 Simulator ⚖️ Theory 📈 Q-function 📚 Resources BASK Modulation Transmits one of two signals: 0 or $\sqrt{E_b}$, representing binary 0 and 1. Simple but sensitive to noise. BFSK Modulation Transmits one of two signals: $\sqrt{E_b}$ on the Y-axis or $\sqrt{E_b}$ on the X-axis. These are orthogonal signals. BPSK Modulation Transmits $+\sqrt{E_b}$ or $-\sqrt{E_b}$ (antipodal signaling). Most efficient binary scheme. ...

Calculation of SNR from FFT bins in MATLAB

📘 Overview 💻 FFT Bin Method 💻 Kaiser Window 📚 Further Reading SNR Estimation Overview In digital signal processing, estimating the Signal-to-Noise Ratio (SNR) accurately is crucial. Below, we demonstrate how to calculate SNR from periodogram and FFT bins using the Kaiser Window . The beta (β) parameter is the key—it allows you to control the trade-off between main-lobe width and side-lobe levels for precise spectral analysis. 1 Define Sampling rate and Time vector 2 Compute FFT and Periodogram PSD 3 Identify Signal Bin and Frequency resolution 4 Segment Signal Power from Noise floor 5 Logarithmic calculation of SNR in dB Method 1: Estimation from FFT Bins This approach uses a Hamming window to estimate SNR directly from the spectral bins. MATLAB Source Code Copy Code clc...

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