On the Marginalization of Polarizing Kernels

In this paper, we analyze the decoding complexity of polarizing kernels of size larger than p = 2, proposing a general procedure which can be used to marginalize kernels of any size. We use this method to evaluate the decoding equations for optimal binary kernels up to size p = 8. Finally, we experimentally show that, even if T2 and T8 share the same polarization exponent, their performance may vary under list decoding, making large kernels of interest for long polar codes.

[1]  Simon Litsyn,et al.  Mixed-Kernels Constructions of Polar Codes , 2016, IEEE Journal on Selected Areas in Communications.

[2]  Ming Chen,et al.  On the Successive Cancellation Decoding of Polar Codes with Arbitrary Linear Binary Kernels , 2017, ArXiv.

[3]  Zhiliang Huang,et al.  On the Successive Cancellation Decoding of Polar Codes with Arbitrary Binary Linear Kernels , 2017 .

[4]  Nickolai Zamarashkin,et al.  Construction and analysis of polar and concatenated polar codes: practical approach , 2012, ArXiv.

[5]  Liang Zhang,et al.  On the SC decoder for any polar code of length N =ln , 2014, 2014 IEEE Wireless Communications and Networking Conference (WCNC).

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

[7]  Toshiyuki Tanaka,et al.  Non-binary polar codes using Reed-Solomon codes and algebraic geometry codes , 2010, 2010 IEEE Information Theory Workshop.

[8]  Alexander Vardy,et al.  Binary Polarization Kernels From Code Decompositions , 2014, IEEE Transactions on Information Theory.

[9]  Shu Lin,et al.  Linear and Nonlinear Binary Kernels of Polar Codes of Small Dimensions With Maximum Exponents , 2015, IEEE Transactions on Information Theory.

[10]  Jean-Claude Belfiore,et al.  Multi-kernel construction of polar codes , 2016, 2017 IEEE International Conference on Communications Workshops (ICC Workshops).

[11]  Rüdiger L. Urbanke,et al.  Polar Codes: Characterization of Exponent, Bounds, and Constructions , 2010, IEEE Transactions on Information Theory.