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

Toshihiro Niinomi; Toshiyasi Matsushima; Shigeichi Hirasawa

doi:10.1002/ecjc.20245

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

Toshihiro Niinomi^*, Toshiyasi Matsushima, Shigeichi Hirasawa

^*Corresponding author for this work

School of Fundamental Science and Engineering

Research output: Contribution to journal › Article › peer-review

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 language	English
Pages (from-to)	27-36
Number of pages	10
Journal	Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)
Volume	90
Issue number	6
DOIs	https://doi.org/10.1002/ecjc.20245
Publication status	Published - 2007 Jun 1

Keywords

Decision criterion
List decoding method
Randomized coding
Viterbi algorithm

ASJC Scopus subject areas

Electrical and Electronic Engineering

Access to Document

10.1002/ecjc.20245

Cite this

On error exponents for a variable size list decoder using the viterbi algorithm with likelihood testing. / Niinomi, Toshihiro; Matsushima, Toshiyasi; Hirasawa, Shigeichi.
In: Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi), Vol. 90, No. 6, 01.06.2007, p. 27-36.

Research output: Contribution to journal › Article › peer-review

@article{4d9a6d28d286489889dab034392fa99c,

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

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.",

keywords = "Decision criterion, List decoding method, Randomized coding, Viterbi algorithm",

author = "Toshihiro Niinomi and Toshiyasi Matsushima and Shigeichi Hirasawa",

year = "2007",

month = jun,

day = "1",

doi = "10.1002/ecjc.20245",

language = "English",

volume = "90",

pages = "27--36",

journal = "Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)",

issn = "1042-0967",

publisher = "John Wiley and Sons Inc.",

number = "6",

}

TY - JOUR

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

AU - Niinomi, Toshihiro

AU - Matsushima, Toshiyasi

AU - Hirasawa, Shigeichi

PY - 2007/6/1

Y1 - 2007/6/1

N2 - 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.

AB - 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.

KW - Decision criterion

KW - List decoding method

KW - Randomized coding

KW - Viterbi algorithm

UR - http://www.scopus.com/inward/record.url?scp=33947368662&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33947368662&partnerID=8YFLogxK

U2 - 10.1002/ecjc.20245

DO - 10.1002/ecjc.20245

M3 - Article

AN - SCOPUS:33947368662

SN - 1042-0967

VL - 90

SP - 27

EP - 36

JO - Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)

JF - Electronics and Communications in Japan, Part III: Fundamental Electronic Science (English translation of Denshi Tsushin Gakkai Ronbunshi)

IS - 6

ER -

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

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this