Multi-Level Gate Networks NAND and NOR Gates

Slides:



Advertisements
Similar presentations
Switching circuits Composed of switching elements called “gates” that implement logical blocks or switching expressions Positive logic convention (active.
Advertisements

Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
Boolean Algebra and Combinational Logic
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.
MULTI-LEVEL GATE NETWORKS
CS 151 Digital Systems Design Lecture 11 NAND and XOR Implementations.
ENGIN112 L11: NAND and XOR Implementation September 26, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 11 NAND and XOR Implementations.
Example: Given a 4-bit input combination N=N 3 N 2 N 1 N 0, this function produces a 1 output for N=1,2,3,5,7,11,13, and 0 otherwise.  According to the.
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.
©2010 Cengage Learning SLIDES FOR CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES This chapter in the book includes: Objectives Study Guide 7.1Multi-Level.
2.7 NAND and NOR logic networks
Digital Logic Design Adil Waheed. BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION AND gate F = A.B OR gate F = A + B NOT gate F = A NAND gate F = A.B NOR gate.
© 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.
Unit 7 Multi-Level Gate Circuits / NAND and NOR Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
ECE 331 – Digital System Design NAND and NOR Circuits, Multi-level Logic Circuits, and Multiple-output Logic Circuits (Lecture #9) The slides included.
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
Basic Gates 3.1 Basic Digital Logic: NAND and NOR Gates ©Paul Godin Created September 2007 Last Update Sept 2009.
CHAPTER 7 MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES
ECE 3110: Introduction to Digital Systems
Implementation of SOP/POS Expressions
Basic Digital Logic: NAND and NOR Gates Technician Series ©Paul Godin Last Update Dec 2014.
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.
1 Logic Gates and Circuits  Logic Gates Logic Gates  The Inverter The Inverter  The AND Gate The AND Gate  The OR Gate The OR Gate  The NAND Gate.
Digital Integrated Circuit Design Laboratory Department of Computer Science and Information Engineering National Cheng Kung University Experiment on digital.
Floyd, Digital Fundamentals, 10 th ed Digital Fundamentals Tenth Edition Floyd Chapter 5 © 2008 Pearson Education.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Pp244 In Sum-of-Products (SOP) form, basic.
NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions ECE 301 – Digital Electronics.
1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
Topic 4 – Switching Circuits. Serial vs. Parallel Transmission Circuit elements can be connected in either a serial or parallel manner. Serial implies.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
CEC 220 Digital Circuit Design NAND/NOR Multi-Level Circuits
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
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.
©2010 Cengage Learning SLIDES FOR CHAPTER 8 COMBINATIONAL CIRCUIT DESIGN AND SIMULATION USING GATES Click the mouse to move to the next page. Use the ESC.
SLIDES FOR CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES
MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES
Combinational Circuits Part 1
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
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Universal Gate – NAND Universal Gate - NAND Digital Electronics
CS 105 Digital Logic Design
Logic Gates.
ECE 331 – Digital System Design
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Universal gates.
Universal Gate – NAND Universal Gate - NAND Digital Electronics
King Fahd University of Petroleum and Minerals
CH7 Multilevel Gate Network
CSE 370 – Winter Combinational Implementation - 1
Logic Gates.
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Chapter 3 Overview • Multi-Level Logic
Digital Fundamentals Floyd Chapter 5 Tenth Edition
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
Combinational Logic Circuit
Presentation transcript:

Multi-Level Gate Networks NAND and NOR Gates Digital Technology: ENEL211

Outline Gate levels in circuit networks Functionally complete sets Reducing levels Functionally complete sets Alternative AND/NAND and OR/NOR gates Designing NAND-only or NOR-only circuit networks

Levels of Gates in a Network The number of gates cascaded in series between a network input the output is referred to as the number of levels of gates Sum-of-products or product-of-sums expression yields a two level network Note: Usually networks are driven from flip-flop devices so that variables and their compliments are available – therefore Inverters can be excluded from the level count of the network

Categories of Network AND-OR: 2 level with a level of AND gates followed by an OR gate at the output OR-AND: 2 level with level of OR gates followed by an AND gate at the output OR-AND-OR: 3 level with a level of OR gates followed by a level of AND gates then an OR gate at the output Network of AND and OR gates: multiple levels of AND and OR gate

Changing Levels in Networks Levels in AND-OR networks are (usually) increased by factoring the sum-of-products expression. Levels in OR-AND networks are (usually) increased by multiplying out terms in the product-of-sums expression Increasing the levels can bring about a reduction in the number of gates – which is good isn’t it?

Problems with Multiple Levels of Cascading Designers are concerned with the number of levels in networks Increasing the number levels of a Network will increase the time between change in input and output And slow down the operation of a digital system Thus: the number of levels limited by propagation delays of gates

A Four-Level Network

Analysis Network for X has 4 levels, 6 gates and 13 inputs Partially multiplying out the expression gives rise to a network with 3 levels, 6 gates and 19 inputs

Equivalent 3 Level Network No increase in the number of gates But would normally expect a trade-off between levels and gates Increase in the number inputs – but does this matter?

Realising Networks with a Single Gate Type Companies learned that AND-OR-NOT gates circuits could be implemented using only NAND or NOR gates Circuits implemented using a single gate type are generally faster and require less components Economies of scale: reduced costs due to bulk buying Though this is not applicable nowadays due to low price of integrated circuits

Functionally Complete Sets of Logic Gates A set of logic operations is said to functionally complete if any Boolean function can be expressed in terms of the operations in the set

Example: AND, OR and NOT Take the set of Boolean Operations: Since any Boolean function can be expressed in sum-of-products form And sum-of-products expressions only comprise of AND, OR and NOT operations The logical set of operations AND, OR and NOT is therefore functionally complete

The NAND operation is functionally Complete

Show that the NOR operation is also Functionally Complete

Design of minimum Two-Level NAND-NAND Network Find the minimum sum-of-products expression Draw the corresponding two-level AND-OR network Replace all gates with NAND gates (leave gate interconnection unchanged) Complement any literal inputs to the level 1 gate

AND-OR and Equivalent NAND-NAND

Design of minimum Two-Level NOR-NOR Network Find the minimum product-of-sums expression Draw the corresponding two-level AND-OR network Replace all gates with NOR gates (leave gate interconnection unchanged) Complement any literal inputs to the level 1 gate

Example XOR Gate A B X 1

Exercise 1 Given the truth opposite: A AB 1 Given the truth opposite: Design a two-level NAND-NAND network And a two-level NOR-NOR network With minimum gates. Assume complements are available B CD D C

Digital Simulation If you’ve got Digital Works or Logisim, build the AND-OR network and corresponding NAND-NAND network and satisfy yourself that they are equivalent And do the same for the OR-AND and NOR-NOR network Logisim http://ozark.hendrix.edu/~burch/logisim/

Design of Multi-Level NAND-Gate Networks Specify the operation of the switching network Design network with AND and OR gates. Output must be an OR gate (at level 1) AND gate output cannot be used as AND gate inputs Or gate output cannot be used as OR gate inputs Replace all gates with NAND gates Invert any literals at levels, 1,3,5,… (levels 2,4,6,…leave unchanged

Design of Multi-Level NOR-Gate Networks Specify the operation of the switching network Design network with AND and OR gates. Output must be an AND gate (at level 1) AND gate output cannot be used as AND gate inputs Or gate output cannot be used as OR gate inputs Replace all gates with NOR gates Invert any literals at levels, 1,3,5,… (levels 2,4,6,…leave unchanged

Exercise Draw the switching network for X. Assume complements are available Redraw it using NAND gates only

Multi-Level AND-OR Network

Equivalent NAND Network

Alternative NOT Gate Usually the inversion “bubble” is placed at the output of gate However the bubble can be placed at the input

Alternative AND and OR Gates (By simple application of DeMorgan’s Law)

Alternative NAND and NOR Gates These symbols can be used to facilitate analysis and design of NAND and NOR networks.

Example of Alternative Method Consider the NAND gate network below Assume compliments are available

Example Replace the NAND gates at the 1st and 3rd level with their alternative symbols

Example Double inversions cancel Remove inversion bubbles for literals and replace with their complements

Exercise Convert the AND-OR network below to a NOR gate only network using the reverse process Assume compliments are available

Exercise: Solution Change OR gates to “conventional” NOR gate symbol Change AND gates to the alternative NOR gate symbol Invert input literals at these (AND) gates Swap alternative NOR gate symbols for conventional NOR gates symbol (but not necessary)

Converting to NAND (or NOR) for non-alternating ANDs and ORs Consider the network below AND and OR gates do not alternate between levels

First Step for NAND conversion Replace ANDs with NANDs by adding inversion bubble to the output Replace Ors with NANDs by adding inversion bubbles to inputs But this is not an equivalent circuit…

Second Step for NAND conversion When an inverted input drives an inverted output no action is necessary But when non-inverted input drives an inverted output (or the other way round) insert an inverter Complement literals at inverted inputs

Exercise For the function F3=(0,2,3,7)8 Use a Karnaugh Map to derive a least minterm expression And a least maxterm expression Draw and NOR realisation of both the minterm and maxterm expression Verify your results