Joint Shuffled Scheduling Decoding Algorithm for DP-LDPC Codes-Based JSCC Systems

Zhiping Xu; Lin Wang; Shaohua Hong; Francis C.M. Lau; Chiu Wing Sham

doi:10.1109/LWC.2019.2937766

Joint Shuffled Scheduling Decoding Algorithm for DP-LDPC Codes-Based JSCC Systems

Zhiping Xu, Lin Wang, Shaohua Hong, Francis C.M. Lau, Chiu Wing Sham

The Hong Kong Polytechnic University

Research output: Journal article publication › Journal article › Academic research › peer-review

15 Citations (Scopus)

Abstract

In this letter, a joint shuffled scheduling decoding algorithm for double-protograph low-density parity-check (DP-LDPC) codes-based joint source-channel coding (JSCC) schemes is presented. The proposed algorithm adopts the shuffled scheduling method to both source decoder and channel decoder, and can improve convergence speed and reduce the decoding complexity. In addition, a unique phenomenon named unequal convergence rates is revealed at the same time. The proposed algorithm can terminate this phenomenon with faster decoding. The results show that this algorithm has faster convergence speed and better error performance, compared with the traditional joint belief propagation (BP) decoding algorithm.

Original language	English
Article number	8815836
Pages (from-to)	1696-1699
Number of pages	4
Journal	IEEE Wireless Communications Letters
Volume	8
Issue number	6
DOIs	https://doi.org/10.1109/LWC.2019.2937766
Publication status	Published - Dec 2019

Keywords

belief propagation
DP-LDPC codes
JSCC
shuffled scheduling

ASJC Scopus subject areas

Control and Systems Engineering
Electrical and Electronic Engineering

More information

10.1109/LWC.2019.2937766

http://hdl.handle.net/10397/90072

Cite this

@article{a6e5d4250c7e4494a19b901673f0dbcc,

title = "Joint Shuffled Scheduling Decoding Algorithm for DP-LDPC Codes-Based JSCC Systems",

abstract = "In this letter, a joint shuffled scheduling decoding algorithm for double-protograph low-density parity-check (DP-LDPC) codes-based joint source-channel coding (JSCC) schemes is presented. The proposed algorithm adopts the shuffled scheduling method to both source decoder and channel decoder, and can improve convergence speed and reduce the decoding complexity. In addition, a unique phenomenon named unequal convergence rates is revealed at the same time. The proposed algorithm can terminate this phenomenon with faster decoding. The results show that this algorithm has faster convergence speed and better error performance, compared with the traditional joint belief propagation (BP) decoding algorithm.",

keywords = "belief propagation, DP-LDPC codes, JSCC, shuffled scheduling",

author = "Zhiping Xu and Lin Wang and Shaohua Hong and Lau, {Francis C.M.} and Sham, {Chiu Wing}",

year = "2019",

month = dec,

doi = "10.1109/LWC.2019.2937766",

language = "English",

volume = "8",

pages = "1696--1699",

journal = "IEEE Wireless Communications Letters",

issn = "2162-2337",

publisher = "IEEE Communications Society",

number = "6",

}

TY - JOUR

T1 - Joint Shuffled Scheduling Decoding Algorithm for DP-LDPC Codes-Based JSCC Systems

AU - Xu, Zhiping

AU - Wang, Lin

AU - Hong, Shaohua

AU - Lau, Francis C.M.

AU - Sham, Chiu Wing

PY - 2019/12

Y1 - 2019/12

N2 - In this letter, a joint shuffled scheduling decoding algorithm for double-protograph low-density parity-check (DP-LDPC) codes-based joint source-channel coding (JSCC) schemes is presented. The proposed algorithm adopts the shuffled scheduling method to both source decoder and channel decoder, and can improve convergence speed and reduce the decoding complexity. In addition, a unique phenomenon named unequal convergence rates is revealed at the same time. The proposed algorithm can terminate this phenomenon with faster decoding. The results show that this algorithm has faster convergence speed and better error performance, compared with the traditional joint belief propagation (BP) decoding algorithm.

AB - In this letter, a joint shuffled scheduling decoding algorithm for double-protograph low-density parity-check (DP-LDPC) codes-based joint source-channel coding (JSCC) schemes is presented. The proposed algorithm adopts the shuffled scheduling method to both source decoder and channel decoder, and can improve convergence speed and reduce the decoding complexity. In addition, a unique phenomenon named unequal convergence rates is revealed at the same time. The proposed algorithm can terminate this phenomenon with faster decoding. The results show that this algorithm has faster convergence speed and better error performance, compared with the traditional joint belief propagation (BP) decoding algorithm.

KW - belief propagation

KW - DP-LDPC codes

KW - JSCC

KW - shuffled scheduling

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

U2 - 10.1109/LWC.2019.2937766

DO - 10.1109/LWC.2019.2937766

M3 - Journal article

AN - SCOPUS:85076575180

SN - 2162-2337

VL - 8

SP - 1696

EP - 1699

JO - IEEE Wireless Communications Letters

JF - IEEE Wireless Communications Letters

IS - 6

M1 - 8815836

ER -

Joint Shuffled Scheduling Decoding Algorithm for DP-LDPC Codes-Based JSCC Systems

Abstract

Keywords

ASJC Scopus subject areas

More information

Other files and links

Fingerprint

Cite this