A tighter Bhattacharyya bound for decoding error probability

doi:10.1109/LCOM.2007.348296

A tighter Bhattacharyya bound for decoding error probability

2007-04-01

5

OA

AI

R

Richard D. Wesel

DOI：10.1109/LCOM.2007.348296

原文链接

原文求助

摘要

En 中文

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.

Keyword:

channel coding

Bhattacharyya bound

error probability

A tighter Bhattacharyya bound for decoding error probability

摘要

期刊

机构

引用论文