A High Throughput List Decoder Architecture for Polar Codes
Jun Lin, Chenrong Xiong, Zhiyuan Yan

TL;DR
This paper introduces a reduced latency list decoding algorithm for polar codes that significantly improves throughput and efficiency by visiting fewer nodes in the decoding tree, with practical hardware implementation results.
Contribution
A novel reduced latency list decoding algorithm for polar codes that decreases decoding time and hardware complexity while maintaining performance.
Findings
Achieves significant latency reduction compared to existing decoders.
Demonstrates improved area efficiency in hardware implementations.
Suitable for larger block lengths with scalable architecture.
Abstract
While long polar codes can achieve the capacity of arbitrary binary-input discrete memoryless channels when decoded by a low complexity successive cancelation (SC) algorithm, the error performance of the SC algorithm is inferior for polar codes with finite block lengths. The cyclic redundancy check (CRC) aided successive cancelation list (SCL) decoding algorithm has better error performance than the SC algorithm. However, current CRC aided SCL (CA-SCL) decoders still suffer from long decoding latency and limited throughput. In this paper, a reduced latency list decoding (RLLD) algorithm for polar codes is proposed. Our RLLD algorithm performs the list decoding on a binary tree, whose leaves correspond to the bits of a polar code. In existing SCL decoding algorithms, all the nodes in the tree are traversed and all possibilities of the information bits are considered. Instead, our RLLD…
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.
