Open AccessSyndrome‐based scheduling: simple adaptive scheduling technique for decoding LDPC codes
Author(s) -
Sever M.,
Cavus E.
Publication year - 2015
Publication title -
electronics letters
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.375
H-Index - 146
eISSN - 1350-911X
pISSN - 0013-5194
DOI - 10.1049/el.2015.1049
Subject(s) - computer science , decoding methods , low density parity check code , scheduling (production processes) , algorithm , dynamic priority scheduling , mathematical optimization , mathematics , computer network , quality of service
A very simple adaptive scheduling method is introduced to improve the convergence rate of low‐density parity‐check decoders. Although the standard decoding method does not impose any constraint on the process order of check nodes, the proposed scheme adopts a dynamic scheduling method for check node message updating based on syndrome values. The proposed technique is applied to lower‐density parity check (LDPC) codes of the 802.11n and 802.15.3c standards. Compared with sequential scheduling, the proposed approach provides a faster convergence speed from 28 to 51% for a WER of 10 −4 and 10 −2 , respectively. Consequently, the introduced adaptive scheduling achieves a target performance with less number of iterations, which leads to reduced power consumption with minimal additional decoding complexity.