Maximum likelihood estimation, analysis, and applications of exponential polynomial signals
We model complex signals by approximating the phase and the logarithm of the time-varying amplitude of the signal as a finite order polynomial. We refer to a signal that has this form as an exponential polynomial signal (EPS). We derive an iterative maximum-likelihood (ML) estimation algorithm to es...
Gespeichert in:
Veröffentlicht in: | IEEE transactions on signal processing 1999-06, Vol.47 (6), p.1493-1501 |
---|---|
Hauptverfasser: | , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | We model complex signals by approximating the phase and the logarithm of the time-varying amplitude of the signal as a finite order polynomial. We refer to a signal that has this form as an exponential polynomial signal (EPS). We derive an iterative maximum-likelihood (ML) estimation algorithm to estimate the unknown parameters of the EPS model. The initialization of the ML algorithm can be performed by using the result of a related paper. A statistical analysis of the ML algorithm is performed using a finite-order Taylor expansion of the mean squared error (MSE) of the estimate about the variance of the additive noise. This perturbation analysis gives a method of predicting the MSE of the estimate for any choice of the signal parameters. The MSE from the perturbation analysis is compared with the MSE from a Monte Carlo simulation and the Cramer-Rao Bound (CRB). The CRB for this model is also derived. |
---|---|
ISSN: | 1053-587X 1941-0476 |
DOI: | 10.1109/78.765111 |