Кафедри
Постійне посилання на розділhttps://repository.kpi.kharkov.ua/handle/KhPI-Press/35393
Переглянути
1 результатів
Результати пошуку
Документ Analysis of efficiency of the bioinspired method for decoding algebraic convolutional codes(Технологический центр, 2019) Panchenko, Sergii; Prykhodko, Sergii; Kozelkov, Sergii; Shtompel, Mykola; Kosenko, Viktor; Shefer, Oleksandr; Dunaievska, О. I.It has been shown that convolutional codes are widely used, along with various decoding methods, to improve the reliability of information transmission in wireless telecommunication systems. The general principles of synthesis and the parameters and algebraic non-systematic convolutional codes with arbitrary coding rate and maximum achievable code distance have been shown. The basic stages of the bioinspired method for decoding algebraic convolutional codes using a random shift mechanism have been presented. It has been shown that the essence of the presented decoding method implies applying the procedure of differential evolution with the heuristically determined parameters. In addition, this method uses information about the reliability of the adopted symbols to find the most reliable basis for the generalized generator matrix. The mechanism of random shift for the modification of the accepted sequence is additionally applied for the bioinspired search based on various most reliable bases of a generalized generator matrix. The research results established that the bioinspired method for decoding algebraic convolutional codes ensures greater efficiency compared with the algebraic decoding method in the communication channel with additive white Gaussian noise. Depending on the parameters of the algebraic convolutional code and the necessary error coefficient, the energy gain from encoding ranges from 1.6 dB to 3 dB. It was shown that the presented bioinspired decoding method can be used for convolutional codes with a large code constraint length. In doing so, the presented method for decoding algebraic convolutional codes is less efficient than the Viterbi decoding method and turbo codes at a sufficient number of decoding iterations.