Reduced latency iterative decoding of LDPC codes
Yige Wang, Juntan Zhang, M.P.C. Fossorier et al. · IEEE Global Telecommunications Conference (GLOBECOM) · 2005
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.
Cited by 11 works. doi:10.1109/glocom.2005.1577843
Authors
References
- Good error-correcting codes based on very sparse matrices
- The capacity of low-density parity-check codes under message-passing decoding
- Convergence behavior of iteratively decoded parallel concatenated codes
- On the design of low-density parity-check codes within 0.0045 dB of the Shannon limit
- Design of Low-Density Parity-Check Codes for Modulation and Detection
- Progressive edge-growth Tanner graphs
- Shuffled Iterative Decoding
- Shuffled belief propagation decoding
- Parallel versus sequential updating for belief propagation decoding
- An efficient message-passing schedule for LDPC decoding