preprint · arXiv (Cornell University) · 2019
Complexity-Adjustable SC Decoding of Polar Codes for Energy Consumption Reduction
Haotian Zheng, Bin Chen, Luis F. Abanto‐Leon, Zizheng Cao, A.M.J. Koonen
Cited by 0Open access
Abstract
This paper proposes an enhanced list-aided successive cancellation stack (ELSCS) decoding algorithm with adjustable decoding complexity. In addition, a logarithmic likelihood ratio (LLR)-threshold based path extension scheme is designed to further reduce the memory consumption of stack decoding. Numerical simulation results show that without affecting the error correction performance, the proposed ELSCS decoding algorithm provides a flexible tradeoff between time complexity and computational complexity, while reducing storage space up to $70\%$. Based on the fact that most mobile devices operate in environments with stringent energy budget to support diverse applications, the proposed scheme is a promising candidate for meeting requirements of different applications while maintaining a low computational complexity and computing resource utilization.
Cite this paper
Zheng, H., Chen, B., Abanto‐Leon, L. F., Cao, Z., & Koonen, A. (2019). Complexity-Adjustable SC Decoding of Polar Codes for Energy Consumption Reduction. arXiv (Cornell University). https://doi.org/10.48550/arxiv.1912.07649
Zheng, Haotian, et al. “Complexity-Adjustable SC Decoding of Polar Codes for Energy Consumption Reduction.” arXiv (Cornell University), 2019, https://doi.org/10.48550/arxiv.1912.07649.
Zheng, Haotian, Bin Chen, Luis F. Abanto‐Leon, Zizheng Cao, and A.M.J. Koonen. 2019. “Complexity-Adjustable SC Decoding of Polar Codes for Energy Consumption Reduction.” arXiv (Cornell University). https://doi.org/10.48550/arxiv.1912.07649.
Zheng, H. et al. (2019) ‘Complexity-Adjustable SC Decoding of Polar Codes for Energy Consumption Reduction’, arXiv (Cornell University). Available at: https://doi.org/10.48550/arxiv.1912.07649.
@misc{zheng2019complexity,
title = {{Complexity-Adjustable SC Decoding of Polar Codes for Energy Consumption Reduction}},
author = {Zheng, Haotian and Chen, Bin and Abanto‐Leon, Luis F. and Cao, Zizheng and Koonen, A.M.J.},
journal = {arXiv (Cornell University)},
year = {2019},
doi = {10.48550/arxiv.1912.07649}
}Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.
Related papers
Low-Complexity Successive Cancellation List Decoding of Polar Codes Based on Path Metric
Xiaodong Liu, Ce Sun, Wei Tang · IEEE International Conference on Communication Technology (ICCT) · 2021
Cited by 3
Soft decision decoding using the hierarchy of linear block codes
Tadahiro Sato, Hatsukazu Tanaka · Electronics and Communications in Japan (Part III Fundamental Electronic Science) · 2000
Cited by 0
Iterative Soft-Decision Decoding of Hermitian Codes
Li Chen · IEEE Transactions on Communications · 2012
Cited by 4
Efficient Sphere Polar Decoding via Synchronous Determination
Huayi Zhou, Warren J. Gross, Zaichen Zhang et al. · IEEE Transactions on Vehicular Technology · 2020
Cited by 11
Adaptive soft—decision decoding for array codes
Xiaohong Peng, Paddy G. Farrell · European Transactions on Telecommunications · 2001
Cited by 1
Fast A soft decision decoding for binary block codes
Sun Shao · Jounal of Xidian University · 2000
Cited by 0