Powered by OpenAIRE graph
Found an issue? Give us feedback
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao IEEE Transactions on...arrow_drop_down
image/svg+xml Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao Closed Access logo, derived from PLoS Open Access logo. This version with transparent background. http://commons.wikimedia.org/wiki/File:Closed_Access_logo_transparent.svg Jakob Voss, based on art designer at PLoS, modified by Wikipedia users Nina and Beao
IEEE Transactions on Signal Processing
Article . 2001 . Peer-reviewed
License: IEEE Copyright
Data sources: Crossref
DBLP
Article . 2021
Data sources: DBLP
https://dx.doi.org/10.1109/78....
Article
Data sources: Microsoft Academic Graph
 View all 2 versions
Claim

Distributed source localization using ESPRIT algorithm

descriptionPublicationkeyboard_double_arrow_right Article 01 Jan 2001Publisher:Institute of Electrical and Electronics Engineers (IEEE)Journal:IEEE Transactions on Signal Processing, volume 49, pages 2,169-2,178 (issn: 1053-587X, Copyright policy )
Authors: Shahram Shahbazpanahi; Shahrokh Valaee; Mohammad Hasan Bastani;

doi: 10.1109/78.950773

Distributed source localization using ESPRIT algorithm

Abstract

A new algorithm based on ESPRIT is proposed for the estimation of the central angle and angular extension of distributed sources. The central angles are estimated using TLS-ESPRIT for both incoherently distributed (ID) and coherently distributed (CD) sources. For CD sources, the extension width is estimated by constructing a one-dimensional (1-D) distributed source parameter estimator (DSPE) spectrum for each source. For ID sources, the extension widths are estimated using the central moments of the distribution. The algorithm can be used for sources with different angular distributions.

Related Organizations
  • BIP!
    Impact byBIP!
    selected citations
    These citations are derived from selected sources.
    This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 186
    popularity
    This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
    		 Top 1%
    influence
    This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
    		 Top 1%
    impulse
    This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
    		 Top 10%
Powered by OpenAIRE graph
Found an issue? Give us feedback
selected citations
These citations are derived from selected sources.
This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Citations provided by BIP!
popularity
This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.
BIP!Popularity provided by BIP!
influence
This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).
BIP!Influence provided by BIP!
impulse
This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.
BIP!Impulse provided by BIP!
186
Top 1%
Top 1%
Top 10%
Upload OA version
Are you the author of this publication? Upload your Open Access version to Zenodo!
It’s fast and easy, just two clicks!
uploadUpload now