arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1812.09357cs.AR
收藏

一种降低逐次消去表译码复杂度的方法

A Complexity Reduction Method for Successive Cancellation List Decoding

Onur Dizdar

摘要:

本文介绍了一种降低SCL解码器硬件复杂度的方法。具体来说,我们建议使用一个排序方案,使L路径最小的路径度量也排序根据其路径索引的路径修剪。我们证明,这样的排序方案减少了输入的多路复用器在任何硬件实现的SCL解码从L到(L/2+1),而没有任何变化的解码延迟。我们还提出了建议的排序方法的排序器架构。现场可编程门阵列(FPGA)实现表明,所提出的方法实现SCL解码器的硬件消耗显着增益,特别是对于大的列表大小和块长度。

英文摘要:

This brief introduces a hardware complexity reduction method for successive cancellation list (SCL) decoders. Specifically, we propose to use a sorting scheme so that L paths with smallest path metrics are also sorted according to their path indexes for path pruning. We prove that such sorting scheme reduces the input number of multiplexers in any hardware implementation of SCL decoding from L to (L/2+1) without any changes in the decoding latency. We also propose sorter architectures for the proposed sorting method. Field programmable gate array (FPGA) implementations show that the proposed method achieves significant gain in hardware consumptions of SCL decoder implementations, especially for large list sizes and block lengths.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