Efficient Serial Message-Passing Schedules for LDPC Decoding


Conventionally, in each low-density parity-check (LDPC) decoding iteration all the variable nodes and subsequently all the check nodes send messages to their neighbors (flooding schedule). An alternative, more efficient, approach is to update the nodes' messages serially (serial schedule). A theoretical analysis of serial message passing decoding schedules… (More)
DOI: 10.1109/TIT.2007.907507

7 Figures and Tables



Citations per Year

209 Citations

Semantic Scholar estimates that this publication has 209 citations based on the available data.

See our FAQ for additional information.

  • Presentations referencing similar topics