Nikolaos I. Dourvas
Cellular Automaton Belousov-Zhabotinsky Model for Binary Full Adder
Dourvas, Nikolaos I.; Sirakoulis, Georgios Ch; Adamatzky, Andrew
Abstract
© 2017 World Scientific Publishing Company. The continuous increment in the performance of classical computers has been driven to its limit. New ways are studied to avoid this oncoming bottleneck and many answers can be found. An example is the Belousov-Zhabotinsky (BZ) reaction which includes some fundamental and essential characteristics that attract chemists, biologists, and computer scientists. Interaction of excitation wave-fronts in BZ system, can be interpreted in terms of logical gates and applied in the design of unconventional hardware components. Logic gates and other more complicated components have been already proposed using different topologies and particular characteristics. In this study, the inherent parallelism and simplicity of Cellular Automata (CAs) modeling is combined with an Oregonator model of light-sensitive version of BZ reaction. The resulting parallel and computationally-inexpensive model has the ability to simulate a topology that can be considered as a one-bit full adder digital component towards the design of an Arithmetic Logic Unit (ALU).
Journal Article Type | Article |
---|---|
Acceptance Date | Jun 1, 2017 |
Online Publication Date | Jun 15, 2017 |
Publication Date | Jun 15, 2017 |
Deposit Date | Jul 27, 2017 |
Publicly Available Date | Jun 15, 2018 |
Journal | International Journal of Bifurcation and Chaos |
Print ISSN | 0218-1274 |
Electronic ISSN | 1793-6551 |
Publisher | World Scientific Publishing |
Peer Reviewed | Peer Reviewed |
Volume | 27 |
Issue | 6 |
DOI | https://doi.org/10.1142/S0218127417500894 |
Keywords | adder, bZ |
Public URL | https://uwe-repository.worktribe.com/output/885083 |
Publisher URL | https://doi.org/10.1142/S0218127417500894 |
Additional Information | Additional Information : Electronic version of an article published as Adamatzky, A. (2017) Cellular automaton Belousov-Zhabotinsky model for binary full adder. International Journal of Bifurcation and Chaos, 27 (6). ISSN 0218-1274 Available from: https://doi.org/10.1142/S0218127417500894 © [copyright World Scientific Publishing Company] |
Contract Date | Jul 27, 2017 |
Files
AA_Cellular_Automaton_Belousov_Zhabotinsky_Model_for_Binary_Full_Adder.pdf
(6.5 Mb)
PDF
You might also like
On the computing potential of intracellular vesicles
(2015)
Journal Article
Complete characterization of structure of rule 54
(2014)
Journal Article
Rapid Physarum Algorithm for shortest path problem
(2014)
Journal Article
Downloadable Citations
About UWE Bristol Research Repository
Administrator e-mail: repository@uwe.ac.uk
This application uses the following open-source libraries:
SheetJS Community Edition
Apache License Version 2.0 (http://www.apache.org/licenses/)
PDF.js
Apache License Version 2.0 (http://www.apache.org/licenses/)
Font Awesome
SIL OFL 1.1 (http://scripts.sil.org/OFL)
MIT License (http://opensource.org/licenses/mit-license.html)
CC BY 3.0 ( http://creativecommons.org/licenses/by/3.0/)
Powered by Worktribe © 2025
Advanced Search