Lifting methods for quasi-cyclic LDPC codes

IEEE Communications Letters

Volumn 10, Issue 6, 2006, Pages 489-491

  Myung, Seho ^a   Yang, Kyeongcheol ^a   Kim, Youngkyun ^b  

^a Pohang University of Science and Technology (POSTECH)   (South Korea)

^b SAMSUNG Electronics   (South Korea)

Author keywords

Block cycle; Circulant permutation matrix; Lifting; Low density parity check (LDPC) codes; Quasi cyclic

Indexed keywords

COMPUTER SIMULATION; MATRIX ALGEBRA; NUMERICAL METHODS; RANDOM PROCESSES;

CIRCULANT PERMUTATION MATRIX; LIFTING METHODS; LOW-DENSITY PARITY-CHECK (LDPC) CODES; QUASI-CYCLIC CODES;

CODES (SYMBOLS);

EID: 33745225452     PISSN: 10897798     EISSN: None     Source Type: Journal    
DOI: 10.1109/LCOMM.2006.1638625     Document Type: Article

References (15)

1. S.-Y. Chung, "On the construction of some capacity-approaching coding schemes," Ph.D. dissertation, MIT, Sept. 2000.
2. I. B. Djordjevic, O. Milenkovic, and B. Vasic, "Generalized low-density parity-check codes for optical communication systems," IEEE/OSA J. Lightwave Tech., vol. 23, pp. 1939-1946, May 2005.
3. J. L. Fan, "Array codes as low-density parity-check codes," in Proc. 2nd Int. Symp. Turbo Codes 2000, pp. 543-546.
4. M. P. C. Fossorier, "Quasi-cyclic low density parity check codes from circulant permutation matrices," IEEE Trans. Inform. Theory, vol. 50, pp. 1788-1794, Aug. 2004.
5. R. G. Gallager, "Low-density parity-check codes," IRE Trans. Inform. Theory, vol. IT-8, pp. 21-28, Jan. 1962.
6. X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edge-growth Tanner graphs," IEEE Trans. Inform. Theory, vol. 51, pp. 386-398, Jan. 2005.
7. J.-L. Kim, U. N. Peled, I. Perepelitsa, V. Pless, and S. Friedland, "Explicit construction of families of LDPC codes with no 4-cycles," IEEE Trans. Inform. Theory, vol. 50, pp. 2378-2388, Oct. 2004.
8. Y. Kou, S. Lin, and M. P. C. Fossorier, "Low-density parity-check codes based on finite geometries: a rediscovery and new results," IEEE Trans. Inform. Theory, vol. 47, pp. 2711-2736, Nov. 2001.
9. D. J. C. MacKay and R. M. Neal, "Near Shannon limit performance of low-density parity-check codes," IEE Electron. Lett., vol. 32, pp. 1645-1646, Aug. 1996.
10. N. Miladinovic and M. P. C. Fossorier, "Systematic recursive construction of LDPC codes," IEEE Commun. Lett., vol. 8, pp. 302-304, May 2004.
11. S. Myung, K. Yang, and J. Kim, "Quasi-cyclic LDPC codes for fast encoding," IEEE Trans. Inform. Theory, vol. 51, pp. 2894-2901, Aug. 2005.
12. S. Myung and K. Yang, "Extension of quasi-cyclic LDPC codes by lifting," in Proc. IEEE Int. Symp. Information Theory 2005, pp. 2305-2309.
13. T. J. Richardson, A. Shokrollahi, and R. Urbanke, "Design of capacity-approaching low-density parity-check codes," IEEE Trans. Inform. Theory, vol. 47, pp. 619-637, Feb. 2001.
14. M. Sipser and D. A. Spielman, "Expander codes," IEEE Trans. Inform. Theory, vol. 42, pp. 1710-1722, Nov. 1996.
15. R. M. Tanner, D. Sridhara, A. Sridharan, T. E. Fuja, and D. J. Costello, Jr., "LDPC block and convolutional codes based on circulant matrices," IEEE Trans. Inform. Theory, vol. 50, pp. 2966-2984, Dec. 2004.