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

Multidimensional Frequency Estimation With Finite Snapshots in the Presence of Identical Frequencies

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

2
79
0

Year Published

2011
2011
2019
2019

Publication Types

Select...
3
2
1

Relationship

1
5

Authors

Journals

citations
Cited by 36 publications
(81 citation statements)
references
References 24 publications
2
79
0
Order By: Relevance
“…Perturbation analysis of IMDF have been done in [6]. However, the obtained expressions require the calculation of the SVD of the MH matrix H. To get simplified perturbation expressions we use the following fact: from (9), K IMDF can be written as a linear combination of…”
Section: Imdf Perturbationsmentioning
confidence: 99%
See 2 more Smart Citations
“…Perturbation analysis of IMDF have been done in [6]. However, the obtained expressions require the calculation of the SVD of the MH matrix H. To get simplified perturbation expressions we use the following fact: from (9), K IMDF can be written as a linear combination of…”
Section: Imdf Perturbationsmentioning
confidence: 99%
“…They include linear prediction-based methods such as 2-D TLS-Prony [10], and subspace approaches such as matrix enhancement and matrix pencil (MEMP) [3], 2-D ESPRIT [8], improved multidimensional folding (IMDF) [7,6], Tensor-ESPRIT [2], principal-singular-vector utilization for modal analysis (PUMA) [14,13]. Among the most promising are N-D ESPRIT [8,12] and IMDF [7,6]. Both methods use the eigenvalue decomposition (EVD) of a so-called shift matrix constructed from the estimated basis of the signal subspace, but the modes are extracted differently: from eigenvalues in ND-ESPRIT and from eigenvectors in IMDF.…”
Section: Introductionmentioning
confidence: 99%
See 1 more Smart Citation
“…We summarize our main result on statistical identifiability for the proposed algorithm in the following theorem [46]. (13), in the absence of noise, the parameter set ({ω f,n } N n=1 , {c f (t)} T t=1 ), f = 1, .…”
Section: B61 the Eigenvector-based Algorithm For N -D Frequency Estmentioning
confidence: 99%
“…We have derived the theoretic error variance of the eigenvector-based algorithm in [46]. We have also derived the Cramér-Rao Bound for multidimensional frequency estimation models [46].…”
Section: B62 Optimization Of the Eigenvector-based Algorithmmentioning
confidence: 99%