基于比较-选择-相加原理的译码率为1/n的双互补卷积码及其高速率穿孔码的差分Viterbi算法

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

Shu Lin, M. Fossorier

{"title":"基于比较-选择-相加原理的译码率为1/n的双互补卷积码及其高速率穿孔码的差分Viterbi算法","authors":"Shu Lin, M. Fossorier","doi":"10.1109/ISIT.1998.708970","DOIUrl":null,"url":null,"abstract":"This paper presents a new algorithm for decoding doubly complementary convolutional codes based on a compare-select-add principle to process the code trellis. This new algorithm is more efficient than the conventional Viterbi (1967) algorithm.","PeriodicalId":133728,"journal":{"name":"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-08-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A differential Viterbi algorithm for decoding rate-1/n doubly complementary convolutional codes and their high-rate punctured codes based on a compare-select-add principle\",\"authors\":\"Shu Lin, M. Fossorier\",\"doi\":\"10.1109/ISIT.1998.708970\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"This paper presents a new algorithm for decoding doubly complementary convolutional codes based on a compare-select-add principle to process the code trellis. This new algorithm is more efficient than the conventional Viterbi (1967) algorithm.\",\"PeriodicalId\":133728,\"journal\":{\"name\":\"Proceedings. 1998 IEEE International Symposium on Information Theory (Cat. No.98CH36252)\",\"volume\":\"3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-08-16\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"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.708970\",\"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.708970","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

摘要

本文提出了一种基于比较-选择-添加原理对码格进行处理的双互补卷积码译码算法。该算法比传统的Viterbi(1967)算法效率更高。

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

查看原文本刊更多论文

A differential Viterbi algorithm for decoding rate-1/n doubly complementary convolutional codes and their high-rate punctured codes based on a compare-select-add principle

This paper presents a new algorithm for decoding doubly complementary convolutional codes based on a compare-select-add principle to process the code trellis. This new algorithm is more efficient than the conventional Viterbi (1967) algorithm.

求助全文

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

来源期刊

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

自引率

0.00%

发文量