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.
Fast-Adapting Matrix Filtering
IEEE Transactions on Aerospace and Electronic Systems ; AES-12 , 2 ; 131-139
1976-03-01
1981411 byte
Article (Journal)
Electronic Resource
English
Kalman Filtering for Matrix Estimation
Online Contents | 2006
|Kalman filtering for matrix estimation
IEEE | 2006
|Shape Recognition using Fast Boosted Filtering
British Library Conference Proceedings | 2005
|