A Simple Relaxation Scheme for Polar Codes

In this paper, a simple relaxation scheme to reduce the encoding and decoding complexity of polar codes is introduced. Unlike the conventional relaxation schemes, the proposed technique relies on selecting relevant encoding/decoding nodes based on initialized relaxation attribute values and their extension to the remainder of the encoder and decoder stages. We show that the proposed relaxation scheme provides comparable BLER performance to the conventional polar codes by numerical simulations, while having significant complexity reduction.

[1]  Ye Wang,et al.  Turbo Product Codes with Irregular Polar Coding for High-Throughput Parallel Decoding in Wireless OFDM Transmission , 2018, 2018 IEEE International Conference on Communications (ICC).

[2]  Toshiaki Koike-Akino,et al.  Irregular Polar Turbo Product Coding for High-Throughput Optical Interface , 2018, 2018 Optical Fiber Communications Conference and Exposition (OFC).

[3]  E. Arkan,et al.  A performance comparison of polar codes and Reed-Muller codes , 2008, IEEE Communications Letters.

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

[5]  Jungwon Lee,et al.  Relaxed Polar Codes , 2017, IEEE Transactions on Information Theory.

[6]  Yi Hong,et al.  A Comparative Study of Polar Code Constructions for the AWGN Channel , 2015, ArXiv.

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

[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]  Ye Wang,et al.  Irregular Polar Coding for Massive MIMO Channels , 2017, GLOBECOM 2017 - 2017 IEEE Global Communications Conference.