Hardware Decoders for Polar Codes: An Overview
arXiv:1606.00737 · doi:10.1109/ISCAS.2016.7527192
Abstract
Polar codes are an exciting new class of error correcting codes that achieve the symmetric capacity of memoryless channels. Many decoding algorithms were developed and implemented, addressing various application requirements: from error-correction performance rivaling that of LDPC codes to very high throughput or low-complexity decoders. In this work, we review the state of the art in polar decoders implementing the successive-cancellation, belief propagation, and list decoding algorithms, illustrating their advantages.
arXiv comment4 pages, 3 figures, presented at IEEE ISCAS 2016
References in corpus (9)
- Channel polarization: A method for constructing capacity-achieving codes for symmetric binary-input memoryless channels
- LLR-based Successive Cancellation List Decoding of Polar Codes
- Fast Polar Decoders: Algorithm and Implementation
- Symbol-Decision Successive Cancellation List Decoder for Polar Codes
- On Metric Sorting for Successive Cancellation List Decoding of Polar Codes
- A 237 Gbps Unrolled Hardware Polar Decoder
- Low-latency List Decoding Of Polar Codes With Double Thresholding
- A Reduced Latency List Decoding Algorithm for Polar Codes
- Low Complexity Belief Propagation Polar Code Decoders
Cited by in corpus (6)
- Belief Propagation List Decoding of Polar Codes
- Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders
- Scaling Deep Learning-based Decoding of Polar Codes via Partitioning
- Ternary Quantized Polar Code Decoders: Analysis and Design
- Quantized Polar Code Decoders: Analysis and Design
- Decoder-tailored Polar Code Design Using the Genetic Algorithm