Draft:Ziv-Zakai Bound

From testwiki
Jump to navigation Jump to search

Template:Short description Template:Draft topics Template:AfC topic Template:AfC submission


The Ziv–Zakai bound is a theoretical bound used in estimation theory which provides a lower bound on the estimation error of estimation some random parameter X from a noisy observation Y. The bound work by connecting probability of the excess error to the hypothesis testing. The Ziv–Zakai bound was first introduced by Jaco Ziv and Moshe Zakai in 1969.[1] The bound is considered to be tighter than Cramer-Rao bound albeit more involved. Several modern version of the bound have been subsequently introduced.[2]

Simple Form of the Bound

Suppose we want to estimate a random variable X with the probability density fX from a noisy observation Y, then for any estimator g a simple form of Ziv-Zakai bound is given by[1]

𝔼[|Xg(Y)|2]120t(fX(x)+fX(x+t))Pe(x,x+t)dxdt,

where Pe(x,x+t) is the minimum (Bayes) error probability for the binary hypothesis testing problem between

0:YX=x1:YX=x+t

with prior probabilities Pr(0)=fX(x)fX(x)+fX(x+t) and Pr(1)=1Pr(0).


Applications

The Ziv-Zakai bound has several appealing advantages. Unlike the other bounds, in fact, the Ziv-Zakai bound only requires one regularity condition, that is, the parameter under estimation needs to have a probability density function; this is one of the key advantages of the Ziv-Zakai bound . Hence, the Ziv-Zakai bound has a broader applicability than, for instance, the Cramér-Rao bound, which requires several smoothness assumptions on the probability density function of the estimand.

  • quantum parameter estimation [3]
  • time delay estimation [4]
  • time of arrival estimation [5]
  • direction of arrival estimation [6]
  • MIMO radar [7]

See also

References

Template:Draft categories