.png){kind=icon}
Return
An improved square-root algorithm for BLAST
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2004.833483.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In this letter, an improved square-root algorithm for Bell Labs Layered Space-Time (BLAST) system is proposed. It speeds up the original square-root algorithm by 36% in terms of the number of multiplications and additions. Compared with the recursive algorithm, it requires only a 13.6% higher number of multiplications and a 38.9% higher number of additions. Since it uses unitary transformations to avoid the computation of any matrix inversion or squaring operation, it maintains the advantages of the square-root based algorithms that are numerically stable, robust, and hardware friendly.
Keywords:
Bell Labs Layered Space-Time (BLAST)
fast algorithm
MIMO
square-root
V-BLAST
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
No organization information available
.png){kind=icon}
