论文部分内容阅读
时分同步码分多址(TD-SCDMA)是第三代移动通信系统的时分复用(TDD)模式.在TD-SCDMA系统中,解决联合检测算法问题相当于解决系统矩阵的最小均方问题.由于联合检测算法具有较高的运算复杂度,Cholesky分解算法被应用于系统联合检测中,这种算法可以将矩阵分解成上下三角子矩阵,从而有效地降低运算量.文中介绍了一种改进的Cholesky分解算法,分析了其运算复杂度,在FPGA上,用Verilog语言实现了该算法,最后对该算法的性能进行了分析.
Time Division Synchronous Code Division Multiple Access (TD-SCDMA) is the third generation mobile communication system time division multiplexing (TDD) mode.In TD-SCDMA system, to solve the joint detection algorithm problem is equivalent to solve the system matrix minimum-mean square problem. Due to the high computational complexity of the joint detection algorithm, the Cholesky decomposition algorithm is applied to the joint detection of the system, which decomposes the matrix into upper and lower triangular sub-matrices, thus reducing the computational complexity effectively.In this paper, an improved Cholesky decomposition algorithm is analyzed, and its computational complexity is analyzed. On the FPGA, the algorithm is implemented in Verilog language, and finally the performance of the algorithm is analyzed.