An Improved Union Bound on Block Error Probability for Closest Coset Decoding

Kenichi TOMITA  Toyoo TAKATA  Tadao KASAMI  Shu LIN  

IEICE TRANSACTIONS on Fundamentals of Electronics, Communications and Computer Sciences   Vol.E78-A   No.9   pp.1077-1085
Publication Date: 1995/09/25
Online ISSN: 
Print ISSN: 0916-8508
Type of Manuscript: Special Section PAPER (Special Section on Information Theory and Its Applications)
block error probability,  block modulation code,  closest coset decoding,  and union bound,  

Full Text: PDF(673.2KB)>>
Buy this Article

This paper is concerned with the evaluation of the block error probability Pic of a block modulation code for closest coset decoding over an AWGN channel. In most cases, the conventional union bound on Pic for closest coset decoding is loose not only at low signal-to-noise ratios but at relatively high signal-to-noise ratios. In this paper, we introduce a new upper bound on the probability of union of events by using the graph theory and we derive an improved upper bound on Pic for some block modulation codes using closest coset decoding over an AWGN channel. We show that the new bound is better than the conventional union bound especially at relatively high signal-to-noise ratios.