Low-Latency Successive-Cancellation List Decoders for Polar Codes with Multi-bit Decision
Bo Yuan, Keshab K. Parhi

TL;DR
This paper introduces multi-bit decision techniques for Successive-Cancellation List (SCL) decoders of polar codes, significantly reducing decoding latency and increasing throughput without performance loss.
Contribution
It proposes a reformulated SCL algorithm performing intermediate decoding of multiple bits simultaneously, reducing latency and enabling efficient VLSI implementations.
Findings
Latency reduced by up to 60% in proposed decoders.
Throughput increased by up to 3.23 times with list size 4.
No performance loss compared to traditional SCL decoders.
Abstract
Polar codes, as the first provable capacity-achieving error-correcting codes, have received much attention in recent years. However, the decoding performance of polar codes with traditional successive-cancellation (SC) algorithm cannot match that of the low-density parity-check (LDPC) or turbo codes. Because SC list (SCL) decoding algorithm can significantly improve the error-correcting performance of polar codes, design of SCL decoders is important for polar codes to be deployed in practical applications. However, because the prior latency reduction approaches for SC decoders are not applicable for SCL decoders, these list decoders suffer from the long latency bottleneck. In this paper, we propose a multi-bit-decision approach that can significantly reduce latency of SCL decoders. First, we present a reformulated SCL algorithm that can perform intermediate decoding of 2 bits together.…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsError Correcting Code Techniques · Advanced Wireless Communication Techniques · DNA and Biological Computing
