Advanced

On the error probability of general trellis codes with applications to sequential decoding

Johannesson, Rolf LU (1977) In IEEE Transactions on Information Theory 23(5). p.609-611
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.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
in
IEEE Transactions on Information Theory
volume
23
issue
5
pages
609 - 611
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • Scopus:0017534992
ISSN
0018-9448
language
English
LU publication?
yes
id
fb051c5d-9e7f-468a-af7b-cae48c340f0b (old id 1056924)
alternative location
http://ieeexplore.ieee.org/iel5/18/22698/01055771.pdf
date added to LUP
2008-04-17 13:34:49
date last changed
2016-10-13 04:26:17
@misc{fb051c5d-9e7f-468a-af7b-cae48c340f0b,
  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.},
  author       = {Johannesson, Rolf},
  issn         = {0018-9448},
  language     = {eng},
  number       = {5},
  pages        = {609--611},
  publisher    = {ARRAY(0x964ea00)},
  series       = {IEEE Transactions on Information Theory},
  title        = {On the error probability of general trellis codes with applications to sequential decoding},
  volume       = {23},
  year         = {1977},
}