2012
DOI: 10.1109/tac.2011.2161842
|View full text |Cite
|
Sign up to set email alerts
|

A Maximum Entropy Enhancement for a Family of High-Resolution Spectral Estimators

Abstract: Abstract-Structured covariances occurring in spectral analysis, filtering and identification need to be estimated from a finite observation record. The corresponding sample covariance usually fails to possess the required structure. This is the case, for instance, in the Byrnes-Georgiou-Lindquist THREE-like tunable, high-resolution spectral estimators. There, the output covariance 6 of a linear filter is needed to initialize the spectral estimation technique. The sample covariance estimate6, however, is usuall… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
45
0

Year Published

2012
2012
2018
2018

Publication Types

Select...
8
1

Relationship

0
9

Authors

Journals

citations
Cited by 50 publications
(45 citation statements)
references
References 33 publications
0
45
0
Order By: Relevance
“…4) In general the estimateΣ does not satisfy the conditions stated in Theorem 3.1. In order to guarantee feasibility, we compute a suitable matrixΣ by solving an ancillary optimization problem as in [6]. 5) Introduce a prior spectral density Ψ.…”
Section: Simulation Resultsmentioning
confidence: 99%
See 1 more Smart Citation
“…4) In general the estimateΣ does not satisfy the conditions stated in Theorem 3.1. In order to guarantee feasibility, we compute a suitable matrixΣ by solving an ancillary optimization problem as in [6]. 5) Introduce a prior spectral density Ψ.…”
Section: Simulation Resultsmentioning
confidence: 99%
“…4 Indeed, following the lines detailed in [6] it is possible to obtain directly a basis of Range(Γ) by solving only N Lyapunov equations.…”
Section: A Search Directionmentioning
confidence: 99%
“…However, due to statistical noise, a "sample covariance" may only approximately satisfy those structural constraints. Thus, it is standard to consider covariance approximation problems of the form: (12) where is an appropriate distance/divergence measure [16]- [18]. In particular, using either or in (12), this becomes (13) which, when the set is defined by linear constraints as is the case for Toeplitz matrices, is a convex program.…”
Section: Structured Covariance Approximationmentioning
confidence: 99%
“…An example is provided by the covariance extension problem and its generalization; see [9][10][11][12][13][14]. These problems pose a number of theoretical and computational challenges, especially in the multivariable framework, for which we also refer the reader to [15][16][17][18][19][20][21][22]. Besides signal processing, significant applications of this theory are found in modeling and identification [23][24][25], H ∞ robust control [26,27], and biomedical engineering [28].…”
Section: Introductionmentioning
confidence: 99%