Lower bounds on the estimation of harmonics in colored noise
- 23 November 2002
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 1, 478-482
- https://doi.org/10.1109/acssc.1997.680373
Abstract
A fast algorithm for the computation of the Fisher information matrix for the parameters of a deterministic signal in Gaussian AR noise is derived. The harmonic signal is studied in detail. In the case of a harmonic signal with random phases, closed-form expressions for the finite-sample posterior Cramer-Rao bounds are established. The fast algorithm is also useful for computing the conditional CRB when the additive noise is a non-Gaussian AR process. It is seen that the asymptotic lower bounds may deviate significantly from the exact bounds even when the data length is moderate. Theoretical results are illustrated via numerical evaluation of the different lower bounds. Author(s) Ghogho, M. Dept. of Electron. & Electr. Eng., Strathclyde Univ., Glasgow, UK Swami, A.Keywords
This publication has 6 references indexed in Scilit:
- Bibliography on higher-order statisticsSignal Processing, 1997
- Cramer-Rao bounds for deterministic signals in additive and multiplicative noiseSignal Processing, 1996
- On the accuracy of estimating the parameters of a regular stationary processIEEE Transactions on Information Theory, 1996
- Estimation for processes with mixed spectraPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1993
- Parameter estimation and GLRT detection in colored non-Gaussian autoregressive processesIEEE Transactions on Acoustics, Speech, and Signal Processing, 1990
- Computation of the exact information matrix of Gaussian time series with stationary random componentsIEEE Transactions on Acoustics, Speech, and Signal Processing, 1986