探索鲍姆-韦尔奇算法和turbo解码之间的关系

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252) Pub Date : 1998-08-16 DOI:10.1109/ISIT.1998.708708

Saejoon Kim, S. Wicker

{"title":"探索鲍姆-韦尔奇算法和turbo解码之间的关系","authors":"Saejoon Kim, S. Wicker","doi":"10.1109/ISIT.1998.708708","DOIUrl":null,"url":null,"abstract":"It is shown that the problem of APP decoding of single and parallel concatenated codes can be recast in terms of parameter estimation for one or more nonstationary hidden Markov processes. It is then shown that simple extensions of the Baum-Welch algorithm provide solutions to these problems, including solutions that provide channel-matching turbo decoding algorithms.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"52 20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":"{\"title\":\"An exploration of the relationship between the Baum-Welch algorithm and turbo decoding\",\"authors\":\"Saejoon Kim, S. Wicker\",\"doi\":\"10.1109/ISIT.1998.708708\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"It is shown that the problem of APP decoding of single and parallel concatenated codes can be recast in terms of parameter estimation for one or more nonstationary hidden Markov processes. It is then shown that simple extensions of the Baum-Welch algorithm provide solutions to these problems, including solutions that provide channel-matching turbo decoding algorithms.\",\"PeriodicalId\":133728,\"journal\":{\"name\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"volume\":\"52 20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"3\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISIT.1998.708708\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISIT.1998.708708","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 3

摘要

研究表明，单个和并行级联码的APP解码问题可以用一个或多个非平稳隐马尔可夫过程的参数估计问题来重新定义。然后证明了Baum-Welch算法的简单扩展提供了这些问题的解决方案，包括提供信道匹配turbo解码算法的解决方案。

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

查看原文本刊更多论文

An exploration of the relationship between the Baum-Welch algorithm and turbo decoding

It is shown that the problem of APP decoding of single and parallel concatenated codes can be recast in terms of parameter estimation for one or more nonstationary hidden Markov processes. It is then shown that simple extensions of the Baum-Welch algorithm provide solutions to these problems, including solutions that provide channel-matching turbo decoding algorithms.

求助全文

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

来源期刊

Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)

自引率

0.00%

发文量