Browse > Article
http://dx.doi.org/10.7840/kics.2016.41.12.1745

New Irregular Quasi-Cyclic LDPC Codes Constructed from Perfect Difference Families  

Park, Hosung (School of Electronics and Computer Engineering, Chonnam National University)
Abstract
In this paper, we propose a construction method of irregular quasi-cyclic low-density parity-check codes based on perfect difference families with various block sizes. The proposed codes have advantages in that they support various values with respect to code rate, length, and degree distribution. Also, this construction enables very short lengths which are usually difficult to be achieved by a random construction. We verify via simulations the error-correcting performance of the proposed codes.
Keywords
Girth; low-density parity-check codes; perfect difference family; quasi-cyclic codes;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 C.-U. Baek and J.-W. Jung, "A study on turbo equalization for MIMO systems based on LDPC codes," J. KICS, vol. 41, no. 5, pp. 504-511, May 2016.   DOI
2 B. Vasic and O. Milenkovic, "Combinatorial constructions of low-density parity-check codes for iterative decoding," IEEE Trans. Inf. Theory, vol. 50, no. 6, pp. 1156-1176, Jun. 2004.   DOI
3 S. J. Johnson and S. R. Weller, "A family of irregular LDPC codes with low encoding complexity," IEEE Commun. Lett., vol. 7, no. 2, pp. 79-81, Feb. 2003.   DOI
4 T. Xia and B. Xia, "Quasi-cyclic codes from extended difference families," in Proc. IEEE Wireless Commun. Netw. Conf., pp. 1036-1040, New Orleans, LA, USA, Mar. 2005.
5 X.-Y. Hu, E. Eleftheriou, and D. M. Arnold, "Regular and irregular progressive edgegrowth tanner graphs," IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386-398, Jan. 2005.   DOI
6 D. Wu, M. Cheng, and Z. Chen, "Perfect difference families and related variable-weight optical orthogonal codes," Australian J. Combin., vol. 55, pp. 153-166, 2013.
7 R. M. Tanner, "Spectral graphs for quasi-cyclic LDPC codes," in Proc. IEEE Symp. Inf. Theory, p. 226, Washington, D.C., USA, Jun. 2001.