Design and Optimization of Linking Matrix for a JSCC System Based on DP-LDPC Codes.

Saved in:
Bibliographic Details
Title: Design and Optimization of Linking Matrix for a JSCC System Based on DP-LDPC Codes.
Authors: Lv, Yijie, Hong, Shaohua, Wang, Lin
Source: Entropy; Aug2023, Vol. 25 Issue 8, p1145, 11p
Subject Terms: DECODING algorithms, CHANNEL coding, LINEAR network coding, KNOWLEDGE transfer, SOURCE code, MATRICES (Mathematics)
Abstract: Although extensive optimization of encoding and decoding schemes for joint source-channel coding (JSCC) systems has been conducted, efficient optimization schemes are still required for designing and optimizing the linking matrix between variable nodes of the source code and check nodes of the channel code. A scheme has been proposed for design and optimization of linking matrix with multi-edges by analyzing the performance of the JSCC system using the joint protograph extrinsic information transfer algorithm to calculate decoding thresholds. The proposed scheme incorporates structural constraints and is effective in designing and optimizing the multi-edges in linking matrix for the JSCC system. Experimental results have demonstrated that the designed and optimized linking matrix significantly improves the performance of the JSCC system. Furthermore, the proposed scheme reduces the complexity of the solution space for the optimized example. [ABSTRACT FROM AUTHOR]
Copyright of Entropy is the property of MDPI and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Complementary Index
Be the first to leave a comment!
You must be logged in first