Recursive algorithms are presented for time domain, broadband, adaptive beamforming. The algorithms are rapidly converging and can be computationally efficient for a certain range of array processor parameters. The algorithms are presented for two forms of array processor. One form is a Frost-type structure in which explicit constraints are required for defining the array-look direction and also to control the sensitivity of the array processor to implementation errors. The other form is a partitioned array processor in which constraints are built into the processor and the adaptive weight control algorithm is therefore unconstrained. The two processors presented are both element-space processors but the algorithms can be applied also to beam-space processors.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Fast Algorithms for Time Domain Broadband Adaptive Array Processing


    Contributors:

    Published in:

    Publication date :

    1982-09-01


    Size :

    3140032 byte




    Type of media :

    Article (Journal)


    Type of material :

    Electronic Resource


    Language :

    English




    Broadband Efficient Adaptive Method for True-Time-Delay Array Processing

    Wagner, K. / Weaver, S. / Kraut, S. et al. | British Library Conference Proceedings | 1998


    Broadband efficient adaptive method for true-time-delay array processing

    Wagner, K.H. / Weaver, S. / Kraut, S. et al. | IEEE | 1998


    Fast Time-Domain Algorithms for UWB Bistatic SAR Processing

    Vu, V. T. / Sjogren, T. K. / Pettersson, M. I. | IEEE | 2013


    Broadband Time-Domain Impedance Models

    K.-Y. Fung / Hongbin Ju | AIAA | 2001