By Topic

A Tighter Bhattacharyya Bound for Decoding Error Probability

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

3 Author(s)
Griot, M. ; Electr. Eng. Dept., California Univ., Los Angeles, CA ; Wen-Yen Weng ; Wesel, R.D.

The Bhattacharyya bound has been widely used to upper bound the pair-wise probability of error when transmitting over a noisy channel. However, the bound as it appears in most textbooks on channel coding can be improved by a factor of 1/2 when applied to the frame error probability. For the particular case of symmetric channels, the pairwise error probability can also be improved by a factor of 1/2. This letter provides a simple proof of these tighter bounds that has the same simplicity as the proof of the standard Bhattacharyya bound currently found in textbooks

Published in:

Communications Letters, IEEE  (Volume:11 ,  Issue: 4 )