Low Density Parity Check Codes Constructed from Hankel Matrices
DOI:
https://doi.org/10.26636/jtit.2018.121717Keywords:
dual diagonal matrix, error correcting codes, girth, Hankel matrix, low density parity check codesAbstract
In this paper, a new technique for constructing low density parity check codes based on the Hankel matrix and circulant permutation matrices is proposed. The new codes are exempt of any cycle of length 4. To ensure that parity check bits can be recursively calculated with linear computational complexity, a dual-diagonal structure is applied to the parity check matrices of those codes. The proposed codes provide a very low encoding complexity and reduce the stored memory of the matrix H in which this matrix can be easily implemented comparing to others codes used in channel coding. The new LDPC codes are compared, by simulation, with uncoded bi-phase shift keying (BPSK). The result shows that the proposed codes perform very well over additive white Gaussian noise (AWGN) channels.
Downloads
References
[1] R. G. Gallager, “Low-density parity-check codes”, IRE Transact. Inform. Theory, vol. 8, no. 1, pp. 21–28, 1962.
View in Google Scholar
[2] W. Sułek, “Seed graph expansion for construction of structured LDPC codes”, in Proc. 6th Int. Symp. on Wireless Commun. Sys. ISWCS, Siena, Italy, 2009, pp. 216–220.
View in Google Scholar
[3] D. Xia, H. He, Y. Xu, and Y. Cai, “A novel construction scheme with linear encoding complexity for LDPC codes”, in Proc. 4th Int. Conf. on Wireless Commun. Network. and Mob. Comput., Dalian, Liaoning, China, 2008, pp. 1–4.
View in Google Scholar
[4] R. Tanner, “A recursive approach to low complexity codes”, IEEE Transact. Inform. Theory, vol. 27, no. 5, pp. 533–547, 1981.
View in Google Scholar
[5] Y. Abid, O. Sidek, M. F. M. Salleh, and F. Ghani, “A new quasi-cyclic low density parity check codes”, in Proc. 2009 IEEE Symp. on Indust. Electron. & Applic., Kuala Lumpur, Malaysia, 2009, pp. 239–242.
View in Google Scholar
[6] D. J. C. MacKay, “Good codes based on very sparse matrices”, IEEE Transact. Inform. Theory, vol. 45, no. 2, pp. 399–431, 1999.
View in Google Scholar
[7] Q. Guo-lei and Z. Dong, “Design of structured LDPC codes with quasi-cyclic and rotation architecture”, in Proc. 2010 3rd Int. Conf. on Adv. Comput. Theory and Engineer. ICACTE, Chengdu, Sichuan, China, 2010, pp. 655–657.
View in Google Scholar
[8] M. Yang, W. E. Ryan, and Y. Li, “Design of efficiently encodable moderate length high-rate irregular LDPC codes”, IEEE Trans. Commun., vol. 52, no. 4, pp. 564–571, 2004.
View in Google Scholar
[9] K. Liu, Z. Fei, J. Kuang, and X. Li, “A novel algorithm for removing cycles in quasi-cyclic LDPC codes”, in Proc. 2009 IEEE 20th Int. Symp. on Person. Indoor and Mob. Radio Commun., Tokyo, Japan, 2009, pp. 1054–1058.
View in Google Scholar
[10] A. Ahmed and Y. F. Hu, “3M relationship pattern for detection and estimation of unknown frequencies for unknown number of sinusoids based on eigenspace analysis of Hankel matrix”, in Proc. IET 2nd Intel. Sig. Process. Conf. ISP 2013, London, UK, 2013, pp. 1–6.
View in Google Scholar
[11] H. Song, J. Liu, and B. V. K. V. Kumar, “Low complexity LDPC codes for partial response channels”, in Proc. IEEE Global Telecommun. Conf. GLOBECOM’02, Taipei, Taiwan, 2002, vol. 2, pp. 1294–1299.
View in Google Scholar
[12] H. Song, J. Liu, and B. V. K. V. Kumar, “Large girth cycle codes for partial response channels”, IEEE Transact. on Magnet., vol. 40, no. 4, part 2, pp. 3084–3086, 2004.
View in Google Scholar
[13] G. Malema and M. Liebelt, “Quasi-cyclic LDPC codes of column-weight two using a search algorithm”, EURASIP J. Adv. Sig. Process., vol. 2007, no. 4, pp. 1–8, 2007.
View in Google Scholar
[14] M. P. C. Fossorier, “Quasi-cyclic low-density parity-check codes from circulant permutation matrices”, IEEE Transact. Inform. Theory, vol. 50, no. 8, pp. 1788–1793, 2004.
View in Google Scholar
[15] M. E. O’Sullivan, “Algebraic construction of sparse matrices with large girth”, IEEE Transact. Inform. Theory, vol. 52, no. 2, pp. 718–727, 2006.
View in Google Scholar
[16] Y. Mao and A. H. Banihashemi, “A heuristic search for good low-density parity-check codes at short block lengths”, in Proc. IEEE Int. Conf. on Commun. ICC’01, Helsinki, Finland, 2001, vol. 1, pp. 41–44.
View in Google Scholar
[17] T. J. Richardson and R. L. Urbanke, “Efficient encoding of low-density-parity-check codes”, IEEE Transact. Inform. Theory, vol. 47, no. 2, pp. 638–656, 2001.
View in Google Scholar
[18] L. Ping, W. K. Leung, and N. Phamdo, “Low density parity check codes with semi-random parity check matrix”, Electron. Let., vol. 35, no. 1, pp. 38–39, 1999.
View in Google Scholar
[19] Z. Hao and Z. Tong, “Block-LDPC: a partial LDPC coding system design approach”, IEEE Transact. Circuits Sys. I, vol. 52, no. 4, pp. 766–775, 2005.
View in Google Scholar
[20] J. M. F. Moura, J. Lu, and H. Zhang, “Structured low-density-parity-check codes”, IEEE Sig. Process. Mag., vol. 21, no. 1, pp. 42–55, 2004.
View in Google Scholar
Downloads
Submitted
Published
Issue
Section
License
Copyright (c) 2018 Journal of Telecommunications and Information Technology
This work is licensed under a Creative Commons Attribution 4.0 International License.
