A new method to implement the Block-FFT algorithm is investigated based on the comparative study of the computation of the inverse of the system matrix which is the crucial part of Joint data Detection algorithms, and the computational complexity, memory requirements and the BER performance of the proposed Block-FFT algorithm is compared to that of standard Cholesky decomposition algorithm and approximate Cholesky decomposition algorithm. The simulation results indicate that the proposed Block-FFT algorithm exhibits same BER performance with the other two algorithms while whose computational complexity and memory requirements are sharply decreased . Furthermore, it is more tractable to realize.

Zhao Shuaijun

Papers

Research of TD-SCDMA Joint Data Detection Algorithm