Please use this identifier to cite or link to this item: http://scholarbank.nus.edu.sg/handle/10635/62797
Title: Source tracking with a gradient-based eigenstructure algorithm
Authors: Ko, C.C. 
Issue Date: 2000
Citation: Ko, C.C. (2000). Source tracking with a gradient-based eigenstructure algorithm. IEEE Transactions on Aerospace and Electronic Systems 36 (3 PART 1) : 859-867. ScholarBank@NUS Repository.
Abstract: A new gradient-based eigenstructure algorithm to locate and track the azimuth and elevation angles of unknown sources in a 3-dimensional environment is proposed and investigated. Starting from initial estimates of the source locations from, say, a coarse search of the multiple signal classification (MUSIC) spectrum, the algorithm obtains better estimates and tracks sources in a repetitive cyclical manner. To refine a particular source location estimate: 1) a preprocessor is designed to remove the effects of the other sources; 2) the eigenvector for the largest eigenvalue of the covariance matrix after preprocessing is found and its difference from the ideal value is determined; and finally 3) a gradient calculation is used to obtain an estimate for the difference of the assumed source location from the actual position. The advantages of using the proposed technique rather than performing a thorough MUSIC search in the 2-dimensional spectrum are: 1) the implementation complexity can be reduced considerably, and 2) the algorithm is well suited to be employed for continuous adaptive filtering purposes in a tracking scenario. © 2000 IEEE.
Source Title: IEEE Transactions on Aerospace and Electronic Systems
URI: http://scholarbank.nus.edu.sg/handle/10635/62797
ISSN: 00189251
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

1
checked on Feb 28, 2018

WEB OF SCIENCETM
Citations

1
checked on Apr 24, 2018

Page view(s)

10
checked on Mar 12, 2018

Google ScholarTM

Check


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.