By Topic

Computation of the exact information matrix of Gaussian time series with stationary random components

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
B. Porat ; Technion-Israel Institute of Technology, Haifa, Israel. ; B. Friedlander

The paper presents an algorithm for efficient recursive computation of the Fisher information matrix of Gaussian time series whose random components are stationary, and whose means and covariances are functions of a parameter vector. The algorithm is first developed in a general framework and then specialized to the case of autoregressive moving-average processes, with possible additive white noise. The asymptotic behavior of the algorithm is explored and a termination criterion is derived. Finally, the algorithm is used to demonstrate the behavior of the exact Cramer-Rao bound (for unbiased estimates) for some ARMA processes, as a function of the number of data points. It is shown that for processes with zeros near the unit circle and short data records, the exact Cramer-Rao bound differs dramatically from its common approximation based on asymptotic theory.

Published in:

IEEE Transactions on Acoustics, Speech, and Signal Processing  (Volume:34 ,  Issue: 1 )