By Topic

Concentrated Cramer-Rao bound expressions

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. Hochwald ; Dept. of Electr. Eng., Yale Univ., New Haven, CT, USA ; A. Nehorai

We present a method to simplify the analytical computation of the Cramer-Rao bound. The method circumvents bound calculations for so-called nuisance parameters. Under mild regularity conditions the technique, which replaces expectations with almost sure limits, can significantly lower the analytical complexity as compared to traditional methods. The dimension of a matrix that requires computation and inversion is reduced to the length of the parameter vector of interest. We give applications to random variables having densities in the exponential family. For normal distributions the resulting expressions take on particularly simple closed forms

Published in:

IEEE Transactions on Information Theory  (Volume:40 ,  Issue: 2 )