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.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Convergence properties of Gram-Schmidt and SMI adaptive algorithms


    Contributors:


    Publication date :

    1990-01-01


    Size :

    836391 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English