Construction of binary polarization kernels for low complexity window processing

An algorithm for construction of binary polarization kernels of size 16 and 32 with polarization rate greater than 0.5, which admit low complexity processing is proposed. Kernels are obtained by employing such linear transformations of the Arikan matrix, which minimize the complexity of the window processing algorithm, while preserving required rate of polarization. Simulation results show that polar subcodes with obtained kernels can outperform polar codes with Arikan kernel, while having lower decoding complexity.

[1]  Helmut Griesser,et al.  A Posteriory Probability Decoding of Nonsystematically Encoded Block Codes , 2002, Probl. Inf. Transm..

[2]  Vera Miloslavskaya,et al.  Sequential decoding of polar codes with arbitrary binary kernel , 2014, 2014 IEEE Information Theory Workshop (ITW 2014).

[3]  Arman Fazeli,et al.  Binary Linear Codes with Optimal Scaling: Polar Codes with Large Kernels , 2017, 2018 IEEE Information Theory Workshop (ITW).

[4]  Peter Trifonov.  Design of Randomized Polar Subcodes with Non-Arikan Kernels , 2018 .

[5]  Rüdiger L. Urbanke,et al.  Polar codes: Characterization of exponent, bounds, and constructions , 2009, 2009 IEEE International Symposium on Information Theory.

[6]  Arman Fazeli,et al.  On the scaling exponent of binary polarization kernels , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[7]  Peter Trifonov,et al.  On Construction of Polar Subcodes with Large Kernels , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[8]  Vera Miloslavskaya,et al.  Sequential Decoding of Polar Codes , 2014, IEEE Communications Letters.

[9]  Rüdiger L. Urbanke,et al.  Finite-Length Scaling for Polar Codes , 2013, IEEE Transactions on Information Theory.

[10]  Paul H. Siegel,et al.  On Efficient Decoding of Polar Codes with Large Kernels , 2017, 2017 IEEE Wireless Communications and Networking Conference Workshops (WCNCW).

[11]  Peter Trifonov,et al.  Efficient decoding of polar codes with some 16×16 kernels , 2018, 2018 IEEE Information Theory Workshop (ITW).

[12]  Peter Trifonov,et al.  Binary successive cancellation decoding of polar codes with Reed-Solomon kernel , 2014, 2014 IEEE International Symposium on Information Theory.

[13]  Grigorii Trofimiuk,et al.  Reduced complexity window processing of binary polarization kernels , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

[14]  Arman Fazeli,et al.  Explicit Polar Codes with Small Scaling Exponent , 2019, 2019 IEEE International Symposium on Information Theory (ISIT).

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

[16]  Peter Trifonov,et al.  A randomized construction of polar subcodes , 2017, 2017 IEEE International Symposium on Information Theory (ISIT).

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

[18]  Peter Trifonov,et al.  A Score Function for Sequential Decoding of Polar Codes , 2018, 2018 IEEE International Symposium on Information Theory (ISIT).