全部 标题 作者
关键词 摘要

OALib Journal期刊
ISSN: 2333-9721
费用:99美元

查看量下载量

相关文章

更多...

High throughput accumulate codes decoder with low resource overhead
高吞吐量低资源占用的累积码译码器

Keywords: accumulating codes,Bahl Cocke Jelinek Raviv(BCJR) algorithm,decoder,FPGA
累积码
,最小误符号率(BCJR)算法,译码器,现场可编程逻辑阵列

Full-Text   Cite this paper   Add to My Lib

Abstract:

Accumulate codes decoder based on BCJR algorithm can not compute several nodes in parallel because of the data dependence exiting in adjoining nodes. In order to increase the throughput of decoder, the parallelism of BCJR algorithm for accumulating codes is exploited in this paper. Through dividing the codes into several blocks and passing messages generated in the last iteration among these blocks, the throughput is increased efficiently because several nodes belong to different blocks can be computed at the same time. In addition, the performance is almost equal to the un-divided inner code decoding. Meanwhile a message updated flow fit hardware implementation is proposed. The accumulating codes decoder based on the proposed message updated flow cut down 30% resource.

Full-Text

Contact Us

service@oalib.com

QQ:3279437679

WhatsApp +8615387084133