Abstract:

A modified serial decoding algorithm for low-density parity-check（LDPC） codes is proposed. Unlike conventional approaches, this algorithm calculates the sum of variable-to-check messages only once at the initialization stage, and then updates it by simple recursions during the decoding stage. Compared with the conventional serial LDPC decoding algorithm, the proposed algorithm has lower computational complexity and higher processing speed without any performance deterioration.

Key words: low-density parity-check codes, serial decoding, belief propagation, iterative decoding