2007 IEEE International Conference on Acoustics, Speech and Signal Processing - ICASSP '07 2007
DOI: 10.1109/icassp.2007.366851
|View full text |Cite
|
Sign up to set email alerts
|

Maximum-Likelihood Autoregressive Estimation on Incomplete Spectra

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
6
0

Year Published

2010
2010
2011
2011

Publication Types

Select...
1
1

Relationship

1
1

Authors

Journals

citations
Cited by 2 publications
(6 citation statements)
references
References 6 publications
0
6
0
Order By: Relevance
“…The present author recently provided his own particular derivation [18]. The suitability of this criterion for autoregressive estimation on incomplete spectra has been demonstrated anew in [19].…”
Section: Maximum-likelihood Estimationmentioning
confidence: 94%
See 4 more Smart Citations
“…The present author recently provided his own particular derivation [18]. The suitability of this criterion for autoregressive estimation on incomplete spectra has been demonstrated anew in [19].…”
Section: Maximum-likelihood Estimationmentioning
confidence: 94%
“…A known fact is that the asymptotic Cramér-Rao bound is inversely proportional to the number of samples Supported on this well-known fact and on the frequency-selective nature of the maximum-likelihood solution (20), we present here an intuitive approximation of that bound: since the spectral weight (19) sort of informs on how valuable (from 0 to 1) each spectral sample is, we suggest replacing the number of samples in the noise-free Cramér-Rao bound by the effective number of available samples under the presence of noise; in consequence, this number is obtained as follows: (29) The proposed estimation bound for the autoregressive coefficients in noise finally results in (30) Although the proposed bound may not correspond to the correct formula of the lower bound of the estimation variance, a supportive fact to this proposal is that the Fisher information matrix (the inverse of the Cramér-Rao bound) is built with the logarithm of the likelihood, which corresponds indeed to the core of the proposed estimator (16). Such a parallel further suggests that the proposed bound should be close in form to the actual asymptotic Cramér-Rao bound.…”
Section: Numerical Implementationmentioning
confidence: 98%
See 3 more Smart Citations