An Improved Square-Root Algorithm for V-BLAST Based on Efficient Inverse Cholesky Factorization

A fast algorithm for inverse Cholesky factorization is proposed, to compute a triangular square-root of the estimation error covariance matrix for Vertical Bell Laboratories Layered Space-Time architecture (V-BLAST). It is then applied to propose an improved square-root algorithm for V-BLAST, which...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on wireless communications Jg. 10; H. 1; S. 43 - 48
Hauptverfasser: Zhu, Hufei, Chen, Wen, Li, Bin, Gao, Feifei
Format: Journal Article
Sprache:Englisch
Veröffentlicht: New York, NY IEEE 01.01.2011
Institute of Electrical and Electronics Engineers
Schlagworte:
Algorithm design and analysis
Antennas
Applied sciences
Complexity theory
Detection, estimation, filtering, equalization, prediction
Exact sciences and technology
fast algorithm
Information, signal and communications theory
inverse Cholesky factorization
MIMO
Miscellaneous
Multiplexing
OFDM
Signal and communications theory
Signal processing
Signal processing algorithms
Signal, noise
square-root
Telecommunications and information theory
V-BLAST
Wireless communication
MIMO system
Estimation error
Error estimation
Noise reduction
V-BLAST
Space time
Covariance matrix
Recursive algorithm
Factorization
Interference suppression
inverse Cholesky factorization
Algorithm performance
Orthogonal frequency division multiplexing
Signal processing
MIMO
Fast algorithm
square-root
Signal detection
Musical instrument
ISSN:1536-1276
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:A fast algorithm for inverse Cholesky factorization is proposed, to compute a triangular square-root of the estimation error covariance matrix for Vertical Bell Laboratories Layered Space-Time architecture (V-BLAST). It is then applied to propose an improved square-root algorithm for V-BLAST, which speedups several steps in the previous one, and can offer further computational savings in MIMO Orthogonal Frequency Division Multiplexing (OFDM) systems. Compared to the conventional inverse Cholesky factorization, the proposed one avoids the back substitution (of the Cholesky factor), and then requires only half divisions. The proposed V-BLAST algorithm is faster than the existing efficient V-BLAST algorithms. The expected speedups of the proposed square-root V-BLAST algorithm over the previous one and the fastest known recursive V-BLAST algorithm are 3.9 ~ 5.2 and 1.05 ~ 1.4, respectively.
ISSN:1536-1276
DOI:10.1109/TWC.2010.110510.100555