Information-Propagation-Based Scheduling for the Fast Convergence of Shuffled Decoding

Taehyun Kim, Jun Heo

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

This letter presents a scheduling scheme for the fast convergence of shuffled decoding. The messages from the variable node group that is expected to propagate the most reliable information are updated first. Mutual information is used to measure the information reliability. Simulation results show that the average number of iterations is reduced by adopting the proposed schedule, compared to previous scheduling schemes. In addition, information-theoretic analysis results show that mutual information in the proposed scheme increases faster than in the previous scheme.

Original languageEnglish
JournalIEEE Communications Letters
DOIs
Publication statusAccepted/In press - 2018 Apr 23

Fingerprint

Decoding
Scheduling
Propagation
Information analysis
Mutual Information
Schedule
Iteration
Vertex of a graph
Simulation

Keywords

  • Convergence
  • Decoding
  • Iterative decoding
  • Low-density parity-check codes
  • Mutual information
  • mutual information
  • Reliability
  • Schedules
  • scheduling
  • shuffled decoding

ASJC Scopus subject areas

  • Modelling and Simulation
  • Computer Science Applications
  • Electrical and Electronic Engineering

Cite this

Information-Propagation-Based Scheduling for the Fast Convergence of Shuffled Decoding. / Kim, Taehyun; Heo, Jun.

In: IEEE Communications Letters, 23.04.2018.

Research output: Contribution to journalArticle

@article{44af437276a44cffb7021c60fb0d3045,
title = "Information-Propagation-Based Scheduling for the Fast Convergence of Shuffled Decoding",
abstract = "This letter presents a scheduling scheme for the fast convergence of shuffled decoding. The messages from the variable node group that is expected to propagate the most reliable information are updated first. Mutual information is used to measure the information reliability. Simulation results show that the average number of iterations is reduced by adopting the proposed schedule, compared to previous scheduling schemes. In addition, information-theoretic analysis results show that mutual information in the proposed scheme increases faster than in the previous scheme.",
keywords = "Convergence, Decoding, Iterative decoding, Low-density parity-check codes, Mutual information, mutual information, Reliability, Schedules, scheduling, shuffled decoding",
author = "Taehyun Kim and Jun Heo",
year = "2018",
month = "4",
day = "23",
doi = "10.1109/LCOMM.2018.2829739",
language = "English",
journal = "IEEE Communications Letters",
issn = "1089-7798",
publisher = "Institute of Electrical and Electronics Engineers Inc.",

}

TY - JOUR

T1 - Information-Propagation-Based Scheduling for the Fast Convergence of Shuffled Decoding

AU - Kim, Taehyun

AU - Heo, Jun

PY - 2018/4/23

Y1 - 2018/4/23

N2 - This letter presents a scheduling scheme for the fast convergence of shuffled decoding. The messages from the variable node group that is expected to propagate the most reliable information are updated first. Mutual information is used to measure the information reliability. Simulation results show that the average number of iterations is reduced by adopting the proposed schedule, compared to previous scheduling schemes. In addition, information-theoretic analysis results show that mutual information in the proposed scheme increases faster than in the previous scheme.

AB - This letter presents a scheduling scheme for the fast convergence of shuffled decoding. The messages from the variable node group that is expected to propagate the most reliable information are updated first. Mutual information is used to measure the information reliability. Simulation results show that the average number of iterations is reduced by adopting the proposed schedule, compared to previous scheduling schemes. In addition, information-theoretic analysis results show that mutual information in the proposed scheme increases faster than in the previous scheme.

KW - Convergence

KW - Decoding

KW - Iterative decoding

KW - Low-density parity-check codes

KW - Mutual information

KW - mutual information

KW - Reliability

KW - Schedules

KW - scheduling

KW - shuffled decoding

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

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

U2 - 10.1109/LCOMM.2018.2829739

DO - 10.1109/LCOMM.2018.2829739

M3 - Article

AN - SCOPUS:85045986761

JO - IEEE Communications Letters

JF - IEEE Communications Letters

SN - 1089-7798

ER -