Classification and universality of reversible logic elements with one-bit memory

Authors:
Kenichi Morita;Tsuyoshi Ogiro;Keiji Tanaka;Hiroko Kato
Affiliations:
Graduate School of Engineering, Hiroshima University, Higashi-Hiroshima, Japan;Graduate School of Engineering, Hiroshima University, Higashi-Hiroshima, Japan;Graduate School of Engineering, Hiroshima University, Higashi-Hiroshima, Japan;Graduate School of Engineering, Hiroshima University, Higashi-Hiroshima, Japan
Venue:
MCU'04 Proceedings of the 4th international conference on Machines, Computations, and Universality
Year:
2004

Citing 4
Cited 4

Notes on the history of reversible computation

IBM Journal of Research and Development
Reversible Computing

Proceedings of the 7th Colloquium on Automata, Languages and Programming
A Simple Universal Logic Element and Cellular Automata for Reversible Computing

MCU '01 Proceedings of the Third International Conference on Machines, Computations, and Universality
Logical reversibility of computation

IBM Journal of Research and Development

A reversible programming language and its invertible self-interpreter

Proceedings of the 2007 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Reversible computing and cellular automata—A survey

Theoretical Computer Science
Universality Issues in Reversible Computing Systems and Cellular Automata (Extended Abstract)

Electronic Notes in Theoretical Computer Science (ENTCS)
Reversible delay-insensitive distributed memory modules

RC'13 Proceedings of the 5th international conference on Reversible Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

A reversible logic element is a model of a computing element that has an analogous property to physical reversibility. In this paper, we investigate k-symbol reversible elements with one-bit memory (i.e., two states) for k=2, 3, and 4. We classified all of them, and showed the total numbers of essentially different elements are 8 (k=2), 24 (k=3), and 82 (k=4). So far, a rotary element, a 2-state 4-symbol reversible element, has been known to be logically universal. Here, we proved that a new and interesting elements called 3- and 4-symbol left-/right-rotate elements are both universal. We also gave a new concise construction method of a Fredkin gate out of rotary elements.