A Modified-SCD for Optimize Performance Rate at Polar Code

Abstract

The first verified capacity-achieving codes were developed by Arikan called “polar codes.” It has gained significant attention due to their low encoding and decoding process complexity and optimum capacity-achievement process. In the original form of polar codes, the decoder has the inferior performance with finite ‘block-lengths' as compared to the LDPC codes, therefore, the successive cancellation decoder (“SCD”) for the polar codes is a very important element in order to provide a capacity theorem, but it comprises complexity at a larger number of iterations that is not applicable for the point of view of lower latency application. Therefore, in this article we proposed a modified SCD that rearranges the stages but it can cause decoder performance degradation, so we applied a novel design rule of the polar codes in order to match with our MSCD model. In the result analysis section, we show the effectiveness of our proposed model that tends to have higher performance rate as compared to standard SCD.