涡轮产品代码的q次迭代解码算法

Anais do XXVI Simpósio Brasileiro de Telecomunicações Pub Date : 1900-01-01 DOI:10.14209/sbrt.2008.42818

D. Cunha, Vagner Nascimento, Jaime Portugheis

{"title":"涡轮产品代码的q次迭代解码算法","authors":"D. Cunha, Vagner Nascimento, Jaime Portugheis","doi":"10.14209/sbrt.2008.42818","DOIUrl":null,"url":null,"abstract":"— This article considers the study of turbo product encoding schemes constructed from components Reed-Solomon codes. A proposal of modiﬁcation of the Chase algorithm is developed to satisfy q -ary symbols requirements and is used in the implementation of a iterative q -ary decoding algorithm. It is veriﬁed that the iterative q -ary decoding algorithm presents a reduction of complexity when compared to the binary turbo algorithm. Simulation results are presented to show the effectiveness of the proposed algorithm","PeriodicalId":340055,"journal":{"name":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Um Algoritmo de Decodificação Iterativa q-ária para Códigos Turbo Produto\",\"authors\":\"D. Cunha, Vagner Nascimento, Jaime Portugheis\",\"doi\":\"10.14209/sbrt.2008.42818\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"— This article considers the study of turbo product encoding schemes constructed from components Reed-Solomon codes. A proposal of modiﬁcation of the Chase algorithm is developed to satisfy q -ary symbols requirements and is used in the implementation of a iterative q -ary decoding algorithm. It is veriﬁed that the iterative q -ary decoding algorithm presents a reduction of complexity when compared to the binary turbo algorithm. Simulation results are presented to show the effectiveness of the proposed algorithm\",\"PeriodicalId\":340055,\"journal\":{\"name\":\"Anais do XXVI Simpósio Brasileiro de Telecomunicações\",\"volume\":\"67 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Anais do XXVI Simpósio Brasileiro de Telecomunicações\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.14209/sbrt.2008.42818\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Anais do XXVI Simpósio Brasileiro de Telecomunicações","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14209/sbrt.2008.42818","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 0

摘要

本文研究了由Reed-Solomon码组成的turbo积编码方案。提出了一种改进的Chase算法，以满足对q元符号的要求，并将其用于迭代q元译码算法的实现。验证了迭代q元译码算法与二进制turbo算法相比具有较低的复杂度。仿真结果表明了该算法的有效性

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

查看原文本刊更多论文

Um Algoritmo de Decodificação Iterativa q-ária para Códigos Turbo Produto

— This article considers the study of turbo product encoding schemes constructed from components Reed-Solomon codes. A proposal of modiﬁcation of the Chase algorithm is developed to satisfy q -ary symbols requirements and is used in the implementation of a iterative q -ary decoding algorithm. It is veriﬁed that the iterative q -ary decoding algorithm presents a reduction of complexity when compared to the binary turbo algorithm. Simulation results are presented to show the effectiveness of the proposed algorithm

求助全文

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

来源期刊

Anais do XXVI Simpósio Brasileiro de Telecomunicações

自引率

0.00%

发文量