M.M. Matushin1, A.Yu. Kutomanov2, O.V. Rudakova3, A.A. Sidorenko4, Yu.A. Konysheva5

1-3 JSC "TsNIIMash" (Korolev, Moscow Region, Russia)

4,5 RTU MIREA (Moscow, Russia)

1mccm@mcc.rsa.ru, 2kutomanov@mcc.rsa.ru, 3rudakovaov@mcc.rsa.ru, 4sidorenko_a@mirea.ru, 5konysheva@mirea.ru

To correct errors that occur in digital communication systems when information passes through data transmission channels, error-correcting codes are used. Among the best codes, according to the criterion of error-correcting capability, are turbo codes. The sequence at the output of a turbo code encoder consists of a block of information bits and several blocks of check bits. In a turbo code decoder, the block of information bits participates in the formation of several codewords simultaneously. The values of the information bits at the input of the decoder have a more significant impact on the decoding result than the values of the check bits; therefore, errors occurring in the information bits are more likely to lead to incorrect decoding of the codeword than errors in the check bits. This allows us to put forward the hypothesis that reducing the influence of information bit values on the decoding result will increase the efficiency of the turbo code. Aim of article – development and experimental verification of the effectiveness of a method for increasing the efficiency of a turbo code by reducing the decoder's sensitivity to the values of information bits.

A method for increasing the efficiency of turbo code decoding based on reducing the decoder's sensitivity to the values of information bits is proposed. The efficiency of turbo code decoding was evaluated according to the Maximum a Posteriori (MAP) decoding algorithm. The studies used versions of turbo code construction based on systematic convolutional codes and systematic block codes with parallel decoder decoding. A method of artificially reducing the decoder's sensitivity to the values of information bits by multiplying them by a decreasing coefficient K3<1 is proposed. Multiplying the values of information bits by K3<1 led to a decrease in the probability of an erroneous bit appearing in the decoded information message, which confirmed the proposed hypothesis. The effect increased with a decrease in the probability of an erroneous bit appearing in the data transmission channel. The statistical significance of the differences in the experimental results was proven using the interval estimation method.

An effective method for improving the error-correcting capability of a turbo code, developed and tested based on decoding with the MAP algorithm, which has low computational complexity.

Matushin M.M., Kutomanov A.Yu., Rudakova O.V., Sidorenko A.A., Konysheva Yu.A. Improving efficiency of turbo code decoding by reducing the decoder's sensitivity to information bit values // Information-measuring and Control Systems. 2026. V. 24. № 3. P. 67−75. DOI: https://doi.org/10.18127/j20700814-202603-07

1. Adzhemov A.S., Sannikov V.G. Obshchaya teoriya svyazi: Uchebnik dlya vuzov. M.: Goryachaya liniya – Telekom. 2023. 624 s. (in Russian)
2. Vasilev K.K., Glushkov V.A., Nesterenko A.G. Teoriya elektricheskoi svyazi. Vologda: Infra-Inzheneriya. 2021. 468 s. (in Russian)
3. Shennon K.E. Matematicheskaya teoriya svyazi. M.: Inostrannaya literatura. 1963. 830 s. (in Russian)
4. Kudryashev B.D. Osnovy teorii kodirovaniya: Ucheb. posobie. SPb.: BKhV-Peterburg. 2016. 400 s. (in Russian)
5. Zolotorev V.V. Kodirovanie dlya tsifrovoi svyazi i sistem pamyati: monografiya. M.: Goryachaya liniya – Telekom. 2023. 192 s. (in Russian)
6. Varguzin V.A., Tsikin I.A. Metody povysheniya energeticheskoi i spektralnoi effektivnosti tsifrovoi radiosvyazi. SPb.: BKhV-Peterburg. 2013. 352 s. (in Russian)
7. Golikov A.M. Modulyatsiya, kodirovanie i modelirovanie v telekommunikatsionnykh sistemakh. Teoriya i praktika: Ucheb. posobie dlya vuzov. SPb.: Lan. 2022. 452 s. (in Russian)
8. Sklyar B. Tsifrovaya svyaz. Teoreticheskie osnovy i prakticheskoe primenenie. Per s angl. M.: Vilyams. 2016. 1104 s. (in Russian)
9. Morelos-Saragosa R. Iskusstvo pomekhoustoichivogo kodirovaniya. Metody, algoritmy, primenenie: Per s angl. M.: Tekhnosfera. 2006. 319 s. (in Russian)
10. Berezkin E.F. Osnovy teorii kodirovaniya: uchebnoe posobie. SPb.: Lan. 2019. 320 s. (in Russian)
11. Sidorenko A.A. Overview of the International Conference on Applied Physics, Information Technologies and Engineering APITECH III 2021. Journal of Physics: Conference Series. 2021. V. 2094(1). P. 032061(1−9) doi:10.1088/1742-6596/2094/3/032061.
12. Sidorenko A.A. Otsenka effektivnosti turbokoda, postroennogo na osnove blochnogo koda, pri dekodirovanii v sootvetstvii s kriteriem maksimuma aposteriornoi veroyatnosti. Sistemy upravleniya, svyazi i bezopasnosti. 2023. № 3. S. 29−43. (in Russian)
13. Sidorenko A.A. Programmnyi trenazher issledovaniya effektivnosti turbokoda s izmenyaemymi koeffitsientami znachimosti dekodiruemykh simvolov. Svidetelstvo o gosudarstvennoi registratsii programmy dlya EVM. № 2023619022. 2023. (in Russian)
14. Sidorenko A.A. Programmnyi trenazher issledovaniya effektivnosti turbokoda, postroennogo na osnove koda Khemminga. Svidetelstvo o gosudarstvennoi registratsii programmy dlya EVM. № 2023614197. 2023. (in Russian)
15. Koltsov D.M. Python. Polnoe rukovodstvo. M.: Nauka i tekhnika. 2022. 480 s. (in Russian)
16. Nunes-Iglesias Kh., Uolt Sh., Deshnou Kh. Elegantnyi SciPy: Per s angl. DMK Press. 2018. 266 s. (in Russian)
17. Konyshev M.Yu., Barabashov A.Yu., Lukyanchenkova N.E., Nadezhin A.V. Metod upravleniya vychislitelnym eksperimentom po otsenke kachestva dekoderov pomekhoustoichivykh kodov. Telekommunikatsii. 2018. № 10. S. 2−8. (in Russian)
18. Venttsel E.S. Teoriya veroyatnostei: uchebnik. M.: Vysshaya shkola. 2006. 575 s. (in Russian)