Logic Design CS221 1 st Term 2009-2010 Logic-Circuit Implementation Cairo University Faculty of Computers and Information.

Slides:



Advertisements
Similar presentations
Digital Logic Design Gate-Level Minimization
Advertisements

Chapter3: Gate-Level Minimization Part 2
Gate-level Minimization
Gate-Level Minimization
Logic Gate Level Part 2. Constructing Boolean expression from truth table First method: write nonparenthesized OR of ANDs Each AND is a 1 in the result.
Gate-Level Minimization. Digital Circuits The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.
CS 151 Digital Systems Design Lecture 11 NAND and XOR Implementations.
SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 4.
ENGIN112 L11: NAND and XOR Implementation September 26, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 11 NAND and XOR Implementations.
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Introduction Gate-level minimization refers to the design task of finding an optimal gate-level implementation of Boolean functions describing a digital.
بهينه سازي با نقشة کارنو Karnaugh Map. 2  Method of graphically representing the truth table that helps visualize adjacencies 2-variable K-map 3-variable.
Combinational Logic Circuits Chapter 2 Mano and Kime.
Unit 8 Combinational Circuit Design and Simulation Using Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Fundamentals with PLD Programming.
Unit 7 Multi-Level Gate Circuits / NAND and NOR Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
Logic Design CS221 1 st Term K-Map Cairo University Faculty of Computers and Information.
Logic Design CS221 1 st Term Boolean Algebra Cairo University Faculty of Computers and Information.
Overview of Chapter 3 °K-maps: an alternate approach to representing Boolean functions °K-map representation can be used to minimize Boolean functions.
KU College of Engineering Elec 204: Digital Systems Design
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
The NAND gate as a universal gate Logic function NAND gate only AA A B A.BA.B A B A+B A B A B A B A A A B A.BA.B B A A B A B A B.
BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)
Gate-Level Minimization Chapter 3. Digital Circuits The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.
D IGITAL L OGIC D ESIGN I G ATE -L EVEL M INIMIZATION.
October 29, 2015 EASTERN MEDITERRANEAN UNIVERSITY1 Digital Logic Design I Gate-Level Minimization Mustafa Kemal Uyguroğlu.
LOGIC CIRCUIT IMPLEMENTATION
Chapter 3 Gate-Level Minimization
Digital Systems: Combinational Logic Circuits Wen-Hung Liao, Ph.D.
Gate-level Minimization
D IGITAL L OGIC D ESIGN I G ATE -L EVEL M INIMIZATION.
3.Gate-Level Minimization
Chapter 3 Gate-level Minimization. 3-7 NAND and NOR Implementation Digital circuits are frequently constructed with NAND or NOR gates rather than with.
Multi-Level Gate Networks NAND and NOR Gates
CHAPTER 7 MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES
CS 1110 Digital Logic Design
Chapter 3 Gate-Level Minimization
1 K-Maps, Multi-level Circuits, Time Response Today: Reminder: Test #1, Thu 7-9pm K-map example, espressoFirst Hour: K-map example, espresso –Section 2.3.
Implementation of SOP/POS Expressions
CS 121 Digital Logic Design Gate-Level Minimization Chapter 3.
Lecture 09 NAND and XOR Implementations. Overview °Developing NAND circuits °Two-level implementations Convert from AND/OR to NAND (again!) °Multi-level.
Chap 2. Combinational Logic Circuits
Digital Integrated Circuit Design Laboratory Department of Computer Science and Information Engineering National Cheng Kung University Experiment on digital.
Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
Experiment 2 Questions 1. There are two methods that can be used on generate a complement function using a 2-input NAND gate. Draw a diagram detailing.
CEC 220 Digital Circuit Design NAND/NOR Multi-Level Circuits
Module 7.  In Module 3 we have learned about NAND gate – it is a combination of AND operation followed by NOT operation  Symbol A. B = Y  Logic Gate.
Karnaugh Map (K-Map) By Dr. M. Khamis Mrs. Dua’a Al Sinari.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
Combinational Logic Analysis. Basic Combinational Logic Circuits AND-OR logic AND-OR logic AND-OR logic produces an SOP expression. AND-OR logic produces.
1 CS 352 Introduction to Logic Design Lecture 4 Ahmed Ezzat Multi-level Gate Circuits and Combinational Circuit Design Ch-7 + Ch-8.
Lecture 07 Digital logic By Amr Al-Awamry. 4 variables K-Map.
K-maps and Decoders Prof. Sin-Min Lee Department of Computer Science.
Fuw-Yi Yang1 數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi.
Digital Systems Design 1 Signal Expressions Multiply out: F = ((X + Y)  Z) + (X  Y  Z) = (X  Z) + (Y  Z) + (X  Y  Z)
FIGURE 3.1 Two-variable K-map
CHAPTER 3 Simplification of Boolean Functions
Eng. Mai Z. Alyazji October, 2016
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Princess Sumaya University
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Chapter 5 Combinational Logic Analysis
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Computer Architecture
Presentation transcript:

