Hybrid Machine Learning Framework for Joint Prediction of Window Mean and Bit Error Rate in SC-LDPC Decoding

Authors

  • Tanzeela Bibi Nanjing University of Information Science and Technology, China
  • Hua Zhou Institute of Communication Engineering, China
  • Sana Akbar Nanjing University of Information Science and Technology, China
  • Lalit Awasthi Nanjing University of Information Science and Technology, China

DOI:

https://doi.org/10.64539/sjer.v2i1.2026.364

Keywords:

Hybrid Machine Learning, SC-LDPC Codes, Windowed Decoding (WD), Random Forest Regressor (RFR), Joint Prediction, Bit Error Rate (BER), Decoding Complexity, Window Mean (W_MEAN), Surrogate Modeling

Abstract

Modern low-latency communication systems increasingly rely on spatially coupled low-density parity-check (SC-LDPC) codes combined with windowed decoding (WD) to achieve high reliability with reduced latency and memory requirements. However, evaluating the intrinsic trade-off between decoding complexity and error performance typically measured by the average window iteration count (WMEAN) and bit error rate (BER) still depends on computationally intensive Monte Carlo simulations, which limits rapid system optimization and real-time design exploration. To address this limitation, this paper proposes a hybrid machine learning framework for the joint, non-iterative prediction of WMEAN and BER using a single set of code and channel parameters. A high-fidelity dataset is generated through extensive SC-LDPC windowed decoding simulations across varying window sizes, coupling lengths, and signal-to-noise ratio (SNR) conditions. Based on this dataset, a multi-output Random Forest Regressor is trained to exploit the shared underlying decoding dynamics that govern both computational complexity and decoding reliability. The proposed model achieves accurate simultaneous prediction of WMEAN and BER, demonstrating strong generalization performance while significantly reducing system evaluation time compared to conventional simulation-based approaches. Feature-importance analysis further reveals the dominant influence of channel quality and coupling structure on both decoding effort and error performance. These results indicate that the proposed framework provides an effective surrogate modeling tool for fast design-space exploration and informed performance–complexity trade-off analysis. The methodology enables practical optimization of high-throughput SC-LDPC decoders and supports the development of adaptive and resource-efficient communication systems.

References

[1] R. Gallager, “Low-Density Parity-Check Codes”. IRE Transactions on Information Theory, vol. 8, no. 1, pp. 21-28, 1962. https://doi.org/10.1109/TIT.1962.1057683.

[2] C. E. Shannon, “A mathematical theory of communication,” The Bell System Technical Jour-nal, vol. 27, no. 3, pp. 379–423, Jul. 1948. https://doi.org/10.1002/j.1538-7305.1948.tb01338.x.

[3] W. Wei, T. Koike-Akino, D. G. M. Mitchell, T. E. Fuja, and D. J. Costello, “Threshold analysis of non-binary spatially coupled LDPC codes with windowed decoding,” in IEEE Interna-tional Symposium on Information Theory, 2014. https://doi.org/10.1109/ISIT.2014.6874959.

[4] M. Lentmaier, A. Sridharan, D. J. Costello, and K. S. Zigangirov, “Iterative decoding thresh-old analysis for LDPC convolutional codes,” IEEE Transactions on Information Theory, vol. 56, no. 10, pp. 5274 - 5289, 2010. https://doi.org/10.1109/TIT.2010.2059490.

[5] M. Wei, D. G. M. Mitchell, T. E. Fuja, and D. J. Costello, “Design of spatially coupled LDPC codes over GF(q) for windowed decoding,” IEEE Transactions on Information Theory, vol. 62, no. 9, pp. 4781–4800, 2016. https://doi.org/10.1109/TIT.2016.2567638.

[6] M. Herrmann and N. Wehn, “Beyond 100 Gbit/s pipeline decoders for spatially coupled LDPC codes,” EURASIP Journal on Wireless Communications and Networking, vol. 90, pp. 1–15, 2022. https://doi.org/10.1186/s13638-022-02169-5.

[7] E. Ram and Y. Cassuto, “On the decoding performance of spatially coupled LDPC codes with subblock access,” IEEE Transactions on Information Theory, vol. 66, no. 6, 2022. https://doi.org/10.1109/TIT.2022.3152104.

[8] I. Sason and G. Wiechman, “Performance versus complexity per iteration for low-density parity-check codes: An information-theoretic approach,” in 4th International Symposium on Turbo Codes & Related Topics; 6th International ITG-Conference on Source and Channel Coding, 2006. https://ieeexplore.ieee.org/abstract/document/5755847.

[9] Z. Xu and B. Hassibi, “On the Complexity of Exact Maximum-Likelihood Decoding for As-ymptotically Good Low Density Parity Check Codes: A New Perspective,” in IEEE Infor-mation Theory Workshop, 2007. https://doi.org/10.1109/ITW.2007.4313065.

[10] A. R. Iyengar, P. H. Siegel, R. L. Urbanke, and J. K. Wolf, “Windowed decoding of spatially coupled codes,” in IEEE International Symposium on Information Theory Proceedings, St. Pe-tersburg, Russia, 2011. https://doi.org/10.1109/ISIT.2011.6034029.

