Cellular Automaton Belousov-Zhabotinsky Model for Binary Full Adder

@article{Dourvas2017CellularAB,
  title={Cellular Automaton Belousov-Zhabotinsky Model for Binary Full Adder},
  author={Nikolaos I. Dourvas and Georgios Ch. Sirakoulis and Andrew I. Adamatzky},
  journal={Int. J. Bifurc. Chaos},
  year={2017},
  volume={27},
  pages={1750089:1-1750089:14},
  url={https://api.semanticscholar.org/CorpusID:39898122}
}
The inherent parallelism and simplicity of Cellular Automata (CAs) modeling is combined with an Oregonator model of light-sensitive version of BZ reaction and 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).
View via Publisher
eprints.uwe.ac.uk
16 Citations
Background Citations
4
Methods Citations
3
Results Citations
1

Figures from this paper

16 Citations

Light sensitive Belousov-Zhabotinsky medium accommodates multiple logic gates

Power Consumption in Cellular Automata

A power estimation model for combinational logic circuits using CA and focused on glitching estimation will be presented to elucidate the application of CA model to hardware power dissipation measurements and the power consumption of CA based logic circuits and namely of 1-d CAs rules logic circuits will be analyzed.

Cellular automata implementation of Oregonator simulating light-sensitive Belousov–Zhabotinsky medium

It was observed that the results from the CA-based Oregonator are in good agreement with both modelled and laboratory experiments, and the main advantage can be summarized as the acceleration achieved in current implementations (serial computers), but also towards potential future implementations in massively parallel computational systems that have been proved to be good substrates for accelerating the implemented CA models.

Cellular Automata coupled with Memristor devices: A fine unconventional computing paradigm

The outcome of employing Memristors in CAs applications is promising in terms of parallelization, power consumption, scalability, reconfigurability, and high computing performance.

Memristors in Cellular-Automata-Based Computing:A Review

This paper reviews the most recent advancements toward the development of Cellular-Automata-based computing coupled with memristor devices and provides a thorough insight into the most important developments so far.

MemCA: All-Memristor Design for Deterministic and Probabilistic Cellular Automata Hardware Realization

In the proposed MemCA hardware realization, memristor devices are incorporated in both the cell and rule modules, composing the very first all-memristor CA hardware, designed with mixed CMOS/Memristor circuits.

Memristive Oscillatory Networks for Computing: The Chemical Wave Propagation Paradigm

This talk focuses on a hybrid analogue computational circuit-level system with unipolar memristor nanodevices connected in oscillatory networks and based on wave-like propagation of information, which will have a powerful tool targeting beyond the existing von Neumann information processing techniques and alleviating the aforementioned disadvantages associated with them.

Random Expansion Method for the Generation of Complex Cellular Automata

Parallel Accelerated Virtual Physarum Lab Based on Cellular Automata Agents

An accelerated virtual lab is developed which uses a multi-agent CA model to describe the behavior of plasmodium and can be used as an intelligent, autonomous, self-adaptive system in various heterogeneous and unknown environments spanning from different types of graph problems up to real life-time applications.

Cellular Automata Applications in Shortest Path Problem

This chapter focuses on the successful application of CAs to shortest path problem as found in various diverse disciplines like computer science, swarm robotics, computer networks, decision science and biomimicking of biological organisms’ behaviour.

62 References

Towards constructing multi-bit binary adder based on Belousov-Zhabotinsky reaction.

This study designed a planar geometrical binary adder chemical device based on Belousov-Zhabotinsky reaction, and demonstrated that the device can implement the function of a single-bit fullbinary adder, and can be further extended in plane, and coupled together to realize a two-bit, or even multi-bit binaryAdder.

Multi-bit binary decoder based on Belousov-Zhabotinsky reaction.

The chemical realization of decoders can guide the construction of more sophisticated functions based on BZ reaction; meanwhile, the cascade method can facilitate the design of other combinational logic circuits.

Binary full adder, made of fusion gates, in sub-excitable Belousov-Zhabotinsky system

    A. Adamatzky
    Physics
    Physical review. E, Statistical, nonlinear, and…
  • 2015
A unique design of a binary one-bit full adder based on a fusion gate, and how to cascade the adder blocks into a many-bitFull adder by cascading two fusion gates is proposed.

Belousov-Zhabotinsky "Chemical Neuron" as a Binary and Fuzzy Logic Processor

We demonstrate experimentally that the well-known oscillatory BelousovZhabotinsky (BZ) reaction can be exploited to process both Boolean and fuzzy logic if the input variables are either the volumes…

Towards constructing one-bit binary adder in excitable chemical medium

Hardware Acceleration of Cellular Automata Physarum polycephalum Model

This study implements a Cellular Automata (CA) model in hardware, which attempts to describe and mimic the behavior of the plasmodium in a maze and presents two FPGA implementations which succeed to take advantage of the CA's inherit parallelism and improve the performance of theCA algorithm when compared with software in terms of computational speed and power consumption.

On Polymorphic Logical Gates in Subexcitable Chemical Medium

In computer simulations based on the Oregonator model, it is demonstrated that the outcomes of inter-fragment collisions can be controlled by varying the illumination level applied to the medium.

Logical and arithmetic circuits in Belousov-Zhabotinsky encapsulated disks.

Chemical analogs of elementary logic and arithmetic circuits created entirely from interconnected arrangements of individual BZ encapsulated cell-like disk are presented.

Computation with competing patterns in Life-like automaton

This automaton is a discrete analog spatially extendedchemical media, combining both properties of sub-excitable and precipitating chemical media, and when started from random initial configuration B2/S2345 automaton exhibits chaotic behavior.

A cellular automaton for the propagation of circular fronts and its applications

...