The browser you are using is not supported by this website. All versions of Internet Explorer are no longer supported, either by us or Microsoft (read more here: https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Please use a modern browser to fully experience our website, such as the newest versions of Edge, Chrome, Firefox or Safari etc.

An optimal circular Viterbi decoder for the bounded distance criterion

På svenska

Author

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.

Publishing year

2002

Language

English

Pages

1736-1742

Publication/Series

IEEE Transactions on Communications

Volume

50

Issue

11

Document type

Journal article

Publisher

IEEE - Institute of Electrical and Electronics Engineers Inc.

Topic

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

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

Status

Published

Research group

  • Informations- och kommunikationsteori

ISBN/ISSN/Other

  • ISSN: 0090-6778