New results on estimations of the burst and bit error probabilities for fixed convolutional codes

Author

Balakirsky, Vladimir B. ; Johannesson, Rolf ; Zigangirov, Kamil Sh

Author_Institution

Dept. of Inf. Theory, Lund Univ., Sweden

fYear

1994

fDate

27 Jun-1 Jul 1994

Firstpage

271

Abstract

Improved upper bounds on both burst and bit error probabilities for maximum-likelihood decoding of fixed binary convolutional codes on the binary symmetric channel are derived. The bounds are evaluated for rate R=1/2 encoders and comparisons are made with simulations and with the bounds of Viterbi (1971) and Van de Meeberg (1974). The new bounds are significantly better than Van de Meeberg´s bounds for rates above the computational cut-off rate R₀

Keywords

binary sequences; channel capacity; channel coding; coding errors; convolutional codes; error statistics; maximum likelihood decoding; probability; telecommunication computing; Van de Meeberg´s bounds; Viterbi bounds; binary symmetric channel; bit error probability; burst error probability; computational cut-off rate; encoders; fixed binary convolutional codes; maximum-likelihood decoding; upper bounds; Communication systems; Computational modeling; Convolutional codes; Error probability; Information theory; Maximum likelihood decoding; Maximum likelihood estimation; Upper bound; Viterbi algorithm;

fLanguage

English

Publisher

ieee

Conference_Titel

Information Theory, 1994. Proceedings., 1994 IEEE International Symposium on

Conference_Location

Trondheim

Print_ISBN

0-7803-2015-8

Type

conf

DOI

10.1109/ISIT.1994.395011

Filename

395011