The recursive constant modulus algorithm; a new approach for real-time array processing

Abstract

The constant modulus algorithm (CMA) has proved its ability to compensate the severe effect of the multipath interference and co-channel signals on the constant modulus signals. The application limitation of the CMA is mainly due to its slow rate of convergence. The paper presents a new algorithm which keeps the desired properties of the original CMA while it reduces the time required for convergence on the expense of some added mathematical complexity. The algorithm shows stable operations in both cases of compensating the effect of the multipath interference by an adaptive correction filter and separation of cochannel signals by an adaptive array followed by a signal canceler. The proposed algorithm is an order of magnitude faster than the original CMA on the average.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>