Analysis and Optimization of a General Linking Matrix for JSCC Scheme Based on Double LDPC Codes

• Published in: Entropy (Basel, Switzerland) Vol. 25; no. 2; p. 382
• Main Authors: Chen, Qiwang, Xu, Zhiping, Wu, Huihui, Cai, Guofa
• Format: Journal Article
• Language: English
• Published: Switzerland MDPI AG 19.02.2023; MDPI
• Subjects: Algorithms; Analysis; Codes; Coding; Coding theory; Decoding; double low-density parity-check codes; Error correcting codes; Information transfer; joint source-channel coding; linking matrix; Low density parity check codes; Mathematical optimization; Matrices; Nodes; Optimization; Parity; Redundancy; China; joint source-channel coding; linking matrix; double low-density parity-check codes
• ISSN: 1099-4300; 1099-4300
• DOI: 10.3390/e25020382

A key component of the joint source-channel coding (JSCC) scheme based on double low-density parity-check (D-LDPC) codes is the introduction of a linking matrix between the source LDPC code and channel LDPC code, by which the decoding information including the source redundancy and channel state information can be transferred iteratively. However, the linking matrix is a fixed one-to-one mapping, i.e., an identity matrix in a conventional D-LDPC code system, which may not take full advantage of the decoding information. Therefore, this paper introduces a general linking matrix, i.e., a non-identity linking matrix, connecting the check nodes (CNs) of the source LDPC code and the variable nodes (VNs) of the channel LDPC code. Further, the encoding and decoding algorithms of the proposed D-LDPC coding system are generalized. A joint extrinsic information transfer (JEXIT) algorithm is derived for calculating the decoding threshold of the proposed system with a general linking matrix. In addition, several general linking matrices are optimized with the aid of the JEXIT algorithm. Finally, the simulation results demonstrate the superiority of the proposed D-LDPC coding system with general linking matrices.