Space-efficient quantized polar decoders designed using the information Bottleneck method

Citation
26th International ITG Workshop on Smart Antennas (WSA 2023) and 13th Conference on Systems, Communications, and Coding (SCC 2023)
Contribution to Conference
26th International ITG Workshop on Smart Antennas, WSA 2023 and 13th Conference on Systems, Communications, and Coding, SCC 2023  
Scopus ID
2-s2.0-85162761899
Publisher
VDE Verlag GMBH
ISBN
978-3-8007-6050-3
Quantized successive cancellation list decoders can be designed by incorporating the information bottleneck method into the density evolution of polar codes. All operations, except the path metric update, in the information bottleneck successive cancellation list decoders are simple table lookups of unsigned integers. The number of lookup tables required for decoding depends on the codeword length such that a larger number of tables are used in decoding longer codewords. These lookup tables add to the space complexity of the quantized decoder and it is, therefore, desirable to reduce the number of lookup tables required for decoding. In this work, an information bottleneck based polar decoder design is proposed that uses the minsum rule to design the lookup tables beside the information bottleneck method. In the proposed decoder, the number of required decoding tables is halved since the min-sum lookup tables need not to be stored due the availability of their hardwareefficient implementation. Additionally, the design SNR of the information bottleneck decoders are optimized to improve their error correction performance.
DDC Class
380: Commerce, Communications, Transport