The Constant Modulus Algorithm is a common equalization method which adapts at every sample in an attempt to give a filter which produces a fixed power output. Divergence/convergence of the CMA algorithm is still a problem.

Has this ever been done in block form? For example the Least Squares equalizer uses a training sequence and computes an equalizer in block form. Is there a reason this cannot be done blind in the case of the Constant Modulus Algorithm(excluding computational requirements)? Even if a closed form expression cannot exist, you could still attempt block equalization using runs of gradient descent from a number of random starting locations or do a grid search.

  • $\begingroup$ What do you mean by 'block form'? $\endgroup$
    – MBaz
    Commented Dec 12, 2019 at 23:22
  • $\begingroup$ Instead of updating each sample, accumulate a block of samples and run the algorithm on the whole block at the same time. It should never diverge. $\endgroup$ Commented Dec 13, 2019 at 0:49
  • $\begingroup$ I don't remember seeing the algorithm implemented like this. I suggest going ahead and trying it. $\endgroup$
    – MBaz
    Commented Dec 13, 2019 at 1:22


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.