Delay-Limited Rate-Compatible Protograph LDPC Codes

  IJETT-book-cover  International Journal of Engineering Trends and Technology (IJETT)          
© 2019 by IJETT Journal
Volume-67 Issue-7
Year of Publication : 2019
Authors : Thuy V. Nguyen, Hung N. Dang and Hieu T. Nguyen
DOI :  10.14445/22315381/IJETT-V67I7P223


MLA Style: Thuy V. Nguyen, Hung N. Dang and Hieu T. Nguyen"Delay-Limited Rate-Compatible Protograph LDPC Codes" International Journal of Engineering Trends and Technology 67.7 (2019): 115-123.

APA Style:Thuy V. Nguyen, Hung N. Dang and Hieu T. Nguyen(2019). "Delay-Limited Rate-Compatible Protograph LDPC Codes"International Journal of Engineering Trends and Technology, 67(7), 115-123.

This paper produces a family of rate-compatible protograph-based low-density parity-check (PLDPC) codes that have superior performance under strict constraints of short block length and low decoding iterations. The design of such practical codes is a challenging task since the constraints imposed by structured designs (PLDPC), rate-compatibility, small block length, as well as a small number of decoding iterations, are hard to meet simultaneously. As the block length and the number of decoding iterations decrease, the typical LDPC design based only on the coding threshold is no longer effective due to imperfection in the modeling of LDPC decoders in the short block length regime. We propose a code design method that takes the code simulations and the number of the decoding iterations as inputs to optimize the new codes. Analytical and simulation results confirm that the new codes produced by the proposed approach outperform the state-of-the-art codes in a wide range of code rates. None of the newly optimized codes has the error-floor behavior even below the frame error rate of 10-5or bit error rate of 10-6

