RUS  ENG JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



J. Comp. Eng. Math.:
Year:
Volume:
Issue:
Page:
Find






Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register


J. Comp. Eng. Math., 2018, Volume 5, Issue 2, Pages 44–57 (Mi jcem118)  

Computational Mathematics

On the accuracy and convergence of the minimax filtering algorithm for chaotic signals

A. S. Sheludko

South Ural State University (Chelyabinsk, Russian Federation)

Abstract: The article is focused on the filtering problem for chaotic signals. The original discrete signal is generated by a one-dimensional chaotic system, and the measured signal is corrupted by additive errors. The goal is to estimate the unknown system states from measurements. The minimax filtering algorithm is developed in the context of guaranteed state estimation that is based on a set-membership description of uncertainty. It assumes that the unknown variables (system states and measurement errors) are bounded by intervals (sets of possible values). The proposed algorithm is a recursive procedure based on interval analysis. It computes interval estimates that are guaranteed to contain the true states of the system (true values of the original signal). The computation of the interval estimate consist of three steps (prediction, measurement, and correction) that are similar to the computation of the information set for linear dynamical systems. The point estimates are obtained by an algorithm that is similar to the Kalman filter. This paper studies the accuracy and convergence properties of the minimax filter. The aims of this study are the following: to confirm the effectiveness of the proposed algorithm for computation of the point estimates, to compare the results of the minimax filter and the unscented Kalman filter, and to derive the sufficient conditions for obtaining the exact value of the state. The computational scheme of the minimax filter and numerical simulations are given for the logistic map.

Keywords: chaotic signal, filtering problem, guaranteed estimation, interval estimate.

Funding Agency Grant Number
Ministry of Education and Science of the Russian Federation 02.A03.21.0011
The work was supported by Act 211 Government of the Russian Federation, contract № 02.A03.21.0011.


DOI: https://doi.org/10.14529/jcem180204

Full text: PDF file (303 kB)
References: PDF file   HTML file

UDC: 519.7
MSC: 94A12
Received: 01.06.2018
Language:

Citation: A. S. Sheludko, “On the accuracy and convergence of the minimax filtering algorithm for chaotic signals”, J. Comp. Eng. Math., 5:2 (2018), 44–57

Citation in format AMSBIB
\Bibitem{She18}
\by A.~S.~Sheludko
\paper On the accuracy and convergence of the minimax filtering algorithm for chaotic signals
\jour J. Comp. Eng. Math.
\yr 2018
\vol 5
\issue 2
\pages 44--57
\mathnet{http://mi.mathnet.ru/jcem118}
\crossref{https://doi.org/10.14529/jcem180204}
\elib{http://elibrary.ru/item.asp?id=35221214}


Linking options:
  • http://mi.mathnet.ru/eng/jcem118
  • http://mi.mathnet.ru/eng/jcem/v5/i2/p44

    SHARE: VKontakte.ru FaceBook Twitter Mail.ru Livejournal Memori.ru


    Citing articles on Google Scholar: Russian citations, English citations
    Related articles on Google Scholar: Russian articles, English articles
  • Journal of Computational and Engineering Mathematics
    Number of views:
    This page:106
    Full text:64
    References:19

     
    Contact us:
     Terms of Use  Registration  Logotypes © Steklov Mathematical Institute RAS, 2019