Reduced latency iterative decoding of LDPC codes

Reduced latency versions of iterative decoders of low-density parity-check codes are analyzed in this paper. The proposed schemes converge faster than standard approaches. Two methods, density evolution and EXIT charts, are used to analyze the performance of the proposed algorithms. Both theoretical analysis and simulations show that the new schedules offer good performance versus complexity and latency trade-offs.