350 rub
Journal Science Intensive Technologies №8 for 2011 г.
Article in number:
Bidirectional searching of the shortest ways in the fragments transition graph of continuous correcting codes
Authors:
A.P. Ratoushin, Е.V. Rachinsky
Abstract:
Gradual thickening of correcting code designs of satellite communication systems signals does actual a problem of modernisation their technical analysis automated means spent in the conditions of a priori uncertainty. In the conditions of erroneous discrete sequence symbols presence there is priority use of statistical analysis methods. The existing approach to detection and parametres definition of such continuous codes as convolution codes and convolution turbocodes, using construction of the finite oriented fragments transition graph of a code for restoration of its parametres, possesses the raised computing complexity. In paper principles of graph construction are described and the method of bidirectional search of the shortest ways in the graph is presented, ensuring reduction of computing expenditures at restoration of a code generating matrix. Use of the offered method allows to reduce temporary expenditures to the engineering analysis of discrete sequences with continuous coding.
Pages: 23-26
References
  1. Вернер М. Основы кодирования: Учебник для вузов: пер. с нем. Д.К. Зигангирова.М.: Техносфера. 2004.
  2. Ратушин А.П., Рачинский Е.В. Обнаружение и идентификация сверточных турбокодов с учетом закономерностей распределения символов кодированной последовательности // Наукоемкие технологии. 2009. №1. Т. 10. C. 14-17.
  3. Ратушин А.П., Дианов С.В., Тамп В.Л.Модифицированный способ аналитического описания сверточного кода // Наукоемкие технологии. 2008. № 4.Т. 9. C.10 - 11.
  4. Фомин Я.А., Тарловский Г.Р. Статистическая теория распознавания образов. М.: Радиоисвязь. 1986.