DocumentCode
927377
Title
On the error probability of general trellis codes with applications to sequential decoding (Corresp.)
Author
Johannesson, Rolf
Volume
23
Issue
5
fYear
1977
fDate
9/1/1977 12:00:00 AM
Firstpage
609
Lastpage
611
Abstract
An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of random 
-branch binary trellis codes of rate 
is given which separates the effects of the tail length 
and the memory length 
of the code. It is shown that the bound is independent of the length of the information Sequence when ![M \\geq T + [nE_{VU}(R)]^{-1} \\log _{2} L](/images/tex/5477.gif)
. The implication that the actual error probability behaves similarly is investigated by computer simulations of sequential decoding utilizing the stack algorithm. These simulations confirm the implication which can thus be taken as a design rule for choosing so that the error probability is reduced to its minimum value for a given .
-branch binary trellis codes of rate is given which separates the effects of the tail length and the memory length of the code. It is shown that the bound is independent of the length of the information Sequence when . The implication that the actual error probability behaves similarly is investigated by computer simulations of sequential decoding utilizing the stack algorithm. These simulations confirm the implication which can thus be taken as a design rule for choosing so that the error probability is reduced to its minimum value for a given .Keywords
Sequential decoding; Trellis codes; Viterbi decoding; Coaxial cables; Convolutional codes; Data systems; Error probability; Intersymbol interference; Maximum likelihood decoding; Maximum likelihood detection; Maximum likelihood estimation; Upper bound; Viterbi algorithm;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1977.1055771
Filename
1055771
Link To Document