Comparative Study of MMSE-BLE Joint-Detection Based on Block-FFT and Cholesky Factorization for TD-SCDMA

摘要

To increase the capacity and performance of TDSCDMA 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.