A Design Method of Universal Reversible Sequential Machine

Abstract

The invention discloses a design method of a universal reversible sequential machine. The method comprises the following steps: utilizing a reversible logic element CDE to form S-CDE; utilizing logic elements RT and IRT and a novel invented S-CDE to form S-RD and S-IRD; utilizing logic elements S-RD and S-IRD to form an m-signal s-state transformer and an m-signal s-state inverse transformer; utilizing the m-signal s-state transformer, the m-signal s -state inverse transformer and the S-CDE to form the reversible sequential machine. The reversible sequential machine designed according to the method can have any s kinds of internal states, can be changed between any two states, and can be kept in a certain state. The reversible sequential machine designed according to the method can be a completely universal m-signal s-state reversible sequential machine, further can be a reversible sequential machine module with the universality, can be embodied to form a specific computing module, and further is completely suitable for the situation that the requirement internal state is greater than 2.

Description

Technical field: [0001] The invention relates to a design method of a universal reversible sequential machine. Background technique: [0002] A general reversible computer model capable of reversible computing tasks has been proposed by Morita (KenichiMorita, 'A Simple Universal Logic Element and Cellular Automata for Reversible Computing' MCU 2001, LNCS 2055, pp.102-113, 2001). Morita proposed a reversible logic element called RotaryElement (RE), and proved that any reversible Turing machine (Turing machine is the prototype of modern electronic computers) can be constructed by RE interconnection. At any one time there is only one physical signal moving throughout the RE network described by Morita, so delays in REs or on any connection will not affect the correctness of the calculation. The reversible logic circuit constructed by RE will be able to run completely asynchronously without clock. Jia Lee (Lee, J. "An asynchronous cellular automaton implementing 2-state 2-inpu...

AI Technical Summary

Problems solved by technology

Although the structure of the reversible sequential machine is simple and intuitive, and it can also run under asynchronous conditions, it has several disadvantages: there are only two states inside the reversible sequential machine, and in a calculation process, Its state must be transferred from one state to another state, and the state cannot be kept unchanged; when the state is greater than 2, the reversible sequential machine will not be able to perform calculations, and it will be difficult to expand

Images