Fast decoding algorithm for low-density parity-check codes

Abstract

A fast decoding algorithm for low-density parity-check codes is presented based on graph decomposition and two-way message passing schedule. Simulations show that the convergence speed of the proposed algorithm is about twice that of the conventional belief propagation algorithm. Copyright © 2005 The Institute of Electronics, Information and Communication Engineers.