Abstract
Three constant modulus algorithms (CMA), the fast quasi-Newton CMA, the transform domain CMA, and the genetic search based CMA are proposed in this paper. The performances of these three algorithms are compared with each other via computer simulation. It is shown that the fast quasi-Newton CMA and the transform domain CMA achieve much faster convergence rate than the constant modulus algorithm based on the LMS algorithm. This fact shows that the whitening technique is not only useful but also necessary for the CMA.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
