Title :
Comparative Study of MMSE-BLE Joint-Detection Based on Block-FFT and Cholesky Factorization for TD-SCDMA
Author_Institution :
Sch. of Comput., Xidian Univ., Xi´´an
Abstract :
To increase the capacity and performance of TD- SCDMA system, the receiver will contain a joint detector. Joint detection is equivalent to solving a least squares problem with a block-Toeplitz system matrix. Therefore, algorithms and implementations must be developed that lower this complexity as far as possible without degrading the performance. In current TD-SCDMA system, MMSE-BLE detectors are the main choice because of its small computational complexity. Among the various algorithm to solve the MMSE-BLE, Block-FFT and Cholesky Factorization algorithms are widely used in practice. In this paper, we compare the two methods on the basis of simulation performance and computational complexity. The simulations show that Block-Fourier algorithm need low computational amount while yielding a better bit error ratio performance. So we recommend the Block-FFT joint detector as the best choice for TD-SCDMA system.
Keywords :
Toeplitz matrices; code division multiple access; computational complexity; equalisers; error statistics; fast Fourier transforms; least mean squares methods; matrix decomposition; signal detection; time division multiple access; Cholesky factorization; MMSE-BLE joint-detection; TD-SCDMA; bit error ratio; block linear equalization; block-FFT; block-Toeplitz system matrix; computational complexity; least square problem; Computational complexity; Computational modeling; Computer errors; Data models; Detection algorithms; Detectors; Downlink; Least squares methods; Resists; Time division synchronous code division multiple access;
Conference_Titel :
Wireless Communications, Networking and Mobile Computing, 2008. WiCOM '08. 4th International Conference on
Conference_Location :
Dalian
Print_ISBN :
978-1-4244-2107-7
Electronic_ISBN :
978-1-4244-2108-4
DOI :
10.1109/WiCom.2008.10