Implementation and convergence of adaptive processors are of continuing interest. To this end, a fast-adapting, linear, general recursive matrix-filtering algorithm is described. Two complex xoefficients are optimized at each recursion. A signal and interference estimation procedure is included. Results for some low-resolution, frequency domain beamformer trials with two targets, and using a single sample set, are presented. Considerable adaptive improvement occurs, along with target resolution, compared with a correlation beamformer. The algorithm shows rapid and direct convergence.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Fast-Adapting Matrix Filtering


    Contributors:

    Published in:

    Publication date :

    1976-03-01


    Size :

    1981411 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English



    Fast Adapting PMD Equalizers Using Adaptive Step-Size Control

    Goelz, Daniel / Mandel, Christian / Meissner, Peter | IEEE | 2008


    Kalman Filtering for Matrix Estimation

    Choukroun, D. | Online Contents | 2006


    Kalman filtering for matrix estimation

    Choukroun, D. / Weiss, H. / Bar-Itzhack, I.Y. et al. | IEEE | 2006


    Adapting turn signal

    SALOMON TAVI / POMERANTZ ITZHAK | European Patent Office | 2015

    Free access

    Shape Recognition using Fast Boosted Filtering

    Lin, Y.-Y. / Liu, T.-L. | British Library Conference Proceedings | 2005