A fast computing method for circular array space time adaptive processing

摘要

A fast implementation of space time adaptive for 7-elements circular array is discussed in this paper. This implementation is based on the CG (Conjugate Gradient) based MSNWF. We find a simplified method to calculate the signal covariance matrix by utilizing the array parallelogram relationship for the 7-elements circular array. We also find a fast implementation to calculate the multiply product between the covariance matrix and a vector by utilizing the Topelitz feature of the covariance matrix. The computation comparison shows that the new implementation is efficient.