EE 231 Digital Electronics Fall 01 Week 4-1 Multi-Level Logic: Conversion of Forms NAND-NAND and NOR-NOR Networks DeMorgan's Law: A + B = A B; A B = A.

Slides:



Advertisements
Similar presentations
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
Advertisements

Combinational Logic : NAND – NOR Gates CS370 – Spring 2003.
Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
Number Systems Discussion D4.1 Appendix C. Number Systems Counting in Binary Positional Notation Hexadecimal Numbers Negative Numbers.
Chapter # 3: Multi-Level Combinational Logic
MULTI-LEVEL GATE NETWORKS
CS 151 Digital Systems Design Lecture 11 NAND and XOR Implementations.
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
ENGIN112 L11: NAND and XOR Implementation September 26, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 11 NAND and XOR Implementations.
Lecture 5 Multilevel Logic Synthesis
ECE 331 – Digital System Design Multi-level Logic Circuits and NAND-NAND and NOR-NOR Circuits (Lecture #8) The slides included herein were taken from the.
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
SYEN 3330 Digital Systems Jung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 Part 7.
Computer ArchitectureFall 2007 © August 29, 2007 Karem Sakallah CS 447 – Computer Architecture.
+ CS 325: CS Hardware and Software Organization and Architecture Exam 1: Study Guide.
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.
Unit 7 Multi-Level Gate Circuits / NAND and NOR Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
Chapter # 3: Multi-Level Combinational Logic
Overview of Chapter 3 °K-maps: an alternate approach to representing Boolean functions °K-map representation can be used to minimize Boolean functions.
Digital Electronics. Introduction to Number Systems & Codes Digital & Analog systems, Numerical representation, Digital number systems, Binary to Decimal.
DeMorgan Theorem, Computer Simulation Exercises
ECE 331 – Digital System Design NAND and NOR Circuits, Multi-level Logic Circuits, and Multiple-output Logic Circuits (Lecture #9) The slides included.
DLD Lecture 19 Recap II Give qualifications of instructors: DAP
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
1 CSE370, Lecture 5 Lecture 5 u Logistics n HW1 due today n HW2 available today, due Wed 1/21 n Office Hours this week: íMe: Friday 10:00-11:00 CSE 668.
Unit 7 Multi-Level Gate Circuits Nand and Nor Gates Fundamentals of Logic Design Roth and Kinny.
NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions
ETE 204 – Digital Electronics
Multi-Level Gate Networks NAND and NOR Gates
CHAPTER 7 MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES
LOGIC GATES & BOOLEAN ALGEBRA
TUTORIAL CHAPTER 3 GATE_LEVEL MINIMIZATION PART 2 TA. Arwa Al Saad. 9 November 2013.
Unit 1 Minimization Techniques and Logic Gates. Introduction to Digital Systems Analog devices and systems process time-varying signals that can take.
Logic Functions: XOR, XNOR
ECE/CS 352 Digital System Fundamentals© T. Kaminski & C. Kime 1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 2 Part 7 Tom Kaminski & Charles.
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
Lecture 09 NAND and XOR Implementations. Overview °Developing NAND circuits °Two-level implementations Convert from AND/OR to NAND (again!) °Multi-level.
Logic Gates Informatics INFO I101 February 3, 2003 John C. Paolillo, Instructor.
Combinational Logic Design Process © 2014 Project Lead The Way, Inc.Digital Electronics.
Kavita Bala CS 3410, Spring 2014 Computer Science Cornell University.
Digital Integrated Circuit Design Laboratory Department of Computer Science and Information Engineering National Cheng Kung University Experiment on digital.
Digital Representations ME 4611 Binary Representation Only two states (0 and 1) Easy to implement electronically %0= (0) 10 %1= (1) 10 %10= (2) 10 %11=
NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions ECE 301 – Digital Electronics.
No. 3-1 Chapter # 3: Multi-Level Combinational Logic.
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.
In decimal we are quite familiar with placing a “-” sign in front of a number to denote that it is negative The same is true for binary numbers a computer.
Gates AND, OR, NOT NAND, NOR Combinational logic No memory A set of inputs uniquely and unambiguously specifies.
1 Ethics of Computing MONT 113G, Spring 2012 Session 4 Binary Addition.
{ Binary “There are 10 types of people in the world: Those who understand binary, and those who don't.”
1’S COMPLEMENT REPRESENTATION 1’s complement of a number (binary) is obtained by changing all 1’s to 0 and all 0’s to 1. If one of these numbers is positive.
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Universal Gate – NAND Universal Gate - NAND Digital Electronics
CHAPTER 7 MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Boolean Expressions Lecture No. 10.
University of Gujrat Department of Computer Science
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Lecture 6 Logistics Last lecture Today’s lecture HW2 due on Wednesday
Universal Gate – NAND Universal Gate - NAND Digital Electronics
CSE 370 – Winter Combinational Implementation - 1
EECS150 - Digital Design Lecture 7 - Boolean Algebra II
SYEN 3330 Digital Systems Chapter 2 Part 7 SYEN 3330 Digital Systems.
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Chapter 3 Overview • Multi-Level Logic
Lecture 5 Converting to use NAND and NOR
Lecture 6 Logistics Last lecture Today’s lecture HW2 due on Wednesday
CSE 370 – Winter Number syst.; Logic functions- 1
Presentation transcript:

EE 231 Digital Electronics Fall 01 Week 4-1 Multi-Level Logic: Conversion of Forms NAND-NAND and NOR-NOR Networks DeMorgan's Law: A + B = A B; A B = A + B Written differently: A + B = A B; A B = A + B A A BB A B A B   In other words, OR =NAND with complemented inputs AND =NOR with complemented inputs NAND =OR with complemented inputs NOR = AND with complemented inputs A B A B  AA BB 

EE 231 Digital Electronics Fall 01 Week 4-2 Multi-Level Logic: Conversion of Forms Example: Map AND/OR network to NAND/NAND network Verify equivalence of the two forms NAND A A B B C C D D Z Z

EE 231 Digital Electronics Fall 01 Week 4-3 Multi-Level Logic: Mapping Between Forms Example: Map AND/OR network to NOR/NOR network Step 1 Step 2 NOR Conserve "Bubbles" NOR Conserve "Bubbles" A A’ B B’ C C’ D D’ Z Z

EE 231 Digital Electronics Fall 01 Week 4-4 Multi-Level Logic: CAD Tools for Simplification Decomposition: Take a single Boolean expression and replace with collection of new expressions: F = A B C + A B D + A' C' D' + B' C' D' F rewritten as: F = X Y + X' Y' X = A B Y = C + D (12 literals) (4 literals) Before Decomposition After Decomposition F F A A A A B B B B C C C C D D D D X Y

EE 231 Digital Electronics Fall 01 Week 4-5 Multi-Level Logic: CAD Tools for Simplification Extraction: common intermediate subfunctions are factored out F = (A + B) C D + E G = (A + B) E' H = C D E can be re-written as: F = X Y + E G = X E' H = Y E X = A + B Y = C D (11 literals) (7 literals) Before Extraction After Extraction X E E E GG Y HH A A AB B B C C CD D D FF

EE 231 Digital Electronics Fall 01 Week 4-6 Multi-Level Logic: CAD Tools for Simplification Factoring: expression in two level form re-expressed in multi-level form F = A C + A D + B C + B D + E can be rewritten as: F = (A + B) (C + D) + E (9 literals) (5 literals) Before FactoringAfter Factoring A A A B B B C C C D D D E E F F

EE 231 Digital Electronics Fall 01 Week 4-7 Number Systems Sign and Magnitude Representation High order bit is sign: 0 = positive (or zero), 1 = negative Three low order bits is the magnitude: 0 (000) to 7 (111) Two representations for 0 are: 0000 and 1000

EE 231 Digital Electronics Fall 01 Week 4-8 Number Systems Ones Complement To negate a number simply flip all the bits. Still two representations of 0!

EE 231 Digital Electronics Fall 01 Week 4-9 Number Representations Twos Complement To negate: Twos complement = Ones complement + 1 Only one representation for 0 Easier to implement addition and subtraction

EE 231 Digital Electronics Fall 01 Week 4-10 Number Systems Overflow Conditions Add two positive numbers to get a negative number or two negative numbers to get a positive number = =