Open AccessKnowledge‐aided informed dynamic scheduling for LDPC decoding of short blocks
Author(s) -
Healy Cornelius,
Shao Zhichao,
Oliveira Robert M.,
Lamare Rodrigo C.,
Mendes Luciano L.
Publication year - 2018
Publication title -
iet communications
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.355
H-Index - 62
eISSN - 1751-8636
pISSN - 1751-8628
DOI - 10.1049/iet-com.2017.0873
Subject(s) - low density parity check code , computer science , decoding methods , scheduling (production processes) , belief propagation , computational complexity theory , algorithm , latency (audio) , block code , residual , list decoding , theoretical computer science , concatenated error correction code , mathematical optimization , mathematics , telecommunications
Low‐density parity‐check (LDPC) codes have excellent performance for a wide range of applications at reasonable complexity. LDPC codes with short blocks avoid the high latency of codes with large block lengths, making them potential candidates for ultra reliable low‐latency applications of future wireless standards. In this work, a novel informed dynamic scheduling (IDS) strategy for decoding LDPC codes, denoted reliability‐based residual belief propagation (Rel‐RBP), is developed by exploiting the reliability of the message and the residuals of the possible updates to choose the messages to be used by the decoding algorithm. A different measure for each iteration of the IDS schemes is also presented, which underlies the high cost of those algorithms in terms of computational complexity and motivates the development of the proposed strategy. Simulations show that Rel‐RBP speeds up the decoding at reduced complexity and results in error rate performance gains over prior work.