Abstract:

Polar codes can approach the Shannon’s limit in binary symmetric channels. However, the conventional polar decoding algorithms, such as the successive cancellation (SC) and belief propagation (BP) decoding algorithms, have high computation complexity and latency in the decoding ends. Therefore, a binary tree graph is modeled and analyzed on the Polar decoding operations, which proves that the binary tree pruning can delete redundant decoding nodes. Simplified polar decoding algorithms based on pruning process of the tree graph are proposed, which greatly reduce computation complexity, and maintain the original error rate performance at the same time. Simulation results show that the simplified algorithms for the SC and BP decoding complexity can reduce by 36%~65% and 41%~67%, respectively.