2003
DOI: 10.1016/s0165-1684(03)00103-8
|View full text |Cite
|
Sign up to set email alerts
|

Low-complexity estimation of 2D DOA for coherently distributed sources

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
4
1

Citation Types

0
56
0

Year Published

2007
2007
2017
2017

Publication Types

Select...
7
1

Relationship

0
8

Authors

Journals

citations
Cited by 73 publications
(56 citation statements)
references
References 23 publications
0
56
0
Order By: Relevance
“…Clearly, this task may be critical in terms of processing power and battery consumption for sensor nodes. We note, however, that (1) according to our simulation results, accurate localization can be achieved with a limited number of antennas per sensor, resulting in an affordable complexity for typical state-of-the-art embedded processors (for a practical DSP implementation of MUSIC, we refer to [30]); (2) although we have considered here the classic MUSIC algorithm, low-complexity variants exist in the literature (see, for example, [31][32][33]). The DoA fusion step (using LS or Stansfield estimation) then involves solving a system of linear equations (Equations 32 and 34).…”
Section: Implementation Issuesmentioning
confidence: 99%
“…Clearly, this task may be critical in terms of processing power and battery consumption for sensor nodes. We note, however, that (1) according to our simulation results, accurate localization can be achieved with a limited number of antennas per sensor, resulting in an affordable complexity for typical state-of-the-art embedded processors (for a practical DSP implementation of MUSIC, we refer to [30]); (2) although we have considered here the classic MUSIC algorithm, low-complexity variants exist in the literature (see, for example, [31][32][33]). The DoA fusion step (using LS or Stansfield estimation) then involves solving a system of linear equations (Equations 32 and 34).…”
Section: Implementation Issuesmentioning
confidence: 99%
“…The localization of CD sources has been tackled by the classical approaches conceived for point sources [8,[10][11][12], while the localization of ID sources is generally more challenging . Although most of the existing ID source localization methods are proposed for onedimensional (1-D) scenarios, where only the azimuth parameters have to be estimated, some of them can be extended to 2-D scenarios.…”
Section: Introductionmentioning
confidence: 99%
“…All these methods are involved joint 2-D searching and computationally intensive. Some low-complexity estimators have also been given in [15,16,17,18,19,20]. In the low-complexity algorithms, some of them are sequential 1-D algorithms instead of joint 2-D searching [16,17].…”
Section: Introductionmentioning
confidence: 99%
“…Some low-complexity estimators have also been given in [15,16,17,18,19,20]. In the low-complexity algorithms, some of them are sequential 1-D algorithms instead of joint 2-D searching [16,17]. Others are simpler but suboptimal solutions can be achieved by the subspace-based approach, which relies on signal subspace and noise subspace [18,19,20].…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation