1995
DOI: 10.1016/0165-1684(94)00122-g
|View full text |Cite
|
Sign up to set email alerts
|

The propagator method for source bearing estimation

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1

Citation Types

1
238
0
2

Year Published

2006
2006
2017
2017

Publication Types

Select...
6
2

Relationship

0
8

Authors

Journals

citations
Cited by 420 publications
(249 citation statements)
references
References 8 publications
1
238
0
2
Order By: Relevance
“…In the noise free case, it can be shown that U o = −V as discussed in [9,20]. So the RMSE in (44a) and (45) differ only by the numerator value.…”
mentioning
confidence: 93%
See 1 more Smart Citation
“…In the noise free case, it can be shown that U o = −V as discussed in [9,20]. So the RMSE in (44a) and (45) differ only by the numerator value.…”
mentioning
confidence: 93%
“…A possible alternative to the MUSIC method for source bearing estimation with arrays consisting of a large number of sensors is the propagator method (PM). Marcos et al [9] have proposed the so-called 'propagator, method for array signal processing without any eigen-decomposition. The propagator is a linear operator based on a partition of the steering vectors, and was found to be a very effective tool for estimating the DOAs.…”
Section: Introductionmentioning
confidence: 99%
“…We can make a common assumption like many previous works [9][10] that the array manifold B is of full rank and the K rows of B are linearly independent. Then the other (2M-K) rows of B can be expressed as a linear combination of the former K rows.…”
Section: The Proposed Algorithmmentioning
confidence: 99%
“…The work in [8] proposed a low complexity algorithm with an unsatisfied estimation performance. And the work in [11] which also needs 2-D search is based on the OPM algorithm [14], which utilizes the propagator to obtain the noise subspace and estimates nominal DOAs and angular spreads through a similar spectrum search like DSPE-CD [7]. In this letter, a successive propagator method (S-PM) algorithm was proposed to further reduce the computational complexity.…”
Section: Introductionmentioning
confidence: 99%
“…In [5], a polynomial root-finding-based method was proposed using two parallel ULAs, by decoupling the 2-D problem into two 1-D problems to reduce the computational complexity. Another computationally efficient method was proposed in [6], where the propagator method in [7] was employed based on two parallel ULAs. However, this method requires pair matching between the 2-D azimuth and elevation estimation results and may not work effectively for some situations.…”
Section: Introductionmentioning
confidence: 99%