Logic Design CS221 1 st Term Logic-Circuit Implementation Cairo University Faculty of Computers and Information

24/10/2009 cs221 – sherif khattab 2 Administrivia lab 2 is divided into two parts subject must include the word CS221 homework 1 due today project ideas due next Saturday by

24/10/2009 cs221 – sherif khattab 3 important concepts clock timing diagram counter datasheet

24/10/2009 cs221 – sherif khattab 4 K-map simplification a Boolean function is represented by a truth table  function value (0 or 1) at each combination of inputs truth table => K-map K-map simplification  combining adjacent squares

24/10/2009 cs221 – sherif khattab 5 don't-care conditions in some Boolean functions, we do not care whether the output is 0 or 1 for some input combinations these don't-care conditions allow for simpler expressions Example:  conversion from BCD-code to excess-3 code  how many inputs?  how many outputs?  truth table (next slide)‏

24/10/2009 cs221 – sherif khattab 6 don't-care conditions (contd.)‏ ? ? ? ? ? ? ? ? ? ? ? ? X X X X X X X X X X X X

24/10/2009 cs221 – sherif khattab 7 don't-care conditions (contd.)‏ K-map for z don't-care conditions can be treated as 1 or 0, whichever gives a simpler expression m 12, m 14, m 10 : 1's m 13, m 15, m 11 : 0's z = ?

24/10/2009 cs221 – sherif khattab 8 don't-care conditions (contd.)‏ Example 2: F = ∑(1,3,7,11,15) with don't-care minterms d = ∑(0,2,5)‏ F = w'x' + yzF = w'z' + yz =?

24/10/2009 cs221 – sherif khattab 9 Boolean function implementation convert Boolean function expression into logic circuit Example: F = B'D' + B'C' + A'C'D

24/10/2009 cs221 – sherif khattab 10 AND-OR implementation any Boolean function can be represented using only AND, OR, and NOT gates  why? sum-of-minterms and sum-of-product forms can be directly converted into two-level AND-OR implementation

24/10/2009 cs221 – sherif khattab 11 NAND implementation NAND gates are easy to fabricate any Boolean function can be represented using only NAND gates why?  answer in the next 2 slides

24/10/2009 cs221 – sherif khattab 12 NAND implementation (contd.)‏ AND, OR, and NOT gates can represented using NAND gates

24/10/2009 cs221 – sherif khattab 13 NAND implementation (contd.)‏ any Boolean function can be represented using only AND, OR, and NOT gates AND, OR, and NOT gates can represented using NAND gates Then? NAND is a universal gate.

24/10/2009 cs221 – sherif khattab 14 how to get a NAND implementation first, note that NAND gate can be: start with AND-OR implementation insert pairs of bubbles (NOT gates)‏ works with alternating levels of AND and OR gates: AND-OR, AND-OR-AND-OR, etc.

24/10/2009 cs221 – sherif khattab 15 how to get a NAND implementation (contd.)‏

24/10/2009 cs221 – sherif khattab 16 how to get a NAND implementation (contd.)‏

24/10/2009 cs221 – sherif khattab 17 how to get a NAND implementation (contd.)‏

24/10/2009 cs221 – sherif khattab 18 how to get a NAND implementation (contd.)‏ combining 1's in a K-map gives:  sum-of-products?  product-of-sums? ? ?

