Decoding forward error correction code in a priori uncertainty

The purpose of research is to increase the efficiency of decoding noise–resistant block codes in conditions of a priori uncertainty about the parameters used.

Methods. In modern systems, the use of noise-resistant block codes with a large codeword length is noted, which allows the permitted code combinations to be sufficiently far apart from each other during encoding and to obtain, during iterative decoding, the possibility of their correct determination at low values of the signal-to-noise ratio in the communication channel. The use of long noise-tolerant codes requires a reduction in the complexity of error correction algorithms, which is estimated by the number of operations of various types per decoding iteration. The number of operations of various types will depend on the parameters of the code and the verification matrix, as well as the decoding algorithm used. The practical implementation of the decoder has a number of limitations, and its design is a difficult task, especially in conditions of a priori uncertainty about the applied code parameters. To solve this problem, it is proposed to use the method of determining the applied LBC verification matrix based on the analysis of the received digital sequence.

Results. In the course of the study, a comparative analysis of known methods for determining the parameters of an interference-resistant block code was carried out and a modification of the Gauss method was proposed to solve a system of linear algebraic equations when finding the LBC verification matrix.

Conclusion. The proposed method avoids performing a strict sequence of actions according to the well-known Gauss method, as well as reducing time complexity by paralleling calculations and significantly increasing the efficiency of practical implementation of the algorithm for finding the LBC verification matrix.

1. Abdel Halim A. Zikry, Ashraf Y. Hassan, Wageeda I. Shaban, Sahar F. Abdel-Momen Performance Analysis of LDPC Decoding Techniques. International Journal of Recent Technology and Engineering (IJRTE). 2021;9:17‒26.

2. Kolomensky K.Y., Demidova A.Y., Kazarinov A.S. From DVB-S to DVB-S2X: Progress in Standardization of Digital Satellite Broadcasting Systems. Journal of the Russian Universities. Radioelectronics. 2024;27(2):68–78. https://doi.org/10.32603/1993-8985-2024-27-2-68-78

3. Shuang S., Biju I. Analysis of WiFi and WiMAX and Wireless Network Coexistence. International Journal of Computer Networks and Communications (IJCNC). 2014;6(6):63– 78. https://doi.org/10.5121/ijcnc.2014.6605

4. Stepanets I., Odoevskii S. Model of microwave link channel with adaptive modulation under the fading conditions. E3S Web of Conferences. 2022;351:01064. https://doi.org/10.1051/e3sconf/202235101064

5. CCSDS protocols over DVBS2 – Summary of DVB-S2 summary of definition, implementation, and performance. Washington: Geen Book; 2023. 56 p.

6. Zhou F., Niu L., Tian B. Performance analysis of LDPC decoding algorithm. Journal of Physics. Conference Series. 2020;(1453):012026. https://doi.org/10.1088/1742-6596/1453/1/012026

7. Lulu A., Hudrouss A. A. LDPC Construction using Randomly Permutated Copies of Parity Check Matrix. An-Najah University Journal for Research. 2018;(32):1544. https://doi.org/10.35552/anujr.a.32.1.1544

8. Guan Wu., Liping L. Check-Belief Propagation Decoding of LDPC Codes. IEEE Transactions on Communications. 2023;71:6849–6858. https://doi.org/10.1109/TCOMM.2023.3308155

9. Pinyoanuntapong K., Goswami M., Habib A. B., Kwon H. M., Pham K. Boundaries of signal-to-noise ratio for adaptive code modulations. In: IEEE Military Communications Conference. Baltimore, MD, USA; 2016. P. 132–137.

10. Karimian Y., Ziapour S., Ahmadian-Attari M. Parity Check Matrix Recognition from Noisy Codewords. Available at: https://arxiv.org/abs/1205.4641 (accessed 11.09.2024).

11. Digital Video Broadcasting (DVB); Second generation framing structure, channel coding and modulation systems for Broadcasting, Interactive Services, News Gathering and other broadband satellite applications; Part 1: DVB-S2. Sophia Antipolis Cedex, 2014. 80 p.

12. Zhu H., Fu M., Hou C., Hu G. Low-complexity LDPC decoding algorithms for ultrahigh-order modulated signals. Optics Express. 2023;31:41645–41657. https://doi.org/10.1364/OE.507292

