.png){kind=icon}
Return
An Improved Square-Root Algorithm for V-BLAST Based on Efficient Inverse Cholesky Factorization
.png){kind=icon}
OA
AI
DOI：10.1109/TWC.2010.110510.100555.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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 similar to 5.2 and 1.05 similar to 1.4, respectively.
Keywords:
MIMO
V-BLAST
square-root
fast algorithm
inverse Cholesky factorization
Journal
IF:
10.7
Papers:
1.3W
Citations:
5.3W
Organization
Cited Papers
The Influence of Socioeconomic Status on Psychological Distress in Canadian Adults With ADD/ADHD
.png){kind=icon}
PREAI
ShareSaveShareSaveShareSave
ShareSaveShareSave
View more