Preprint Article Version 1 Preserved in Portico This version is not peer-reviewed

Implementation of the Hindmarsh–Rose Model Using Stochastic Computing

Version 1 : Received: 22 October 2022 / Approved: 26 October 2022 / Online: 26 October 2022 (10:33:54 CEST)

A peer-reviewed article of this Preprint also exists.

Camps, O.; Stavrinides, S.G.; de Benito, C.; Picos, R. Implementation of the Hindmarsh–Rose Model Using Stochastic Computing. Mathematics 2022, 10, 4628. Camps, O.; Stavrinides, S.G.; de Benito, C.; Picos, R. Implementation of the Hindmarsh–Rose Model Using Stochastic Computing. Mathematics 2022, 10, 4628.

Abstract

In this paper we present a successful implementation of the Hindmarsh–Rose model within a SC environment. The merits of the proposed approach are design simplicity, due to stochastic computing, and the ease of implementation. Simulation results showed that the approximation achieved is equivalent to introducing a noise source into the original model. A study for the level of noise introduced, according to the number of bits in the stochastic sequence, has been performed. Additionally, we demonstrate that such an approach, even though it is noisy, it reproduces the behaviour of biological systems, which are intrinsically noisy. It is also demonstrated that a speedup of x2 compared to biological systems is easily achievable, with a very small number of gates, thus paving the road for the in silico implementation of large neuron networks.

Keywords

stochastic logic; chaotic systems; approximate computing; Hindmarsh Rose system

Subject

Computer Science and Mathematics, Computational Mathematics

Comments (0)

We encourage comments and feedback from a broad range of readers. See criteria for comments and our Diversity statement.

Leave a public comment
Send a private comment to the author(s)
* All users must log in before leaving a comment
Views 0
Downloads 0
Comments 0
Metrics 0


×
Alerts
Notify me about updates to this article or when a peer-reviewed version is published.
We use cookies on our website to ensure you get the best experience.
Read more about our cookies here.