A Novel Puncturing Scheme for Polar Codes

A novel kind of punctured polar codes is proposed in this paper. The codes are constructed by certain constraints on both puncturing patterns and frozen sets such that the values of the punctured bits are known to the decoder. As a result, the initialized log-likelihood ratios of the punctured bits can be set to infinity (or minus infinity), which guarantees a better decoding performance. Furthermore, explicit puncturing patterns are designed for arbitrary code lengths. The simulation results show that the proposed codes outperform the conventional punctured polar codes.