By Topic

A fast computing method for circular array space time adaptive processing

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Li Shuangxun ; Coll. of Electron. Sci. & Eng., Nat. Univ. of Defense Technol., Changsha, China ; Wang Zhan ; Lou Shengqiang ; Zhan Yonghong

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.

Published in:

Millimeter Waves (GSMM), 2012 5th Global Symposium on

Date of Conference:

27-30 May 2012