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.