arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1309.7818cs.AR
收藏

极化码连续抵消译码的部分和生成结构

Partial Sums Generation Architecture for Successive Cancellation Decoding of Polar Codes

Guillaume Berhault, Camille Leroux, Christophe Jego, Dominique Dallet

摘要:

极化码是一种新的纠错码族,必须为编码器和解码器定义高效的硬件架构。使用包括部分和计算的连续消除解码算法来解码极化码。我们利用极化码的递归结构来引入一个高效的部分和计算单元,该单元也可以实现编码器。所提出的架构是综合了几个codelumin 65纳米ASIC技术。结果设计的面积减少了26%,最大工作频率提高了~ 25%。

英文摘要:

Polar codes are a new family of error correction codes for which efficient hardware architectures have to be defined for the encoder and the decoder. Polar codes are decoded using the successive cancellation decoding algorithm that includes partial sums computations. We take advantage of the recursive structure of polar codes to introduce an efficient partial sums computation unit that can also implements the encoder. The proposed architecture is synthesized for several codelengths in 65nm ASIC technology. The area of the resulting design is reduced up to 26% and the maximum working frequency is improved by ~25%.

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

↑