TY - GEN
T1 - Fast-SSC-flip decoding of polar codes
AU - Giard, Pascal
AU - Burg, Andreas
N1 - Publisher Copyright:
© 2018 IEEE.
PY - 2018/5/29
Y1 - 2018/5/29
N2 - Polar codes are widely considered as one of the most exciting recent discoveries in channel coding. For short to moderate block lengths, their error-correction performance under list decoding can outperform that of other modern error-correcting codes. However, high-speed list-based decoders with moderate complexity are challenging to implement. Successive-cancellation (SC)-flip decoding was shown to be capable of a competitive error-correction performance compared to that of list decoding with a small list size, at a fraction of the complexity, but suffers from a variable execution time and a higher worst-case latency. In this work, we show how to modify the state-of-the-art high-speed SC decoding algorithm to incorporate the SC-flip ideas. The algorithmic improvements are presented as well as average execution-time results tailored to a hardware implementation. The results show that the proposed fast-SSC-flip algorithm has a decoding speed close to an order of magnitude better than the previous works while retaining a comparable error-correction performance.
AB - Polar codes are widely considered as one of the most exciting recent discoveries in channel coding. For short to moderate block lengths, their error-correction performance under list decoding can outperform that of other modern error-correcting codes. However, high-speed list-based decoders with moderate complexity are challenging to implement. Successive-cancellation (SC)-flip decoding was shown to be capable of a competitive error-correction performance compared to that of list decoding with a small list size, at a fraction of the complexity, but suffers from a variable execution time and a higher worst-case latency. In this work, we show how to modify the state-of-the-art high-speed SC decoding algorithm to incorporate the SC-flip ideas. The algorithmic improvements are presented as well as average execution-time results tailored to a hardware implementation. The results show that the proposed fast-SSC-flip algorithm has a decoding speed close to an order of magnitude better than the previous works while retaining a comparable error-correction performance.
UR - https://www.scopus.com/pages/publications/85048879012
U2 - 10.1109/WCNCW.2018.8369026
DO - 10.1109/WCNCW.2018.8369026
M3 - Contribution to conference proceedings
AN - SCOPUS:85048879012
T3 - 2018 IEEE Wireless Communications and Networking Conference Workshops, WCNCW 2018
SP - 73
EP - 77
BT - 2018 IEEE Wireless Communications and Networking Conference Workshops, WCNCW 2018
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2018 IEEE Wireless Communications and Networking Conference Workshops, WCNCW 2018
Y2 - 15 April 2018 through 18 April 2018
ER -