Skip to main content

Optimal Power Allocation in MIMO Transmission using SVD


 SVD-Based MIMO Transmission & Optimal Power Allocation



Optimal power allocation is defined as in a MIMO communication system we need to allocate more power to an independent stronger path and allocation of less power to a weaker path. By following this method we can achieve high throughput. Firstly, we talk about SVD-based MIMO. Then we discussed step by step how to find stronger or weaker communication paths between two MIMO antennas. 


Channel Matrix,



Let's assume, the first column in the above matrix is c1  .  c2   and    c3 

are the 2nd and 3rd columns, respectively.


Here, columns are orthogonal for instance, i.e.,  c1Hcj =0

Here, r=3, t=3  (r=number of Rx antenna; t=number of Tx antenna)


Now, c1


c2





Now, c1Hc2

 *



=0


Multiplication is 0 since the columns are orthogonal.



Step 1: We normalize each column

We get, H=


Here singular values are not in decreasing order.


Step 2: Now we arrange the singular values in decreasing order


H=



 



That implies,





Again assume, the first matrix is U (unitary matrix), the middle one is Σ (eigenmatrix), and 3rd matrix is V (unitary matrix).

Alternatively, UUH=I,     VHV=VVH=I


Σ =





In the above matrix, σ1=√52, σ2=√13, σ3=2, and Singular values are in decreasing order.


At receiver side   

            y ̃= UHy =

           





At the transmitter side

  ͞x =V x ̃

Or,




Here, notation "x1~, x2~, x3~" represents original message signal vector


Transmit pre-processing or precoding at the receiver side

ỹ= Σx̃ + w̃

Or,




Here, "y~" represents the received signal vector and "w~" represents the noise vector


Now, 3 decoupled channel spatial multiplexing are as follows

ỹ1 = √52x̃1 + w̃1

ỹ2 = √13x̃2 + w̃2

ỹ3 = 2x̃3 + w̃3


Optimal Power allocation

To maximize sum-rate and to achieve the Shannon capacity,

P1=(1/λ- σ2/σ12)= (1/λ- σ2/52)

P2=(1/λ- σ2/σ22)= (1/λ- σ2/13)

P3=(1/λ- σ2/σ32)= (1/λ- σ2/4)

 

Consider the noise power, σ2= 0dB

                                         So, 10log10 σ2=0

                                              σ2=10^(0/10)=1

let P=total power=3dB

                  So, 10log10 P=3

                                      P=10^(3/10)=2 (approx.)

 

So, we must have

                 P1+P2+P3= 2

                (1/λ-1/52)+  (1/λ-1/13)+  (1/λ-1/4)=2

               Or, 1/λ=.7821

Now,

P1=10log10(1/λ- σ2/52)= 10log10(0.7821- 1/52)=-1.1755 dB

P2=10log10(1/λ- σ2/13)= 10log10(0.7821- 1/13)=-1.517 dB

P1=10log10(1/λ- σ2/4)= 10log10(0.7821- 1/4)=-2.74 dB

Power allocation decreases as gain σ2 decreases. So, we can say poor power to poor channel , more power to strong channel.





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

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

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

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

Random Variable vs. Random Process: Definitions, Examples, and Key Differences

Random Variable vs. Random Process: Definitions, Examples, and Key Differences Random Variable and Random Process In the fields of probability theory and statistics, understanding the distinction between a Random Variable and a Random Process (Stochastic Process) is fundamental. This guide breaks down these concepts with mathematical precision and practical examples. 1. Random Variable (RV) Definition: A Random Variable is a deterministic function that maps each possible outcome of a random experiment to a unique real number. Mathematical Representation A random variable X is defined as a mapping from the sample space S to the set of real numbers ℝ : X : S → ℝ S (Sample Space): The set of all possible outcomes of an experiment. s ∈ S: A specific outcome. X(s): The numerical value asso...