产品累积码的可重构FPGA实现

T. Koh, B. Ng, Y. Guan, T. Li
{"title":"产品累积码的可重构FPGA实现","authors":"T. Koh, B. Ng, Y. Guan, T. Li","doi":"10.1109/SIPS.2007.4387553","DOIUrl":null,"url":null,"abstract":"A memory-based, pipelined, serial architecture is developed for implementing product accumulate codes in field programmable gate arrays. A three-stage pipeline structure is exploited on the min-sum decoding algorithm to achieve full utilization of instantiated resources, to reduce latency, and to increase throughput while keeping the performance degradation minimal. Different types of interleavers are investigated and the quadratic permutation polynomial based inter-leaver is shown to be the best choice in terms of implementation cost, reconfigurability and bit error rate performance. The proposed decoder implemented in Xilinx 2v3000FG676-4 chips is capable of processing one full decoding iteration for 1 encoded bit every clock. Thus regardless of the block size, throughput will be determined only by the number of iterations done while latency is linear to block size.","PeriodicalId":93225,"journal":{"name":"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)","volume":"92 1","pages":"249-254"},"PeriodicalIF":0.0000,"publicationDate":"2007-11-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Reconfigurable FPGA Implementation of Product Accumulate Codes\",\"authors\":\"T. Koh, B. Ng, Y. Guan, T. Li\",\"doi\":\"10.1109/SIPS.2007.4387553\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A memory-based, pipelined, serial architecture is developed for implementing product accumulate codes in field programmable gate arrays. A three-stage pipeline structure is exploited on the min-sum decoding algorithm to achieve full utilization of instantiated resources, to reduce latency, and to increase throughput while keeping the performance degradation minimal. Different types of interleavers are investigated and the quadratic permutation polynomial based inter-leaver is shown to be the best choice in terms of implementation cost, reconfigurability and bit error rate performance. The proposed decoder implemented in Xilinx 2v3000FG676-4 chips is capable of processing one full decoding iteration for 1 encoded bit every clock. Thus regardless of the block size, throughput will be determined only by the number of iterations done while latency is linear to block size.\",\"PeriodicalId\":93225,\"journal\":{\"name\":\"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)\",\"volume\":\"92 1\",\"pages\":\"249-254\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2007-11-21\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings. IEEE Workshop on Signal Processing Systems (2007-2014)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIPS.2007.4387553\",\"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. IEEE Workshop on Signal Processing Systems (2007-2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIPS.2007.4387553","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

为了在现场可编程门阵列中实现产品累积码,开发了一种基于存储器的流水线串行结构。在最小和译码算法上采用三级管道结构,充分利用实例化资源,减少延迟,提高吞吐量,同时保持性能下降最小。对不同类型的交织器进行了研究,从实现成本、可重构性和误码率性能等方面证明了基于二次置换多项式的交织器是最佳选择。该解码器在Xilinx 2v3000FG676-4芯片上实现,每个时钟能够处理1个编码位的一次完整解码迭代。因此,无论块大小如何,吞吐量将仅由完成的迭代次数决定,而延迟与块大小呈线性关系。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Reconfigurable FPGA Implementation of Product Accumulate Codes
A memory-based, pipelined, serial architecture is developed for implementing product accumulate codes in field programmable gate arrays. A three-stage pipeline structure is exploited on the min-sum decoding algorithm to achieve full utilization of instantiated resources, to reduce latency, and to increase throughput while keeping the performance degradation minimal. Different types of interleavers are investigated and the quadratic permutation polynomial based inter-leaver is shown to be the best choice in terms of implementation cost, reconfigurability and bit error rate performance. The proposed decoder implemented in Xilinx 2v3000FG676-4 chips is capable of processing one full decoding iteration for 1 encoded bit every clock. Thus regardless of the block size, throughput will be determined only by the number of iterations done while latency is linear to block size.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信