Cart (Loading....) | Create Account
Close category search window
 

Modified Subspace Algorithms for DoA Estimation With Large Arrays

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)
Mestre, X. ; Centre Tecnologic de Telecomunicacions de Catalunya, Barcelona ; Lagunas, M.A.

This paper proposes the use of a new generalized asymptotic paradigm in order to analyze the performance of subspace-based direction-of-arrival (DoA) estimation in array signal processing applications. Instead of assuming that the number of samples is high whereas the number of sensors/antennas remains fixed, the asymptotic situation analyzed herein assumes that both quantities tend to infinity at the same rate. This asymptotic situation provides a more accurate description of a potential situation where these two quantities are finite and hence comparable in magnitude. It is first shown that both MUSIC and SSMUSIC are inconsistent when the number of antennas/sensors increases without bound at the same rate as the sample size. This is done by analyzing and deriving closed-form expressions for the two corresponding asymptotic cost functions. By examining these asymptotic cost functions, one can establish the minimum number of samples per antenna needed to resolve closely spaced sources in this asymptotic regime. Next, two alternative estimators are constructed, that are strongly consistent in the new asymptotic situation, i.e., they provide consistent DoA estimates, not only when the number of snapshots goes to infinity, but also when the number of sensors/antennas increases without bound at the same rate. These estimators are inspired by the theory of G-estimation and are therefore referred to as G-MUSIC and G-SSMUSIC, respectively. Simulations show that the proposed algorithms outperform their traditional counterparts in finite sample-size situations, although they still present certain limitations.

Published in:

Signal Processing, IEEE Transactions on  (Volume:56 ,  Issue: 2 )

Date of Publication:

Feb. 2008

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.