On efficient designing of protograph LDPC codes
Abstract
This paper designs two protograph LDPC codes with code-rate $R > 1/2$. A simple method using the protograph extrinsic information transfer (PEXIT) to design the codes with a low decoding threshold and the asymptotic weight enumerator (AWE) to evaluate the error floor of the codes is deployed. Simulation results show that the proposed codes have a better error floor than prior art protograph codes and offer higher rate protographs.
Downloads
Download data is not yet available.
References
[1] R. G. Gallager, “Low-density parity-check codes,” IRE Trans. Inf. Theory, vol. 8, no. 1, pp. 21–28, Jan. 1962.
[2] 3GPP TS 38.212 V15.3.0, Technical Specification; 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Multiplexing and channel coding (Release 15), Sept. 2018.
[3] Y. Fang, G. Bi, Y. L. Guan, and F. C. M. Lau, “A survey on protograph ldpc codes and their applications,” IEEE Communications Surveys Tutorials, vol. 17, no. 4, pp. 1989–2016, 4th Quart., 2015.
[4] A. Abbasfar, D. Divsalar, and K. Yao, “Accumulate-repeat-accumulate codes,” IEEE Trans. Commun., vol. 55, no. 4, pp. 692–702, Apr. 2007.
[5] T. Richardson and R. Urbanke, “Multi-Edge Type LDPC Codes,” presented at the Workshop honoring Prof. Bob McEliece on his 60th birthday, California Institute of Technology, Pasadena, California, May, 2002.
[6] Y. Fang, G. Han, G. Cai, F. C. M. Lau, P. Chen, and Y. L. Guan, “Design guidelines of low-density parity-check codes for magnetic recording systems,” IEEE Commun. Surveys Tutr., vol. 20, no. 2, pp. 1574–1606, 2nd Quart., 2018.
[7] T. Van Nguyen, A. Nosratinia, and D. Divsalar, “Protograph-based LDPC codes for partial response channels,” in Proc. IEEE ICC, pp. 2166–2170, Jun. 2012.
[8] Y. M. Chee, M. Horovitz, A. Vardy, V. K. Vu and E. Yaakobi, “Codes for Endurance-Limited Memories,” Proceeding of Int. Symp. Inform. Theory, pp. 501–505, App 2018.
[9] Z. Chen, X. Xu and Y. Chen, ”Application of protograph-based LDPC codes in underwater acoustic channels”, IEEE International Conference on Signal Processing Communications and Computing (ICSPCC), pp. 923-927, Aug. 2014.
[10] X. Zhong, K. Cai, P. Chen, and Z. Mei, “Design of rate-compatible protograph LDPC codes for spin-torque transform magnetic random access memory (STT-MRAM),” IEEE Access, vol. 7 pp. 182425 –182432, Nov. 2019.
[11] H. D. Vu, T. V. Nguyen, D. N. Nguyen and H. T. Nguyen, ”On design of protograph LDPC codes for large-scale MIMO systems”, IEEE Access, vol. 8, pp. 46017-46029, Mar. 2020.
[12] H. Uchikawa, “Design of non-precoded protograph-based ldpc codes,” in Proc. IEEE ISIT, June 2014, pp. 2779–2783.
[13] T. Van Nguyen and H. T. Nguyen, ”The design of optimized fast decoding protograph LDPC codes”, Proc. Int. Conf. Adv. Technol. Commun. (ATC), pp. 282-286, Oct. 2016.
[14] D. Divsalar, S. Dolinar, C. R. Jones, and K. Andrews, “Capacityapproaching protograph codes,” IEEE J. Sel. Areas. Commun., vol. 27, no. 6, pp. 876–888, Aug. 2009.
[15] T. V. Nguyen, A. Nosratinia, and D. Divsalar, “The design of rate compatible protograph LDPC codes,” IEEE Trans. Commun., Oct. 2012.
[16] J. Kim, A. Ramamoorthy, and S. Mclaughlin, “The design of efficiently encodable rate-compatible LDPC codes,” IEEE Trans. Commun., vol. 57, no. 2, pp. 365–375, Feb. 2009.
[17] P. Chen, L. Kong, Y. Fang and L. Wang, ”The design of protograph LDPC codes for 2-D magnetic recording channels”, IEEE Trans. Magn., vol. 51, no. 11, Oct. 2015.
[18] Y. Fang, G. Han, Y. Guan, G. Bi, C. M. Francis Lau, and L. Kong, “Finite-length extrinsic information transfer analysis and design of protograph low-density parity-check codes for ultra-high-density magnetic recording channels,” IET Commun., vol. 10, no. 11, pp. 1303–1311, Jul. 2016.
[19] S. ten Brink, “Convergence behavior of iteratively decoded parallel concatenated codes,” IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
[20] G. Liva and M. Chiani, “Protograph LDPC codes design based on EXIT analysis,” in Proc. 2007 IEEE GLOBECOM, pp. 3250–3254, Nov. 2007.
[21] X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, “Regular and irregular progressive edge-growth Tanner graphs,” IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386–398, Jan. 2005.
[2] 3GPP TS 38.212 V15.3.0, Technical Specification; 3rd Generation Partnership Project; Technical Specification Group Radio Access Network; NR; Multiplexing and channel coding (Release 15), Sept. 2018.
[3] Y. Fang, G. Bi, Y. L. Guan, and F. C. M. Lau, “A survey on protograph ldpc codes and their applications,” IEEE Communications Surveys Tutorials, vol. 17, no. 4, pp. 1989–2016, 4th Quart., 2015.
[4] A. Abbasfar, D. Divsalar, and K. Yao, “Accumulate-repeat-accumulate codes,” IEEE Trans. Commun., vol. 55, no. 4, pp. 692–702, Apr. 2007.
[5] T. Richardson and R. Urbanke, “Multi-Edge Type LDPC Codes,” presented at the Workshop honoring Prof. Bob McEliece on his 60th birthday, California Institute of Technology, Pasadena, California, May, 2002.
[6] Y. Fang, G. Han, G. Cai, F. C. M. Lau, P. Chen, and Y. L. Guan, “Design guidelines of low-density parity-check codes for magnetic recording systems,” IEEE Commun. Surveys Tutr., vol. 20, no. 2, pp. 1574–1606, 2nd Quart., 2018.
[7] T. Van Nguyen, A. Nosratinia, and D. Divsalar, “Protograph-based LDPC codes for partial response channels,” in Proc. IEEE ICC, pp. 2166–2170, Jun. 2012.
[8] Y. M. Chee, M. Horovitz, A. Vardy, V. K. Vu and E. Yaakobi, “Codes for Endurance-Limited Memories,” Proceeding of Int. Symp. Inform. Theory, pp. 501–505, App 2018.
[9] Z. Chen, X. Xu and Y. Chen, ”Application of protograph-based LDPC codes in underwater acoustic channels”, IEEE International Conference on Signal Processing Communications and Computing (ICSPCC), pp. 923-927, Aug. 2014.
[10] X. Zhong, K. Cai, P. Chen, and Z. Mei, “Design of rate-compatible protograph LDPC codes for spin-torque transform magnetic random access memory (STT-MRAM),” IEEE Access, vol. 7 pp. 182425 –182432, Nov. 2019.
[11] H. D. Vu, T. V. Nguyen, D. N. Nguyen and H. T. Nguyen, ”On design of protograph LDPC codes for large-scale MIMO systems”, IEEE Access, vol. 8, pp. 46017-46029, Mar. 2020.
[12] H. Uchikawa, “Design of non-precoded protograph-based ldpc codes,” in Proc. IEEE ISIT, June 2014, pp. 2779–2783.
[13] T. Van Nguyen and H. T. Nguyen, ”The design of optimized fast decoding protograph LDPC codes”, Proc. Int. Conf. Adv. Technol. Commun. (ATC), pp. 282-286, Oct. 2016.
[14] D. Divsalar, S. Dolinar, C. R. Jones, and K. Andrews, “Capacityapproaching protograph codes,” IEEE J. Sel. Areas. Commun., vol. 27, no. 6, pp. 876–888, Aug. 2009.
[15] T. V. Nguyen, A. Nosratinia, and D. Divsalar, “The design of rate compatible protograph LDPC codes,” IEEE Trans. Commun., Oct. 2012.
[16] J. Kim, A. Ramamoorthy, and S. Mclaughlin, “The design of efficiently encodable rate-compatible LDPC codes,” IEEE Trans. Commun., vol. 57, no. 2, pp. 365–375, Feb. 2009.
[17] P. Chen, L. Kong, Y. Fang and L. Wang, ”The design of protograph LDPC codes for 2-D magnetic recording channels”, IEEE Trans. Magn., vol. 51, no. 11, Oct. 2015.
[18] Y. Fang, G. Han, Y. Guan, G. Bi, C. M. Francis Lau, and L. Kong, “Finite-length extrinsic information transfer analysis and design of protograph low-density parity-check codes for ultra-high-density magnetic recording channels,” IET Commun., vol. 10, no. 11, pp. 1303–1311, Jul. 2016.
[19] S. ten Brink, “Convergence behavior of iteratively decoded parallel concatenated codes,” IEEE Trans. Commun., vol. 49, no. 10, pp. 1727-1737, Oct. 2001.
[20] G. Liva and M. Chiani, “Protograph LDPC codes design based on EXIT analysis,” in Proc. 2007 IEEE GLOBECOM, pp. 3250–3254, Nov. 2007.
[21] X.-Y. Hu, E. Eleftheriou, and D.-M. Arnold, “Regular and irregular progressive edge-growth Tanner graphs,” IEEE Trans. Inf. Theory, vol. 51, no. 1, pp. 386–398, Jan. 2005.
Published
2021-06-29
How to Cite
NGUYEN, Huong-Giang et al.
On efficient designing of protograph LDPC codes.
Journal of Science and Technology: Issue on Information and Communications Technology, [S.l.], v. 19, n. 6.2, p. 39-44, june 2021.
ISSN 1859-1531.
Available at: <http://ict.jst.udn.vn/index.php/jst/article/view/131>. Date accessed: 20 apr. 2024.
doi: https://doi.org/10.31130/ict-ud.2021.131.
Section
Articles
