Asynchronous Polar-Coded Modulation

A new polar-coded modulation (PCM) framework with the bit interleaving is proposed to enhance the polarization diversity among the bit polarized subchannels under the finite block length, consequently, the transmission reliability is further improved. The key idea is asynchronously transmitting the coded bits within one block and spatially coupling multiple coded blocks by the joint modulation, and the polarization diversity among the modulation synthesized subchannels under the parallel partition is enhanced. Combining the binary polar coding, this polarization enhancement at the modulation partition stage is then delivered to the final bit polarized subchannels. The capacity-achieving property under the infinite block length and the polarization superiority with respect to state-of-the-art PCM schemes under the finite block length are proved. Finally, the simulation results indicate the performance gain compared to the conventional PCM and 5G LDPC coded modulation schemes.

[1]  Kai Chen,et al.  Practical polar code construction over parallel channels , 2013, IET Commun..

[2]  Giuseppe Caire,et al.  Bit-Interleaved Coded Modulation , 2008, Found. Trends Commun. Inf. Theory.

[3]  Kai Chen,et al.  Polar Coded Modulation with Optimal Constellation Labeling , 2013, ArXiv.

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

[5]  Kamil Sh. Zigangirov,et al.  Time-varying periodic convolutional codes with low-density parity-check matrix , 1999, IEEE Trans. Inf. Theory.

[6]  Robert F. H. Fischer,et al.  Multilevel codes: Theoretical concepts and practical design rules , 1999, IEEE Trans. Inf. Theory.

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

[8]  Valerio Bioglio,et al.  Design of Polar Codes in 5G New Radio , 2018, IEEE Communications Surveys & Tutorials.

[9]  Shlomo Shamai,et al.  Secrecy-achieving polar-coding , 2010, 2010 IEEE Information Theory Workshop.

[10]  Rüdiger L. Urbanke,et al.  Polar Codes for Channel and Source Coding , 2009, ArXiv.

[11]  Andreas Schenk,et al.  Polar-Coded Modulation , 2013, IEEE Transactions on Communications.

[12]  Ido Tal,et al.  A lower bound on the probability of error of polar codes over BMS channels , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

[13]  Ido Tal,et al.  Polar coding for processes with memory , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[14]  Kai Chen,et al.  An efficient design of bit-interleaved polar coded modulation , 2013, 2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC).

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

[16]  Rüdiger L. Urbanke,et al.  Polar Codes are Optimal for Lossy Source Coding , 2009, IEEE Transactions on Information Theory.

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