An adaptive array architecture is described which has improved convergence speed over the conventional Applebaum array when the eigenvalue spread of the input signal covariance matrix is large. The architecture uses N+1 Applebaum adaptive arrays in a two-layer cascaded configuration. The gain constants in the first layer are set so that large interfering sources are quickly nulled, but small interfering sources are suppressed more slowly. Since the first layer removes the large interfering signals, the gain constant for the second layer can be set to a large value to quickly null the smaller interferers. The adaptation time is examined for several combinations of signal levels and array sizes. It is shown that, in many signal environments, the computational requirements for the cascaded array compare favorably with those of conventional sample matrix inversion (SMI) methods for large arrays.<>


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Rapid convergence by cascading Applebaum adaptive arrays


    Contributors:
    Ganz, M.W. (author)


    Publication date :

    1994-04-01


    Size :

    922404 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English





    Rapid Convergence Rate in Adaptive Arrays

    Reed, I.S. / Mallett, J.D. / Brennan, L.E. | IEEE | 1974



    A Simpler Proof of Rapid Convergence Rate in Adaptive Arrays

    Jun Liu / Weijian Liu / Hongwei Liu | IEEE | 2017