| 高吞吐量低资源占用的累积码译码器 |
| |
| 引用本文： | 游莹.高吞吐量低资源占用的累积码译码器[J].重庆邮电大学学报(自然科学版),2011,23(3):266-270. |
| |
| 作者姓名： | 游莹 |
| |
| 作者单位： | 福州大学 阳光学院电子信息工程系，福建 福州 350015 |
| |
| 摘 要： | 由于相邻节点间存在数据依赖关系,基于最小误符号率(Bahl Cocke Jelinek Raviv,BCJR)算法的累积码译码器无法进行多个节点的并行计算.为了提高译码器吞吐量,研究提高BCJR算法并行度的方法,通过将累积码分段,并在不同分段间传递上一次迭代的信息,属于不同分段的多个节点可以并行计算,使译码器的吞吐量得...
|
| 关 键 词： | 累积码 最小误符号率(BCJR)算法 译码器 现场可编程逻辑阵列 |
| 收稿时间： | 2010/12/13 0:00:00 |
High throughput accumulate codes decoder with low resource overhead |
| |
| YOU Ying.High throughput accumulate codes decoder with low resource overhead[J].Journal of Chongqing University of Posts and Telecommunications,2011,23(3):266-270. |
| |
| Authors: | YOU Ying |
| |
| Institution: | Dept. of Electronic and Information Engineering of Sunshine College, Fuzhou University, Fuzhou 350015 |
| |
| 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. |
| |
| Keywords: | accumulating codes Bahl Cocke Jelinek Raviv(BCJR) algorithm decoder FPGA |
|
| 点击此处可从《重庆邮电大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《重庆邮电大学学报(自然科学版)》下载免费的PDF全文 |
