Design of Low-Density Parity-Check Code Pair for Joint Source-Channel Coding Systems Based on Graph Theory-Reference-Cited by-同舟云学术

Design of Low-Density Parity-Check Code Pair for Joint Source-Channel Coding Systems Based on Graph Theory

Published:2023-08-10 Issue:8 Volume:25 Page:1189
ISSN:1099-4300
Container-title:Entropy
language:en
Short-container-title:Entropy

Author:

Lv Yijie¹^ORCID,He Jiguang²³,Xu Weikai¹,Wang Lin¹^ORCID

Affiliation:

1. Department of Information and Communication Engineering, Xiamen University, Xiamen 361005, China

2. Technology Innovation Institute, Abu Dhabi P.O. Box 9639, United Arab Emirates

3. Centre for Wireless Communications, University of Oulu, 90014 Oulu, Finland

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.

Funder

National Natural Science Foundation of China

Key Laboratory of Southeast Coast Marine Information Intelligent Perception and Application, Ministry of Natural Resources

Publisher

MDPI AG

Subject

General Physics and Astronomy

Link

https://www.mdpi.com/1099-4300/25/8/1189/pdf

Reference25 articles.

1. A mathematical theory of communication;Shannon;Bell Syst. Tech. J.,1948

2. Joint source-channel turbo decoding of entropy-coded sources;Guyader;IEEE J. Sel. Areas Commun.,2001

3. Performance analysis and design criteria for finite-alphabet source-channel codes;Hedayat;IEEE Trans. Commun.,2004

4. Lakovic, K., and Villasenor, J. (2002, January 6–9). Combining variable length codes and turbo codes. Proceedings of the IEEE 55th Vehicular Technology Conference, Birmingham, AL, USA.

5. Lakovic, K., and Villasenor, J. (July, January 30). On reversible variable length codes with turbo codes, and iterative source-channel decoding. Proceedings of the IEEE International Symposium on Information Theory, Lausanne, Switzerland.