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

Taehyun Kim, Jun Heo

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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
Publication statusAccepted/In press - 2018 Apr 23


  • 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

Fingerprint Dive into the research topics of 'Information-Propagation-Based Scheduling for the Fast Convergence of Shuffled Decoding'. Together they form a unique fingerprint.

Cite this