Rapid and stable optimization of CMA adaptive array by Marquardt method

Author

Kikuma, N. ; Fujimoto, M. ; Inagaki, N.

Author_Institution

Dept. of Electr. & Comput. Eng., Nagoya Inst. of Technol., Japan

fYear

1991

fDate

24-28 June 1991

Firstpage

102

Abstract

The authors present a rapidly converging and well-conditioned algorithm based on the nonlinear least squares method referred to as the Marquardt method for the CMA (constant modulus algorithm) adaptive array. Computer simulation with a pi /4-shifted QPSK (quadrature phase-shift keying) signal verified its rapid and stable convergence characteristics for any radio environment. Taking into consideration the increase of computation for one weight update, the Marquardt method can reduce the convergence time by a factor of 10 to 100 compared to the steepest descent method.<>

Keywords

convergence of numerical methods; optimisation; signal processing; Marquardt method; constant modulus algorithm; convergence time; nonlinear least squares method; optimization; pi /4-shifted QPSK; quadrature phase-shift keying; radio environment; rapid stable convergence; Adaptive arrays; Antenna arrays; Computer simulation; Convergence; Cost function; Gaussian processes; Land mobile radio; Least squares methods; Mobile communication; Optimization methods;

fLanguage

English

Publisher

ieee

Conference_Titel

Antennas and Propagation Society International Symposium, 1991. AP-S. Digest

Conference_Location

London, Ontario, Canada

Print_ISBN

0-7803-0144-7

Type

conf

DOI

10.1109/APS.1991.174783

Filename

174783