基于贪心算法的解相关CDMA多用户检测  

Decorrelating multiuser detection based on greedy algorithm for CDMA communications

作　　者：谢红[1] 刘瑶[1] 

机构地区：[1]哈尔滨工程大学信息与通信工程学院,黑龙江哈尔滨150001

出　　处：《应用科技》2008年第8期5-8,共4页Applied Science and Technology

摘　　要：多用户检测是第3代移动通信系统码分多址(CDMA)的一项关键技术.在此,提出了一种基于贪心算法的解相关CDMA多用户检测方法.该方法利用解相关检测的输出作为初始解,以加快算法的收敛速度,应用贪心算法进行搜索,解决最佳多用户检测的非线性优化组合问题.在高斯信道和瑞利衰减信道下的仿真结果表明,该方法计算复杂度低,能够得到与最佳检测方法非常接近的误码率性能.Muhiuser detection is a crucial technique for code division multiple-access（CDMA） of 3G mobile com- munication system. We proposed a decorrelating muhiuser detection based on greedy algorithm for CDMA communication. This approach takes the outputs from decorrelating detector as initial solutions to speed up the convergence rate. Meanwhile, the greedy algorithm is used in searching process to solve the nonlinear optimization problem of optimal muhiuser detection. In the additive white Gaussian noise channel and in the frequency-nonselective Rayleigh fading channel, simulation results showed that the performance of error bit rate of the proposed method is similar to that of optimal muhiuser detection and the complexity is much lower than that of it.

关 键 词：码分多址(CDMA) 多用户检测(MUD) 贪心算法 解相关 

分 类 号：TN914.53[电子电信—通信与信息系统]