Skip to main content

Why is SVD useful in multi-antenna communication? | Channel Matrix, U, S, V


 

svd based transmission

These days, multi-antenna transmission and reception systems are practically universal. MIMO is one of the popular types of multi-antenna systems. By enabling numerous orthogonal data streams between the transmitter and receiver (or receivers) , such antennas have the primary advantage of increasing spectral efficiency. 

A matrix can be transformed linearly with the aid of SVD. We are aware that when determining an eigenvalue, the formula Av - λv = 0, is used, where v is an eigenvector with a corresponding eigenvalue of. For calculating SVD of a matrix A, firstly we compute A*AT ,then we compute A*AT - Î»v = 0. To minimize the linear operations in a matrix, eigen vectors are used to simplify the matrix equations.

However, eigenvectors need not always be linearly independent (or orthogonal). However, orthogonal data streams are necessary to boost overall throughput and decrease interference between them in order to permit multiple data streams between multi-antenna communication.

In singular value decomposition, you'll get three matrices, U, S, and V. Where U and V are orthonormal eigenvectors of  A*AT    

and S is a diagonal matrix. U*UT = V*VT = I (identity matrix).

The SVD of matrix A is given by the formula:

A = USVT

Keep in mind that the singular values for matrix A will be the squareroots of the obtained eigen values as we compute the eigen values of A*AT.

The aforementioned equations make it evident that the entire received signal will appear as follows if we employ precoding matrix V at the transmitter side and post-precoding matrix UT at the receiver side.

y = UT (USVT) Vx = Sx

 Where, S is a diagonal matrix, y is the signal being received, and x is the signal being sent. The multiple data streams between the transmitter and receivers are currently independent and interference-free (theoretically).

 

MATLAB Code for Singular Value Decomposition

clc;
clear;
close all;

% Define the matrix A
A = [1 2; 3 4];

% Compute the Singular Value Decomposition
[U, S, V] = svd(A);

% Display the results
disp('Matrix A:');
disp(A);

disp('Matrix U:');
disp(U);

disp('Matrix S:');
disp(S);

disp('Matrix V:');
disp(V);

% Verify the decomposition
A_reconstructed = U * S * V';
disp('Reconstructed Matrix A:');
disp(A_reconstructed);

% Compute A^T A
ATA = A' * A;
disp('Matrix A^T A:');
disp(ATA);

% Compute eigenvalues and eigenvectors of A^T A
[eigV, eigD] = eig(ATA);
disp('Eigenvalues of A^T A:');
disp(diag(eigD));
disp('Eigenvectors of A^T A:');
disp(eigV);

% Compute A A^T
AAT = A * A';
disp('Matrix A A^T:');
disp(AAT);

% Compute eigenvalues and eigenvectors of A A^T
[eigU, eigD2] = eig(AAT);
disp('Eigenvalues of A A^T:');
disp(diag(eigD2));
disp('Eigenvectors of A A^T:');
disp(eigU);

Output

Matrix A:
     1     2
     3     4

Matrix U:
   -0.4046   -0.9145
   -0.9145    0.4046

Matrix S:
    5.4650         0
         0    0.3660

Matrix V:
   -0.5760    0.8174
   -0.8174   -0.5760

Reconstructed Matrix A:
    1.0000    2.0000
    3.0000    4.0000

Matrix A^T A:
    10    14
    14    20

Eigenvalues of A^T A:
    0.1339
   29.8661

Eigenvectors of A^T A:
   -0.8174    0.5760
    0.5760    0.8174

Matrix A A^T:
     5    11
    11    25

Eigenvalues of A A^T:
    0.1339
   29.8661

Eigenvectors of A A^T:
   -0.9145    0.4046
    0.4046    0.9145

 

Copy the code from here

 
<<Previous Page


Contact Us

Name

Email *

Message *

Popular Posts

MATLAB Code for Constellation Diagram of QAM configurations such as 4, 8, 16, 32, 64, 128, and 256-QAM

