Rateless Coding Schemes Using Polar Codes: Truly “No” Rates?

In this paper, aiming to achieve rate adaptation for the rateless coding (RC) schemes of polar codes, we explore their throughput efficiency and optimize a series of rates that are set in two types of RC schemes. First, the RC scheme with incremental freezing (IF-RC) decoding is analyzed from the perspective of rate matching. Then, a new RC scheme based on extending codes and copying information bits (termed EC-RC) is developed in detail. Moreover, to overcome the drawback of an undefined rate sequence in RC transmission, rate optimization strategies are separately proposed for both IF-RC and EC-RC by maximizing throughput efficiency with dynamic programming. Closed-form expressions of throughput for these two RC methods are derived as a consequence. The optimization procedure can be realized in practice with low complexity. Finally, the numerical results and analyses demonstrate that rate adaptation of polar-coded RC can be achieved along with maximum throughput by our proposed strategies over both AWGN channels and Rayleigh fading channels. The two optimized RC schemes provide higher throughput efficiency than other existing rateless codes.

[1]  Rongke Liu,et al.  Near-optimal rate adaptation based on spinal codes for incremental redundancy truncated HARQ , 2014, 9th International Conference on Communications and Networking in China.

[2]  Michael Luby,et al.  LT codes , 2002, The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings..

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

[4]  Rong Li,et al.  An Adaptive IR-HARQ Scheme for Polar Codes by Polarizing Matrix Extension , 2018, IEEE Communications Letters.

[5]  Song-Nam Hong,et al.  An Efficient Construction of Rate-Compatible Punctured Polar (RCPP) Codes Using Hierarchical Puncturing , 2017, IEEE Transactions on Communications.

[6]  Aijun Liu,et al.  Analysis and Adaptive Design of Polar Coded HARQ Transmission Under SC-List Decoding , 2017, IEEE Wireless Communications Letters.

[7]  Kai Chen,et al.  CRC-Aided Decoding of Polar Codes , 2012, IEEE Communications Letters.

[8]  Giuseppe Caire,et al.  The throughput of hybrid-ARQ protocols for the Gaussian collision channel , 2001, IEEE Trans. Inf. Theory.

[9]  Jun Wang,et al.  Beta-Expansion: A Theoretical Framework for Fast and Recursive Construction of Polar Codes , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.

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

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

[12]  Jungwon Lee,et al.  Circular Buffer Rate-Matched Polar Codes , 2017, IEEE Transactions on Communications.

[13]  Jian Gu,et al.  Modeling conditional FER for hybrid ARQ , 2006, IEEE Commun. Lett..

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

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

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

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

[18]  Liang Ma,et al.  An Incremental Redundancy HARQ Scheme for Polar Code , 2017, ArXiv.

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

[20]  Emina Soljanin,et al.  Punctured vs Rateless Codes for Hybrid ARQ , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Punta del Este.