A Tighter Bhattacharyya Bound for Decoding Error Probability
Authors:
- 23 April 2007
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Communications Letters
- Vol. 11 (4) , 346-347
Abstract
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 textbooksKeywords
This publication has 3 references indexed in Scilit:
- Fundamentals of Convolutional Coding1999
- Probability of error, equivocation, and the Chernoff boundIEEE Transactions on Information Theory, 1970
- The Divergence and Bhattacharyya Distance Measures in Signal SelectionIEEE Transactions on Communications, 1967