基于拟牛顿法的常模盲多用户检测算法  

The constant modulus algorithm and quasi-newton approach for blind multi-user detection

作　　者：潘子宇[1] 酆广增[2] 孔媛媛[2] 

机构地区：[1]南京工程学院通信工程学院,江苏南京211167 [2]南京邮电大学通信与信息工程学院,江苏南京210003

出　　处：《电子技术应用》2012年第10期88-91,共4页Application of Electronic Technique

基　　金：南京工程学院青年基金项目(QKJB2010009)

摘　　要：分析了传统常模算法及其改进算法的缺点,将线性约束和拟牛顿法应用于常模算法,提出了线性约束拟牛顿常模盲多用户检测算法,称之为LC-QNCMA。在DS-CDMA系统中,对本文算法与传统的线性约束常模算法(LC-CMA)及最小二乘常模算法(LSCMA)进行了仿真比较。结果表明,与LC-CMA相比,LC-QNCMA的信干比性能和误码性能方面有较大改善;与LSCMA算法相比,LC-QNC-MA算法复杂度有明显降低。本文算法在两种算法的优缺点中取得了较好的折中。In this paper, a linearly constrained Quasi-Newton constant modulus blind multi-user detection algorithm （LC- QNCMA） is proposed by analyzing the shortages of traditional constant modulus algorithm. The algorithm applies the linearly con- strained condition and Quasi-Newton approach to the constant modulus algorithm. Compared with traditional LC-CMA and LSCMA in direct sequence CDMA blind multi-user detection system, the simulation results show that the proposed LC-QNCMA algorithm can give better SIR and BER improvement than LC-CMA and its complexity is obviously less than LSCMA. The algorithm in this paper gets better compromise effect between advantages and disadvantages of LC-CMA and LSCMA.

关 键 词：线性约束 拟牛顿方法 常模算法 多用户检测 

分 类 号：TN911[电子电信—通信与信息系统]