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

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

Zhiping XU, Lin WANG^*, Shaohua HONG, Guanrong CHEN

^*Corresponding author for this work

Department of Electrical Engineering

Research output: Journal Publications and Reviews › RGC 21 - Publication in refereed journal › peer-review

3 Citations (Scopus)

75 Downloads (CityUHK Scholars)

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.

Original language	English
Pages (from-to)	128372-128380
Journal	IEEE Access
Volume	9
Online published	14 Sept 2021
DOIs	https://doi.org/10.1109/ACCESS.2021.3112740
Publication status	Published - 2021

Research Keywords

Codes
Complexity theory
Decoding
Iterative decoding
Joining processes
Joint source-channel coding
Manganese
Modulation
P-LDPC code
shuffled decoding

Publisher's Copyright Statement

This full text is made available under CC-BY 4.0. https://creativecommons.org/licenses/by/4.0/

Access Output

10.1109/ACCESS.2021.3112740

83310116.pdfFinal Published version, 6.19 MBLicence: CC BY

Other Access Options

Check CityUHK Library

Permanent Link

Right click to copy link

Cite this

@article{b238785f7e2c4c0ea7cc140d05be9b32,

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

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.",

keywords = "Codes, Complexity theory, Decoding, Iterative decoding, Joining processes, Joint source-channel coding, Manganese, Modulation, P-LDPC code, shuffled decoding",

author = "Zhiping XU and Lin WANG and Shaohua HONG and Guanrong CHEN",

year = "2021",

doi = "10.1109/ACCESS.2021.3112740",

language = "English",

volume = "9",

pages = "128372--128380",

journal = "IEEE Access",

issn = "2169-3536",

publisher = "IEEE",

}

TY - JOUR

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

AU - XU, Zhiping

AU - WANG, Lin

AU - HONG, Shaohua

AU - CHEN, Guanrong

PY - 2021

Y1 - 2021

N2 - 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.

AB - 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.

KW - Codes

KW - Complexity theory

KW - Decoding

KW - Iterative decoding

KW - Joining processes

KW - Joint source-channel coding

KW - Manganese

KW - Modulation

KW - P-LDPC code

KW - shuffled decoding

UR - http://www.scopus.com/inward/record.url?scp=85115147578&partnerID=8YFLogxK

UR - https://www.scopus.com/record/pubmetrics.uri?eid=2-s2.0-85115147578&origin=recordpage

U2 - 10.1109/ACCESS.2021.3112740

DO - 10.1109/ACCESS.2021.3112740

M3 - RGC 21 - Publication in refereed journal

SN - 2169-3536

VL - 9

SP - 128372

EP - 128380

JO - IEEE Access

JF - IEEE Access

ER -

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

Abstract

Research Keywords

Publisher's Copyright Statement

Access Output

Other Access Options

Permanent Link

Other Files and Links

Fingerprint

Cite this