An optimal circular Viterbi decoder for the bounded distance criterion

John B Anderson, SM Hladik

Research output: Contribution to journalArticlepeer-review

18 Citations (SciVal)


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.
Original languageEnglish
Pages (from-to)1736-1742
JournalIEEE Transactions on Communications
Issue number11
Publication statusPublished - 2002

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering


  • Viterbi decoding
  • error correction coding
  • trellis codes
  • tailbiting
  • decoding
  • convolutional codes


Dive into the research topics of 'An optimal circular Viterbi decoder for the bounded distance criterion'. Together they form a unique fingerprint.

Cite this