Open AccessSimplified successive‐cancellation decoding using information set reselection for polar codes with arbitrary blocklength
Author(s) -
Zhang Liang,
Zhang Zhaoyang,
Wang Xianbin,
Zhong Caijun,
Ping Li
Publication year - 2015
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.2014.0988
Subject(s) - decoding methods , computer science , algorithm , list decoding , set (abstract data type) , block (permutation group theory) , polar , sequential decoding , reduction (mathematics) , theoretical computer science , block code , mathematics , concatenated error correction code , combinatorics , physics , astronomy , programming language , geometry
The distribution of information bits and frozen bits on the decoder graph can be exploited to simplify the successive‐cancellation (SC) decoding of polar codes. In this study, the authors establish a general simplified SC decoding framework for polar codes with arbitrary block‐length, which is independent of any specific or explicit generator matrices and considerably reduces decoding complexity while retaining the same error performance. Then, based on the fact that the complexity reduction depends on the distribution of information bits, a so‐called m ‐radius reselection scheme is proposed to construct multiple feasible information sets which are different from the original one defined by Arıkan. In this way, flexible tradeoffs between performance and complexity could be achieved.