Design of low-density parity-check code pair for joint source-channel coding systems based on graph theory
Lv, Yijie; He, Jiguang; Xu, Weikai; Wang, Lin (2023-08-10)
Lv Y, He J, Xu W, Wang L. Design of Low-Density Parity-Check Code Pair for Joint Source-Channel Coding Systems Based on Graph Theory. Entropy. 2023; 25(8):1189. https://doi.org/10.3390/e25081189
© 2023 by the authors. Licensee MDPI, Basel, Switzerland. This article is an open access article distributed under the terms and conditions of the Creative Commons Attribution (CC BY) license (https://creativecommons.org/licenses/by/4.0/).
https://creativecommons.org/licenses/by/4.0/
https://urn.fi/URN:NBN:fi-fe20231017140470
Tiivistelmä
Abstract
In this article, a graph-theoretic method (taking advantage of constraints among sets associated with the corresponding parity-check matrices) is applied for the construction of a double low-density parity-check (D-LDPC) code (also known as LDPC code pair) in a joint source-channel coding (JSCC) system. Specifically, we pre-set the girth of the parity-check matrix for the LDPC code pair when jointly designing the two LDPC codes, which are constructed by following the set constraints. The constructed parity-check matrices for channel codes comprise an identity submatrix and an additional submatrix, whose column weights can be pre-set to be any positive integer numbers. Simulation results illustrate that the constructed D-LDPC codes exhibit significant performance improvement and enhanced flexible frame length (i.e., adaptability under various channel conditions) compared with the benchmark code pair.
Kokoelmat
- Avoin saatavuus [32049]