论文部分内容阅读
分层空时码分多址系统(LST-CDMA)的联合检测算法(JD)利用扩频码和信道冲击响应(CIR)卷积形成的空-时二维特征向量来进行多用户和多天线检测,能够获得优良的检测性能。但是该JD算法的复杂度非常高,针对这个问题提出了两种快速算法:近似Cholesky分解和块-Fourier算法。为了进一步减少运算量,又利用重叠保留法(OLA)对块-Fourier算法进行改进。仿真证明,这些算法在几乎不降低检测性能的前提下,可以大幅降低计算复杂度。
Joint Detection Algorithm for Layered Space-Time Code Division Multiple Access (LST-CDMA) (JD) The space-time two-dimensional eigenvector formed by the convolution of the spreading code and the channel impulse response (CIR) Detection, to obtain excellent detection performance. However, the complexity of the JD algorithm is very high. Two fast algorithms are proposed for this problem: approximate Cholesky decomposition and block-Fourier algorithm. In order to further reduce the computational complexity, the block-Fourier algorithm is improved by using the overlap preserving method (OLA). The simulation results show that these algorithms can greatly reduce the computational complexity without reducing the detection performance.