Fast robust quasi-Newton algorithm for adaptive arrays

Author

Klemes, M.

Author_Institution

Microwave Radio Syst. Dev., Nortel Networks, Ottawa, Ont., Canada

Volume

146

Issue

4

fYear

1999

fDate

8/1/1999 12:00:00 AM

Firstpage

231

Lastpage

239

Abstract

A stable, fast (order-of-N) quasi-Newton (QN) algorithm (FRQN) applicable to arbitrary array signals is presented. Its complexity is only twice that of the normalised least mean squares (NLMS) algorithm, yet its convergence is faster and smoother, proceeding along the optimal QN path as that of the order N² recursive least squares (RLS) algorithm, albeit more slowly. The development of its recursive update equation is outlined and compared to those of the NLMS and RLS algorithms, as well as variations of the conjugate gradient (CG) algorithm. Analytic expressions for its excess mean squared error in stationary and non-stationary scenarios are presented and compared with those of the LMS algorithm. Simulations of an adaptive array in a mobile wireless base-station show that the FRQN performance falls between that of the NLMS and RLS algorithms for a wide range of signal scenarios

Keywords

Newton method; adaptive antenna arrays; adaptive signal processing; computational complexity; interference suppression; land mobile radio; mean square error methods; numerical stability; radiofrequency interference; NLMS algorithm; RLS algorithm; array signals; complexity; conjugate gradient algorithm; convergence; digital adaptive array algorithm; fast robust quasi-Newton algorithm; interference cancellation; mean squared error; mobile wireless base-station; nonstationary signals; normalised least mean squares; recursive least squares algorithm; recursive update equation; stable quasi-Newton algorithm; stationary signals;

fLanguage

English

Journal_Title

Communications, IEE Proceedings-

Publisher

iet

ISSN

1350-2425

Type

jour

DOI

10.1049/ip-com:19990348

Filename

803783