On the puncturing patterns for punctured polar codes

Puncturing is widely used to generate rate-compatible codes. However, for punctured polar codes, some puncturing patterns may greatly affect the split bit channels and cause considerable performance loss. In this paper, we aim to investigate how the split bit channels are affected by various puncturing patterns, and then evaluate the performances of these patterns. We propose a search algorithm to design good punctured polar codes, and prove that designing the optimal puncturing pattern for output bits is equivalent to finding the optimal puncturing pattern for frozen bits. We also propose a heuristic approach based on the idea of polarization to select the position of each punctured output bit, and simulations show that the puncturing pattern designed this way almost achieves the same performance as the optimal one selected by exhaustive search.

[1]  Peter Trifonov,et al.  Efficient Design and Decoding of Polar Codes , 2012, IEEE Transactions on Communications.

[2]  Sae-Young Chung,et al.  Analysis of sum-product decoding of low-density parity-check codes using a Gaussian approximation , 2001, IEEE Trans. Inf. Theory.

[3]  Michael Gastpar,et al.  On LP decoding of polar codes , 2010, 2010 IEEE Information Theory Workshop.

[4]  Simon Litsyn,et al.  Binary polar code kernels from code decompositions , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

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

[6]  Alexander Vardy,et al.  How to Construct Polar Codes , 2011, IEEE Transactions on Information Theory.

[7]  Gou Hosoya,et al.  国際会議参加報告:2014 IEEE International Symposium on Information Theory , 2014 .

[8]  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.

[9]  Huaiyu Dai,et al.  Rateless-coding-assisted multi-packet spreading over mobile networks , 2013, 2013 IEEE Globecom Workshops (GC Wkshps).

[10]  Frank R. Kschischang,et al.  A Simplified Successive-Cancellation Decoder for Polar Codes , 2011, IEEE Communications Letters.

[11]  Steven W. McLaughlin,et al.  Rate-compatible punctured low-density parity-check codes with short block lengths , 2006, IEEE Transactions on Information Theory.

[12]  Rüdiger L. Urbanke,et al.  Polar codes: Characterization of exponent, bounds, and constructions , 2009, 2009 IEEE International Symposium on Information Theory.

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

[14]  Steven W. McLaughlin,et al.  Rate-compatible puncturing of low-density parity-check codes , 2004, IEEE Transactions on Information Theory.