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

D. Cunha, Vagner Nascimento, Jaime Portugheis
{"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 modification 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 verified 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}
引用次数: 0

Abstract

— This article considers the study of turbo product encoding schemes constructed from components Reed-Solomon codes. A proposal of modification 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 verified 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
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
涡轮产品代码的q次迭代解码算法
本文研究了由Reed-Solomon码组成的turbo积编码方案。提出了一种改进的Chase算法,以满足对q元符号的要求,并将其用于迭代q元译码算法的实现。验证了迭代q元译码算法与二进制turbo算法相比具有较低的复杂度。仿真结果表明了该算法的有效性
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Método de Análise de Tráfegos VoIP Sobrepostos Uma Análise Experimental da Capacidade de Redes Ad Hoc Veiculares Fusão biométrica com lógica nebulosa Space-Time Coding for Single Carrier Block CDMA Systems Um Algoritmo Adaptativo para Predição da Regularidade Local de Tráfego de Redes
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1