A fast computing method for circular array space time adaptive processing

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...

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Hauptverfasser: Li Shuangxun, Wang Zhan, Lou Shengqiang, Zhan Yonghong
Format: Tagungsbericht
Sprache:eng
Schlagworte:
Adaptive filters
Arrays
Covariance matrix
Equations
FFT
Mathematical model
MSNWF
Noise
STAP
Toeplitz
Vectors
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung: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.
DOI:10.1109/GSMM.2012.6314413