High-Throughput and Flexible Belief Propagation List Decoder for Polar Codes
- 1 February 2024
- journal article
- research article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 72 (1053587X) , 1158-1174
Abstract
Due to its high parallelism, belief propagation (BP) decoding is amenable to high-throughput applications and thus represents a promising solution for the ultra-high peak data rate required by future communication systems. To bridge the performance gap compared to the widely used successive cancellation list (SCL) decoding algorithm, BP list (BPL) decoding for polar codes extends candidate codeword exploration via multiple permuted factor graphs (PFGs) to improve the error-correcting performance of BP decoding. However, it is a significant challenge to design a unified and flexible BPL hardware architecture that supports various PFGs and code configurations. In this paper, we present the first VLSI implementation of a BPL decoder for polar codes that overcomes this implementation challenge with a hardware-friendly algorithm for on-the-fly flexible permutations. First, we introduce a sequential generation (SG) algorithm to obtain a near-optimal PFG set. Additionally, we demonstrate that any permutation can be decomposed into a combination of multiple fixed routings, and design a low-complexity permutation network to generate graphs in an on-the-fly fashion. Our BPL decoder has a low decoding latency by executing decoding and permutation generation in parallel and supports arbitrary list sizes without area overhead. Experimental results based on 28nm FD-SOI technology show that for length-1024 polar codes with a code rate of one-half, our BPL decoder with 32 PFGs exhibits similar error-correcting performance to SCL with a list size of 4 and achieves an average throughput of 25.63 Gbps and an area efficiency of 29.46 Gbps/mm 2 , which is 1.82× and 4.33× faster than the state-of-the-art BP flip and SCL decoders, respectivelyKeywords
All Related Versions
This publication has 62 references indexed in Scilit:
- A Polar Subcode Approach to Belief Propagation List Decoding2022
- Low-Latency Polar Decoder Using Overlapped SCL Processing2021
- Towards 6G wireless communication networks: vision, enabling technologies, and new paradigm shiftsScience China Information Sciences, 2020
- A Configurable Successive-Cancellation List Polar Decoder Using Split-Tree ArchitectureIEEE Journal of Solid-State Circuits, 2020
- CRC-Aided Belief Propagation List Decoding of Polar Codes2020
- Deep Learning-Aided Belief Propagation Decoder for Polar CodesIEEE Journal on Emerging and Selected Topics in Circuits and Systems, 2020
- Belief Propagation Bit-Flip Decoder for Polar CodesIEEE Access, 2019
- XJ-BP: Express Journey Belief Propagation Decoding for Polar Codes2015
- Fast Polar Decoders: Algorithm and ImplementationIEEE Journal on Selected Areas in Communications, 2014
- A Simplified Successive-Cancellation Decoder for Polar CodesIEEE Communications Letters, 2011