Advanced

An optimal circular Viterbi decoder for the bounded distance criterion

Anderson, John B LU and Hladik, SM (2002) In IEEE Transactions on Communications 50(11). p.1736-1742
Abstract
We propose a Viterbi-type decoder for tailbiting trellis codes that works by traversing the tailbiting circle somewhat more than once. The traversal is the least possible for any bounded distance Viterbi decoder. Procedures are given that compute this minimum. Unlike previous decoders of the type, the new scheme does not suffer limit cycles or from pseudocodewords. The bit-error rate is compared to that of Bahl-Cocke-Jelinek-Raviv and maximum-likelihood decoding.
Please use this url to cite or link to this publication:
author
organization
publishing date
type
Contribution to journal
publication status
published
subject
keywords
Viterbi decoding, error correction coding, trellis codes, tailbiting, decoding, convolutional codes
in
IEEE Transactions on Communications
volume
50
issue
11
pages
1736 - 1742
publisher
IEEE--Institute of Electrical and Electronics Engineers Inc.
external identifiers
  • wos:000179747100008
  • scopus:0036863590
ISSN
0090-6778
DOI
10.1109/TCOMM.2002.805263
language
English
LU publication?
yes
id
0e23f67f-4eb4-4fe8-adda-f46b7a6ce2c9 (old id 321693)
date added to LUP
2007-08-02 11:26:32
date last changed
2017-12-10 04:36:13
@article{0e23f67f-4eb4-4fe8-adda-f46b7a6ce2c9,
  abstract     = {We propose a Viterbi-type decoder for tailbiting trellis codes that works by traversing the tailbiting circle somewhat more than once. The traversal is the least possible for any bounded distance Viterbi decoder. Procedures are given that compute this minimum. Unlike previous decoders of the type, the new scheme does not suffer limit cycles or from pseudocodewords. The bit-error rate is compared to that of Bahl-Cocke-Jelinek-Raviv and maximum-likelihood decoding.},
  author       = {Anderson, John B and Hladik, SM},
  issn         = {0090-6778},
  keyword      = {Viterbi decoding,error correction coding,trellis codes,tailbiting,decoding,convolutional codes},
  language     = {eng},
  number       = {11},
  pages        = {1736--1742},
  publisher    = {IEEE--Institute of Electrical and Electronics Engineers Inc.},
  series       = {IEEE Transactions on Communications},
  title        = {An optimal circular Viterbi decoder for the bounded distance criterion},
  url          = {http://dx.doi.org/10.1109/TCOMM.2002.805263},
  volume       = {50},
  year         = {2002},
}