View in EDS

Fredkin gates in simple reversible cellular automata.

Saved in:
Bibliographic Details
Title: Fredkin gates in simple reversible cellular automata.
Authors: Morita, Kenichi1 (AUTHOR) km@hiroshima-u.ac.jp
Source: International Journal of Parallel, Emergent & Distributed Systems. May2022, Vol. 37 Issue 3, p249-272. 24p.
Subjects: Cellular automata, Cell compartmentation, Turing machines, Mathematical logic, Logic circuits, Reversible computing
Abstract: In this paper, we give a survey on the problem of how a Fredkin gate, a universal reversible logic gate, is realised in various reversible cellular automata (RCAs). Models of RCAs considered here are two kinds of square partitioned cellular automata (SPCAs), and four kinds of elementary triangular partitioned cellular automata (ETPCAs). These six RCAs are very simple, in particular, ETPCAs are extremely simple, yet they are computationally universal in the sense any reversible Turing machine, which is composed of Fredkin gates, can be embedded in them. There are three key points for implementing a Fredkin gate in an RCA: (1) realising a signal, (2) routeing a signal, and (3) interacting two signals. We shall see that depending on the properties of the RCAs, different techniques are used to realise the above three functions. Based on these techniques, complete configurations of Fredkin gates in the six RCAs are given. [ABSTRACT FROM AUTHOR]
Copyright of International Journal of Parallel, Emergent & Distributed Systems is the property of Taylor & Francis Ltd and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database: Engineering Source
Description
Abstract:In this paper, we give a survey on the problem of how a Fredkin gate, a universal reversible logic gate, is realised in various reversible cellular automata (RCAs). Models of RCAs considered here are two kinds of square partitioned cellular automata (SPCAs), and four kinds of elementary triangular partitioned cellular automata (ETPCAs). These six RCAs are very simple, in particular, ETPCAs are extremely simple, yet they are computationally universal in the sense any reversible Turing machine, which is composed of Fredkin gates, can be embedded in them. There are three key points for implementing a Fredkin gate in an RCA: (1) realising a signal, (2) routeing a signal, and (3) interacting two signals. We shall see that depending on the properties of the RCAs, different techniques are used to realise the above three functions. Based on these techniques, complete configurations of Fredkin gates in the six RCAs are given. [ABSTRACT FROM AUTHOR]
ISSN:17445760
DOI:10.1080/17445760.2022.2052871