IEICE TRANSACTIONS on Communications
Block-Based Scheduling Algorithm for Layered Decoding of Block LDPC Codes
Summary :
This paper proposes an efficient scheduling algorithm for the layered decoding of block low-density parity-check (LDPC) codes. To efficiently configure check node-based scheduling groups, the proposed algorithm utilizes the base matrix of the block LDPC code for a block-by-block scheduling group configuration; i.e., the proposed algorithm generates a scheduling group of check nodes, satisfying the weight condition of the layered decoding, which is performed in block units (including several check nodes). Therefore, unlike the conventional scheduling algorithms performed in node units, the proposed algorithm can efficiently generate scheduling groups for layered decoding at low computational complexity and memory requirements. In addition, to accelerate the decoding convergence speed, check nodes are allocated in each scheduling group such that messages from check nodes up to the current group are delivered as evenly as possible to bit nodes. Simulation results confirm that the proposed algorithm can accelerate decoding convergence compared to other block-based scheduling algorithms for layered decoding of block LDPC codes.
- Publication
- IEICE TRANSACTIONS on Communications Vol.E105-B No.11 pp.1408-1413
- Publication Date
- 2022/11/01
- Publicized
- 2022/04/28
- Online ISSN
- 1745-1345
- DOI
- 10.1587/transcom.2022EBP3032
- Type of Manuscript
- PAPER
- Category
- Fundamental Theories for Communications
Authors
Sangjoon PARK
Kyonggi University
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Sangjoon PARK, "Block-Based Scheduling Algorithm for Layered Decoding of Block LDPC Codes" in IEICE TRANSACTIONS on Communications,
vol. E105-B, no. 11, pp. 1408-1413, November 2022, doi: 10.1587/transcom.2022EBP3032.
Abstract: This paper proposes an efficient scheduling algorithm for the layered decoding of block low-density parity-check (LDPC) codes. To efficiently configure check node-based scheduling groups, the proposed algorithm utilizes the base matrix of the block LDPC code for a block-by-block scheduling group configuration; i.e., the proposed algorithm generates a scheduling group of check nodes, satisfying the weight condition of the layered decoding, which is performed in block units (including several check nodes). Therefore, unlike the conventional scheduling algorithms performed in node units, the proposed algorithm can efficiently generate scheduling groups for layered decoding at low computational complexity and memory requirements. In addition, to accelerate the decoding convergence speed, check nodes are allocated in each scheduling group such that messages from check nodes up to the current group are delivered as evenly as possible to bit nodes. Simulation results confirm that the proposed algorithm can accelerate decoding convergence compared to other block-based scheduling algorithms for layered decoding of block LDPC codes.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.2022EBP3032/_p
Copy
@ARTICLE{e105-b_11_1408,
author={Sangjoon PARK, },
journal={IEICE TRANSACTIONS on Communications},
title={Block-Based Scheduling Algorithm for Layered Decoding of Block LDPC Codes},
year={2022},
volume={E105-B},
number={11},
pages={1408-1413},
abstract={This paper proposes an efficient scheduling algorithm for the layered decoding of block low-density parity-check (LDPC) codes. To efficiently configure check node-based scheduling groups, the proposed algorithm utilizes the base matrix of the block LDPC code for a block-by-block scheduling group configuration; i.e., the proposed algorithm generates a scheduling group of check nodes, satisfying the weight condition of the layered decoding, which is performed in block units (including several check nodes). Therefore, unlike the conventional scheduling algorithms performed in node units, the proposed algorithm can efficiently generate scheduling groups for layered decoding at low computational complexity and memory requirements. In addition, to accelerate the decoding convergence speed, check nodes are allocated in each scheduling group such that messages from check nodes up to the current group are delivered as evenly as possible to bit nodes. Simulation results confirm that the proposed algorithm can accelerate decoding convergence compared to other block-based scheduling algorithms for layered decoding of block LDPC codes.},
keywords={},
doi={10.1587/transcom.2022EBP3032},
ISSN={1745-1345},
month={November},}
Copy
TY - JOUR
TI - Block-Based Scheduling Algorithm for Layered Decoding of Block LDPC Codes
T2 - IEICE TRANSACTIONS on Communications
SP - 1408
EP - 1413
AU - Sangjoon PARK
PY - 2022
DO - 10.1587/transcom.2022EBP3032
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E105-B
IS - 11
JA - IEICE TRANSACTIONS on Communications
Y1 - November 2022
AB - This paper proposes an efficient scheduling algorithm for the layered decoding of block low-density parity-check (LDPC) codes. To efficiently configure check node-based scheduling groups, the proposed algorithm utilizes the base matrix of the block LDPC code for a block-by-block scheduling group configuration; i.e., the proposed algorithm generates a scheduling group of check nodes, satisfying the weight condition of the layered decoding, which is performed in block units (including several check nodes). Therefore, unlike the conventional scheduling algorithms performed in node units, the proposed algorithm can efficiently generate scheduling groups for layered decoding at low computational complexity and memory requirements. In addition, to accelerate the decoding convergence speed, check nodes are allocated in each scheduling group such that messages from check nodes up to the current group are delivered as evenly as possible to bit nodes. Simulation results confirm that the proposed algorithm can accelerate decoding convergence compared to other block-based scheduling algorithms for layered decoding of block LDPC codes.
ER -
English
