The least square constant modulus algorithm for blind adaptive multiuser detection

摘要

In this paper, we apply the Least Square Constant Modulus Algorithm(LSCMA)to the blind Multiuser Detection(MUD). The algorithm is shown to be global stable an convergent for any linearly independent set of in- Put data and converge faster than the conventional Steepest-Decent(SDCMA)and Linearly Constrained CMA (LCCMA), but more complex.