A Data Structure-Based Approximate Belief Propagation Decoder for Polar Codes

Polar code, as the first code that can probably achieve the capacity of B-DMCs, has received great attention. Belief propagation (BP) decoding algorithm, a paralleled de-coding approach for polar codes, suffers from high hardware complexity. In this paper, we devoted ourselves to proposing a data structure-based approximate BP decoder for polar code. Multiple simulations have been done. The simulation results show that by reforming the data structure of the received channel message and introducing the approximate computing schemes, significant hardware reduction has been made compared to its conventional counterpart. The hardware architecture and corresponding implementation results are also given in this paper.