Reproduce “Complexity-Adjustable SC Decoding of Polar Codes for Energy Consumption Reduction” on OpenResearch
Turn your favorite coding agents into research agents that review literature, develop hypotheses, and run experiments.
Universal app for Apple silicon and Intel. Requires macOS 11 or later.
About this paper
Haotian Zheng, Bin Chen, Luis F. Abanto-Leon, Zizheng Cao, Ton Koonen
An enhanced list-aided successive cancellation stack (ELSCS) decoding algorithm for polar codes is presented by researchers at Eindhoven University of Technology, offering adjustable trade-offs between energy consumption, throughput, and error rate performance. This approach reduces maximum stack memory depth by approximately 70% compared to traditional stack decoders and decreases relative time complexity by over 20% compared to a predecessor, all while maintaining error rate performance.
Key insights
- Introducing an LLR threshold for path pruning effectively reduces stack memory usage without compromising error rate performance, especially at higher SNRs where more aggressive pruning is possible.
- The parameter `L` (number of paths extended simultaneously) in a stack-based search provides a continuum for trading off computational complexity (energy) against time complexity (throughput) while maintaining a consistent error rate.
- Extending two sequential bits per stage in ELSCS, instead of one, significantly improves the efficiency of parallel processing units and reduces overall decoding latency without increasing computational complexity.
Summary by alphaXiv.
Tip: change arxiv.org to autoarxiv.org in any arXiv abstract link to open the paper here.