Research Article
Performance Analysis of Polar Codes Based on 3x3 Kernel Matrix
@INPROCEEDINGS{10.4108/eai.15-8-2015.2260456, author={Zhenzhen Liu and Kai Niu and Chao Dong and Jiaru Lin}, title={Performance Analysis of Polar Codes Based on 3x3 Kernel Matrix}, proceedings={10th EAI International Conference on Communications and Networking in China}, publisher={IEEE}, proceedings_a={CHINACOM}, year={2015}, month={9}, keywords={polar codes kernel matrix successive cancellation list distance spectrum bit error rate frame error rate}, doi={10.4108/eai.15-8-2015.2260456} }- Zhenzhen Liu
Kai Niu
Chao Dong
Jiaru Lin
Year: 2015
Performance Analysis of Polar Codes Based on 3x3 Kernel Matrix
CHINACOM
IEEE
DOI: 10.4108/eai.15-8-2015.2260456
Abstract
In this paper, polar codes are constructed based on 3x3 kernel matrix G3 rather than the classic 2x2 kernel matrix G2 proposed by Arikan. Since the distance spectrum is a powerful tool to estimate the maximum likelihood performance of block codes, it can be applied to analyze the performance tendency of the above mentioned polar codes.Both the union bound and simulation results show that systematic polar codes (SPCs) have better performance of bit error rate (BER) than the non-systematic polar codes (NSPCs) while they have the same frame error rate (FER) performance. Meanwhile, the performance comparison relied on distance spectrum between polar codes with G2 kernel matrix and those with G3 kernel matrix shows that the former has better performance.
