A Complexity Reduction Method for Successive Cancellation List Decoding
arXiv:1812.09357
Abstract
This brief introduces a hardware complexity reduction method for successive cancellation list (SCL) decoders. Specifically, we propose to use a sorting scheme so that L paths with smallest path metrics are also sorted according to their path indexes for path pruning. We prove that such sorting scheme reduces the input number of multiplexers in any hardware implementation of SCL decoding from L to (L/2+1) without any changes in the decoding latency. We also propose sorter architectures for the proposed sorting method. Field programmable gate array (FPGA) implementations show that the proposed method achieves significant gain in hardware consumptions of SCL decoder implementations, especially for large list sizes and block lengths.
6 pages, 3 figures, 6 tables
References in corpus (7)
- Fast and Flexible Successive-Cancellation List Decoders for Polar Codes
- Symbol-Decision Successive Cancellation List Decoder for Polar Codes
- A Low-Latency List Successive-Cancellation Decoding Implementation for Polar Codes
- A High Throughput List Decoder Architecture for Polar Codes
- Partitioned Successive-Cancellation List Decoding of Polar Codes
- Low-latency List Decoding Of Polar Codes With Double Thresholding
- On Path Memory in List Successive Cancellation Decoder of Polar Codes