By Topic

Reducing the Computational Complexity for BLAST by Using a Novel Fast Algorithm to Compute an Initial Square-Root Matrix

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

5 Author(s)
Hufei Zhu ; Wireless Res. Dept, Huawei Technol. Co. Ltd., Shanghai ; Wen Chen ; Dageng Chen ; Yinggang Du
more authors

We propose a fast algorithm to compute an initial triangular square-root of the estimation error covariance matrix for BLAST, which are then applied to develop a square-root algorithm for BLAST. The speedups of our square-root BLAST algorithm over the previous square-root BLAST algorithm in the number of multiplications and additions are 3.78-5.8 and 3.95-5 respectively, and the ratios between the computational complexity of our BLAST algorithm and that of the linear MMSE detection algorithm in the number of multiplications and additions are 1.10-0.71 and 0.90-0.71 respectively, which means that for the first time, the nonlinear MMSE BLAST detector with successive interference cancellation can have even lower complexity than the linear MMSE detector. Moreover, our BLAST algorithm is also numerically stable and hardware friendly, since it uses unitary transformations to avoid the matrix inversions, and gets the initial square-root which is equivalent to a Cholesky factor of the estimation error covariance matrix.

Published in:

Vehicular Technology Conference, 2008. VTC 2008-Fall. IEEE 68th

Date of Conference:

21-24 Sept. 2008