Convergence analysis of the least squares constant modulus algorithm

Author

Biedka, Thomas E. ; Tranter, William H. ; Reed, Jeffrey H.

Volume

1

fYear

1996

fDate

3-6 Nov. 1996

Firstpage

541

Abstract

This paper examines the convergence behavior of the least squares constant modulus algorithm in an adaptive beamforming application. The improvement in output SIR with each iteration of the algorithm is predicted for several different signal environments. Deterministic results are presented for an environment containing two tones. Probabilistic results are presented for a constant modulus desired signal with a constant modulus interferer and with a gaussian interferer. The asymptotic improvement in output SIR as the output SIR becomes high is also derived.

Keywords

array signal processing; convergence of numerical methods; interference (signal); iterative methods; least squares approximations; probability; adaptive beamforming application; constant modulus interferer; convergence analysis; deterministic results; gaussian interferer; iteration; least squares constant modulus algorithm; output SIR; probabilistic results; signal environments; Adaptive algorithm; Adaptive equalizers; Algorithm design and analysis; Array signal processing; Convergence; Interference; Iterative algorithms; Least squares methods; Prediction algorithms; Signal analysis;

fLanguage

English

Publisher

ieee

Conference_Titel

Signals, Systems and Computers, 1996. Conference Record of the Thirtieth Asilomar Conference on

Conference_Location

Pacific Grove, CA, USA

ISSN

1058-6393

Print_ISBN

0-8186-7646-9

Type

conf

DOI

10.1109/ACSSC.1996.601077

Filename

601077