Block-Fourier algorithm of joint detection in TD-SCDMA
Feng Guang-zeng · Journal of Chongqing University of Posts and Telecommunications · 2004
TD-SCDMA has been accepted by ITU and 3GPP as one of the third-generation mobile telecommunication international standard. Joint detection is one of the key technologies in TD-SCDMA. It is equivalent to solving a least squares problem, which represents a significant computational effort because of the amount of data processing that is involved. At present, some algorithms such as Cholesky algorithm, Schur algorithm and Levinson algorithm exploit the system matrix's block-Sylvester structure to decrease computational complexity. In this paper, the computational complexity of block-Fourier algorithm has been studied, which can significantly lower the computational complexity. To present its efficiency, comparison with other algorithms in computational complexity has also been made.