Performance of CMA adaptive array optimized by the marquardt method for suppressing multipath waves
- 1 January 1992
- journal article
- research article
- Published by Wiley in Electronics and Communications in Japan (Part I: Communications)
- Vol. 75 (9) , 89-100
- https://doi.org/10.1002/ecja.4410750908
Abstract
Constant modulus algorithm (CMA) adaptive array has been proposed as a countermeasure to frequency selective fading; but since the evaluation function is nonlinear with respect to weight, the conventional steepest gradient method is being used for optimization. However, if there is a large variation in the eigenvalue of the correlation matrix of the input, then the convergence becomes very slow.In this paper, Marquardt's method of optimizing the CMA adaptive array is proposed. This method is based on a nonlinear least‐square algorithm, and its dynamic characteristics are clarified by computer simulations.First, the fundamental characteristics of the algorithm are investigated. It is shown that this algorithm gives satisfactory convergence even for those cases where the convergence performance of the conventional steepest gradient method has degraded and where waves approach by multiple paths.Next, the performance of the algorithm is studied under the influence of Doppler shift or in the case where the wave conditions vary and satisfactory performance is obtained under frequency selective fading environment.Keywords
This publication has 5 references indexed in Scilit:
- Convergence behavior of the constant modulus algorithmPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- The least-squares CMA: A new technique for rapid correction of constant modulus signalsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2005
- Tamed adaptive antenna arrayIEEE Transactions on Antennas and Propagation, 1986
- A new approach to multipath correction of constant modulus signalsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1983
- Nonlinear least squares — the Levenberg algorithm revisitedThe Journal of the Australian Mathematical Society. Series B. Applied Mathematics, 1976