Generalized Joint Shuffled Scheduling Decoding Algorithm for the JSCC System Based on Protograph-LDPC Codes

Zhiping Xu,Lin Wang,Shaohua Hong,Guanrong Chen

doi:10.1109/access.2021.3112740

Zhiping Xu, Lin Wang + Show 2 more

Open Access

https://doi.org/10.1109/access.2021.3112740

Copy DOI

Journal: IEEE Access	Publication Date: Jan 1, 2021
Citations: 2	License type: CC BY 4.0

Affiliation: Xiamen University, City University of Hong Kong

Abstract

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.

Highlights

S HANNON’S classical separation principle is a milestone of information theory, which states that joint data compression and channel coding cannot bring gains and the source coding and channel coding can be optimized separately to keep the separate source-channel coding (SSCC) optimality [1], [2]
The joint source-channel coding (JSCC) system, where one low-density parity-check (LDPC) code [8] is used for source compression and one LDPC code is used for channel error correction, was proved to perform well in practical applications by utilizing the joint Tanner graph on the decoder side, named the double LDPC (D-LDPC) JSCC system [2]
The DP-LDPC JSCC system can be seen as an evolution of the D-LDPC JSCC system, VOLUME X, 2021

Summary

INTRODUCTION

S HANNON’S classical separation principle is a milestone of information theory, which states that joint data compression and channel coding cannot bring gains and the source coding and channel coding can be optimized separately to keep the separate source-channel coding (SSCC) optimality [1], [2]. The JSCC system, where one low-density parity-check (LDPC) code [8] is used for source compression and one LDPC code is used for channel error correction, was proved to perform well in practical applications by utilizing the joint Tanner graph on the decoder side, named the double LDPC (D-LDPC) JSCC system [2]. The JSSD algorithm without considering type-II linking matrix cannot take full advantage of the complete structure of the DP-LDPC JSCC system, since the influence of type-II linking matrix on the performance of the DP-LDPC JSCC system is not negligible [20], [22] It is beneficial for the DPLDPC JSCC system to have a decoding algorithm to support the shuffled mode with a complete structure including all four components in the system

CONTRIBUTIONS

THE GENERALIZED JOINT SHUFFLED SCHEDULING DECODING ALGORITHM

SIMULATION RESULTS

PERFORMANCE ANALYSIS OF THE GJSSD ALGORITHM

PERFORMANCE COMPARISON BETWEEN GJSSD ALGORITHM AND JBP ALGORITHM

CONCLUSIONS