Title :
Lazy scheduling forLDPC decoding
Author :
Levin, Daniel ; Sharon, Eran ; Litsyn, Simon
Author_Institution :
Fac. of Electr. Eng., Tel Aviv Univ.
Abstract :
A complexity reducing method for iterative message passing decoding algorithms of low-density parity-check (LDPC) codes is described. It is based on lazy scheduling which involves a partial update of messages in the iterations. A density evolution (DE) approach is developed for optimization of the parameters for choice of the messages to be updated. Combined with an efficient serial scheduling, the resulting method reduces the decoding complexity by about 70-75% compared to the classical belief propagation (BP) scheme, while maintaining the same performance
Keywords :
iterative decoding; message passing; parity check codes; scheduling; LDPC codes; complexity reducing method; density evolution approach; iterative message passing decoding algorithm; lazy scheduling; low-density parity-check codes; serial scheduling; Belief propagation; Bipartite graph; Convergence; Iterative algorithms; Iterative decoding; Iterative methods; Message passing; Parity check codes; Processor scheduling; Scheduling algorithm;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2007.061454
