基于似然测试的Viterbi算法的变大小列表解码器的错误指数研究

Electronics and Communications in Japan (Part III: Fundamental Electronic Science) Pub Date : 2007-06-01 DOI:10.1002/ECJC.20245

T. Niinomi, T. Matsushima, S. Hirasawa

{"title":"基于似然测试的Viterbi算法的变大小列表解码器的错误指数研究","authors":"T. Niinomi, T. Matsushima, S. Hirasawa","doi":"10.1002/ECJC.20245","DOIUrl":null,"url":null,"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","PeriodicalId":100407,"journal":{"name":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","volume":"14 1","pages":"27-36"},"PeriodicalIF":0.0000,"publicationDate":"2007-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On error exponents for a variable size list decoder using the Viterbi algorithm with likelihood testing\",\"authors\":\"T. Niinomi, T. Matsushima, S. Hirasawa\",\"doi\":\"10.1002/ECJC.20245\",\"DOIUrl\":null,\"url\":null,\"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\",\"PeriodicalId\":100407,\"journal\":{\"name\":\"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)\",\"volume\":\"14 1\",\"pages\":\"27-36\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-06-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1002/ECJC.20245\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Electronics and Communications in Japan (Part III: Fundamental Electronic Science)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1002/ECJC.20245","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

众所周知，Yamamoto和Itoh的决策反馈(ARQ)方案[1]采用的似然比(LR)决策准则[3]与Viterbi算法(VA)的兼容性很高，因为它需要少量的计算量。此外，Forney还将编码定理推广到可变大小列表解码器，用于分组码的最大似然解码。本文提出了一种利用Viterbi算法将基于lr的变长列表解码扩展到卷积码解码的算法;假设一个离散的无内存信道，我们也推导出解码器的误差指数的下界。©2007 Wiley期刊公司电子工程学报，2009,35 (6):379 - 379;在线发表于Wiley InterScience (www.interscience.wiley.com)。DOI 10.1002 / ecjc.20245

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

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

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

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Electronics and Communications in Japan (Part III: Fundamental Electronic Science)

自引率

0.00%

发文量