Adaptive recursive algorithm for optimal weighted suprathreshold stochastic resonance
Author(s) -
Liyan Xu,
Fabing Duan,
Xiao Gao,
Derek Abbott,
Mark D. McDonnell
Publication year - 2017
Publication title -
royal society open science
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.84
H-Index - 51
ISSN - 2054-5703
DOI - 10.1098/rsos.160889
Subject(s) - decoding methods , algorithm , kalman filter , mean squared error , stochastic resonance , computer science , noise (video) , scheme (mathematics) , mathematics , minimum mean square error , signal (programming language) , adaptive filter , recursive filter , filter (signal processing) , control theory (sociology) , statistics , artificial intelligence , filter design , mathematical analysis , root raised cosine filter , estimator , image (mathematics) , computer vision , programming language , control (management)
Suprathreshold stochastic resonance (SSR) is a distinct form of stochastic resonance, which occurs in multilevel parallel threshold arrays with no requirements on signal strength. In the generic SSR model, an optimal weighted decoding scheme shows its superiority in minimizing the mean square error (MSE). In this study, we extend the proposed optimal weighted decoding scheme to more general input characteristics by combining a Kalman filter and a least mean square (LMS) recursive algorithm, wherein the weighted coefficients can be adaptively adjusted so as to minimize the MSE without complete knowledge of input statistics. We demonstrate that the optimal weighted decoding scheme based on the Kalman–LMS recursive algorithm is able to robustly decode the outputs from the system in which SSR is observed, even for complex situations where the signal and noise vary over time.
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom