On the Construction of Rate-Compatible Punctured Polar ( RCPP ) Codes Using Hierarchical Puncturing

In this paper, we present an efficient method to construct a rate-compatible punctured polar (RCPP) code. In the proposed method, an information set is simply optimized only considering the highest rate and then the information set is updated for other codes in the family, by satisfying the rate-compatibility constraint. This is enabled by presenting a novel hierarchical puncturing and information-copy technique. In fact, the updated information sets are represented by the original information set and an informationdependent frozen vector. Namely, the proposed code uses a non-zero frozen vector differently from conventional RCPP codes. Via simulation results, we demonstrate that the proposed RCPP code attains a significant performance gain (about 2dB) over a benchmark RCPP code, in which both codes use the identical puncturing patterns but the latter employs the conventional all-zero frozen vector. Thus, the proposed approach would be crucial to design a good RCPP code efficiently.

[1]  Laurence B. Milstein,et al.  On the performance of hybrid FEC/ARQ systems using rate compatible punctured turbo (RCPT) codes , 2000, IEEE Trans. Commun..

[2]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[3]  Alexander Vardy,et al.  List decoding of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[4]  Hossein Pishro-Nik,et al.  A practical approach to polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[5]  Kai Chen,et al.  Beyond turbo codes: Rate-compatible punctured polar codes , 2013, 2013 IEEE International Conference on Communications (ICC).

[6]  Kai Chen,et al.  A Hybrid ARQ Scheme Based on Polar Codes , 2013, IEEE Communications Letters.

[7]  Kyeongcheol Yang,et al.  Design of Length-Compatible Polar Codes Based on the Reduction of Polarizing Matrices , 2013, IEEE Transactions on Communications.

[8]  Rongke Liu,et al.  A Novel Puncturing Scheme for Polar Codes , 2014, IEEE Communications Letters.

[9]  Richard D. Wesel,et al.  Protograph-Based Raptor-Like LDPC Codes , 2014, IEEE Transactions on Communications.

[10]  Vera Miloslavskaya,et al.  Shortened Polar Codes , 2015, IEEE Transactions on Information Theory.

[11]  Kai Chen,et al.  Capacity-achieving rateless polar codes , 2015, 2016 IEEE International Symposium on Information Theory (ISIT).

[12]  Ivana Maric,et al.  Capacity-achieving rate-compatible polar codes , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[13]  Dennis Hui,et al.  On the Analysis of Puncturing for Finite-Length Polar Codes: Boolean Function Approach , 2018, ArXiv.