Open AccessComplexity‐adjustable SC decoding of polar codes for energy consumption reduction
Author(s) -
Zheng Haotian,
Chen Bin,
AbantoLeon Luis F.,
Cao Zizheng,
Koonen Ton
Publication year - 2019
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.2018.5643
Subject(s) - decoding methods , computer science , computational complexity theory , reduction (mathematics) , list decoding , energy consumption , sequential decoding , algorithm , logarithm , computer engineering , concatenated error correction code , mathematics , block code , mathematical analysis , geometry , ecology , biology
This study proposes an enhanced list‐aided successive cancellation stack (ELSCS) decoding algorithm with adjustable decoding complexity. Also, a logarithmic likelihood ratio‐threshold based path extension scheme is designed to further reduce the memory consumption of stack decoding. Numerical simulation results show that without affecting the error correction performance, the proposed ELSCS decoding algorithm provides a flexible trade‐off between time complexity and computational complexity, while reducing storage space up to 70%. Based on the fact that most mobile devices operate in environments with stringent energy budget to support diverse applications, the proposed scheme is a promising candidate for meeting requirements of different applications while maintaining a low computational complexity and computing resource utilisation.