Convergence properties of Gram-Schmidt and SMI adaptive algorithms. II

1 January 1991

journal article
Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Aerospace and Electronic Systems

Vol. 27 (1) , 83-91
https://doi.org/10.1109/7.68150

Abstract

For pt.I see ibid., vol.26, no.1, p.44-56, Jan. 1990. Theorems and relationships associated with the convergence rate of the Gram-Schmidt (GS) and sampled matrix inversion (SMI) algorithms are presented. Two forms of the GS canceler are discussed: concurrent block processing and sliding window processing. It is shown (as has been stated by other researchers) that the concurrent block processed GS canceler converges rapidly to its optimal signal-to-noise ratio. However, it is also shown that the result is deceptive in that the output residue samples may be highly correlated, which would significantly degrade postdetection processing. It is demonstrated that a specific form of a sliding window GS canceler has the same convergence properties as the concurrent block processed GS canceler.

Keywords

This publication has 5 references indexed in Scilit:

Convergence properties of Gram-Schmidt and SMI adaptive algorithms
IEEE Transactions on Aerospace and Electronic Systems, 1990
Fast orthogonalization networks
IEEE Transactions on Antennas and Propagation, 1986
Lattice filters for adaptive processing
Proceedings of the IEEE, 1982
Orthonormal lattice filter—a multistage multichannel estimation technique
Geophysics, 1978
Rapid Convergence Rate in Adaptive Arrays
IEEE Transactions on Aerospace and Electronic Systems, 1974