On error exponents for a variable size list decoder using the viterbi algorithm with likelihood testing

Toshihiro Niinomi, Toshiyasi Matsushima, Shigeichi Hirasawa

Research output: Contribution to journalArticle

Abstract

The likelihood ratio (LR) decision criterion [3] employed by Yamamoto and Itoh's decision feedback (ARQ) scheme [1] is known to be highly compatible with the Viterbi algorithm (VA) due to the fact that it requires a small amount of computational effort. In addition, Forney has derived an extension of the coding theorem to the variable size list decoder for maximum likelihood decoding of block codes. In this paper we propose an algorithm for extending LR-based variable size list decoding for decoding convolutional codes using the Viterbi algorithm; assuming a discrete memoryless channel we also derive a lower bound on the decoder's error exponents.

Original languageEnglish
Pages (from-to)27-36
Number of pages10
JournalElectronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)
Volume90
Issue number6
DOIs
Publication statusPublished - 2007 Jun 1

Keywords

  • Decision criterion
  • List decoding method
  • Randomized coding
  • Viterbi algorithm

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'On error exponents for a variable size list decoder using the viterbi algorithm with likelihood testing'. Together they form a unique fingerprint.

  • Cite this