Please use this identifier to cite or link to this item:
http://lib.kart.edu.ua/handle/123456789/4772
Full metadata record
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Штомпель, Николай Анатольевич | - |
dc.contributor.author | Shtompel, М. | - |
dc.date.accessioned | 2020-12-03T17:55:56Z | - |
dc.date.available | 2020-12-03T17:55:56Z | - |
dc.date.issued | 2016 | - |
dc.identifier.citation | Штомпель Н. А. Адаптивное декодирование алгебраических сверточных кодов перемежения / Н. А. Штомпель // Інформаційно-керуючі системи на залізничному транспорті. - 2016. - № 6. - С. 18-22. | uk_UA |
dc.identifier.issn | 1681-4886 (рrint); 2413-3833 (online) | - |
dc.identifier.uri | http://lib.kart.edu.ua/handle/123456789/4772 | - |
dc.description.abstract | RU: Обоснована целесообразность применения алгебраических сверточных кодов перемежения для увеличения достоверности передачи информации в каналах с памятью. Предложен метод итеративного декодирования данных кодов на основе комбинированного подхода с использованием процедур адаптивного распространения доверия и природных вычислений. Представлены основные принципы реализации основных этапов предложенного метода декодирования. | uk_UA |
dc.description.abstract | EN: For correcting burst errors in channels with memory are widely used various code constructions together with interleaving. For increasing the reliability of information transmission in such channels is advisable to apply algebraic interleaved convolutional codes. The principles of polynomial and matrix representation of algebraic interleaved convolutional codes with predetermined coding rate are given. The parameters of these codes which completely determined by the modified generator polynomial are presented. Algebraic decoding these codes has been a large computational complexity and limited correction capability. Algebraic interleaved convolutional codes can be represented as a long binary block codes which can be determined with using generator or parity check matrix. The combination approach to iterative decoding these codes whose purpose is to find the most probable codeword by assessing a log likelihood ratio of each code symbol is proposed. The share using information about the reliability of symbols, adaptive belief propagation and natural computing procedures are offered. According to this approach each iteration of decoding starts with finding the expected codeword using natural computing procedures. If the received vector is not codeword, then adaptive belief propagation procedures are used for updating the information about the reliability of symbols which then used in the next iteration of decoding. The basic principles of implementation of the main steps of the proposed method decoding algebraic interleaving convolution codes are presented. | - |
dc.publisher | Український державний університет залізничного транспорту | uk_UA |
dc.subject | адаптивное декодирование | uk_UA |
dc.subject | сверточные коды | uk_UA |
dc.subject | перемежение | uk_UA |
dc.subject | природные вычисления | uk_UA |
dc.subject | адаптивне декодування | uk_UA |
dc.subject | згорткові коди | uk_UA |
dc.subject | перемежування | uk_UA |
dc.subject | природні обчислення | uk_UA |
dc.subject | adaptive decoding | uk_UA |
dc.subject | convolutional codes | uk_UA |
dc.subject | interleaving | uk_UA |
dc.subject | natural computing | uk_UA |
dc.title | Адаптивное декодирование алгебраических сверточных кодов перемежения | uk_UA |
dc.title.alternative | Adaptive decoding algebraic interleaved convolutional codes. | uk_UA |
dc.type | Article | uk_UA |
Appears in Collections: | № 6 |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Shtompel.pdf | 137.08 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.