Controlled- Controlled NOTControlled- Controlled NOT = Toffoli Gate.

Slides:



Advertisements
Similar presentations
Combinational Logic Circuits Chapter 2 Mano and Kime.
Advertisements

Combinational Circuits. Analysis Diagram Designing Combinational Circuits In general we have to do following steps: 1. Problem description 2. Input/output.
MVI Function Review Input X is p -valued variable. Each Input can have Value in Set {0, 1, 2,..., p i-1 } literal over X corresponds to subset of values.
ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.
Lecture 3 Karnaugh Map Chapter 2 Jack Ou, Ph.D.. Home Alarm Logic.
Fuzzy Reversible Logic using Toffoli-like gates. Building reversible fuzzy Toffoli gate We have to design such gate that knowing P,Q,R we will be able.
GF(4) Based Synthesis of Quaternary Reversible/Quantum Logic Circuits
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
Derivatives of Perkowski’s Gate k f2 g h t t De Vos gates  f1f1  A B P Q Feynman gates A B P f 2f 2  C Q R Toffoli gates Q P f 2 A C R B S D 0.
ECE Synthesis & Verification - Lecture 18 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Systems Word-level.
Section 10.3 Logic Gates.
 2001 CiesielskiBDD Tutorial1 Decision Diagrams Maciej Ciesielski Electrical & Computer Engineering University of Massachusetts, Amherst, USA
Combinational Logic1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Lecture 3. Boolean Algebra, Logic Gates
Combinational Logic Circuits Chapter 2 Mano and Kime.
Part 2: DESIGN CIRCUIT. LOGIC CIRCUIT DESIGN x y z F F = x + y’z x y z F Truth Table Boolean Function.
Shannon’s Expansion Muxes and Encoders. Tri-State Buffers  A tri-state buffer has one input x, one output f and one control line e Z means high impedance,
Boolean Algebra Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
Adders and Multipliers Review. ARITHMETIC CIRCUITS Is a combinational circuit that performs arithmetic operations, e.g. –Addition –Subtraction –Multiplication.
1 CHAPTER 4: PART I ARITHMETIC FOR COMPUTERS. 2 The MIPS ALU We’ll be working with the MIPS instruction set architecture –similar to other architectures.
XOR and XNOR Logic Gates. XOR Function Output Y is TRUE if input A OR input B are TRUE Exclusively, else it is FALSE. Logic Symbol  Description  Truth.
Digital Computer Concept and Practice Copyright ©2012 by Jaejin Lee Logic Circuits I.
Chapter 3.5 Logic Circuits. How does Boolean algebra relate to computer circuits? Data is stored and manipulated in a computer as a binary number. Individual.
TODAY YOU ARE LEARNING to explain why data is represented in computer systems in binary form 2. to understand and produce simple logic diagrams.
Logic Design A Review. Binary numbers Binary numbers to decimal  Binary 2 decimal  Decimal 2 binary.
F = ∑m(1,4,5,6,7) F = A’B’C+ (AB’C’+AB’C) + (ABC’+ABC) Use X’ + X = 1.
Chapter 10 (Part 2): Boolean Algebra  Logic Gates (10.3) (cont.)  Minimization of Circuits (10.4)
Digital Circuits Design Chin-Sung Lin Eleanor Roosevelt High School.
Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.
Dr. Eng. Farag Elnagahy Office Phone: King ABDUL AZIZ University Faculty Of Computing and Information Technology CPCS 222.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. Circuit Optimization Logic and Computer Design Fundamentals.
1 Lecture 6 BOOLEAN ALGEBRA and GATES Building a 32 bit processor PH 3: B.1-B.5.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 7 Dr. Shi Dept. of Electrical and Computer Engineering.
Computer Systems 1 Fundamentals of Computing Simplifying Boolean Expressions.
Karnaugh Maps (K maps). What are Karnaugh 1 maps?  Karnaugh maps provide an alternative way of simplifying logic circuits.  Instead of using Boolean.
Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.
Karnaugh Map and Circuit Design.
Prof. Hsien-Hsin Sean Lee
Chapter 4 OPTIMIZED IMPLEMENTATION OF LOGIC FUNCTIONS.
Combinational Circuits. Outline Boolean Algebra Decoder Encoder MUX.
The inverter performs the Boolean NOT operation. When the input is LOW, the output is HIGH; when the input is HIGH, the output is LOW. The Inverter AX.
Based on slides by:Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 7 – Karnaugh Maps.
NAND, NOR, and EXOR (more primitive logical gates) CS Computer Architecture David Mayer.
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.
1 CSE370, Lecture 7 Lecture 9 u Logistics n HW3 posted, due on Friday n Lab3 this week u Last lecture n Verilog u Last last lecture n K-maps examples n.
Digital Systems Design 1 Signal Expressions Multiply out: F = ((X + Y)  Z) + (X  Y  Z) = (X  Z) + (Y  Z) + (X  Y  Z)
Very good news for People who know Reed-Muller Logic 1.Quantum XOR 1.Quantum XOR is the most important gate in Quantum Logic 2.Synthesis of Quantum Circuits.
Chapter 12. Chapter Summary Boolean Functions Representing Boolean Functions Logic Gates Minimization of Circuits (not currently included in overheads)
Assembly Lab1 - Review.
CHAPTER 3 Simplification of Boolean Functions
Lecture 3: Incompletely Specified Functions and K Maps
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
Boolean Algebra.
Combinational Circuits
Logic Gates.
EI205 Lecture 5 Dianguang Ma Fall 2008.
Overview Part 1 – Gate Circuits and Boolean Equations
Computer Architecture CST 250
Lecture 3: Incompletely Specified Functions and K Maps
Basic Logic Gates 1.
Schematics 201 Lecture Topic: Electrical Symbols
Logic Gates.
13 Digital Logic Circuits.
DIGITAL ELECTRONICS B.SC FY
Today You are Learning simple logic diagrams using the operations AND, OR and NOT truth tables combining Boolean operators using AND, OR and NOT.
Chapter 10.3 and 10.4: Combinatorial Circuits
Overview Part 2 – Circuit Optimization
Fuzzy Reversible Logic using Toffoli-like gates
Boolean Algebra and Gate Networks
Lecture 3: Incompletely Specified Functions and K Maps
Presentation transcript:

Controlled- Controlled NOTControlled- Controlled NOT = Toffoli Gate

The Toffoli Gate The Toffoli gate Q (3) is universal in the sense that we can build a circuit to compute any reversible function using Toffoli gates alone (if we can x input bits and ignore output bits). It will be instructive to show this directly, without relying on our earlier argument that NAND/NOT is universal for Boolean functions. In fact, we can show the following: –From the NOT gate and the Toffoli gate Q (3), we can construct any invertible function on n bits, provided we have one extra bit of scratchpad space available.

Use of Toffoli Gate From three-bit Toffoli-Gate Q (3) Q 4 Scratch space Q 4 from three Q 3 The first step is to show that from the three-bit Toffoli Gate Q (3) we can construct an n- bit Toffoli Gate Q (n). The n-bit gate works as follows: (x 1,x 2,…,x n-1, x n )==>(x 1,x 2,…,x n-1 1 x 2 …x n-1 ) The construction requires one extra bit of scratch space. For example, we construct Q (4) circuit from Q (3) circuits as follows: x1 x2

Simple Idea – Toffoli gate with any number of inputs If we generalize the Toffoli Gate, we can realize any binary function in a very efficient way One can build Toffoli gate with 3 inputs Can one build Toffoli gate with n inputs?????? xn z x2 … xn-1 xn xn-1 x1 Of course, from many gates, but directly???

Karnaugh Maps A 4-variable K- map. Simple Idea

SOP Cover Simple Idea

ESOP = Positive RM cover Simple Idea yz

Simple Idea – build ESOP circuit from Toffoli gates wxyzwxyz 0 wx wx  yz

Simple Idea This idea can be generalized to: Fixed Polarity Reed-Muller Expansions Generalized Reed-Muller Expansions Exclusive Sum of Products Galois Sum of Galois Products Expansions Boolean Ring based logic Min-Modsum based logic Any Quasi-Group based logic Arithmetic Logic

Realizations of binary logic with Toffoli and reversible logic with Toffoli-like circuits Kronecker functional Diagram (uses Davio expansions and Shannon Expansions) Kronecker function-driven Diagram ESOP DSOP (disjunctive SOP = Disjunctive ESOP)

* + * + A B B A fg X Y= C + 1C  C C AB C AB C AB C AB C 0 1 f A’ X=f A’  f A AB C 1 0  C C f B’ AB C f B’  f B 0 1 Graphical method to calculate decision diagram from Toffoli gates We use Davio expansions Use Toffoli gates to realize Davio expansions

* + * + A B B A fg X Y= C + 1C  C C * + * + A B + C + 0 f  C C 1C A X

What you have to remember 1.Toffoli gate equation and symbol. 2.Kmaps for up to 5 variables. 3.The concept of ESOP circuits. 4.How to synthesize ESOP circuit from equation 5.How to synthesize ESOP equation from Kmap. 6.The concept of Mirror Circuit 7.The concept of ancilla bit 8.How to create large Toffoli gates from small Toffoli gates 9.The concept of Davio Expansion realized in Toffoli gate. The concepts of Davio expansions and ESOP/DSOP circuits will be more elaborated in next lectures. Now you can just use their ideas for simple circuits.