Large sample performance analysis of ACMA
Alle-Jan van der Veen · 2002
The "algebraic constant modulus algorithm" (ACMA) is a noniterative block algorithm for blind separation of constant modulus sources. We previously showed that, unlike CMA, it asymptotically converges to the (non-blind) Wiener receiver. We present a finite sample statistical performance analysis. This can be used to predict the SINR performance, as well as the deviation from the Wiener receivers. The theoretical performance is illustrated by numerical simulations and shows a good match.