线性受限最小二乘恒模波束形成算法

将线性受限条件运用于最小二乘，提出了一种线性受限最小二乘恒模波束形成算法，称为LC-LSCMA，并将它与传统的最小二乘恒模波束形成算法(LSCMA)及预解扩最小二乘恒模波束形成算法(P-LSCMA)进行了仿真比较。仿真结果表明，提出的LC-LSCMA算法比LSCMA及P-LSCMA的信干比性能和误码率性能要好，特别在低信噪比情况下性能仍优于LSCMA。     

基于天线阵列的一种预处理LCLSCM多用户检测算法

给出了一种天线阵列信号的预处理方法,并将线性受限条件和判决反馈用于最小二乘,提出了一种基于天线阵列的预处理线性受限判决反馈最小二乘恒模多用户检测算法,称为PLC-DFB-LSCMA算法,并与判决反馈最小二乘恒模算法(DFB-LSCMA)及传统的最小二乘恒模算法(LSCMA)进行了仿真比较,仿真结果表明,PLC-DFB-LSCMA算法的信干比性能及误码性能仍优于后二者。     

一种基于DFP方法的拟牛顿恒模算法跟踪信道变化能力的研究

本文根据信道变化快慢程度,把信道模型分成剧变信道和渐变信道.分析研究了恒模盲均衡算法(CMA)在不同的信道模型下跟踪信道变化的能力.针对于原有典型恒模盲均衡算法的性能上的劣势,结合最优化理论,提出了一种线性受限拟牛顿恒模算法,称之为LC-DFPCMA,并将它与传统的线性受限恒模算法(LC-CMA)及最小二乘恒模算法(LSCMA)进行了仿真比较.仿真结果表明,提出的LC-DFPCMA算法比LC-CMA算法能更快地跟踪信道变化且收敛效果较好;与LSCMA算法相比,算法复杂度有明显降低.     

一种线性受限共轭梯度常模盲多用户检测算法

本文将线性受限条件和共轭梯度法应用于常模算法,提出了一种线性受限共轭梯度常模盲多用户检测算法,称之为LC-CGCMA,并将它与传统的线性受限常模算法(LC-CMA)及最小二乘常模算法(LSCMA)进行了仿真比较.仿真结果表明,提出的LC-CGCMA算法比LC-CMA算法的信干比性能和误码性能有较大改善;与LSCMA算法相比,算法复杂度有明显降低.     

一种基于天线阵列的预处理盲多用户检测算法

该文提出了一种基于天线阵列的预处理判决反馈最小二乘恒模盲多用户检测算法,称为P-DFB-LSCMA 算法。它是对天线阵列接收信号经预处理,采用判决反馈最小二乘恒模算法进行多用户检测。仿真结果表明, P-DFB-LSCMA算法比仅采用判决反馈最小二乘恒模算法(DFB-LSCMA)和传统的LSCMA算法性能要好,特别在低信噪比下性能仍优于后二者。     

基于最小二乘恒模算法及子空间方法的盲多用户检测算法

恒模算法（CMA)是一种广泛应用于阵列处理、均衡、多用户检测中的盲算法。最小二乘恒模算法(LSCMA)由于其全局收敛性及稳定性受到关注，但是它在信噪比较低时性能不是很理想。本文将最小二乘恒模算法与子空间方法相结合，提出一种基于子空间分解的恒模算法，称为LSCM_SUB算法。仿真结果表明这种算法的收敛性能比LSCMA要好，尤其是在信噪比低的时候。     

基于二次型约束的鲁棒最小二乘恒模算法

阵列指向性偏差会导致线性约束最小二乘恒模算法(LSCMA)的性能急剧下降,为此提出了一种基于二次型约束的鲁棒LSCMA算法。该算法通过对期望信号波达方向附近小区域内的方向向量的误差模值进行约束来构造一种新的代价函数,并在此函数下迭代更新权重向量,以提高算法的鲁棒性。该算法收敛速度快,稳态性能好,能够有效地解决干扰捕获问题,对阵列指向性偏差具有很强的鲁棒性,从而改善了阵列输出的信干噪比,使其更接近最优值。仿真结果表明:与线性约束最小二乘恒模算法相比,所提鲁棒算法提高了输出性能,降低了计算量,易于实时实现,且能适应实际复杂的通信环境。     

一种结合HT算法和LSCMA的联合自适应算法

最小二乘恒模算法(LSCMA)是阵列信号处理中广泛使用的一种能全局收敛且稳定性强的算法,但是在低信噪比的情况下会发生干扰捕获问题.正交化(Hung-Turner)算法在低信噪比情况下有较好的收敛性能,且计算简单.本文提出了一种正交化算法和最小二乘恒模算法的联合算法.仿真结果表明这种算法能较好的解决干扰捕获问题,其收敛性能比LSCMA要好,尤其在低信噪比的情况下.     

一种改进的波束形成算法

论文分析研究了最陡下降恒模算法（SDCMA）在波束形成应用中收敛稳定性好和最小二乘恒模算法（LSCMA）收敛速度快的特点,将两种算法以新的方式相结合,吸收二者的优点,提出了一种基于预解扩判决反馈盲波束形成组合算法（SD—LSCMA）。通过和传统算法在相同环境下进行MATLAB仿真比较,结果表明,文中提出的算法具有更好的抗强多址干扰性能。     

