Cellular Automata Application on Chemical Computing Logic Circuits

被引:2
|
作者
Tsompanas, Michail-Antisthenis [1 ]
Chatzinikolaou, Theodoros Panagiotis [2 ]
Sirakoulis, Georgios Ch [2 ]
机构
[1] Univ West England, Unconvent Comp Lab, Bristol BS16 1QY, Avon, England
[2] Democritus Univ Thrace, Dept Elect & Comp Engn, Xanthi, Greece
来源
CELLULAR AUTOMATA (ACRI 2022) | 2022年 / 13402卷
关键词
Cellular automata; Belousov-Zabotinsky reaction; Unconventional computing; Chemical computing; MODEL; PROPAGATION;
D O I
10.1007/978-3-031-14926-9_1
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Cellular Automata (CAs) have been proved to be a robust tool for mimicking a plethora of biological, physical and chemical systems. CAs can be used as an alternative to partial differential equations, in order to illustrate the evolution in time of the aforementioned systems. However, CAs are preferred due to their formulation simplicity and their ability to portray the emerging of complex dynamics. Their simplicity is attributed to the fact that they are composed by simple elementary components, whereas their complexity capacities are the result of emerging behaviors from the local interactions of these elementary components. Here, the utilization of CAs on mimicking of physio-chemical reactions is presented. In specific, the implementation of chemical-based logic circuits with the use of the Belousov-Zhabotinsky (BZ) class reactions was illustrated. The BZ reaction can demonstrate non-linear oscillations that have been utilized in different scenarios as a computational substrate, whereas its photo-sensitivity have been exploited as an additional factor of manipulating the computations. A common method to mathematically represent the BZ dynamics is the Oregonator equations, which are a set of PDEs. In this work the approximation of the Oregonator equations is performed with CAs to simulate logic circuits (from classic logic gates like AND to combinatorial ones). The proposed tool has been proved to be in agreement with results produced in the lab from the actual chemical reactions. Moreover, the tool is used to design novel computing architectures in a trivial manner, without the need of specialized knowledge on chemistry, without the need to handle dangerous chemicals and alleviating unnecessary costs for equipment and consumables. The main advantage of this method can be summarized as the acceleration achieved in current implementations (serial computers), but also towards potential future implementations in massively parallel computational systems (like Field-Programmable Gate Array hardware and mainly nano-neuromorphic circuits) that have been proved to be good substrates for accelerating the implemented CA models.
引用
收藏
页码:3 / 14
页数:12
相关论文
共 50 条
  • [21] Asynchronous circuits design using quantum-dot cellular automata for molecular computing
    Aghababa, Hossein
    Jourabchian, Moitaba
    Forouzandeh, Behjat
    Afzali, Ali
    2008 MOSHARAKA INTERNATIONAL CONFERENCE ON COMMUNICATIONS, PROPAGATION AND ELECTRONICS, 2008, : 13 - 16
  • [22] Asynchronous circuits design using quantum-dot cellular automata for molecular computing
    Aghababa, Hossein
    Jourabchian, Mojtaba
    Afzali, Ali
    Forouzandeh, Behjat
    2008 7TH INTERNATIONAL CARIBBEAN CONFERENCE ON DEVICES, CIRCUITS AND SYSTEMS, 2008, : 39 - +
  • [23] Cellular automata imbedded memristor-based recirculated logic in-memory computing
    Yanming Liu
    He Tian
    Fan Wu
    Anhan Liu
    Yihao Li
    Hao Sun
    Mario Lanza
    Tian-Ling Ren
    Nature Communications, 14
  • [24] Modelling sequential circuits with cellular automata
    1600, Taylor and Francis Ltd. (26):
  • [25] Cellular automata imbedded memristor-based recirculated logic in-memory computing
    Liu, Yanming
    Tian, He
    Wu, Fan
    Liu, Anhan
    Li, Yihao
    Sun, Hao
    Lanza, Mario
    Ren, Tian-Ling
    NATURE COMMUNICATIONS, 2023, 14 (01)
  • [26] Automatic design of optimal logic circuits based on ternary quantum-dot cellular automata
    Janez, Miha
    Bajec, Iztok Lebar
    Pecar, Primoz
    Jazbec, Andrej
    Zimic, Nikolaj
    Mraz, Miha
    WSEAS Transactions on Circuits and Systems, 2008, 7 (09): : 919 - 928
  • [27] Propositional Logic and Cellular Automata on Monoids
    Ishida, Toshikazu
    Inokuchi, Shuichi
    Kawahara, Yasuo
    JOURNAL OF CELLULAR AUTOMATA, 2017, 12 (1-2) : 27 - 45
  • [28] Reliability Analysis and Power Dissipation of Quantum Dot Cellular Automata Circuits for Next Generation Computing
    Jayalakshmi, R.
    Kumaran, M. Senthil
    INTERNATIONAL JOURNAL OF NANOELECTRONICS AND MATERIALS, 2019, 12 (04): : 485 - 494
  • [29] EXTENSION OF CELLULAR AUTOMATA TO NEURAL COMPUTING
    BLAYO, F
    MARCHAL, P
    ARTIFICIAL NEURAL NETWORKS : JOURNEES DELECTRONIQUE 1989, 1989, : 145 - 157
  • [30] Reservoir Computing with Complex Cellular Automata
    Babson, Neil
    Teuscher, Christof
    COMPLEX SYSTEMS, 2019, 28 (04): : 433 - 455