A square-root adaptive V-BLAST algorithm for fast time-varying MIMO channels

Among the methods that have been proposed for a multiple-input multiple-output (MIMO) receiver, the V-BLAST algorithm provides a good compromise between transmission rate, achievable diversity, and decoding complexity. In this letter, we derive a new adaptive V-BLAST-type equalization scheme for fas...

Full description

Saved in:
Bibliographic Details
Published in:IEEE signal processing letters 2006-05, Vol.13 (5), p.265-268
Main Authors: Rontogiannis, A.A., Kekatos, V., Berberidis, K.
Format: Article
Language:English
Subjects:
Adaptive algorithms
Adaptive equalization
Adaptive equalizers
Algorithms
Autocorrelation
Channels
Cholesky factorization
Complexity
Computational complexity
Decision feedback equalizers
Decoding
Equalization
Equalizers
Filters
MIMO
multiple-input multiple-output (MIMO)
Receiving antennas
Robustness
Signal processing algorithms
time-varying channels
V-BLAST
Vanadium
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Among the methods that have been proposed for a multiple-input multiple-output (MIMO) receiver, the V-BLAST algorithm provides a good compromise between transmission rate, achievable diversity, and decoding complexity. In this letter, we derive a new adaptive V-BLAST-type equalization scheme for fast time-varying, flat-fading MIMO channels. The proposed equalizer stems from the Cholesky factorization of the MIMO system's output data autocorrelation matrix, and the equalizer filters are updated in time using numerically robust unitary Givens rotations. The new square-root algorithm exhibits identical performance to a recently proposed V-BLAST adaptive algorithm, offering at the same time noticeable reduction in computational complexity. Moreover, as expected due to its square-root form and verified by simulations, the algorithm exhibits particularly favorable numerical behavior.
ISSN:1070-9908
1558-2361
DOI:10.1109/LSP.2006.870373