2019
DOI: 10.1109/tsp.2019.2892021
|View full text |Cite
|
Sign up to set email alerts
|

Further Results on the Cramér–Rao Bound for Sparse Linear Arrays

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
7
0

Year Published

2020
2020
2024
2024

Publication Types

Select...
5

Relationship

0
5

Authors

Journals

citations
Cited by 18 publications
(7 citation statements)
references
References 36 publications
0
7
0
Order By: Relevance
“…For comparison, the CRB of an M ‐sensors ULA decreases at a rate of O ( M −3 ) . 42,43 This indicates that ULA is more sensitive to the number of sensors than UCA. One of the reasons is that for ULAs, the array aperture increases linearly as M increases.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…For comparison, the CRB of an M ‐sensors ULA decreases at a rate of O ( M −3 ) . 42,43 This indicates that ULA is more sensitive to the number of sensors than UCA. One of the reasons is that for ULAs, the array aperture increases linearly as M increases.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…In this section, the DOA CRB (denoted as CRB(ω)), which gives the low bound on the variance of estimated DOA, on multi-level DNA is focused. In [35]- [37], the authors have investigated some closed-form CRB(ω) expressions for several classical sparse arrays and found their validity even when the number of sources exceeds the number of array elements. Here, CRB(ω) for sparse array is reviewed and some new results will be obtained when CRB(ω) is applied into multi-level DNA.…”
Section: Doa Crb Analysismentioning
confidence: 99%
“…The CRB is the lower bound of unbiased parameter estimation and usually used as the performance comparison metrics. According to [24][25][26], the CRB of the WNA can be derived as where Π A ⊥ = I N − A(A H A) −1 A H , A is the direction matrix of WNA, P = 1/J ∑ t = 1 J s(t)s H (t) and D can be presented as…”
Section: Cramer-rao Bound (Crb)mentioning
confidence: 99%
“…can be derived as the following cases: Case 1: if N 1 is even. D WNA + can be expressed asD WNA + = {αn 11 d + βn 2 d, n 2 ∈ [0, N 2 − 1], n 11 = 0, 2, × …, N 1 } ∪ {αn 12 d + βn 2 d, n 2 ∈ [0, N 2 − 1], n 12 = 1, 3, …, N 1 − 1} ∪ {αN 1 d + β(N 2 − 1)d + αn 3 d, n 3 = 1, 3, …, N 1 − 1} (24) Assume that D E + = {αN 1 d + β(N 2 − 1)d + αn 3 d, n 3 = 1, 3, ⋯, N 1 − 1}, by combining(23) and(24), we can conclude that D E + contains N 1 /2 unique lags and satisfies the condition ofD d + βn 2 d, n 2 ∈ [0, N 2 − 1], n 11 = 0, 2, × …, N 1 − 1} ∪ {αn 12 d + βn 2 d, n 2 ∈ [0, N 2 − 1], × n 12 = 1, 3, …, N 1 } ∪ {αN 1 d + β(N 2 − 1)d + αn 3 d, × n 3 = 2, 4, …, N 1 − 1} 1 d + β(N 2 − 1)d + αn 3 d, n 3 = 2, 4, …, N 1 − 1}.It is obvious that D E + has N 1 /2 unique lags and D (according to(23) and(25)). …”
mentioning
confidence: 99%