By Topic

On the Cramer-Rao bound under parametric constraints

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
$31 $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)
Stoica, Petre ; Syst. & Control Group, Uppsala Univ., Sweden ; Boon Chong Ng

This paper presents a simple expression for the Cramer-Rao bound (CRB) for parametric estimation under differentiable, deterministic constraints on the parameters. In contrast to previous works, the constrained CRB presented does not require that the Fisher information matrix (FIM) for the unconstrained problem be of full rank. This is a useful extension because, for several signal processing problems (such as blind channel identification), the unconstrained problem is unidentifiable. Our expression for the constrained CRB depends only on the unconstrained FIM and a basis of the nullspace of the constraint's gradient matrix. We show that our constrained CRB formula reduces to the known expression when the FIM for the unconstrained problem is nonsingular. A necessary and sufficient condition for the existence of the constrained CRB is also derived.

Published in:

Signal Processing Letters, IEEE  (Volume:5 ,  Issue: 7 )