A Tighter Bhattacharyya Bound for Decoding Error Probability
โ Scribed by Griot, M.; Wen-Yen Weng; Wesel, R.D.
- Book ID
- 117885130
- Publisher
- IEEE
- Year
- 2007
- Tongue
- English
- Weight
- 55 KB
- Volume
- 11
- Category
- Article
- ISSN
- 1089-7798
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper we first derive a tighter error bound on form factors as a subdivision criterion for the hierarchical radiosity algorithm. Such an error bound can reduce more unnecessary links and improve the performance of the hierarchical radiosity algorithm to meet a user-specified error tolerance.
New upper bounds for the bit and burst error probabilities are derived for the case, when a xed convolutional code is used for communication over the binary symmetric channel (BSC) and the decoder performs maximum likelihood decoding. These bounds are tighter than existing bounds.