DocumentCode
2268495
Title
Improved union bound for Viterbi decoder of convolutional codes
Author
Burnashev, Marat V.
Author_Institution
Inst. for Problems of Inf. Transmission, Acad. of Sci., Moscow, Russia
fYear
1995
fDate
17-22 Sep 1995
Firstpage
167
Abstract
Transmission of binary information sequences over the BSC with crossover probability 0<p 1/2 is considered. It is assumed that a noncatastrophic time-invariant convolutional encoder and Viterbi decoder are used. There are two types of performance characteristics that are usually used to describe the probabilistic behavior of such communication systems. The first type describes the stationary behavior of the system (e.g. bit-error probability, averaged decoding delay, etc.). Usually they are of the main interest. The second type describes the behavior of the system at initial moment (e.g. first-error event probability). The most commonly used “union bounds” to upper bound any of the mentioned characteristics do not take into account some essential difference between these two types of characteristics. We show that standard “union bounds” for stationary characteristics can be considerably improved preserving the same form and terms
Keywords
Viterbi decoding; binary sequences; convolutional codes; error statistics; Viterbi decoder; averaged decoding delay; binary information sequences; binary symmetric channel; bit-error probability; convolutional codes; crossover probability; first-error event probability; improved union bound; noncatastrophic time-invariant convolutional encoder; performance characteristics; stationary characteristics; upper bound; Communication systems; Convolutional codes; Decoding; Equations; Error probability; Testing; Viterbi algorithm;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory, 1995. Proceedings., 1995 IEEE International Symposium on
Conference_Location
Whistler, BC
Print_ISBN
0-7803-2453-6
Type
conf
DOI
10.1109/ISIT.1995.531516
Filename
531516
Link To Document