Abstract
An upper bound on the average error probability for maximum-likelihood decoding of the ensemble of randomL-branch binary trellis codes of rateR = 1/nis given which separates the effects of the tail lengthTand the memory lengthMof the code. It is shown that the bound is independent of the lengthLof the information Sequence whenM geq T + [nE_{VU}(R)]^{-1} log_{2} L. 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 choosingMso that the error probability is reduced to its minimum value for a givenT.
| Original language | English |
|---|---|
| Pages (from-to) | 609-611 |
| Journal | IEEE Transactions on Information Theory |
| Volume | 23 |
| Issue number | 5 |
| Publication status | Published - 1977 |
Subject classification (UKÄ)
- Electrical Engineering, Electronic Engineering, Information Engineering