The redundancy of telemetric information significantly complicates the real-time processing of the information flows. To speed up the telemetry processing process, the methods for telemetric information redundancy reduction should be applied in order to reduce its flows entering the monitoring systems while maintaining a high speed of processing and reliability of the information. The article provides an overview of the methods for reduction of telemetric information redundancy, such as the increase in PHY-rate of telemetry channel, the Huffman algorithm, the batch mechanism for generation and transmission of telemetry information, the adaptive difference algorithm, the algorithm for transmission of the information based on its representation by residual images, Golomb-Rice codes, reversible compression method. The advantages and disadvantages of each of them are considered. Recommendations on the use of multi-level telemetry information compression system are given, which makes it possible to effectively combine target data compression algorithms that give the highest compression ratio depending on the type of telemetry information transmitted.

No abstract

No abstract

1 Краснодарское высшее военное училище им. генерала армии С. М. Штеменко, Краснодар, РоссияДля выбора параметров системы синхронизации, обеспечивающих наибольшую эффективность, необходимо получить временные характеристики. Для этого в работе проведена оценка среднего времени поиска псевдослучайной последовательности (ПСП) через решение задачи системного анализа временных характеристик мажоритарной обработки синхронизирующей информации. В статье сформулирована и решена задача анализа временных характеристик для метода синхронизации ПСП на основе мажоритарной обработки сегментов ПСП, в которой требовалось найти среднее время поиска ПСП. Получены аналитические соотношения для среднего времени поиска ПСП, проведены расчеты и системный анализ результатов. Показано, что увеличение длины обрабатываемого сегмента (зачетного отрезка) N неизбежно приведет к увеличению времени вхождения системы в синхронизм за счет приема дополнительных битов ПСП, участвующих в проверках.Ключевые слова: метод Уорда, синхронизация псевдослучайной последовательности, мажоритарное декодирование, среднее время поиска псевдослучайной последовательности Для цитирования: Подольцев В. В. Оценка временных характеристик мажоритарной обработки синхронизирующей информации в ПСПориентированных MAC-протоколах множественного доступа // Радиопромышленность. 2019. Т. 29, № 4. С. 26-34.

Simulation modeling of the processing method for pseudo-random sequence (PRS) short segments based on the majority tests gives the probability characteristics that are different from the results of a calculation using the Gaussian approximation. The simulation modeling shows that the probability of bit error decoding is changed discretely with the explicit minima and maxima for the length of the processed segment of the PRS. This is due to the fact that the decoder always uses a fixed test sequence, which is determined by the initial phase of the analyzer. Thus, the distribution of these checks determines the dependence of the bit error probability. On this basis, the paper conducts a theoretical study of the probability characteristics synchronization method based on the majority tests, taking into account the specifics of the PRS analyzer. The article formulates and solves the task of analyzing probabilistic characteristics of the majority method of processing short segments of the PRS, which required finding the probability of bit error of decoding. The analytical relations for the probability of bit error of decoding are obtained. The calculations and systematic analysis of the results are performed. It is shown that: with the increase in the length of the processed segment or the length of the valid section N the probability of error can be greater than the probability of destructive errors; the method based on the majority tests with a high probability of destructive errors has a significant advantage in the average code search time over the Ward’s method. Based on the obtained results a modification of the method that will provide the optimal choice of the length of the processed segment of PRS N will be offered in further studies.