Hard-Decision SCL Polar Decoder With Weighted Pruning Operation for Storage Applications

In this brief, we present a novel weighted pruning method that effectively reduces the processing latency of the hard-decision (HD) polar decoder for storage applications without compromising the error-correcting capability. Based on the previous Fast-SSCL-SPC decoding algorithm, we thoroughly analy...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on circuits and systems. II, Express briefs Express briefs, 2024-09, Vol.71 (9), p.4181-4185
Main Authors: Park, Dain, Kam, Dongyun, Yun, Sangbu, Choe, Jeongwon, Lee, Youngjoo
Format: Article
Language:English
Subjects:
Algorithms
Decoding
Error analysis
Error correction
hard-decision decoding
Iterative decoding
Low latency communication
Performance degradation
Polar code
Polar codes
pruning nodes
Reliability
Sorting
storage systems
successive-cancellation list decoding
Vectors
Citations: Items that this one cites
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this brief, we present a novel weighted pruning method that effectively reduces the processing latency of the hard-decision (HD) polar decoder for storage applications without compromising the error-correcting capability. Based on the previous Fast-SSCL-SPC decoding algorithm, we thoroughly analyze the cause of the performance degradation when using HD inputs. Introducing a weighted operation on the least reliable internal value, the proposed HD decoding method successfully avoids faulty updates of codeword candidates. Furthermore, we demonstrate the HD decoder architecture that incorporates the proposed pruning scheme, reducing the decoding latency by 22% compared to the state-of-the-art design for 0.9-rate 4096b storage-aware polar codes while maintaining a similar error-correcting capability and hardware complexity.
ISSN:1549-7747
1558-3791
DOI:10.1109/TCSII.2024.3378204