Open AccessImproved BP decoder for polar codes based on a modified kernel matrix
Author(s) -
Sha Jin,
Liu Jingbo,
Wang Zhongfeng
Publication year - 2016
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
ISSN - 1350-911X
DOI - 10.1049/el.2016.1878
Subject(s) - decoding methods , belief propagation , computer science , algorithm , polar , kernel (algebra) , berlekamp–welch algorithm , sequential decoding , polar code , selection (genetic algorithm) , matrix (chemical analysis) , code (set theory) , soft decision decoder , list decoding , error detection and correction , parallel computing , mathematics , concatenated error correction code , block code , discrete mathematics , set (abstract data type) , artificial intelligence , physics , materials science , astronomy , composite material , programming language
Since the polar code was discovered by Arikan, many decoding methods have been proposed, one of which is the belief propagation (BP) decoding. Its inherent high parallel level makes it suitable for high‐speed applications. A novel BP decoder based on a modified three‐by‐three kernel matrix is proposed. The corresponding decoding algorithm and frozen bits selection method are presented. The numerical results show that it has a similar error correcting capability compared with the original polar BP decoder. More importantly, the message memory requirement can be reduced from O ( N log 2 N ) to O ( N log 3 N ), and the decoding delay can be reduced accordingly.