Low complexity adaptive blind equalization using the frequency domain block constant modulus algorithm

Is this paper, fast algorithms for the CMA (constant modulus algorithm), wh ich is one of the widely used algorithms for blind equalizationi are presen ted. Ne propose the FBCMA (frequency domain black CMA) which takes advantag e of fast linear convolution iu the DFT domain by using the overlap save me thod. For the FBCMA, a nonlinear error function in the frequency domain is derived using Parseval's relation. Also, an adaptive algorithm in the DFT d omain is introduced to adjust the frequency domain filter coefficients. For a block. size and filter length of N, the multiplications required for the conventional CMA and proposed FBCMA are on the order of O(N-2) and O(N log N), respectively.