Optimal Puncturing of Polar Codes With a Fixed Information Set

For a given polar code construction, the existing literature on puncturing for polar codes focuses on finding the optimal puncturing pattern, and then re-selecting the information set. This paper devotes itself to find the optimal puncturing pattern when the information set is fixed. Puncturing the coded bits corresponding to the worst quality bit channels, called worst quality puncturing (WQP), is proposed, which is analyzed to minimize the bit channel quality loss at the punctured positions. The simulation results show that the WQP outperforms the best existing puncturing schemes when the information set is fixed.

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

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

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

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

[5]  Hamid Saber,et al.  An Incremental Redundancy Hybrid ARQ Scheme via Puncturing and Extending of Polar Codes , 2015, IEEE Transactions on Communications.

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

[7]  Ryuhei Mori,et al.  Performance and construction of polar codes on symmetric binary-input memoryless channels , 2009, 2009 IEEE International Symposium on Information Theory.

[8]  Wei Wang,et al.  Efficient construction of polar codes , 2017, 2017 13th International Wireless Communications and Mobile Computing Conference (IWCMC).

[9]  Zhongwei Si,et al.  Does Gaussian Approximation Work Well for the Long-Length Polar Code Construction? , 2015, IEEE Access.

[10]  Yan Chen,et al.  On the puncturing patterns for punctured polar codes , 2014, 2014 IEEE International Symposium on Information Theory.

[11]  Rong Li,et al.  Polarization Weight Family Methods for Polar Code Construction , 2018, 2018 IEEE 87th Vehicular Technology Conference (VTC Spring).

[12]  Athanasios V. Vasilakos,et al.  Rate-Compatible Punctured Polar Codes: Optimal Construction Based on Polar Spectra , 2016, ArXiv.

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

[14]  Toshiyuki Tanaka,et al.  Performance of polar codes with the construction using density evolution , 2009, IEEE Communications Letters.