Lecture Notes 2.C

# For the physical significance of this approach see

This preview shows page 1. Sign up to view the full content.

This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: , 1982) In conservative logic, all signal processing is ultimately reduced to conditional routing of signals. Roughly 100 100 speaking, signals are treated as unalterable0objects0that can be moved around in the course of a computation 1111 but never created or destroyed. For the physical significance of this approach, see Section 6. 110 110 1 1 1 1 of ¶2. The unit wire moves one bit 1 1 information from one space-time point 2.5. Conservative-Logic Circuits. Finally, we shall introduce a scheme for connecting signals, to another in Figure point computing element gates. aepresented by unit wires, with space-time2a. Thisby conservative-logicunit be visualized as Fig. r nd graphically represented as events, represented separated by one can of time. See a device that performs conditional crossover of two data signals according to the value of a control signal (Figure 2b). II.9. When this value is 1 the two data signals follow parallel paths; when 0, they cross over. Observe that the Fredkin gate ¶3. State:and coincides with its own inverse. a wire’s input at time t (and at is nonlinear “The value that is present at its output at time t + 1) is called the state of the wire at time t.” ¶4. It is invertible and conservative (since it conserves the number of 0s and 1s in its input). (Note that there are mathematically reversible functions that are not conservative, e.g., Not.) C.4 Figure 2. (a) Symbol and (b) operation of the Fredkin gate. Fredkin gate In conservative logic, all signal processing is ultimately reduced to conditional routing of signals. Roughly ¶1. are treated as unalterable gate: Any Boolean function that is invertible speaking, signals Conservative logic objects that can be moved around in the course of a computation but never created and conservative. physical significance of this approach, see Section 6. or destroyed. For the 2.5. Conservative-Logic Circuits. Finally, we shall introduce1s and 0s is conserved, ¶2. Conditional rerouting: Since the number of a scheme for connecting represented by unit wires, with e...
View Full Document

## This document was uploaded on 03/14/2014 for the course COSC 494/594 at University of Tennessee.

Ask a homework question - tutors are online