Low-latency List Decoding Of Polar Codes With Double Thresholding

Abstract

For polar codes with short-to-medium code length, list successive cancellation decoding is used to achieve a good error-correcting performance. However, list pruning in the current list decoding is based on the sorting strategy and its timing complexity is high. This results in a long decoding latency for large list size. In this work, aiming at a low-latency list decoding implementation, a double thresholding algorithm is proposed for a fast list pruning. As a result, with a negligible performance degradation, the list pruning delay is greatly reduced. Based on the double thresholding, a low-latency list decoding architecture is proposed and implemented using a UMC 90nm CMOS technology. Synthesis results show that, even for a large list size of 16, the proposed low-latency architecture achieves a decoding throughput of 220 Mbps at a frequency of 641 MHz.

5 pages, 7 figures, 1 table, to be presented in the 40th IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP) 2015

References in corpus (1)

• List Decoding of Polar Codes

Cited by in corpus (10)

• Fast List Decoders for Polar Codes
• A Low-Latency List Successive-Cancellation Decoding Implementation for Polar Codes
• Polar Codes and Their Quantum-Domain Counterparts
• Comparison of Polar Decoders with Existing Low-Density Parity-Check and Turbo Decoders
• A High-Throughput Architecture of List Successive Cancellation Polar Codes Decoder with Large List Size
• Hardware Decoders for Polar Codes: An Overview
• Low Complexity Belief Propagation Polar Code Decoders
• High Throughput Polar Decoding Using Two-Staged Adaptive Successive Cancellation List Decoding
• A Complexity Reduction Method for Successive Cancellation List Decoding
• Dynamic-SCFlip Decoding of Polar Codes