A fast algorithm for broadband power inversion adaptive arrays is investigated. Essentially, in this algorithm, each broadband jammer is individually tracked by steering a broadband null formed from the use of a set of tapped delay line filters in a Davies beamformer. To steer a particular broadband null to its optimal position, the algorithm first swaps the associated set of null-controlling filters into the last stage of the beam former, and then employs the LMS algorithm with a simple time-invariant decorrelation preprocessor to adjust the filter parameters to minimise the output power for a number of iterations. Performing this procedure for each null in turn results in continuous tracking of all the broadband jammers in a cyclical manner. Although the algorithm requires implementation of the broadband tapped delay-line Davies beamformer, only one tapped delay-line filter is being adaptively updated at any instant. Thus, when the number of elements is small, the overall implementation complexity of the proposed algorithm is comparable to that of using the LMS algorithm directly. However, since each broadband null is independently steered, the proposed algorithm has a much faster convergence behaviour, particularly under situations of severe jamming.
[1]
R. Theodore Compton.
On the Davies tree for adaptive array processing
,
1985,
IEEE Trans. Acoust. Speech Signal Process..
[2]
C. Ko.
Simple Eigenvalue-Equalizing Preprocessor for Broadband Power Inversion Array
,
1985,
IEEE Transactions on Aerospace and Electronic Systems.
[3]
Sophocles J. Orfanidis,et al.
Zero-tracking adaptive filters
,
1986,
IEEE Trans. Acoust. Speech Signal Process..
[4]
R. Khanna,et al.
Adaptive beam forming using a cascade configuration
,
1983
.
[5]
Chi Chung Ko,et al.
Approximation of a variable-length delay line by using tapped delay line processing
,
1988
.
[6]
C. C. Ko.
Adaptive array processing using the Davies beamformer
,
1986
.
[7]
O. L. Frost,et al.
An algorithm for linearly constrained adaptive array processing
,
1972
.