CONVERGENCE PROPERTIES OF GRAM-SCHMIDT AND SMI ADAPTIVE ALGORITHMS .2.

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 it 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. Furthermore, 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.