A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is `application/pdf`

.

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

2008
*
2008 IEEE 68th Vehicular Technology Conference
*

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

doi:10.1109/vetecf.2008.122
dblp:conf/vtc/ZhuCCDL08
fatcat:axjlzab3srgs7mbwvsxxym3w7e