Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
169 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
45 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Boosted Neural Decoders: Achieving Extreme Reliability of LDPC Codes for 6G Networks (2405.13413v2)

Published 22 May 2024 in cs.IT, cs.LG, eess.SP, and math.IT

Abstract: Ensuring extremely high reliability in channel coding is essential for 6G networks. The next-generation of ultra-reliable and low-latency communications (xURLLC) scenario within 6G networks requires frame error rate (FER) below $10{-9}$. However, low-density parity-check (LDPC) codes, the standard in 5G new radio (NR), encounter a challenge known as the error floor phenomenon, which hinders to achieve such low rates. To tackle this problem, we introduce an innovative solution: boosted neural min-sum (NMS) decoder. This decoder operates identically to conventional NMS decoders, but is trained by novel training methods including: i) boosting learning with uncorrected vectors, ii) block-wise training schedule to address the vanishing gradient issue, iii) dynamic weight sharing to minimize the number of trainable weights, iv) transfer learning to reduce the required sample count, and v) data augmentation to expedite the sampling process. Leveraging these training strategies, the boosted NMS decoder achieves the state-of-the art performance in reducing the error floor as well as superior waterfall performance. Remarkably, we fulfill the 6G xURLLC requirement for 5G LDPC codes without a severe error floor. Additionally, the boosted NMS decoder, once its weights are trained, can perform decoding without additional modules, making it highly practical for immediate application. The source code is available at https://github.com/ghy1228/LDPC_Error_Floor.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (41)
  1. E.-K. Hong, I. Lee, B. Shim, Y.-C. Ko, S.-H. Kim, S. Pack, K. Lee, S. Kim, J.-H. Kim, Y. Shin, Y. Kim, and H. Jung, “6G R&D vision: Requirements and candidate technologies,” J. Commun. Netw., vol. 24, no. 2, pp. 232–245, 2022.
  2. G. Dong, N. Xie, and T. Zhang, “On the use of soft-decision error-correction codes in NAND flash memory,” IEEE Trans. Circuits Syst. I: Reg. Papers, vol. 58, no. 2, pp. 429–439, 2010.
  3. S. Chandak, K. Tatwawadi, B. Lau, J. Mardia, M. Kubit, J. Neu, P. Griffin, M. Wootters, T. Weissman, and H. Ji, “Improved read/write cost tradeoff in DNA-based data storage using LDPC codes,” in Proc. Allerton Conf. Commun. Control Comput. (Allerton), 2019, pp. 147–156
  4. M. Baldi, M. Bodrato, and F. Chiaraluce, “A new analysis of the McEliece cryptosystem based on QC-LDPC codes,” in Proc. Security and Cryptography for Networks (SCN), Springer, Sep., 2008, pp. 246–262
  5. T. J. Richardson, “Error floors of LDPC codes,” in Proc. Allerton Conf. Commun. Control Comput. (Allerton), Oct. 2003, pp. 1426–1435.
  6. X. Zhang and P. H. Siegel, “Quantized iterative message passing decoders with low error floor for LDPC codes,” IEEE Trans. Commun., vol. 62, no. 1, pp. 1–14, 2014.
  7. E. Nachmani, E. Marciano, L. Lugosch, W. J. Gross, D. Burshtein, and Y. Be’ery, “Deep learning methods for improved decoding of linear codes,” IEEE J. Sel. Topics Signal Process., vol. 12, no. 1, pp. 119–131, 2018.
  8. Y. Freund and R. E. Schapire, “A decision-theoretic generalization of on-line learning and an application to boosting,” J. Comput. Syst. Sci., vol. 55, no. 1, pp. 119–139, 1997.
  9. H. Hatami, D. G. M. Mitchell, D. J. Costello, and T. E. Fuja, “A threshold-based min-sum algorithm to lower the error floors of quantized LDPC decoders,” IEEE Trans. Commun., vol. 68, no. 4, pp. 2005–2015, Apr. 2020.
  10. S. Han, J. Oh, K. Oh, and J. Ha, “Deep-learning for breaking the trapping sets in low-density parity-check codes,” IEEE Trans. Commun., vol. 70, no. 5, pp. 2909–2923, May, 2022.
  11. H. Lee, Y.-S. Kil, M. Y. Chung, and S.-H. Kim, “Neural network aided impulsive perturbation decoding for short raptor-like LDPC codes,” IEEE Wireless Commun. Lett., vol. 11, no. 2, pp. 268–272, Feb. 2022.
  12. X. Glorot and Y. Bengio, “Understanding the difficulty of training deep feedforward neural networks,” in Proc. Int. Conf. Artif. Intell. Stat., 2010, pp. 249–256.
  13. L. Dolecek, P. Lee, Z. Zhang, V. Anantharam, B. Nikolic, and M. Wainwright, “Predicting error floors of structured LDPC codes: Deterministic bounds and estimates,” IEEE J. Sel. Areas Commun., vol. 27, no. 6, pp. 908–917, Jun. 2009.
  14. IEEE, “IEEE standard for local and metropolitan area networks-part 16: Air interface for fixed and mobile broadband wireless access systems amendment 2: Physical and medium access control layers for combined fixed and mobile operation in licensed bands and corrigendum 1,” IEEEStandard 802.16e, 2020.
  15. IEEE, “IEEE standard for information technology—telecommunications and information exchange between systems local and metropolitan area networks—specific requirements—part 11: Wireless lan medium access control (MAC) and physical layer (PHY) specification,” IEEE Standard 802.11, 2016.
  16. 3rd Generation Partnership Project, “Technical specification group radio access network; NR; multiplexing and channel coding (release 17) document ts 38.212 v17.5.0,” 2023.
  17. J. Chen, A. Dholakia, E. Eleftheriou, M. P. C. Fossorier, and X.-Y. Hu, “Reduced-complexity decoding of LDPC codes,” IEEE Trans. Commun., vol. 53, no. 8, pp. 1288–1299, 2005.
  18. J. Dai, K. Tan, Z. Si, K. Niu, M. Chen, H. V. Poor, and S. Cui, “Learning to decode protograph LDPC codes,” IEEE J. Sel. Areas Commun., vol. 39, no. 7, pp. 1983–1999, 2021.
  19. J. Rosseel, V. Mannoni, I. Fijalkow, and V. Savin, “Decoding short LDPC codes via BP-RNN diversity and reliability-based post-processing,” IEEE Trans. Commun., vol. 70, no. 12, pp. 7830–7842, 2022.
  20. Y. Choukroun and L. Wolf, “Error correction code transformer,” in Proc. Adv. Neural Inf. Process. Syst. (NeurIPS), vol. 35, 2022, pp. 38695–38705.
  21. G. Richter and A. Hof, “On a construction method of irregular LDPC codes without small stopping sets,” in Proc. IEEE Int. Conf. Commun., vol. 3, Jun. 2006, pp. 1119–1124.
  22. X. Jiao, J. Mu, J. Song, and L. Zhou, “Eliminating small stopping sets in irregular low-density parity-check codes,” IEEE Commun. Lett., vol. 13, no. 6, pp. 435–437, Jun. 2009.
  23. R. Asvadi, A. H. Banihashemi, and M. Ahmadian-Attari, “Lowering the error floor of LDPC codes using cyclic liftings,” IEEE Trans. Inf. Theory, vol. 57, no. 4, pp. 2213–2224, Apr. 2011.
  24. S. Naseri and A. H. Banihashemi, “Construction of Girth-8 QC-LDPC codes free of small trapping sets,” IEEE Commun. Lett., vol. 23, no. 11, pp. 1904–1908, Nov. 2019.
  25. B. Karimi and A. H. Banihashemi, “Construction of irregular protograph-based QC-LDPC codes with low error floor,” IEEE Trans. Commun., vol. 69, no. 1, pp. 3–18, Jan. 2021.
  26. W. R. Caid and R. W. Means, “Neural network error correcting decoders for block and convolutional codes,” in Proc. IEEE Global Telecommunications Conference and Exhibition (GLOBECOM), 1990, pp. 1028–1031.
  27. L. G. Tallini and P. Cull, “Neural nets for decoding error-correcting codes,” in Proc. IEEE Tech. Appl. Conf. Workshops, 1995, p. 89.
  28. T. Gruber, S. Cammerer, J. Hoydis, and S. ten Brink, “On deep learning-based channel decoding,” in Proc. Annu. Conf. Inf. Sci. Syst. (CISS), 2017, pp. 1–6.
  29. H. Lee, E. Y. Seo, H. Ju, and S.-H. Kim “On training neural network decoders of rate compatible polar codes via transfer learning” Entropy, vol. 22, no. 5, 2020.
  30. M. Lian, F. Carpi, C. Häger, and H. D. Pfister, “Learned belief-propagation decoding with simple scaling and SNR adaptation,” in Proc. IEEE Int. Symp. Inf. Theory (ISIT), 2019, pp. 161–165.
  31. X. Xiao, B. Vasic, R. Tandon, and S. Lin, “Designing finite alphabet iterative decoders of LDPC codes via recurrent quantized neural networks,” IEEE Trans. Commun., vol. 68, no. 7, pp. 3963–3974, 2020.
  32. X. Xiao, N. Raveendran, B. Vasic, S. Lin, and R. Tandon, “FAID diversity via neural networks,” in Proc. Int. Symp. Topics Coding (ISTC), 2021, pp. 1–5.
  33. N. Shah and Y. Vasavada, “Neural layered decoding of 5G LDPC codes,” IEEE Commun. Lett., vol. 25, no. 11, pp. 3590–3593, 2021.
  34. E. Nachmani and L. Wolf, “Hyper-graph-network decoders for block codes,” in Proc. Adv. Neural Inf. Process. Syst. (NeurIPS), vol. 32, 2019.
  35. I. Be’ery, N. Raviv, T. Raviv, and Y. Be’ery, “Active deep decoding of linear codes,” IEEE Trans. Commun., vol. 68, no. 2, pp. 728–736, 2020.
  36. E. Nachmani and Y. Be’ery, “Neural decoding with optimization of node activations,” IEEE Commun. Lett., vol. 26, no. 11, pp. 2527–2531, 2022.
  37. M. P. C. Fossorier, “Quasi cyclic low-density parity-check codes from circulant permutation matrices,” IEEE trans. Inf. Theory, vol. 50, no. 8, pp. 1788–1793, 2004.
  38. J. Thorpe, “Low-density parity-check (LDPC) codes constructed from protographs,” IPN progress report, vol. 42, no. 154, pp. 42–154, 2003.
  39. X. Wu, Y. Song, M. Jiang, and C. Zhao, “Adaptive-normalized/offset min-sum algorithm,” IEEE Commun. Lett., vol. 14, no. 7, pp. 667–669, 2010.
  40. D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv preprint arXiv:1412.6980, 2014.
  41. H. Gamage, N. Rajatheva, and M. Latva-Aho, “Channel coding for enhanced mobile broadband communication in 5G systems,” in Proc. Eur. Conf. Netw. Commun. (EuCNC), 2017, pp. 1–6.

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now