An optimal circular Viterbi decoder for the bounded distance criterion

Summary, in English

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.

• Författare: John B Anderson; SM Hladik
• Avdelning/ar: Institutionen för elektro- och informationsteknik
• Publiceringsår: 2002
• Språk: Engelska
• Sidor: 1736-1742
• Publikation/Tidskrift/Serie: IEEE Transactions on Communications
• Volym: 50
• Issue: 11
• Länkar: http://dx.doi.org/10.1109/TCOMM.2002.805263
• Dokumenttyp: Artikel i tidskrift
• Förlag: IEEE - Institute of Electrical and Electronics Engineers Inc.
• Ämne: Electrical Engineering, Electronic Engineering, Information Engineering
• Nyckelord: Viterbi decoding; error correction coding; trellis codes; tailbiting; decoding; convolutional codes
• Status: Published
• Forskningsgrupp: Informations- och kommunikationsteori
• ISBN/ISSN/Övrigt: ISSN: 0090-6778