Research Article
Group-Based Layered Scheduling of ADMM Decoding for LDPC Codes
192 downloads
@INPROCEEDINGS{10.1007/978-3-319-78139-6_22, author={Xing-Long Zhang and Meng Niu and Luo-Hui Su and Ke-Pu Song}, title={Group-Based Layered Scheduling of ADMM Decoding for LDPC Codes}, proceedings={Communications and Networking. 12th International Conference, ChinaCom 2017, Xi’an, China, October 10-12, 2017, Proceedings, Part II}, proceedings_a={CHINACOM}, year={2018}, month={4}, keywords={ADMM decoding LDPC codes Message scheduling Convergence rate}, doi={10.1007/978-3-319-78139-6_22} }- Xing-Long Zhang
Meng Niu
Luo-Hui Su
Ke-Pu Song
Year: 2018
Group-Based Layered Scheduling of ADMM Decoding for LDPC Codes
CHINACOM
Springer
DOI: 10.1007/978-3-319-78139-6_22
Abstract
For low-density parity-check (LDPC) codes decoding by alternating direction method of multipliers (ADMM), the layered scheduling sequentially updates the messages of check nodes one by one. Though the layered scheduling can speed up the convergence rates, it may limit the throughput when implementing the ADMM decoder with multi-core systems due to its serial style. To circumvent this problem, a group-based layered scheduling is proposed by updating a group of check node messages at one time. Extensive simulation results for the proposed scheme over two typical LDPC codes with the ADMM penalized decoding algorithm are provided.
Copyright © 2017–2024 EAI
