Rateless Codes Based on Punctured Polar Codes

Polar codes are the first binary linear block codes provably achieving the symmetric capacity of arbitrary binary-input discrete memoryless channels. However, in their original design, their block length is limited to integer powers of two, a constraint that may be relaxed by puncturing. In this work, a novel construction of rateless codes based on punctured polar codes is presented, that is, codes that offer flexible rates via length adaption for a fixed dimension. While the approach presented relies on puncturing, it may be based on arbitrary puncturing methods. The rateless codes obtained work with standard polar code encoders and decoders, and allow for ad-hoc switching of the code rate without additional overhead.

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

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

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

[4]  Anke Schmeink,et al.  Construction of Polar Codes Exploiting Channel Transformation Structure , 2015, IEEE Communications Letters.

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

[6]  Anke Schmeink,et al.  On iterative decoding of polar codes: Schedule-dependent performance and constructions , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[7]  Peter Trifonov,et al.  Generalized concatenated codes based on polar codes , 2011, 2011 8th International Symposium on Wireless Communication Systems.

[8]  Sang-Hyo Kim,et al.  An efficient search on puncturing patterns for short polar codes , 2015, 2015 International Conference on Information and Communication Technology Convergence (ICTC).

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

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

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

[12]  David Declercq,et al.  On puncturing strategies for polar codes , 2017, 2017 IEEE International Conference on Communications Workshops (ICC Workshops).

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

[14]  Gregory W. Wornell,et al.  Rateless Coding and Perfect Rate-Compatible Codes for Gaussian Channels , 2006, 2006 IEEE International Symposium on Information Theory.

[15]  Mayank Bakshi,et al.  Concatenated Polar codes , 2010, 2010 IEEE International Symposium on Information Theory.

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

[17]  Joachim Hagenauer,et al.  Rate-compatible punctured convolutional codes (RCPC codes) and their applications , 1988, IEEE Trans. Commun..

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

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

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

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

[22]  Ivana Maric,et al.  Capacity-Achieving Rate-Compatible Polar Codes for General Channels , 2016, 2017 IEEE Wireless Communications and Networking Conference Workshops (WCNCW).

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

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

[25]  Gianluigi Liva,et al.  Code Design for Short Blocks: A Survey , 2016, ArXiv.

[26]  Jungwon Lee,et al.  On the construction and decoding of concatenated polar codes , 2013, 2013 IEEE International Symposium on Information Theory.