A comparative analysis of the stationary points of the constant modulus algorithm based on Gaussian assumptions

A comparative analysis of the stationary points of the constant modulus algorithm (CMA) performance function that is based on two different Gaussian assumptions is presented. In one case, it is assumed that the received signal is unconditionally Gaussian. This approach leads to an infinity of solutions, all of which correspond to a minimum of the performance function. In the second case, it is assumed that the received signal conditioned in one of the transmitted symbols in Gaussian. This approach leads to several possible solutions that depend not only on the channel characteristics, but also on the symbol on which the conditioning is performed