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.
Fast Algorithms for Time Domain Broadband Adaptive Array Processing
IEEE Transactions on Aerospace and Electronic Systems ; AES-18 , 5 ; 682-699
1982-09-01
3140032 byte
Article (Journal)
Electronic Resource
English
Correction to "Fast Algorithms for Time Domain Broadband Adaptive Array Processing"
IEEE | 1983
Broadband Efficient Adaptive Method for True-Time-Delay Array Processing
British Library Conference Proceedings | 1998
|Broadband Time-Domain Impedance Models
AIAA | 2001
|