[11] Z. Peng and R. Yang, “Performance and Complexity Trade-Off between Short-Length Regu-lar and Irregular LDPC,” Journal of Computer and Communications, vol. 12, no. 9, pp. 208-215, 2024. https://doi.org/10.4236/jcc.2024.129012.

[12] K. Klaiber, S. Cammerer, L. Schmalen, and S. ten Brink, “Avoiding burst-like error patterns in windowed decoding of spatially coupled LDPC codes,” in IEEE 10th International Sym-posium on Turbo Codes & Iterative Information Processing (ISTC), 2018. https://doi.org/10.1109/ISTC.2018.8625312.

[13] P. Kang, Y. Xie, L. Yang, and J. Yuan, “Reliability-based windowed decoding for spatially coupled LDPC codes,” IEEE Communications Letters, vol. 22, no. 7, pp. 1322–1325, 2018. https://doi.org/10.1109/LCOMM.2018.2835466.

[14] C. A. Cole, S. G. Wilson, E. K. Hall, and T. R. Giallorenzi, “A general method for finding low error rates of LDPC codes,” arXiv preprint arXiv:cs/0605051, 2006. https://doi.org/10.48550/arXiv.cs/0605051.

[15] I. E. Bocharova, B. D. Kudryashov, V. Skachek, E. Rosnes, and Ø. Ytrehus, “LDPC Codes Over the BEC: Bounds and Decoding Algorithms,” IEEE Transactions on Communications, vol. 67, no. 3, pp. 1754 – 1769, 2019. https://doi.org/10.1109/TCOMM.2018.2879107.

[16] S. Habib, A. Beemer, J. Kliewer, “Learning to Decode: Reinforcement Learning for Decoding of Sparse Graph-Based Channel Codes,” arXiv preprint arXiv:2010.05637, 2020. https://doi.org/10.48550/arXiv.2010.05637.

[17] H.-Y. Wang, Z.-X. Wang, and S. Shang, “An Improved Low-Density Parity-Check Decoder and Its Field-Programmable Gate Array Implementation,” Applied Science, vol. 14, no. 12, pp. 1-16, 2022. https://doi.org/10.3390/app14125162.

[18] I. E. Bocharova, B. D. Kudryashov, V. Skachek, and Y. Yakimenka, “BP-LED decoding algo-rithm for LDPC codes over AWGN channels,” IEEE Transactions on Information Theory, vol. 65, no. 3, pp. 1677–1693, 2019. https://doi.org/10.1109/TIT.2018.2866879.

[19] A. Hasani, L. Lopacinski, and R. Kraemer, “Reduced-complexity decoding implementation of QC-LDPC codes with modified shuffling,” EURASIP Journal on Wireless Communications and Networking, vol. 2021, no. 1, pp. 1–13, 2021. https://doi.org/10.1186/s13638-021-02056-5.

[20] P. Rybin, K. Andreev, and V. Zyablov, “Error exponents of LDPC codes under low-complexity decoding,” Entropy, vol. 23, no. 2, 2021. https://doi.org/10.3390/e23020253.

[21] S. Haddadi, M. Farhang, and M. Derakhtian, “Low-complexity decoding of LDPC codes using reduced-set WBF-based algorithms,” EURASIP Journal on Wireless Communications and Networking, vol. 2020, no. 1, pp. 1–14, 2020. https://doi.org/10.1186/s13638-020-01791-5.

[22] L. Deng, K. Tao, Z. Shi, Y. Zhang, Y. Shi, J. Wang, T. Liu, Y. Wang, “Optimized generalized LDPC convolutional codes,” Entropy, vol. 27, no. 9, 2025. https://doi.org/10.3390/e27090930.

[23] Q.-F. Lian, Q. Chen, L. Zhou, Y.-C. He, and X. Xie., “Adaptive decoding algorithm with vari-able sliding window for double SC-LDPC coding systems,” IEEE Communications Letters, vol. 27. no. 2, pp. 404-408, 2023. https://doi.org/10.1109/LCOMM.2022.3222560.

[24] N. U. Hassan, A. E. Pusane, M. Lentmaier, G. P. Fettweis, and D. J. Costello, “Non-uniform window decoding schedules for spatially coupled LDPC codes,” IEEE Transactions on Communications, vol. 65, no. 2, pp. 501 – 510, 2017. https://doi.org/10.1109/TCOMM.2016.2633466.

[25] L. Awasthi and E. Danso, “Robust Positive-Unlabeled Learning via Bounded Loss Func-tions under Label Noise,” Scientific Journal of Engineering Research, vol. 1, no. 3, pp. 140–152, 2025. https://doi.org/10.64539/sjer.v1i3.2025.314.

Downloads

Published

2026-01-11

How to Cite

Bibi, T., Zhou, H., Akbar, S., & Awasthi, L. (2026). Hybrid Machine Learning Framework for Joint Prediction of Window Mean and Bit Error Rate in SC-LDPC Decoding. Scientific Journal of Engineering Research, 2(1), 33–49. https://doi.org/10.64539/sjer.v2i1.2026.364

Similar Articles

1 2 3 > >> 

You may also start an advanced similarity search for this article.