New repetition polar code over double blocks for the BEC channel

Although polar codes, introduced recently by Arυkan, can achieve the capacity of symmetric channels, their finite-length performance is not optimal. The repetition technique proposed by Seidl in [4] is an efficient method to improve the performance of polar code. Nevertheless the problem is that the decoding complexity becomes very high as the repetition length or the number of inner codes increases. We propose a new repetition technique over double subblocks, called double repetition polar code (dRPC) in this paper. The code construction rules are described, and a suboptimal decoding algorithm, the parallel successive cancellation (SC) algorithm is proposed. Simulation results illustrate that the BLER of dRPC with Belief Propagation (BP) decoding outperforms that of Seidl's scheme and even approaches to that of polar code with MAP decoding.