Abstract
The soft-output successive cancellation list (SO-SCL) decoder provides a methodology for estimating the a-posteriori probability log-likelihood ratios by only leveraging the conventional SCL decoder of polar codes. However, the sequential decoding nature of SCL introduces high decoding latency to SO-SCL. In this paper, we incorporate node-based fast decoding into the SO-SCL framework. After addressing the challenge of soft output extraction in special node decoding, we proposed the soft-output fast SCL (SO-FSCL) decoding algorithm, along with its log-domain implementation and hardware-friendly version. The proposed SO-FSCL decoder can be regarded as an add-on extension to FSCL decoder, enabling us to autonomously choose whether to output only hard decisions like FSCL or to provide additional soft outputs. Latency and complexity analyses demonstrate that SO-FSCL can significantly reduce, for example, decoding time steps by 81.8% (with unlimited resources), the number of additions by 41.3%, and the number of comparisons by 46.4%. Meanwhile, simulation results indicate that SO-FSCL delivers almost the same soft-output performance as SO-SCL, outperforming other soft-output polar decoders, especially in scenarios involving iterative decoding.
| Original language | English |
|---|---|
| Pages (from-to) | 8500-8516 |
| Number of pages | 17 |
| Journal | IEEE Transactions on Communications |
| Volume | 74 |
| DOIs | |
| Publication status | Published - 2026 |
| Externally published | Yes |
Keywords
- Polar codes
- fast decoding
- iterative decoding
- soft-output
- successive cancellation list
Fingerprint
Dive into the research topics of 'Node-Based Soft-Output Fast Successive Cancellation List Decoding of Polar Codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver