Analysis and Application of Permuted Polar Codes

A special permutation group of polar codes based on $N$/4-cyclic shift is designed and analyzed for practical use. A permutation-transformation equivalence is firstly introduced to transfer the effect of permutation on the codeword side to the uncoded side. Then, we introduce the $N$/4-cyclic shift permutation and analyze the conditions under which it can permute a codeword to another for polar codes that even do not fully respect partial order. We also reveal that the value assignment of frozen bits should follow specific rules related to the permutation pattern. Finally, a novel polar-specific implicit indication method is presented by applying the $N$/4-cyclic shift permutation group to the practical wireless communication scenarios such as Physical Broadcasting Channel (PBCH) of a cellular network, which significantly simplifies the detection algorithm.

[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]  Norbert Stolte,et al.  Rekursive Codes mit der Plotkin-Konstruktion und ihre Decodierung , 2002 .

[3]  Rüdiger L. Urbanke,et al.  Construction of Polar Codes With Sublinear Complexity , 2019, IEEE Transactions on Information Theory.

[4]  Stefania Sesia,et al.  LTE - The UMTS Long Term Evolution, Second Edition , 2011 .

[5]  Alexander Vardy,et al.  Fast Polar Decoders: Algorithm and Implementation , 2013, IEEE Journal on Selected Areas in Communications.

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

[7]  Ayoub Otmani,et al.  Algebraic properties of polar codes from a new polynomial formalism , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

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