Design of Networks with Limited Gate Fan-in

Slides:



Advertisements
Similar presentations
Combinational Logic : NAND – NOR Gates CS370 – Spring 2003.
Advertisements

Digital CMOS Logic Circuits
Logic Gates.
ECE C03 Lecture 21 Lecture 2 Two Level Minimization Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
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.
Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 4-1 Chapter #2: Two-Level Combinational Logic Section 2.3, Switches and Tools.
Design of Two-Level Multiple-Output Networks
10/25/2004EE 42 fall 2004 lecture 231 Lecture #23 Synthesis Next week: Converting gates into circuits.
1 Copyright © 2013 Elsevier Inc. All rights reserved. Chapter 2 Combinational Logic Design.
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.
SYEN 3330 Digital Systems Jung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 Part 7.
Unit 8 Combinational Circuit Design and Simulation Using Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science.
©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.
Digital Logic Design Lecture # 8 University of Tehran.
Unit 7 Multi-Level Gate Circuits / NAND and NOR Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
Top-down modular design
NOCTI Review Lesson 4 Objectives:
ECE 331 – Digital System Design NAND and NOR Circuits, Multi-level Logic Circuits, and Multiple-output Logic Circuits (Lecture #9) The slides included.
Copyright © 2004 by Miguel A. Marin1 COMBINATIONAL CIRCUIT SYNTHESIS CLASSIC TWO-LEVEL CIRCUIT SYNTHESIS MULTILEVEL-CIRCUIT SYNTHESIS FACTORIZATION DECOMPOSITION.
5 Variable K-Map.
Unit 7 Multi-Level Gate Circuits Nand and Nor Gates Fundamentals of Logic Design Roth and Kinny.
CS231 Boolean Algebra1 K-map Summary K-maps are an alternative to algebra for simplifying expressions. – The result is a minimal sum of products, which.
Chapter 33 Basic Logic Gates. 2 Objectives –After completing this chapter, the student should be able to: Identify and explain the function of the basic.
LOGIC CIRCUIT IMPLEMENTATION
Chapter 3 Gate-Level Minimization
Chapter 2 Two- Level Combinational Logic. Chapter Overview Logic Functions and Switches Not, AND, OR, NAND, NOR, XOR, XNOR Gate Logic Laws and Theorems.
NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions
ETE 204 – Digital Electronics
CHAPTER 7 MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES
A.Abhari CPS2131 Chapter 3: Gate-Level Minimization Topics in this Chapter: The Map Method Two-Variable Map Three- Variable Map Four/Five variable Map.
TUTORIAL CHAPTER 3 GATE_LEVEL MINIMIZATION PART 2 TA. Arwa Al Saad. 9 November 2013.
1 EG 32 Digital Electronics Thought for the day You learn from your mistakes..... So make as many as you can and you will eventually know everything.
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.
Nonlinear & Neural Networks LAB. CHAPTER 8 Combinational Circuit design and Simulation Using Gate 8.1Review of Combinational Circuit Design 8.2Design of.
CEC 220 Digital Circuit Design NAND/NOR Multi-Level Circuits
 Do the following conversions:  Solve the following:    /100  10010*110 DecimalOctalHexadecimalBinary 78--
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
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.
President UniversityErwin SitompulDigital Systems 4/1 Lecture 4 Digital Systems Dr.-Ing. Erwin Sitompul President University
Chapter 33 Basic Logic Gates. Objectives After completing this chapter, you will be able to: –Identify and explain the function of the basic logic gates.
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.
©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.
Lecture 7 Multi-Level Gate Networks
MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES
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
Table 2.1 Postulates and Theorems of Boolean Algebra
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Logic Gates.
Digital CMOS Logic Circuits
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Universal Gate – NAND Universal Gate - NAND Digital Electronics
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Chapter 12 : Field – Effect Transistors
Universal gates.
Universal Gate – NAND Universal Gate - NAND Digital Electronics
CH7 Multilevel Gate Network
CSE 370 – Winter Combinational Implementation - 1
Logic Gates.
SYEN 3330 Digital Systems Chapter 2 Part 7 SYEN 3330 Digital Systems.
KS4 Electricity – Electronic systems
Universal Gate – NOR Universal Gate - NOR Digital Electronics
Table 2.1 Postulates and Theorems of Boolean Algebra
Department of Electronics
Presentation transcript:

Design of Networks with Limited Gate Fan-in If a two-level network realization requires more more gate Inputs than allowed, factoring the logic expression to obtain a multi-level realization is necessary. Example: Realize f(a,b,c,d) = S m(0,3,4,5,8,910,14,15) using three-input NOR gates. Soln.: -must use three-input NOR gates so factor expression for f’ and complement

Design of Networks with Limited Gate Fan-in When designing multiple-output networks with more than two levels, it is usually best to minimize each function separately. -- resulting two-level expressions are factored to increase number of levels -- factoring should be done in a way that introduces common terms. Example: Realize the given functions using only two-input NAND gates and inverters. Soln.: -functions to be realized and k-maps are shown

Design of Networks with Limited Gate Fan-in Example(cont’d): Realize the given functions using only two-input NAND gates and inverters. Soln.(cont’d): If we minimize each function separately the result is Factoring to reduce no. of gate inputs (while increasing no. of levels) Expression has common term -- preferred - common terms are underlined in the above expressions -the remaining 3-input gate in the f3 expression for can be eliminated using

Design of Networks with Limited Gate Fan-in Example(cont’d): Realize the given functions using only two-input NAND gates and inverters. Soln.(cont’d): Realization converted to NAND form Realization