LSMI Algorithm Based on Inverse QR Decomposition
Diagonal loaded sample-matrix inversion (LSMI) algorithm requires a high computational complexity. Thus, a new computationally efficient implementation for LSMI algorithm is presented, which is based on an inverse QR decomposition. The new method inserts the diagonal loading by only setting initial inverse Cholesky factor. It can offer good numerical properties and support parallel implementation with VLSI while avoiding backsubstitution operations. Hence, the new method can be applied for real-time signal processing. Simulations support the new algorithm.
CAO Jian-shu WANG Xue-gang
College of Electronic Engineering University of Electronic Science and Technology of China Chengdu, Sichuan, China
国际会议
2006 International Conference on Communications,Circuits and Systems(第四届国际通信、电路与系统学术会议)
广西桂林
英文
262-265
2006-06-25(万方平台首次上网日期,不代表论文的发表时间)