Synthesis of Quasi-Optimal Algorithms Based on the Indirect Method of Nonlinear Filtering

Nonlinear filtering of Markov processes by indi-rect variables is considered. Quasi-optimal algorithms with increased filtering accuracy in conditions of large fluctuations of filtered processes are synthesized. It is shown that the application of the indirect method of nonlinear filtering is more effective in comparison with the direct method which uses Gaussian approximation, where the observation model is an additive mixture of Gaussian noise and signal. At the same time, the indirect method successfully utilizes a functional approach. Dependencies allowing to estimate the phase error variance in the stationary mode on the phase excitation noise variance, as well as dependencies of the phase error skip prob-ability on the excitation noise variance at different values of the signal-to-noise ratio are obtained. It is shown that the consid-ered synthesis method allows to increase filtering accuracy of indirect algorithms synthesized in the first approximation, and the gain increases with the increase of the signal-to-noise ratio. At the same time, it is shown that in the stationary mode with limited phase stochasticity, the average convergence time of indirect estimates is three to four times shorter than the con-vergence time of direct estimates. It is noted that the indirect algorithm has a lower probability of phase error skip.

Authors

Institutions

Publication Details

Published
2025-03-26
DOI
https://doi.org/10.1109/dspa64310.2025.10977847
Primary Topic
Advanced Control and Stabilization in Aerospace Systems
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Synthesis of Quasi-Optimal Algorithms Based on the Indirect Method of Nonlinear Filtering

В. И. Воловач, Evgeny Kimovich Samarov, Vladimir Mikhaylovich Artyushenko
Advanced Control and Stabilization in Aerospace Systems
article

Synthesis of Quasi-Optimal Algorithms Based on the Indirect Method of Nonlinear Filtering

В. И. Воловач, Evgeny Kimovich Samarov, Vladimir Mikhaylovich Artyushenko
article en

Abstract

Nonlinear filtering of Markov processes by indi-rect variables is considered. Quasi-optimal algorithms with increased filtering accuracy in conditions of large fluctuations of filtered processes are synthesized. It is shown that the application of the indirect method of nonlinear filtering is more effective in comparison with the direct method which uses Gaussian approximation, where the observation model is an additive mixture of Gaussian noise and signal. At the same time, the indirect method successfully utilizes a functional approach. Dependencies allowing to estimate the phase error variance in the stationary mode on the phase excitation noise variance, as well as dependencies of the phase error skip prob-ability on the excitation noise variance at different values of the signal-to-noise ratio are obtained. It is shown that the consid-ered synthesis method allows to increase filtering accuracy of indirect algorithms synthesized in the first approximation, and the gain increases with the increase of the signal-to-noise ratio. At the same time, it is shown that in the stationary mode with limited phase stochasticity, the average convergence time of indirect estimates is three to four times shorter than the con-vergence time of direct estimates. It is noted that the indirect algorithm has a lower probability of phase error skip.

University of Technology (RU), Volga Region State University of Service (RU), State Marine Technical University of St. Petersburg (RU)
Openalex Percentile: Top 87%
Advanced Control and Stabilization in Aerospace Systems
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.