Systematic Polar Codes Based on 3x3 Kernel Matrix

In this paper, the construction of polar codes based on multidimensional kernel matrix is analyzed. In order to analyze the performance of the codes efficiently, the performance of systematic polar codes (SPCs) and non-systematic polar codes (NSPCs) constructed by 3×3 kernel matrix is analyzed. Simulation results show that SPCs have advantage over NSPCs in bit error rate (BER) performance while they have the same frame error rate (FER). So we may conclude that SPCs based on 3×3 kernel matrix have better performance than NSPCs.

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

[2]  Kai Chen,et al.  Distance spectrum analysis of polar codes , 2014, 2014 IEEE Wireless Communications and Networking Conference (WCNC).

[3]  Jiaru Lin,et al.  Performance analysis of polar codes based on 3 × 3 kernel matrix , 2015, 2015 10th International Conference on Communications and Networking in China (ChinaCom).

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

[5]  Kai Chen,et al.  Improved Successive Cancellation Decoding of Polar Codes , 2012, IEEE Transactions on Communications.

[6]  G. G. Stokes "J." , 1890, The New Yale Book of Quotations.

[7]  Toshiyuki Tanaka,et al.  Performance of polar codes with the construction using density evolution , 2009, IEEE Communications Letters.

[8]  K. Niu,et al.  List successive cancellation decoding of polar codes , 2012 .

[9]  Rüdiger L. Urbanke,et al.  Modern Coding Theory , 2008 .