Open AccessLow complexity list successive cancellation decoding of polar codes
Author(s) -
Cao Congzhe,
Fei Zesong,
Yuan Jinhong,
Kuang Jingming
Publication year - 2014
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.0227
Subject(s) - decoding methods , bhattacharyya distance , sequential decoding , list decoding , algorithm , computer science , code (set theory) , berlekamp–welch algorithm , reliability (semiconductor) , mathematics , concatenated error correction code , artificial intelligence , set (abstract data type) , block code , power (physics) , physics , quantum mechanics , programming language
The authors propose a low complexity list successive cancellation (LCLSC) decoding algorithm, where the advantages of the successive cancellation (SC) decoding and the list successive cancellation (LSC) decoding are both considered. In the proposed decoding, SC decoding instead of LSC decoding is implemented when all information bits from bad subchannels are received reliably. While the reliability of each information bit is estimated by its likelihood ratio (LR), the bit channel quality is measured via its Bhattacharyya parameter. To achieve this goal, the authors introduce two thresholds: LR threshold and Bhattacharyya parameter threshold. Also, the methods to determine them are both elaborated. The numerical results suggest that the complexity of LCLSC decoding is much lower than LSC decoding and can be close to that of SC decoding, while the error performance is almost equal to that of LSC decoding. Especially, when the code rate is in low region, the advantage of our decoding is more obvious.