High-Throughput Rate-Flexible Combinational Decoders for Multi-Kernel Polar Codes

Author name not available (Why is that?)

Publication date: 25 January 2023

Abstract: Polar codes have received growing attention in the past decade and have been selected as the coding scheme for the control channel in the fifth generation (5G) wireless communication systems. However, the conventional polar codes have only been constructed by binary (2x2) kernel which poses block length limitation to powers of 2. To attain more flexible block lengths, multi-kernel polar codes are proposed. In this paper, a combinational architecture for multi-kernel polar codes with high throughput is proposed based on successive cancellation decoding algorithm. The proposed scheme can decode pure-binary, pure-ternary (3x3), and binary-ternary mixed polar codes. The decoder's architecture is rate-flexible meaning that a new code rate can be assigned to the decoder at every clock cycle. The proposed architecture is validated by FPGA implementation and the results reveal that a code of size N=81 gains the coded throughput of 1664.5 Mbps. A novel Python-based polar compiler is also proposed to automatically generate the HDL modules for target decoders. A designer can input the target block length and kernel ordering of a polar code, and get the required VHDL files automatically. Based on our simulations, the majority of the required HDL files can be generated in less than 0.4 seconds.

Has companion code repository: https://github.com/hosseinrezaeii91/polar-compiler

This page was built for publication: High-Throughput Rate-Flexible Combinational Decoders for Multi-Kernel Polar Codes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6424345)