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

Tb/s极性连续抵消解码器16 nm ASIC实现

Tb/s Polar Successive Cancellation Decoder 16nm ASIC Implementation

Altuğ Süral, E. Göksu Sezer, Ertuğrul Kolağasıoğlu, Veerle Derudder, Kaoutar Bertrand

摘要:

本文提出了一种高效的极化码连续消除(SC)解码器的ASIC实现方法。SC是一种低复杂度的深度优先搜索解码算法,适用于需要极高吞吐量和低功耗的超5G应用。在这项工作中,SC的ASIC实现利用了许多技术,包括流水线和展开,以实现Tb/s的数据吞吐量,而不影响功率和面积指标。为了降低实现的复杂度,使用自适应对数似然比(LLR)量化方案。该方案通过考虑SC译码器中LLR分布的不规则极化和熵,在1-5比特的范围内优化了内部LLR的比特精度。当码块长度为1024比特,有效载荷为854比特时,该方案的性能代价小于0.2dB。此外,在SC中的一些计算需要大的空间与高度并行化,而其他需要更长的时间步长。为了优化这些计算并减少存储器和延迟,使用寄存器减少/平衡(R-RB)方法。最终的解码器架构被称为优化极化SC(OPSC)。在16 nm FinFet ASIC工艺下的后布局布线结果表明,OPSC解码器在0.79 mm $^2$面积上实现了1.2 Tb/s的编码吞吐量,能量效率为0.95 pJ/bit。

英文摘要:

This work presents an efficient ASIC implementation of successive cancellation (SC) decoder for polar codes. SC is a low-complexity depth-first search decoding algorithm, favorable for beyond-5G applications that require extremely high throughput and low power. The ASIC implementation of SC in this work exploits many techniques including pipelining and unrolling to achieve Tb/s data throughput without compromising power and area metrics. To reduce the complexity of the implementation, an adaptive log-likelihood ratio (LLR) quantization scheme is used. This scheme optimizes bit precision of the internal LLRs within the range of 1-5 bits by considering irregular polarization and entropy of LLR distribution in SC decoder. The performance cost of this scheme is less than 0.2 dB when the code block length is 1024 bits and the payload is 854 bits. Furthermore, some computations in SC take large space with high degree of parallelization while others take longer time steps. To optimize these computations and reduce both memory and latency, register reduction/balancing (R-RB) method is used. The final decoder architecture is called optimized polar SC (OPSC). The post-placement-routing results at 16nm FinFet ASIC technology show that OPSC decoder achieves 1.2 Tb/s coded throughput on 0.79 mm$^2$ area with 0.95 pJ/bit energy efficiency.

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

↑