The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
본 논문에서는 블록 저밀도 패리티 검사(LDPC) 코드의 계층적 디코딩을 위한 효율적인 스케줄링 알고리즘을 제안한다. 검사 노드 기반 스케줄링 그룹을 효율적으로 구성하기 위해 제안된 알고리즘은 블록별 스케줄링 그룹 구성을 위해 블록 LDPC 코드의 기본 행렬을 활용합니다. 즉, 제안하는 알고리즘은 블록 단위(여러 개의 체크 노드 포함)로 수행되는 계층적 복호의 가중치 조건을 만족하는 체크 노드의 스케줄링 그룹을 생성한다. 따라서 제안하는 알고리즘은 노드 단위로 수행되는 기존의 스케줄링 알고리즘과 달리 낮은 계산 복잡도와 메모리 요구 사항에서 계층적 복호를 위한 스케줄링 그룹을 효율적으로 생성할 수 있다. 또한, 디코딩 수렴 속도를 높이기 위해 각 스케줄링 그룹에 체크 노드를 할당하여 체크 노드부터 현재 그룹까지의 메시지가 비트 노드에 최대한 균등하게 전달되도록 한다. 시뮬레이션 결과는 제안된 알고리즘이 블록 LDPC 코드의 계층적 디코딩을 위해 다른 블록 기반 스케줄링 알고리즘에 비해 디코딩 수렴을 가속화할 수 있음을 확인합니다.
Sangjoon PARK
Kyonggi University
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.
부
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
부
@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},}
부
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 -