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.
Original language | English (US) |
---|---|
Pages (from-to) | 1049-1052 |
Number of pages | 4 |
Journal | ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings |
Volume | 2 |
State | Published - 1995 |
Event | Proceedings of the 1995 20th International Conference on Acoustics, Speech, and Signal Processing. Part 2 (of 5) - Detroit, MI, USA Duration: May 9 1995 → May 12 1995 |
All Science Journal Classification (ASJC) codes
- Software
- Signal Processing
- Electrical and Electronic Engineering