📘 Overview of QAM 🧮 4-QAM MATLAB 🧮 16-QAM MATLAB 🚀 Online Simulator 📂 Other Topics on Constellation Diagrams... ▼ 🧮 MATLAB Code for 4-QAM 🧮 MATLAB Code for 16-QAM 🧮 MATLAB Code for m-ary QAM 🧮 Simulator for m-ary PSK 🧮 Simulator for m-ary QAM 🧮 Overview of Energy per Bit (Eb / N0) 🧮 Simulator for ASK, FSK, and PSK Overview of QAM One of the best-performing modulation techniques is QAM [↗] . Here, we modulate the symbols by varying the carrier signal's amplitude and phase in response to the variation in the message signal (or voltage variation). So, we may say that QAM is a combination of phase and amplitude modulation. Additionally, it performs better than ASK or PSK [↗] . In fact, any constellation for any type of modulatio...

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

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 Flat Fading and Frequency-Selective Fading Effects of Multipath Components and the Nakagami-m Parameter 1. Flat Fading Flat fading occurs when the signal bandwidth is smaller than the channel's coherence bandwidth, meaning that all frequency components of the transmitted signal experience approximately the same fading. It is typically associated with narrowband signals, where the multipath delay spread is small relative to the symbol duration. ...

Orthogonal Time Frequency Space (OTFS) (with MATLAB)

In OTFS (Orthogonal Time Frequency Space) modulation — a scheme designed for high-Doppler and time-varying wireless channels — the terms ISFFT and SFFT are key mathematical transformations used to move between different representation domains. Figure: OTFS block diagram 1. ISFFT — Inverse Symplectic Finite Fourier Transform Purpose: Transforms data symbols from the delay-Doppler domain to the time-frequency domain . \[ X[n, m] = \frac{1}{\sqrt{NM}} \sum_{k=0}^{N-1} \sum_{l=0}^{M-1} x[k, l] \, e^{j2\pi \left( \frac{nk}{N} - \frac{ml}{M} \right)} \] Here, \( N \) is the number of Doppler bins (time slots), and \( M \) is the number of delay bins (subcarriers). The ISFFT maps each data symbol from the delay-Doppler grid (where the channel is sparse and easier to equalize) to the time-frequency grid (where standard multicarrier modulation like OFDM can be applied). 2. SFFT — Symplectic Finite Fourier Transform Purpose: Performs the reverse operation ...

Coherent vs. Non-Coherent Demodulation

  For demodulation In general: 1. Synchronous (coherent) demodulation Receiver generates a local carrier/oscillator . It combines/multiplies the received signal with that carrier. Then a filter extracts the message. Received signal ↓ × Local oscillator ↓ Low-pass filter ↓ Message So yes, carrier multiplication is a common implementation of synchronous demodulation . 2. Asynchronous (non-coherent) demodulation Receiver doesn't need a phase-synchronized local carrier . It uses properties of the received signal itself to recover the information. For ASK , an envelope detector is the classic example: ASK signal ↓ Diode + RC ↓ Envelope ↓ Comparator ↓ Data Modulation Synchronous demodulation Non-coherent/asynchronous demodulation ASK/OOK Local carrier + multiplier Envelope detector AM Product detector Envelope detector FSK Coherent correlator/mixer Frequency discriminator, filters, etc. PSK Local synchronized carrier + multiplier Differential/n...

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

GMSK BER vs SNR (with Simulation)

  GMSK Performance: Why the BER vs. SNR Curve Matters If you’ve ever wondered why GMSK (Gaussian Minimum Shift Keying) became the backbone of the global GSM revolution, the answer lies in its unique balance of spectral efficiency and power performance. But there is no free lunch in engineering. To get that sleek, narrow spectrum, you have to pay a price in Bit Error Rate (BER) . In this guide, we break down the theoretical BER vs. SNR performance of GMSK, the "magic" of the BT product, and how to optimize your link budget for real-world conditions. What is GMSK and Why Should You Care? GMSK is a derivative of MSK (Minimum Shift Keying) that uses a Gaussian pre-modulation filter. This filter "smooths" the phase transitions, significantly reducing sideband power. The result? A constant envelope signal that allows you to use high-efficiency Class-C amplifiers without distorting the signal. This is the secr...