24/10/2009 cs221 – sherif khattab 19 how to get a NAND implementation (contd.)‏ Boolean function in truth table, minterms, or algebraic form represent the function in a K-map simplify the K-map convert the resulting SoP into AND-OR logic circuit convert the AND-OR circuit into NAND circuit as described earlier (by inserting pairs of bubbles)‏

24/10/2009 cs221 – sherif khattab 20 NOR implementation NOR gates are easy to fabricate any Boolean function can be represented using only NOR gates why?  answer in the next 2 slides

24/10/2009 cs221 – sherif khattab 21 NOR implementation (contd.)‏ AND, OR, and NOT gates can represented using NOR gates

24/10/2009 cs221 – sherif khattab 22 NOR implementation (contd.)‏ any Boolean function can be represented using only AND, OR, and NOT gates AND, OR, and NOT gates can represented using NOR gates Then? NOR is a universal gate.

24/10/2009 cs221 – sherif khattab 23 how to get a NOR implementation first, note that NOR gate can be: start with OR-AND implementation insert pairs of bubbles (NOT gates)‏ works with alternating levels of AND and OR gates: AND-OR, AND-OR-AND-OR, etc.

24/10/2009 cs221 – sherif khattab 24 how to get a NOR implementation (contd.)‏

24/10/2009 cs221 – sherif khattab 25 how to get a NAND implementation (contd.)‏ combining 1's in a K-map gives:  sum-of-products?  product-of-sums? NAND NOR ??

24/10/2009 cs221 – sherif khattab 26 product-of-sums from K-map simplify the function's complement (F')‏ where are the squares of F'? combine adjacent 0's get an algebraic form for F' get complement of F': (F')' = F how?

24/10/2009 cs221 – sherif khattab 27 product-of-sums from K-map Example: simplify the following K-map in product- of-sums form F' = AB + CD + BD' F = (A' + B')(C' + D')(B' + D)‏

24/10/2009 cs221 – sherif khattab 28 NOR implementation NOR ??

24/10/2009 cs221 – sherif khattab 29 NOR implementation

24/10/2009 cs221 – sherif khattab 30 wired-and wiring of two NAND gates => AND no physical AND gate -> one-level => less delay F = (AB)'.(CD)' = (AB + CD)‏' AND-OR-INVERT

24/10/2009 cs221 – sherif khattab 31 wired-or wiring of two NOR gates => OR no physical OR gate -> one-level => less delay F = (A+B)' + (C+D) = ((A+B) (C+D))‏' OR-AND-INVERT

24/10/2009 cs221 – sherif khattab 32 other two-level implementations how many two-level implementations from the four gates: AND, OR, NAND, NOR? AND-AND AND-ORAND-NANDAND-NOR OR-AND OR-OR OR-NAND OR-NOR NAND-AND NAND-OR NAND-NAND NAND-NOR NOR-AND NOR-OR NOR-NAND NOR-NOR

24/10/2009 cs221 – sherif khattab 33 other two-level implementations 8 degenerate (AND-AND) : one operation 8 nondegenerate AND-AND AND-ORAND-NANDAND-NOR OR-AND OR-OR OR-NAND OR-NOR NAND-AND NAND-OR NAND-NAND NAND-NOR NOR-AND NOR-OR NOR-NAND NOR-NOR which ones are duals? which ones are equivalent?

24/10/2009 cs221 – sherif khattab 34 AND-NOR, NAND-AND how to get AND-NOR of a function? F' in sum-of-products (AND-OR)‏ F in AND-NOR

24/10/2009 cs221 – sherif khattab 35 OR-NAND, NOR-OR how to get OR-NAND of a function? F' in product-of-sums (OR-AND)‏ F in OR-NAND

24/10/2009 cs221 – sherif khattab 36 xor implementation can we simplify this K-map? note that the 1's are in the odd rows => XOR

24/10/2009 cs221 – sherif khattab 37 xor implementation can we simplify this K-map? note that the 1's are in the odd rows => XOR

24/10/2009 cs221 – sherif khattab 38 parity xor gates are often used in parity generation and checking truth table for even parity generation

24/10/2009 cs221 – sherif khattab 39 parity xor gates are often used in parity generation and checking truth table for even parity checking