On the Cramer-Rao bound under parametric constraints
- 1 July 1998
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Signal Processing Letters
- Vol. 5 (7) , 177-179
- https://doi.org/10.1109/97.700921
Abstract
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.Keywords
This publication has 6 references indexed in Scilit:
- A subspace approach to blind space-time signal processing for wireless communication systemsIEEE Transactions on Signal Processing, 1997
- Closed-form blind symbol estimation in digital communicationsIEEE Transactions on Signal Processing, 1995
- Subspace methods for the blind identification of multichannel FIR filtersIEEE Transactions on Signal Processing, 1995
- A simple derivation of the constrained multiple parameter Cramer-Rao boundIEEE Transactions on Signal Processing, 1993
- Lower bounds for parametric estimation with constraintsIEEE Transactions on Information Theory, 1990
- A note on a manova model applied to problems in growth curveAnnals of the Institute of Statistical Mathematics, 1966