1. Gallager R G. Low-density parity-check codes. Cambridge, MA, USA: The MIT Press, 1963
2. Gallager R G. Low-density parity-check codes. IRE Transactions on Information Theory, 1962, 8(1): 21-28
4. Richardson T J, Urbanke R. The capacity of low-density parity-check codes under message-passing decoding. IEEE Transactions on Information Theory, 2001, 47(2): 599-618
5. Fan J L. Constrained coding and soft iterative decoding. Boston, MA, USA: Kluwer Academic, 2001
6. Chen J, Dholakia A, Eleftheriou E, et al. Reduced-complexity decoding of LDPC codes. IEEE Transactions on Communications, 2005, 53(8): 1288-1299
7. Chen J, Fossorier M P C. Density evolution for two improved BP-based decoding algorithms of LDPC codes. IEEE Communications Letters, 2002, 6(5): 208-210
8. Chen J, Fossorier M P C. Near optimum universal belief propagation based decoding of low-density parity check codes. IEEE Transactions on Communications, 2002, 50(3): 406-414
9. Wang Z F, Cui Z Q. A memory efficient partially parallel decoder architecture for quasi-cyclic LDPC codes. IEEE Transactions on VLSI Systems, 2007, 15(4): 483-488
10. Zhang H B, Zhu J, Shi H F, et al. Layered approx-regular LDPC: code construction and encoder/decoder design. IEEE Transactions on Circuits and Systems I: Regular Papers, 2008, 55(2): 572-585
11. Sha J, Wang Z F, Gao M L, et al. Multi-Gbit/s LDPC code design and Implementation. IEEE Transactions on VLSI Systems, 2009, 17(2): 262-268
12. Chen J, Tanner R M, Jones C, et al. Improved min-sum decoding algorithms for irregular LDPC codes. Proceedings of 2005 IEEE International Symposium on Information Theory (ISIT’05), Sep 4-9, 2005, Adelaide, Australia, Piscataway, NJ, USA: IEEE, 2005: 449-453
13. Tanner R M. A recursive approach to low complexity codes. IEEE Transactions on Information Theory, 1981, 27(9): 533-547
15. Sun G H, Jin J, Yao W B, et al. A new reduced-complexity decoding algorithm for LDPC codes. IEICE Transactions on Communications, 2007, E90-B(7): 1835-1838
|