DocumentCode
939373
Title
A new upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes (Corresp.)
Author
Cedervall, Mats ; Johannesson, Rolf ; Zigangirov, Kamil Sh
Volume
30
Issue
5
fYear
1984
fDate
9/1/1984 12:00:00 AM
Firstpage
762
Lastpage
766
Abstract
An upper bound on the first-event error probability for maximum-likelihood decoding of fixed binary convolutional codes on the binary symmetric channel is derived. The bound is evaluated for rate
codes, and comparisons are made with simulations and with the bounds of Viterbi, Van de Meeberg, and Post. In particular, the new bound is significantly better than Van de Meeberg\´s bound for rates above
.
codes, and comparisons are made with simulations and with the bounds of Viterbi, Van de Meeberg, and Post. In particular, the new bound is significantly better than Van de Meeberg\´s bound for rates above
.Keywords
Convolutional coding; maximum-likelihood (ML) decoding; Arithmetic; Convolutional codes; Equations; Error probability; Information theory; Maximum likelihood decoding; Reed-Solomon codes; Signal to noise ratio; Upper bound; Viterbi algorithm;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1984.1056961
Filename
1056961
Link To Document