Successive Syndrome-Check Decoding of Polar Codes

  title={Successive Syndrome-Check Decoding of Polar Codes},
  author={Seyyed Ali Hashemi and Marco Mondelli and John M. Cioffi and Andrea J. Goldsmith},
  journal={2021 55th Asilomar Conference on Signals, Systems, and Computers},
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… 

Figures from this paper


List decoding of polar codes
  • I. Tal, A. Vardy
  • Computer Science
    2011 IEEE International Symposium on Information Theory Proceedings
  • 2011
It appears that the proposed list decoder bridges the gap between successive-cancellation and maximum-likelihood decoding of polar codes, and devise an efficient, numerically stable, implementation taking only O(L · n log n) time and O( L · n) space.
Fast List Decoders for Polar Codes
This paper presents a new algorithm based on unrolling the decoding tree of the code that improves the speed of list decoding by an order of magnitude when implemented in software and shows that for software-defined radio applications, the proposed algorithm is faster than the fastest software implementations of LDPC decoders in the literature.
A Fast Successive Cancellation List Decoder for Polar Codes With an Early Stopping Criterion
An early stopping criterion is proposed that can determine the minimum metric path without having to traverse the tree to the end if a special condition is satisfied at a certain point and reduces the decoding latency effectively for various code rates and list sizes.
Fast and Flexible Successive-Cancellation List Decoders for Polar Codes
This paper improves SSCL and SSCL-SPC by proving that the list size imposes a specific number of path splitting required to decode rate one and single parity check codes, and shows that the number of splitting can be limited while guaranteeing exactly the same error-correction performance as if the paths were forked at each bit estimation.
Generalized Fast Decoding of Polar Codes
This work introduces a generalized approach to fast decoding of polar codes to further reduce SC-based decoding latency, and proposes three multi-node polar code subcodes whose identification patterns include most of the existing subcodes, extending them to SCL decoding, and allow to apply fast decoding to larger subsets of bits.
Improved Successive-Cancellation Decoding of Polar Codes Based on Recursive Syndrome Decomposition
The proposed method reduces the latency by 23% for a (2048, 1024) polar code without sacrificing the error-correcting performance and a modified syndrome check rule is proposed to prune unnecessary sub-trees efficiently.
Low Latency Decoder for Short Blocklength Polar Codes
Some new algorithms to process new types of node patterns that appear within multiple levels of pruned sub-trees and it enables to process certain nodes in parallel are proposed and can achieve up to 13% latency reduction from fast-simplified SC without any performance degradation.
A Fast Polar Code List Decoder Architecture Based on Sphere Decoding
A speed-up technique for successive-cancellation list decoding of polar codes that is exact for list size of 2, while its approximations bring negligible error-correction performance degradation (<;0.05 dB) for other list sizes.
Threshold-Based Successive-Cancellation Decoding of Polar Codes
A threshold-based hard-decision-aided scheme is proposed to speed up the decoding process, especially when the communications channel has low noise, and a backtracking strategy is introduced to eliminate the error-correction performance degradation caused by hard decisions.
Efficient Pruning for Successive-Cancellation Decoding of Polar Codes
This letter presents an efficient pruning method for the successive-cancellation (SC) decoding of polar codes that decreases the decoding latency by 85% on the average for the polar (1024, 512) code.