Skip to main content

Alamouti's Scheme for MIMO Communication

 

 The Alamouti scheme is a simple and effective space-time block coding (STBC) technique used in wireless communications to achieve diversity gain. It's designed for systems with two transmit antennas and one or more receive antennas, providing transmit diversity.

Alamouti's Space-Time Block Coding (STBC) is a technique used in MIMO wireless communication systems to achieve diversity gain without requiring channel knowledge at the transmitter.

Alamouti 2 X 1 Matrix Equation Representation

y
=
h11
h21
X
s1 -s2*
s2 s1*
+
n
It involves transmitting multiple copies of the same symbols over multiple antennas with specific phase relationships. This allows the receiver to combine the signals effectively and recover the transmitted symbols even in the presence of fading.

The Alamouti precoding matrix is constructed based on the Alamouti code, which defines the phase relationships between the symbols transmitted from different antennas over two consecutive time slots. For a 2x1 MIMO system (two transmit antennas and one receive antenna), the Alamouti precoding matrix is as follows:

Precoding Matrix=[s1  −s2∗;  s2   s1∗]

Where:

    s1 and s2 are the symbols to be transmitted from the two antennas in the current time slot.
    s1∗​ and s2∗​ are the complex conjugates of s1​ and s2​ respectively.

This matrix ensures that the symbols transmitted from the two antennas in the current time slot have the necessary phase relationships to achieve diversity gain at the receiver.

Here's how the Alamouti precoding matrix works:

    In the first time slot, symbols s1​ and s2​ are transmitted from the two antennas without any phase manipulation.
    In the second time slot, symbols −s2∗​ and s1∗​ are transmitted from the two antennas. The negative sign and complex conjugate ensure the correct phase relationship required for diversity gain at the receiver.
    At the receiver, combining the signals from the two time slots using Alamouti decoding allows for effective recovery of the transmitted symbols, even in the presence of fading.

By using Alamouti's STBC and the corresponding precoding matrix, the MIMO system can achieve diversity gain and improve performance without requiring explicit channel knowledge at the transmitter. 

 

Orthogonality Property 

Alamouti's Space-Time Block Coding (STBC) scheme ensures that symbols transmitted from different antennas in successive time slots are orthogonal to each other. This orthogonality property is essential for enabling simple decoding at the receiver and achieving diversity gain without requiring channel knowledge at the transmitter.



Now, let's calculate the inner product (dot product) between two encoded symbols transmitted from different antennas in successive time slots.

Let x1x1​ and x2x2​ be the encoded symbols transmitted from the two antennas in the first and second time slots respectively.

x1=[s1 ; s2]
x2=[−s2∗​ ; s1∗​​]

The inner product x1' * x2​ is given by:

x1' * x2​ = [s1 ; ​​s2​​] * [−s2∗​ ; s1∗​​]
=−∣s2∣^2 + ∣s1∣^2


Since the symbols s1​ and s2​ are independent and identically distributed (IID) random variables with equal power, their magnitudes are equal, i.e., ∣s1∣=∣s2∣. Therefore, the inner product x1' * x2​ simplifies to:

x1' * x2 = −∣s2∣^2 + ∣s1∣^2 = 0x1T​x2​= −∣s1∣^2 + ∣s1∣^2 = 0

This shows that the inner product between the encoded symbols transmitted from different antennas in successive time slots is zero, indicating orthogonality.

This orthogonality property allows the receiver to effectively decode the transmitted symbols by taking advantage of the diversity provided by the multiple antennas without interference between symbols transmitted from different antennas.

 

 
 
Fig 1:  BER vs SNR for Alamouti's Precoding Matrix for 2 X 2 MIMO in MATLAB

(Get MATLAB Code for Alamouti's Precoding Matrix for 2 X 2 MIMO in MATLAB)

Also Read about

[1] Alamouti's Precoding Matrix for 2 X 2 MIMO in MATLAB

[2] Theoretical BER vs SNR for Alamouti's Scheme  

[3] MATLAB Code for Multi-User STBC (using Alamouti's Scheme) 



Contact Us

Name

Email *

Message *

Popular Posts

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

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

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

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 →

Theoretical BER vs SNR for binary ASK, FSK, and PSK (with MATLAB Code + Simulator)

📘 Overview & Theory 🧮 MATLAB Codes 🧮 Q-function 📚 Further Reading Bit Error Rate (BER) Equations In ASK, noise directly affects the signal amplitude, making it the most vulnerable since the data is carried in amplitude changes. In FSK, data is represented by frequency variations, and because noise typically impacts amplitude more than frequency, FSK is more robust than ASK. In PSK, data is encoded in the signal phase, and BPSK specifically uses 180-degree phase shifts, creating the greatest separation between signal points and therefore achieving the lowest bit error rate (BER) for the same power level. BER formulas for ASK, FSK, and PSK modulation schemes. ASK BER = 0.5 × erfc(0.5 × √SNR) FSK BER = 0.5 × erfc(√(SNR / 2)) PSK BER = 0.5 × erfc(√SNR) ...

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

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