Asymptotic behavior of ACMA
A.-J. van der Veen · 2002
The algebraic constant modulus algorithm (ACMA) is a noniterative blind source separation algorithm. It computes jointly beamforming vectors for all constant modulus sources as the solution of a joint diagonalization problem. In this paper we analyze its asymptotic properties and show that (unlike the iterative CMA) it converges to the Wiener solution in samples or SNR. We also sketch its connection to the related JADE algorithm.