13. Le Gal B., Jego C., Pignoly V. High-performance hard-input LDPC decoding on multi-core devices for optical space links. Journal of Systems Architecture. 2023;137:102832. https://doi.org/10.1016/j.sysarc.2023.102832

14. Zolotarev V.V. Coding Theory as a Simple Optimal Decoding near Shannon's Bound. Optimization Theory of error-correcting coding is a new &quantum mechanics of information theory. Moscow: Hot Line Telecom; 2018. 334 p.

15. Pin H., Wang J., Weng I., Lee Tofar T., Chang C.-Y. Belief-Propagation Decoding of LDPC Codes with Variable Node-Centric Dynamic Schedules. IEEE Transactions on Communications. 2021;69:5014–5027. https://doi.org/10.1109/TCOMM.2021.3078776

16. Dietzfelbinger M., Walzer S. Constant-time retrieval with O(log m) extra bits. In: 36th International Symposium on Theoretical Aspects of Computer Science (STACS 2019). Dagstuhl, Germany: Dagstuhl Publishing; 2019. P. 24:1–24

17. An FPGA-Based LDPC Decoder with Ultra-Long Codes for Continuous-Variable Quantum Key Distribution / S. Yang, J-Q. Liu, Z-Q. Lu, Z-L. Bai, X. Wang, Y. Li. IEEE Access. 2021;9:47687–47697. https://doi.org/10.1109/ACCESS.2021.3065776

18. Wang P., Liang Y., Lipo G., Peng Cheng W. Fast Blind Recovery of Linear Block Codes over Noisy Channels. Available at: https://arxiv.org/abs/2305.04190 (accessed 16.09.2024).

19. Dai J., Yin H., Xu N., Yang P. Multi-Gbps LDPC Decoder on GPU Devices. Electronics. 2022;11(21):3447. https://doi.org/10.3390/electronics11213447

20. Maier B. Cockburn. Optimization of Low-Density Parity Check decoder performance for OpenCL designs synthesized to FPGAs. Journal of Parallel and Distributed Computing. 2017;(107):1. https://doi.org/10.1016/j.jpdc.2017.04.001

21. Saeed M., Nisar S., Razzaq S., Masood R. Gaussian Elimination Method-A Study of Applications. Global Journal of Science Frontier Research: Mathematics and Decision Sciences. 2021;13. https://doi.org/10.1109/LES.2021.3052714

22. Albrecht M.R., Pernet C. Efficient Decomposition of Dense Matrices over GF(2). URL: https://arxiv.org/abs/1006.1744/ (accessed 17.09.2010).

23. Sudrastawa P.A., Parwata A. Conceptual and Practical Review of Gaussian Elimination and Gauss-Jordan Reduction. Jurnal Ilmu Komputer Indonesia. 2022;7(2):19–25.

24. Awatif M., Elsiddieg A. Implementation of Gaussian-Elimination. International Journal of Innovative Technology and Exploring Engineering (IJITEE). 2016;5(11):7–20.

25. Karimi‐Lenji A., Houshmand M., Zarmehi F. A high‐performance belief propagation decoding algorithm for codes with short cycle. International Journal of Communication Systems. 2017;30. https://doi.org/10.1002/dac.3275

26. Sharma F., Rajesh Pillai N. Blind recognition of parameters of linear block codes from intercepted bit stream. In: 2016 International Conference on Computing, Communication and Automation (ICCCA). Greater Noida, India: IEEE; 2016. https://doi.org/10.1109/CCAA.2016.7813910

27. Carrier K., Tillich J.-P. Identifying an unknown code by partial Gaussian elimination. Designs, Codes and Cryptography. 2019;87:685–713. https://doi.org/10.1007/s10623-018-00593-7

28. Donovan D.M., Rao A., Uskuplu E., Yazici E. QC-LDPC Codes from Difference Matrices and Difference Covering Arrays. IEEE Access. 2023;11:52141–52157. https://doi.org/10.1109/ACCESS.2023.3279327

29. Yu Hanqi Peng P.-D., Gong K.-X., Chen Z.-L. LDPC code reconstruction based on algorithm of finding low weight code-words. IEEE Access. 2017;38:108–117. https://doi.org/10.11959/j.issn.1000-436x.2017116