{"title":"On error exponents for a variable size list decoder using the Viterbi algorithm with likelihood testing","authors":"Toshihiro Niinomi, Toshiyasi Matsushima, Shigeichi Hirasawa","doi":"10.1002/ecjc.20245","DOIUrl":null,"url":null,"abstract":"<p>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. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(6): 27– 36, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20245</p>","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2007-02-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1002/ecjc.20245","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","FirstCategoryId":"1085","ListUrlMain":"https://onlinelibrary.wiley.com/doi/10.1002/ecjc.20245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
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. © 2007 Wiley Periodicals, Inc. Electron Comm Jpn Pt 3, 90(6): 27– 36, 2007; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/ecjc.20245
基于Viterbi算法和似然检验的可变大小列表解码器的误差指数
众所周知，Yamamoto和Itoh的决策反馈（ARQ）方案[1]所采用的似然比（LR）决策准则[3]与维特比算法（VA）高度兼容，因为它需要少量的计算工作量。此外，Forney还将编码定理推广到可变大小列表解码器，用于块码的最大似然解码。在本文中，我们提出了一种扩展基于LR的可变大小列表解码的算法，用于使用Viterbi算法解码卷积码；假设一个离散的无记忆通道，我们还导出了解码器误差指数的下界。©2007 Wiley Periodicals，股份有限公司Electron Comm Jpn Pt 3，90（6）：27-362007；在线发表于Wiley InterScience（www.InterScience.Wiley.com）。DOI 10.1002/ecjc.20245
本文章由计算机程序翻译，如有差异，请以英文原文为准。
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
