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

分析了传统常模算法及其改进算法的缺点,将线性约束和拟牛顿法应用于常模算法,提出了线性约束拟牛顿常模盲多用户检测算法,称之为LC-QNCMA。在DS-CDMA系统中,对本文算法与传统的线性约束常模算法(LC-CMA)及最小二乘常模算法(LSCMA)进行了仿真比较。结果表明,与LC-CMA相比,LC-QNCMA的信干比性能和误码性能方面有较大改善;与LSCMA算法相比,LC-QNC-MA算法复杂度有明显降低。本文算法在两种算法的优缺点中取得了较好的折中。

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

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 constrained 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.