当前位置: X-MOL 学术IEEE Access › 论文详情
Our official English website, www.x-mol.net, welcomes your feedback! (Note: you will need to create a separate account there.)
Generalized Joint Shuffled Scheduling Decoding Algorithm for the JSCC System Based on Protograph-LDPC Codes
IEEE Access ( IF 3.4 ) Pub Date : 2021-09-14 , DOI: 10.1109/access.2021.3112740
Zhiping Xu , Lin Wang , Shaohua Hong , Guanrong Chen

The joint shuffled scheduling decoding (JSSD) algorithm can reduce the decoding complexity of the joint source-channel coding system (JSCC) based on double protograph low-density parity-check (P-LDPC) codes. However, the JSSD algorithm will not work when the linking matrix between check nodes (CNs) of the source P-LDPC and variable nodes (VNs) of the channel P-LDPC is adopted in such a system, and this linking matrix has a significant influence on the system performance. In this paper, a generalized joint shuffled scheduling decoding (GJSSD) algorithm is designed to work for the system, and the JSSD algorithm can be regarded as a special case of this algorithm. Simulations show that the proposed GJSSD algorithm can reduce the decoding complexity with performance improvement when compared with the joint belief-propagation (JBP) algorithm.

中文翻译:


基于Protograph-LDPC码的JSCC系统广义联合混洗调度解码算法



联合混洗调度解码(JSSD)算法可以降低基于双原图低密度奇偶校验(P-LDPC)码的联合源信道编码系统(JSCC)的解码复杂度。然而,当在这样的系统中采用源P-LDPC的校验节点(CN)和通道P-LDPC的变量节点(VN)之间的链接矩阵时,JSSD算法将不起作用,并且该链接矩阵具有显着性。对系统性能的影响。本文设计了一种适用于该系统的广义联合混洗调度解码(GJSSD)算法,JSSD算法可以看作该算法的一个特例。仿真结果表明,与联合置信传播(JBP)算法相比,所提出的GJSSD算法可以降低解码复杂度并提高性能。
更新日期:2021-09-14
down
wechat
bug