On computing the optimal weights for adaptive array processing

Abstract

Based on the Hermitian and Toeplitz properties of the signal correlation matrix, an approach to recursively compute the adaptive weights required for optimum processing of array signals is developed. The proposed approach finds the elements of the corresponding adaptive weight vector with size n from the elements of the adaptive weight vectors with size less than n. There are no matrix inversions required during the computation process. This results in a savings in the number of operations and storage locations. A simulation result demonstrating the proposed approach is given. Specifically, the application of the proposed recursive approach in adaptive array beamforming is discussed. >