Convergence properties of Gram-Schmidt and SMI adaptive algorithms

Author

Gerlach, Karl ; Kretschmer, Frank F., Jr.

Author_Institution

US Naval Res. Lab., Washington, DC, USA

Volume

26

Issue

1

fYear

1990

fDate

1/1/1990 12:00:00 AM

Firstpage

44

Lastpage

56

Abstract

The open-loop Gram-Schmidt (GS) canceler is shown to be numerically identical to the sampled matrix inversion (SMI) algorithm in the transient state if infinite numerical accuracy is assumed. Two forms of the GS canceler are discussed and analyzed: concurrent and nonconcurrent processing. Results for concurrent and nonconcurrent SMI cancelers have been obtained in the past by I.S. Reed, J.D. Mallet, and E. Brennan (see ibid., AES-10, p.853-63, 1974) under the assumption that the inputs are Gaussian. Many of those results are reproduced here using the GS structures as an analysis tool. In addition, new results are obtained when the input noises are not Gaussian. The deleterious effect of overmatching the degrees of freedom is discussed

Keywords

antenna phased arrays; computerised signal processing; convergence of numerical methods; interference suppression; parallel processing; telecommunications computing; Gaussian noise; SMI adaptive algorithms; concurrent processing; convergence; nonGaussian noise; nonconcurrent processing; open loop Gram Schmidt canceler; overmatching; sampled matrix inversion algorithm; transient state; Adaptive algorithm; Adaptive arrays; Arithmetic; Convergence; Covariance matrix; Gaussian noise; Laboratories; Noise cancellation; Stability; Transient analysis;

fLanguage

English

Journal_Title

Aerospace and Electronic Systems, IEEE Transactions on

Publisher

ieee

ISSN

0018-9251

Type

jour

DOI

10.1109/7.53412

Filename

53412