Close category search window
 

A dynamic programming algorithm for the maximum likelihood localization of multiple sources

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

2 Author(s)
Yung-Dar Huang ; Dept. of Electron. Eng., Nat. Taiwan Inst. of Technol., Taipei, Taiwan ; Barkat, M.

A dynamic programming algorithm is presented for simultaneously computing the maximum-likelihood (ML) estimator of the number of multiple sources and their directions of arrival (DOA) in sensor array processing. Based on the projection-matrix decomposition technique, the multivariate log-likelihood maximization problem is transformed into a multistage one-dimensional maximization problem. The estimation procedure is obtained with relatively light computational load. In addition, the estimator gives satisfactory performance in the case of both coherent and incoherent sources. The simulation results also show that, when the element SNR is low and/or the number of snapshots is small, the DP-ML algorithm is much superior to MUSIC

Published in:
Antennas and Propagation, IEEE Transactions on  (Volume:40 ,  Issue: 9 )

Date of Publication: Sep 1992

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.