TD-SCDMA中联合检测的块傅立叶算法

TD-SCDMA已被ITU和3GPP批准为第三代移动通信国际标准之一，而联合检测是TD-SCDMA中的一项关键技术，它可以等效为一个求最小二乘解的问题，由于其中涉及的数据繁多，使得计算量十分巨大。目前的一些算法(如Cholesky算法、Schur算法及Levinson算法等)充分利用了其系统矩阵的块Sylvester结构来减少计算量，研究了一种能更显著减少联合检测计算量的方法——块傅立叶算法的算法复杂度，并在算法复杂度方面与其他几种算法进行比较，展示其有效性。

Block-Fourier algorithm of joint detection in TD-SCDMA

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.