Cyclic maximization of non-Gaussianity for blind signal extraction of complex-valued sources

This article presents a new algorithm for the blind extraction of communications sources (complex-valued sources) through the maximization of negentropy approximations based on nonlinearities. A criterion based on the square modulus of a nonlinearity of the output is used. We decouple the arguments of the criterion so that the algorithm maximizes it cyclically with respect to each argument by means of the Cauchy–Schwarz inequality. A proof of the ascent of the objective function after each iteration is also provided. Numerical simulations corroborate the good performance of the proposed algorithm in comparison with the existing methods.