Hadi Hosseini CS 6805 Logic Synthesis Faculty of Computer Science Spring 2009.

Slides:



Advertisements
Similar presentations
TWO STEP EQUATIONS 1. SOLVE FOR X 2. DO THE ADDITION STEP FIRST
Advertisements

Substitution.
Source of slides: Introduction to Automata Theory, Languages and Computation.
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
Jeopardy Q 1 Q 6 Q 11 Q 16 Q 21 Q 2 Q 7 Q 12 Q 17 Q 22 Q 3 Q 8 Q 13
0 - 0.
DIVIDING INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
MULTIPLYING MONOMIALS TIMES POLYNOMIALS (DISTRIBUTIVE PROPERTY)
MULTIPLICATION EQUATIONS 1. SOLVE FOR X 3. WHAT EVER YOU DO TO ONE SIDE YOU HAVE TO DO TO THE OTHER 2. DIVIDE BY THE NUMBER IN FRONT OF THE VARIABLE.
SUBTRACTING INTEGERS 1. CHANGE THE SUBTRACTION SIGN TO ADDITION
MULT. INTEGERS 1. IF THE SIGNS ARE THE SAME THE ANSWER IS POSITIVE 2. IF THE SIGNS ARE DIFFERENT THE ANSWER IS NEGATIVE.
Addition Facts
ZMQS ZMQS
Chapter 4 Gates and Circuits.
Chapter 4 Gates and Circuits Nell Dale • John Lewis.
Chapter 4 Gates and Circuits.
ENGIN112 L7: More Logic Functions September 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 7 More Logic Functions: NAND, NOR,
CMOS Circuits.
Digital CMOS Logic Circuits
Chapter 10 Digital CMOS Logic Circuits
Static CMOS Circuits.
Gates and Circuits Nell Dale & John Lewis (adaptation by Erin Chambers and Michael Goldwasser)
Introduction to Logic Gates
Chap. 3 Logic Gates and Boolean Algebra
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.
Digital Electronics Lecture 2 Logic Gates. Lecture 2 outline Announcement:
Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
Overview Part 1 – Gate Circuits and Boolean Equations
Reversible Gates in various realization technologies
CS2100 Computer Organisation
Other Gate Types COE 202 Digital Logic Design Dr. Aiman El-Maleh
(CSC 102) Discrete Structures Lecture 5.
CS105 Introduction to Computer Concepts GATES and CIRCUITS
Chapter3: Gate-Level Minimization Part 2
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 3.
01 Introduction to Digital Logic
Chapter 4 Gates and Circuits.
1 Directed Depth First Search Adjacency Lists A: F G B: A H C: A D D: C F E: C D G F: E: G: : H: B: I: H: F A B C G D E H I.
Boolean Logic ITI 1121 N. El Kadri. 2 What is a switching network? Switching Network X1X1 XmXm X2X2 Z1Z1 ZmZm Z2Z2 Combinatorial Network: A stateless.
ADDER, HALF ADDER & FULL ADDER
Past Tense Probe. Past Tense Probe Past Tense Probe – Practice 1.
Threshold Logic for Nanotechnologies
Properties of Exponents
Addition 1’s to 20.
25 seconds left…...
Test B, 100 Subtraction Facts
Week 1.
©2004 Brooks/Cole FIGURES FOR CHAPTER 12 REGISTERS AND COUNTERS Click the mouse to move to the next page. Use the ESC key to exit this chapter. This chapter.
1 Unit 1 Kinematics Chapter 1 Day
ECE 424 – Introduction to VLSI
Combinational Circuits ENEL 111. Common Combinationals Circuits NAND gates and Duality Adders Multiplexers.
A Transformation Based Algorithm for Reversible Logic Synthesis D. Michael Miller Dmitri Maslov Gerhard W. Dueck Design Automation Conference, 2003.
Marek Perkowski Reversible Logic Models: Billiard Ball and Optical Lecture 4.
Lecture of Norm Margolus. Physical Worlds Some regular spatial systems: –1. Programmable gate arrays at the atomic scale –2. Fundamental finite-state.
Introduction to Quantum Logic 2002/10/08 Tuesday Jung-wook Kim.
REVERSIBLE LOGIC SYNTHESIS. Overview of the Presentation 1. Introduction 2. Design of a Reversible Full-adder Circuit.
Computer Science 101 Circuit Design - Examples. Sum of Products Algorithm Identify each row of the output that has a 1. Identify each row of the output.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Digital Logic. 2 Abstractions in CS (gates) Basic Gate: Inverter IO IO GNDI O Vcc Resister (limits conductivity) Truth Table.
Logic Design CS 270: Mathematical Foundations of Computer Science Jeremy Johnson.
1 Ethics of Computing MONT 113G, Spring 2012 Session 5 Binary Addition.
Logic and computers 2/6/12. Binary Arithmetic /6/ Only two digits: the bits 0 and 1 (Think: 0 = F, 1.
Logic Gates. AND gate Produces an output only if both inputs are on Input AInput BOutput (Q) Q=
1 Ethics of Computing MONT 113G, Spring 2012 Session 4 Binary Addition.
How does a Computer Add ? Logic Gates within chips: AND Gate A B Output OR Gate A B Output A B A B
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
4–1. BSCS 5 th Semester Introduction Logic diagram: a graphical representation of a circuit –Each type of gate is represented by a specific graphical.
Digital Logic.
DIGITAL ELECTRONICS B.SC FY
Presentation transcript:

Hadi Hosseini CS 6805 Logic Synthesis Faculty of Computer Science Spring 2009

Introduction Interaction and Switch gates Mirrors and delays N-variable gates OR gate Invert Interaction gate Perkowskis full adder Constraints NAND Algorithm Proposed half adder Toffoli gate Conclusion & future work BBM design2

Introduced by Edward Fredkin & Thomas Toffoli Reversible method of computing using elastic collisions (non- dissipative) Rules: the exact laws used in Newtonian kinematics Interacting objects: Balls Walls two-dimensional grid and hard balls velocity of one unit of space per unit time interval Ball => 1 No ball => 0 3BBM design

Interaction gate AB A B 4BBM design

5

6 DelaySideway shift Nontrivial crossover

Mirrors (walls) : changing the direction or path Synchronization No clock signal Timing: Inputs & outputs to each level of gate 7BBM design

8

Attempts to build a BBM OR gate With just using walls & balls We can never redirect two balls into the same trajectory 9BBM design

10BBM design ABAB z1 z3 z2 z4 A B Only disjoint inputs are OR-ed

11BBM design C AB A B Carry 0 Sum A B B (A+B)C AB+AXC +BXC

Physical Constraints No fan-out : We cant split a ball back-feeds are not always possible Only disjoint inputs can be OR-ed 12BBM design

Divide the circuit into different levels and mark the inputs and outputs of each level Where ever there is an AND gate, substitute it with the BBM interaction gate (AND gate) replace each gate with its NAND gate equivalent Simplify the system by deleting adjacent pairs of NOT gates (marked X above). Replace all the NAND gates with equal inputs with a BBM NOT gate in each level replace each NAND gate with a BBM NAND gate 13BBM design

14BBM design

15BBM design

16BBM design

Conclusion Physical aspect of BBM Fan in/out Redirecting Space & time Keep them reversible Future Work: Toffoli gates Analyzing positive XOR representation & NAND representation General methodology to build BBM circuits and feasibility 17BBM design

[1] Edward Fredkin and Tommaso Toffoli. Conservative logic. International Journal of Theoretical Physics, 21:219–253, [2] T. Toffoli, Reversible Computing,Tech. Memo MIT/LCS/TM-151, MIT Lab. for Comp. Sci. (1980). [3] T. Toffoli, Computation and Construction Universality of Reversible Cellular Automata,J. Comput. System Sci. 15 (1977), 213–231. [4] T. Toffoli, Reversible computing, Tech. Memo MIT/LCS/TM-151, Mit Lab. for Comp. Sci. (1980) [Toffoli gate, reversible automata].Reversible computing [5] N. Margolus. Universal cellular automata based on the collision of soft spheres. New constructions in Cellular Automata, Oxford Press (2003). [6] Quantum Computation by.Norman Margolus [7] (accessed ) [8] Marek Perkowski, Portland state university 18BBM design