Abstract
Fast Simplified Successive-Cancellation List (Fast-SSCL) decoding has significantly reduced the decoding latency of polar codes by implementing fast parallel operations in local decoders. This letter presents a Minimum-Combinations (MC) set $\mathcal {C} $ to speed up the splitting process of Rate-1 decoder for fast list decoding of polar codes. The proposed set, eliminating the flipping bit indices combinations with less reliability, is collected in advance and only relative to the size of the list. The experiments demonstrate that compared with existing Fast-SSCL decoding, our proposed method achieves significant latency reduction while preserving the bit and frame error rate.
| Original language | English |
|---|---|
| Pages (from-to) | 3185-3189 |
| Number of pages | 5 |
| Journal | IEEE Communications Letters |
| Volume | 25 |
| Issue number | 10 |
| DOIs | |
| State | Published - 1 Oct 2021 |
| Externally published | Yes |
Keywords
- Polar codes
- fast decoding
- list decoding
- successive-cancellation decoding
Fingerprint
Dive into the research topics of 'Minimum-Combinations Set-Based Rate-1 Decoder for Fast List Decoding of Polar Codes'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver