Computer Science – Information Theory
Scientific paper
2011-07-18
Computer Science
Information Theory
Parts of this technical report will appear in the IEEE Transactions on Information Theory
Scientific paper
A lower bound on the minimum error probability for multihypothesis testing is established. The bound, which is expressed in terms of the cumulative distribution function of the tilted posterior hypothesis distribution given the observation with tilting parameter theta larger than or equal to 1, generalizes an earlier bound due the Poor and Verdu (1995). A sufficient condition is established under which the new bound (minus a multiplicative factor) provides the exact error probability in the limit of theta going to infinity. Examples illustrating the new bound are also provided. The application of this generalized Poor-Verdu bound to the channel reliability function is next carried out, resulting in two information-spectrum upper bounds. It is observed that, for a class of channels including the finite-input memoryless Gaussian channel, one of the bounds is tight and gives a multi-letter asymptotic expression for the reliability function, albeit its determination or calculation in single-letter form remains an open challenging problem. Numerical examples regarding the other bound are finally presented.
Alajaji Fady
Chen Po-Ning
No associations
LandOfFree
A Generalized Poor-Verdu Error Bound for Multihypothesis Testing and the Channel Reliability Function does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with A Generalized Poor-Verdu Error Bound for Multihypothesis Testing and the Channel Reliability Function, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and A Generalized Poor-Verdu Error Bound for Multihypothesis Testing and the Channel Reliability Function will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-271877