High Throughput Polar Code Decoders with Information Bottleneck Quantization
<|reference_start|>High Throughput Polar Code Decoders with Information Bottleneck Quantization: In digital baseband processing, the forward error correction (FEC) unit belongs to the most demanding components in terms of computational complexity and power consumption. Hence, efficient implementation of FEC decoders is crucial for next generation mobile broadband standards and an ongoing research topic. Quantization has a significant impact on the decoder area, power consumption and throughput. Thus, lower bit-widths are preferred for efficient implementations but degrade the error-correction capability. To address this issue, a non-uniform quantization based on the Information Bottleneck (IB) method was proposed that enables a low bit width while maintaining the essential information. Many investigations on the use of IB method for Low-density parity-check code (LDPC) decoders exist and have shown its advantages from an implementation perspective. However, for polar code decoder implementations, there exists only one publication that is not based on the state-of-the-art Fast-SSC decoding algorithm, and only synthesis implementation results without energy estimation are shown. In contrast, our paper presents several optimized Fast Simplified Successive-Cancellation (Fast-SSC) polar code decoder implementations using IB-based quantization with placement&routing results in an advanced 12 nm FinFET technology. Gains of up to 16% in area and 13% in energy efficiency are achieved with IB-based quantization at a Frame Error Rate (FER) of 10-7 and a Polar Code of N = 1024, R = 0.5 compared to state-of-the-art decoders.<|reference_end|>
@article{kestel2024high,
    title={High Throughput Polar Code Decoders with Information Bottleneck
  Quantization},
    author={Claus Kestel, Lucas Johannsen and Norbert Wehn},
    journal={arXiv preprint arXiv:2406.01426},
    year={2024},
    archivePrefix={arXiv},
    eprint={2406.01426},
    primaryClass={cs.IT math.IT}
}