Fast Decoding of Polar Codes Using Tree Structure

Abstract

In this study, the authors first propose a tree structure for the successive cancelation (SC) decoding of polar codes. The proposed structure is easy to implement in hardware and suitable for parallel processing operations. Next, using the proposed tree structure, they propose a technique for the fast decoding of polar codes. With the proposed method, it is possible to decode all the information bits simultaneously at the same time, i.e. in parallel. Lastly, they introduce an improved version of the proposed high-speed decoding algorithm. The proposed high-speed decoding approach and its improved version are simulated on the computer environment and their bit error rate performances are compared to the performance of the classical SC method.