MC-CDMA系统中一种预处理线性受限多用户检测算法

本文提出了MC-CDMA系统中一种预处理线性受限最小二乘恒模多用户检测算法(Pre-processed Linearly Con- strained Least Squares Constant Modulus Multi-user detection Algorithm),称为P-LCLSCMA。它是对MC-CDMA接收信号进行预处理,即在每次迭代中,用已估信道参数先消除信道在各个子载波上对期望用户信号的影响,然后对处理后的信号用P- LCLSCMA算法进行多用户检测,从而确保了算法收敛于期望信号,提高了系统的检测性能。我们对这种新算法分别在下行链路和上行链路进行了仿真,仿真结果表明,本文提出的P-LCLSCMA算法的误码率和信干比性能得到了提高。     

The Linearly Constrained LSCMA for Blind Multi-user Detection

The least square constant modulus algorithm (LSCMA) is a popular constant modulus algorithm (CMA) because of its global convergence and stability. But the performance will degrade when it is affected by the problem of interference capture in the MC-CDMA system that has several constant modulus signals. In order to overcome this shortage, a linearly constrained LSCMA multiuser detection algorithm is proposed by using the spreading code of the desired user to impose linear constraint on the LSCMA. The proposed algorithm ensures the algorithm convergence to the desired user. Thus the performance of the system is improved. The simulation results demonstrate that the proposed algorithm offers faster convergence rate and provides better output signal-to-interference-plus-noise-ratio (SINR) and bit error rate (BER) performance compared with the traditional LSCMA.     

Robust Least Squares Constant Modulus Algorithm to Signal Steering Vector Mismatches

The linearly constrained least squares constant modulus algorithm (LSCMA) may suffer significant performance degradation and lack robustness in the presence of the slight mismatches between the actual and assumed signal steering vectors, which can cause the serious problem of desired signal cancellation. To account for the mismatches, we propose a doubly constrained robust LSCMA based on explicit modeling of uncertainty in the desired signal array response and data covariance matrix, which provides robustness against pointing errors and random perturbations in detector parameters. Our algorithm optimizes the worst-case performance by minimizing the output SINR while maintaining a distortionless response for the worst-case signal steering vector. The weight vector can be optimized by the partial Taylor-series expansion and Lagrange multiplier method, and the optimal value of the Lagrange multiplier is iteratively derived based on the known level of uncertainty in the signal DOA. The proposed implementation based on iterative minimization eliminates the covariance matrix inversion estimation at a comparable cost with that of the existing LSCMA. We present a theoretical analysis of our proposed algorithm in terms of convergence, SINR performance, array beampattern gain, and complexity cost in the presence of random steering vector mismatches. In contrast to the linearly constrained LSCMA, the proposed algorithm provides excellent robustness against the signal steering vector mismatches, yields improved signal capture performance, has superior performance on SINR improvement, and enhances the array system performance under random perturbations in sensor parameters. The on-line implementation and significant SINR enhancement support the practicability of the proposed algorithm. The numerical experiments have been carried out to demonstrate the superiority of the proposed algorithm on beampattern control and output SINR enhancement compared with linearly constrained LSCMA.     

MC-CDMA系统中一种盲多用户检测算法

本文提出了MC-CDMA系统中一种预处理的盲多用户检测算法P-LSCMA,它是对MC-CDMA接收信号 进行预处理,消除部分多址干扰,然后再用LSCMA算法消除由于信道在各个子载波上对信号造成的影响,从而在每次 迭代合并中提高了系统的检测性能。     

MC DS-CDMA 系统中的常模盲检测方法

提出了MC DS-CDMA（多载波直扩码分多址）系统中的SDCMA（最陡下降常模算法）和LSCMA（最小二乘常模算法）的盲检测方法，并把这2种CMA（常模算法）盲检测和基于子空间的MMSE（最小均方误差）检测方法相比较。仿真结果表明这2种CMA盲检测方法性能明显优于基于子空间的MMSE检测方法，而且运算复杂度也低于后者。在收敛速度上，LSCMA检测方法远快于SDCMA检测方法。     

The LSCM_SUB algorithm for blind multiuser detection in multipath CDMA channels

1 Introduction Multiuser detection (MUD) is applied mainly in CDMA to cancel the multiaccess interference. The single-user matched filter or RAKE receiver treats interference from other users as noise, but MUD takes advantage of other user’s interference…     

NEW LSCM BLIND MULTIUSER DETECTION ALGORITHM FOR ANTENNA ARRAY CDMA SYSTEM

Two blind multiuser detection algorithms for antenna array in Code Division Multiple Access （CDMA） system which apply the linearly constrained condition to the Least Squares Constant Modulus Algorithln （LSCMA） are proposed in this paper. One is the Linearly Constrained LSCMA （LC-LSCMA）, the other is the Preprocessing LC-LSCMA （PLC-LSCMA）. The two algorithms are compared with the conventional LSCMA. The results show that the two algorithms proposed in this paper are superior to the conventional LSCMA and the best one is PLC-LSCMA.