I.A. Kiryanov1, K.V. Lushenkov2, M.V. Nepomnyashchikh3, P.A. Pashov4

1,2 PJSC NPO Almaz (Moscow, Russia)

3,4 Ministry of Defense (Znamensk, Russia)

1 cucutnog@bk.ru; 2 konstlush@gmail.com; 3 24NVS1@rambler.ru; 4 pasha_pashov966@mail.ru

The procedure for encoding information with a block turbo code is reduced to a simple matrix multiplication of the row matrix, which is an information sequence that needs to be transmitted over a communication channel, by the generating matrix of the block turbo code, which is built on the basis of Hamming codes or BCH codes.

Due to the fact that this is a matrix multiplication, the dimension of the information message must strictly correspond to the dimension of the matrix, which complicates the encoding of messages of arbitrary length. To solve this problem, the information sequence is supplemented to the required size with bits that do not carry useful information. Such bits are not transmitted over the air, but are involved in calculations during encoding and decoding.

In modern technology, universal schemes for supplementing an information sequence with bits that do not carry a payload have been adopted, giving predictable code characteristics over a wide range of encoded message lengths. However, if the length of the information sequence is fixed and does not change throughout the life cycle of a digital communication line, it is possible to choose an alternative complement scheme that provides an energy gain compared to known solutions.

In this paper, various schemes are proposed for supplementing the information sequence with bits that do not carry a payload. Despite the fact that the presented scheme options were chosen based on engineering experience, for the best of them, the article provides a rigorous mathematical description and justification.

To evaluate the effectiveness of the considered schemes, a communication line model was developed and verified based on known results. The article provides a detailed description of it. The model includes an encoder, a decoder, a modulator, a demodulator, as well as a simulator of a data transmission channel with white Gaussian noise. When planning experiments on the simulation model, the required sample size was taken into account to evaluate the results with the required accuracy.

The research presented in the article shows the effectiveness of schemes for supplementing information sequences that are close to pseudo-random in comparison with regular constructions.

The results of the above studies for a specific length of the information sequence can be scaled to any length and design of block turbo codes.

Kiryanov I.A., Lushenkov K.V., Nepomnyashchikh M.V., Pashov P.A. Block turbo coding of arbitrary length information. Radiotekhnika. 2025. V. 89. №6. P. 126−134. DOI: https://doi.org/10.18127/j00338486-202506-12 (In Russian)

1. Moon T.K., Error correction coding. Mathematical Methods and Algorithms, Wiley-Interscience, 2005, 800p.
2. Kir'janov I.A. Dekodirovanie kodov s maloj plotnost'ju proverok na chetnost': Avtorf. diss. … kand. tehn. nauk. M. 2015 (in Russian).
3. Arhipkin A.V. Razrabotka algoritmov kodirovanija i dekodirovanija dlja telekommunikacionnyh sistem radiosvjazi s ortogonal'nymi podnesushhimi: Avtorf. diss. … kand. tehn. nauk. M. 2008 (in Russian).
4. Klark Dzh., Kejn D. Kodirovanie s ispravleniem oshibok v sistemah cifrovoj svjazi. M.: Radio i svjaz'. 391 s. (in Russian).
5. Ovechkin G.V. Primenenie Min-sum algoritma dlja dekodirovanija blokovyh samoortagonal'nyh kodov. Mezhvuz. sb. nauch. trudov «Matematicheskoe i programmnoe obespechenie vychislitel'nyh sistem». M.: Gorjachaja linija – Telekom. 2010. S. 99–105 (in Russian).
6. Nazarov L.E., Shishkin P.V. Harakteristiki pomehoustojchivyh ukorochennyh blokovyh turbo-kodov iterativnogo priema informacii. Informacionnye tehnologii. 2018. T. 10. № 2. S. 323-328 (in Russian).
7. Pyndtah R.M. Near-Optimum decoding of product codes block turbo codes. IEEE transactions on communication. 1998. V. 46. № 8. Р. 1003-1010.
8. Sovetov B.Ja., Jakovlev S.A. Modelirovanie sistem: Ucheb. dlja vuzov. Izd. 3-e, pererab. i dop. M: Vysshaja shkola. 2001. 343 s.
9. Skljar B. Cifrovaja svjaz'. Teoreticheskie osnovy i prakticheskoe primenenie: Per. s angl. Izd. 2-e, ispr. M.: ID «Vil'jams». 2003. 1104 s. (in Russian).
10. Morelos-Saragosa R. Iskusstvo pomehoustojchivogo kodirovanija. Metody, algoritmy, primenenie. M.: Tehnosfera. 2005. 320 s. (in Russian).