%0 Journal Article
%T High throughput accumulate codes decoder with low resource overhead<br>高吞吐量低资源占用的累积码译码器
%A 游莹
%J 重庆邮电大学学报(自然科学版)
%D 2011
%I 
%X 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.
%K accumulating codes
%K Bahl Cocke Jelinek Raviv(BCJR) algorithm
%K decoder
%K FPGA<br>累积码
%K 最小误符号率（BCJR）算法
%K 译码器
%K 现场可编程逻辑阵列
%U http://www.alljournals.cn/get_abstract_url.aspx?pcid=01BA20E8BA813E1908F3698710BBFEFEE816345F465FEBA5&cid=96E6E851B5104576C2DD9FC1FBCB69EF&jid=5C2694A2E5629ECD6B59D7B28C6937AD&aid=95D43707ED4FCA58EE6C575DE72DD0B9&yid=9377ED8094509821&vid=EA389574707BDED3&iid=38B194292C032A66&sid=4FE459D71E3BF8EB&eid=B7BFA4B351E4C682&journal_id=1673-825X&journal_name=重庆邮电大学学报(自然科学版)&referenced_num=0&reference_num=0