摘要
本文将线性受限条件运用于最小二乘恒模算法,提出了一种线性受限最小二乘恒模盲多用户检测算法,称为LCLSCMA,并将它与传统的最小二乘恒模算法(LSCMA)进行了仿真比较。仿真结果表明,本文提出的LCLSCMA算法比传统的最小二乘恒模算法的信干比性能和误码率性能要好,特别在低信噪比强多址干扰情况下性能仍优于LSCMA。
In this paper, a linearly constrained least squares constant modulus blind multiuser detection algorithm is proposed. It applies the linearly constrained condition to the least squares constant modulus algorithm. We simulated and compared the proposed LCLSCMA with the conventional LSCMA. Simulation results show that the proposed LCLSCMA algorithm is superior to the conventional LSCMA, especially with low SNR and strong MAI.
出处
《信号处理》
CSCD
北大核心
2005年第5期490-493,共4页
Journal of Signal Processing
基金
国家863项目(2002AA123046)国家自然科学基金(60472104)江苏省博士创新基金(xm0432)资助
