Open AccessSerially concatenated scheme of polar codes and the improved belief propagation decoding algorithm
Author(s) -
Mao Yinyou,
Yang Dong,
Liu Xingcheng,
Xie Yi
Publication year - 2020
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2019.0887
Subject(s) - concatenated error correction code , serial concatenated convolutional codes , computer science , algorithm , list decoding , decoding methods , belief propagation , convolutional code , sequential decoding , turbo code , block code , bcjr algorithm , theoretical computer science
In this study, a serially concatenated scheme of polar codes with convolutional codes is proposed to improve the error correction performance. The novel belief propagation (BP) decoding algorithm addresses two issues that are present in the currently available BP decoding algorithms. The first issue is the poor performance of the BP decoding algorithms, in particular the introduction of an error floor. The second is the component codes can only use systematic codes in the traditional concatenated scheme of polar codes with convolutional codes, which inhibits the effective update of the prior information of the redundant check bits. The proposed BP decoding algorithm is based on right‐directed message processing, which effectively improves the decoding performance. In addition, the proposed concatenated scheme extends the selection of component codes from the systematic polar codes to the non‐systematic polar codes. Hence, the areas of applications and the prior information of information bits for polar codes are expanded and more effectively updated, respectively. The simulation results show that the proposed scheme is much better than the traditional concatenated scheme, and the error floor is no longer introduced in terms of the block error rate, while the storage and computational complexities have not increased obviously.