[1] T. V. Nguyen and H. T. Nguyen, “The design of optimized fast decoding protograph LDPC codes,” in Proc. Int. Conf. Advanced Technologies for Communications (ATC), Oct. 2016, pp. 282–286.
[2] I. S. Comsa, A. De-Domenico, and D. Ktenas, “QoS-driven scheduling in 5G radio access networks - A reinforcement learning approach,” in Proc. IEEE GLOBECOM, Dec. 2017, pp. 1–7.
[3] P. Chen, K. Cai, and S. Zheng, “Rate-adaptive protograph LDPC codes for multi-level-cell nand flash memory,” IEEE Commun. Lett., vol. 22, no. 6, pp. 1112–1115, June 2018.
[4] T. P. Fowdur and B. N. Furzun, “Performance of IEEE 802.11n LDPC codes with modified reliability based hybrid ARQ and unequal error protection,” in Int. Conf. on Computer as a Tool (EUROCON), Sept. 2015, pp. 1–6.
[5] C. Condo, G. Masera, and P. Montuschi, “Unequal error protection of memories in LDPC decoders,” IEEE Transactions on Computers, vol. 64, no. 10, pp. 2981–2993, Oct. 2015.
[6] G. Ricciutelli, M. Baldi, N. Maturo, and F. Chiaraluce, “LDPC coded modulation schemes with largely unequal error protection,” in IEEE Int. Black Sea Conf. on Commun. and Networking (BlackSeaCom), May 2015, pp. 48–52.
[7] L. Xu, L. Wang, S. Hong, and H. Wu, “New results on radiography image transmission with unequal error protection using protograph double LDPC codes,” in Int. Symp. on Medical Information and Commun. Technology (ISMICT), Apr. 2014, pp. 1–4.
[8] B. Rajkumarsingh and K. Nuckchady, “LDPC coded adaptive multiresolution modulation for unequal error protection,” in 2013 Africon, Sept 2013, pp. 1–5.
[9] T. Richardson and S. Kudekar, “Design of low-density parity check codes for 5G new radio,” IEEE Communications Magazine, vol. 56, no. 3, pp. 28–34, Mar. 2018.
[10] A. Goldsmith, Wireless Communications, 2005.
[11] I. B. Djordjevic and D. Zou, “FPGA-based rate-adaptive LDPC-coded modulation for the next generation of optical communication systems,” in Int. Conf. on Transparent Optical Networks (ICTON), July 2017, pp. 1–6.
[12] B. Li, C. Ju, H. Yang, and G. Liu, “Adaptive coded modulation based on LDPC codes,” in Int. Conf. on Commun. and Networking in China (ChinaCom), Aug. 2015, pp. 648–651.
[13] M. Mazzotti, S. Moretti, and M. Chiani, “Multiuser resource allocation with adaptive modulation and LDPC coding for heterogeneous traffic in ofdma downlink,” IEEE Trans. Commun., vol. 60, no. 10, pp. 2915– 2925, October 2012.
[14] H. Uchikawa, “Design of non-precoded protograph-based LDPC codes,” in Proc. IEEE ISIT, June 2014, pp. 2779–2783.
[15] T. J. Richardson, M. A. Shokrollahi, and R. L. Urbanke, “Design of capacity-approaching irregular low-density parity-check codes,” IEEE Trans. Inform. Theory, vol. 47, no. 2, pp. 619–637, Feb. 2001.
[16] G. Liva and M. Chiani, “Protograph LDPC codes design based on EXIT analysis,” in Proc. IEEE GLOBECOM, Nov. 2007, pp. 3250–3254.
[17] D. Divsalar, S. Dolinar, C. R. Jones, and K. Andrews, “Capacityapproaching protograph codes,” IEEE J. Select. Areas Commun., vol. 27, no. 6, pp. 876–888, Aug. 2009.
[18] T. V. Nguyen, A. Nosratinia, and D. Divsalar, “The design of ratecompatible protograph LDPC codes,” IEEE Trans. Commun., Oct. 2012.
[19] T. Koike-Akino, D. S. Millar, K. Kojima, K. Parsons, Y. Miyata, K. Sugihara, and W. Matsumoto, “Iteration-aware LDPC code design for low-power optical communications,” Journal of Lightwave Technology, vol. 34, no. 2, pp. 573–581, Jan. 2016.
[20] L. Buccheri, S. Mandelli, S. Saur, L. Reggiani, and M. Magarini, “Hybrid retransmission scheme for QoS-defined 5G ultra-reliable lowlatency communications,” in IEEE Wireless Commun. and Net. Conf. (WCNC), Apr. 2018, pp. 1–6.
[21] 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, no. 7, pp. 2711–2736, Nov. 2001.
[22] A. Bennatan and D. Burshtein, “Design and analysis of nonbinary LDPC codes for arbitrary discrete-memoryless channels,” IEEE Trans. Inform. Theory, vol. 52, no. 2, pp. 549–583, Feb. 2006.
[23] G. Liva, W. E. Ryan, and M. Chiani, “Quasi-cyclic generalized LDPC codes with low error floors,” IEEE Trans. Commun., vol. 56, no. 1, pp. 49–57, January 2008.
[24] C. Tang, M. Jiang, C. Zhao, and H. Shen, “Design of protograph-based LDPC codes with limited decoding complexity,” IEEE Commun. Lett., vol. PP, no. 99, p. 1, 2017.
[25] A. Abbasfar, D. Divsalar, and K. Yao, “Accumulate-repeat-accumulate codes,” IEEE Trans. Commun., vol. 55, no. 4, pp. 692–702, Apr. 2007.
[26] T. V. Nguyen, A. Nosratinia, and D. Divsalar, “Rate-compatible shortlength protograph LDPC codes,” IEEE Commun. Lett., May 2013.
[27] S. Abu-Surra, D. Divsalar, and W. Ryan, “On the existence of typical minimum distance for protograph-based LDPC codes,” in Information Theory and Applications Workshop (ITA), Jan. 2010, pp. 1–7.
[28] 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, 2003.
[29] J. Hamkins, “Performance of low-density parity-check coded modulation,” IPN Progress Report 42-184, Feb. 2011.
[30] 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, Fourthquarter 2015.
[31] K. S. Andrews, D. Divsalar, S. Dolinar, J. Hamkins, C. R. Jones, and F. Pollara, “The development of turbo and LDPC codes for deep-space applications,” Proceedings of the IEEE, vol. 95, no. 11, pp. 2142–2156, Nov 2007.
[32] G. Maral, VSAT Networks, 2003.
[33] ——, Sattelite communications systems: Systems, Techniques and Technology, 2009.

Compatible Protograph LDPC Codes , Limited Rate , Punctured Protograph