2009 European Conference on Circuit Theory and Design 2009
DOI: 10.1109/ecctd.2009.5275041
|View full text |Cite
|
Sign up to set email alerts
|

Particle filter applied to polynomial chaotic maps

Abstract: Polynomial maps offer analytical properties used to obtain better performances in the scope of chaos synchronization under noisy channels. This paper presents a new method to simplify equations of the Exact Polynomial Kalman Filter (ExPKF) given in [1]. This faster algorithm is compared to other estimators showing that performances of all considered observers vanish rapidly with the channel noise making application of chaos synchronization intractable. Simulation of ExPKF shows that saturation drawn on the emi… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
2
0

Year Published

2011
2011
2011
2011

Publication Types

Select...
1

Relationship

1
0

Authors

Journals

citations
Cited by 1 publication
(2 citation statements)
references
References 14 publications
0
2
0
Order By: Relevance
“…An easy solution given in [21] is to saturate the posteriori state. The counterpart is that the new dynamic noise pdf is no longer Gaussian and no more uncorrelated to the state x k .…”
Section: 2mentioning
confidence: 99%
See 1 more Smart Citation
“…An easy solution given in [21] is to saturate the posteriori state. The counterpart is that the new dynamic noise pdf is no longer Gaussian and no more uncorrelated to the state x k .…”
Section: 2mentioning
confidence: 99%
“…Informally this ExPKF is just running in absence of dynamic noise or by a simple adaptation of the iterative chaotic map as we showed in [21]. In addition to this, the computational cost is so high that the ExPKF algorithm can hardly be developed for commercial real time applications.…”
Section: Introductionmentioning
confidence: 96%