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

Lecture Notes in Computer Science

Volumn 3354, Issue , 2005, Pages 245-256

  Morita, Kenichi ^a   Ogiro, Tsuyoshi ^a   Tanaka, Keiji ^a   Kato, Hiroko ^a  

^a HIROSHIMA UNIVERSITY   (Japan)

Author keywords

Fredkin gate; Logical universality; Reversible logic element; Rotary element

Indexed keywords

COMPUTATIONAL METHODS; DATA STORAGE EQUIPMENT; LOGIC GATES;

FREDKIN GATE; LOGICAL UNIVERSALITY; REVERSIBLE LOGIC ELEMENTS; ROTARY ELEMENTS;

FORMAL LOGIC;

EID: 24144453385     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-31834-7_20     Document Type: Conference Paper

References (9)

1. Bennett, C.H., Logical reversibility of computation, IBM J. Res. Dev., 17, 525-532 (1973).
2. Bennett, C.H., Notes on the history of reversible computation, IBM J. Res. Dev., 32, 16-23 (1988).
3. Fredkin, E. and Toffoli, T., Conservative logic, Int. J. Theoret. Phys., 21, 219-253 (1982).
4. Gruska, J., Quantum Computing, McGraw-Hill, London (1999).
5. Lee, J., Peper, F., Adachi, S. and Mashiko, S., Asynchronously timed reversible logic elements, (submitted for publication).
6. Morita, K., Tojima, Y. and Imai, K., A simple computer embedded in a reversible and number-conserving two-dimensional cellular space, Multiple-Valued Logic, 6, 483-514 (2001).
7. Morita, K., A simple universal logic element and cellular automata for reversible computing, Proc. 3rd Int. Conference on Machines, Computations, and Universality, Chisinau, LNCS 2055, Springer-Verlag, 102-113 (2001).
8. Toffoli, T., Reversible computing, in Automata, Languages and Programming, Springer-Verlag, LNCS-85, 632-644 (1980).
9. Toffoli, T., Bicontinuous extensions of invertible combinatorial functions, Mathematical Systems Theory, 14, 12-23 (1981).