TY - GEN
T1 - Successive Syndrome-Check Decoding of Polar Codes
AU - Hashemi, Seyyed Ali
AU - Mondelli, Marco
AU - Cioffi, John
AU - Goldsmith, Andrea
N1 - Funding Information:
This work is supported in part by ONR grant N00014-18-1-2191. S. A. Hashemi was supported by a Postdoctoral Fellowship from the Natural Sciences and Engineering Research Council of Canada (NSERC) and by Huawei. M. Mondelli was partially supported by the 2019 Lopez-Loreta Prize.
Publisher Copyright:
© 2021 IEEE.
PY - 2021
Y1 - 2021
N2 - A two-part successive syndrome-check decoding of polar codes is proposed with the first part successively refining the received codeword and the second part checking its syndrome. A new formulation of the successive-cancellation (SC) decoding algorithm is presented that allows for successively refining the received codeword by comparing the log-likelihood ratio value of a frozen bit with its predefined value. The syndrome of the refined received codeword is then checked for possible errors. In case there are no errors, the decoding process is terminated. Otherwise, the decoder continues to refine the received code-word. The proposed method is extended to the case of SC list (SCL) decoding by terminating the decoding process when the syndrome of the best candidate in the list indicates no errors. Simulation results show that the proposed method reduces the time-complexity of SC and SCL decoders and their fast variants, especially at high signal-to-noise ratios.
AB - A two-part successive syndrome-check decoding of polar codes is proposed with the first part successively refining the received codeword and the second part checking its syndrome. A new formulation of the successive-cancellation (SC) decoding algorithm is presented that allows for successively refining the received codeword by comparing the log-likelihood ratio value of a frozen bit with its predefined value. The syndrome of the refined received codeword is then checked for possible errors. In case there are no errors, the decoding process is terminated. Otherwise, the decoder continues to refine the received code-word. The proposed method is extended to the case of SC list (SCL) decoding by terminating the decoding process when the syndrome of the best candidate in the list indicates no errors. Simulation results show that the proposed method reduces the time-complexity of SC and SCL decoders and their fast variants, especially at high signal-to-noise ratios.
UR - http://www.scopus.com/inward/record.url?scp=85127075334&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85127075334&partnerID=8YFLogxK
U2 - 10.1109/IEEECONF53345.2021.9723394
DO - 10.1109/IEEECONF53345.2021.9723394
M3 - Conference contribution
AN - SCOPUS:85127075334
T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers
SP - 943
EP - 947
BT - 55th Asilomar Conference on Signals, Systems and Computers, ACSSC 2021
A2 - Matthews, Michael B.
PB - IEEE Computer Society
T2 - 55th Asilomar Conference on Signals, Systems and Computers, ACSSC 2021
Y2 - 31 October 2021 through 3 November 2021
ER -