![]() |
CiteULike | ![]() |
yaroslavvb's CiteULike | ![]() |
![]() |
|
![]() |
Register | ![]() |
Log in | ![]() |
A proof of the Fisher information inequality via a data processing argumentby: R. Zamir
|
Reviews
[Write a review of this article]
Find related articles from these CiteULike users
Find related articles with these CiteULike tags
Posting History
AbstractThe Fisher information J(X) of a random variable X under a translation parameter appears in information theory in the classical proof of the entropy-power inequality (EPI). It enters the proof of the EPI via the De-Bruijn identity, where it measures the variation of the differential entropy under a Gaussian perturbation, and via the convolution inequality J(X+Y)<sup>-1</sup>⩾J(X)<sup>-1</sup>+J(Y) <sup>-1</sup> (for independent X and Y), known as the Fisher information inequality (FII). The FII is proved in the literature directly, in a rather involved way. We give an alternative derivation of the FII, as a simple consequence of a “data processing inequality” for the Cramer-Rao lower bound on parameter estimation
BibTeX record
RIS record