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

UGC NET Electronic Science Previous Year Question Papers with Solutions

Home / Engineering & Other Exams / UGC NET 2026 PYQ ⬇️ Download Papers and Solutions 📋 Exam Pattern 💡 Preparation Tips ❓ FAQs 📊 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 - Solved Paper + Explanation ...

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

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

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 📂 Other Topics: M-ary PSK & QAM Diagrams ▼ 🧮 Simulator for M-ary PSK Constellation 🧮 Simulator for M-ary QAM Constellation BASK (Binary ASK) Modulation Transmits one of two signals: 0 or -√Eb, where Eb​ is the energy per bit. These signals represent binary 0 and 1. BFSK (Binary FSK) Modulation Transmits one of two signals: +√Eb​ (On the y-axis, the phas...

UGC NET Electronic Science June 2025 Question Paper with Answer Key & Detailed Solutions

Home / UGC NET PYQ / June 2025 Solved UGC NET Electronic Science June 2025 Question Paper with Answer Key and Full Explanations 📥 Download Question Paper (PDF) 2025 2024 2023 2022 2021 2020 Explanations 1. For forming a p-type semiconductor, the dopant must be a trivalent impurity (three valence electrons) so that it creates acceptor levels and holes become the majority carriers. Among the given elements, boron (B) is a group-III element (trivalent). Arsenic (As) and phosphorus (P) are group-V (pentavalent) donors that produce n-type material, and germanium (Ge) is a group-IV element usually used as the semiconductor, not as an acceptor dopant. Hence, doping an intrinsic semiconductor with B produces a p-type semiconductor. 2. The ohmic resistance of a JFET at zero gate bias is given by the standard relation: R DS(on) = V P / I DSS because in the ohmic (linear) region with V GS...

1G to 5G Technology - Evolution of Wireless Generations

Cellular wireless evolution Generation Frequency band PHY features Data rate Spectral Eff. (bps/Hz) 1G 850 MHz FDMA, FM N/A N/A 2G 900 MHz, 1.8 GHz TDMA/CDMA, GMSK/QPSK, FEC, PC 10 Kbps < 1 3G 1.8–2.5 GHz CDMA, QAM 1–40 Mbps 1–8 4G 2–8 GHz OFDMA, SC-FDMA, QAM, MIMO-OFDM 100–600 Mbps 15 5G 1–6 GHz mm wave (26–28 GHz) < 1 GHz (massive IoT) visible light? massive MIMO, beamforming D2D, Full duplex, NOMA LDPC and Polar codes OFDM & variants (adapted to extremes?) multi-Gbps several tens Waveform design is the major change between the generations Mobile Wireless Generations Specifications  1G  Voice, Analog traffic, FDMA  2G  Voice, SMS, CS data ...

BER performance of QPSK with BPSK, 4-QAM, 16-QAM, 64-QAM, 256-QAM, etc (MATLAB + Simulator)

📘 Overview 📚 QPSK vs BPSK and QAM: A Comparison of Modulation Schemes in Wireless Communication 📚 Real-World Example 🧮 MATLAB Code 📚 Further Reading   QPSK provides twice the data rate compared to BPSK. However, the bit error rate (BER) is approximately the same as BPSK at low SNR values when gray coding is used. On the other hand, QPSK exhibits similar spectral efficiency to 4-QAM and 16-QAM under low SNR conditions. In very noisy channels, QPSK can sometimes achieve better spectral efficiency than 4-QAM or 16-QAM. In practical wireless communication scenarios, QPSK is commonly used along with QAM techniques, especially where adaptive modulation is applied. Modulation Bits/Symbol Points in Constellation Usage Notes BPSK 1 2 Very robust, used in weak signals QPSK 2 4 Balanced speed & reliability 4-QAM ...

MATLAB Code for ASK, FSK, and PSK (with Online Simulator)

MATLAB Code for ASK, FSK, and PSK Comprehensive implementation of digital modulation and demodulation techniques with simulation results. 📘 Theory 📡 ASK Code 📶 FSK Code 🎚️ PSK Code 🕹️ Simulator 📚 Further Reading Amplitude Shift Frequency Shift Phase Shift Live Simulator ASK, FSK & PSK HomePage MATLAB Code MATLAB Code for ASK Modulation and Demodulation COPY % The code is written by SalimWireless.Com clc; clear all; close all; % Parameters Tb = 1; fc = 10; N_bits = 10; Fs = 100 * fc; Ts = 1/Fs; samples_per_bit = Fs * Tb; rng(10); binar...