Title :
Bounded distance decoding of unit memory codes
Author_Institution :
Inst. of Circuit Theor. & Telecommun., Tech. Univ. Denmark, Lyngby, Denmark
fDate :
9/1/1993 12:00:00 AM
Abstract :
We discuss minimum distance decoding of convolutional codes. The relevant distance functions are defined, and the set of correctable error patterns is described by a sequence of weight constraints. Decoding methods for error patterns of bounded weight are described, and it is demonstrated that these methods offer a favorable combination of performance and complexity. Exact values and upper bounds on the error probability are calculated from finite state models of the decoding process
Keywords :
block codes; coding errors; convolutional codes; decoding; error correction codes; error statistics; finite automata; bounded distance decoding; convolutional codes; correctable error patterns; distance functions; error probability; finite state models; minimum distance decoding; sequence of weight constraints; unit memory codes; upper bounds; Block codes; Convolutional codes; Decoding; Error correction; Error correction codes; Error probability; Pattern analysis; Upper bound; Vectors; Viterbi algorithm;
Journal_Title :
Information Theory, IEEE Transactions on
