SYEN 3330 Digital Systems Jung H. Kim Chapter 2-7 1 SYEN 3330 Digital Systems Chapter 2 Part 7.

Slides:

Advertisements

Similar presentations

Advertisements

Chapter3: Gate-Level Minimization Part 2

EXPLAIN THE LOGIC OPERATION APPLYING BASIC DIGITAL ENGINEERING By Sri Wahyuni, S.Pd.

SYEN 3330 Digital SystemsJung H. Kim 1 SYEN 3330 Digital Systems Chapter 6 – Part 1.

MULTI-LEVEL GATE NETWORKS

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.

Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.

Design of Networks with Limited Gate Fan-in

ENGIN112 L11: NAND and XOR Implementation September 26, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 11 NAND and XOR Implementations.

SYEN 3330 Digital SystemsJung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 – Part 1.

EE2174: Digital Logic and Lab Professor Shiyan Hu Department of Electrical and Computer Engineering Michigan Technological University CHAPTER 4 Technology.

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.

Introduction Gate-level minimization refers to the design task of finding an optimal gate-level implementation of Boolean functions describing a digital.

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.

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.

Floyd Digital Fundamentals, 9/e Copyright ©2006 by Pearson Education, Inc. Upper Saddle River, New Jersey All rights reserved. Slide 1 Digital Fundamentals.

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.

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.

Unit 7 Multi-Level Gate Circuits Nand and Nor Gates Fundamentals of Logic Design Roth and Kinny.

Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.

LOGIC CIRCUIT IMPLEMENTATION

NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions

ETE 204 – Digital Electronics

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

CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.

COE 202: Digital Logic Design Combinational Logic Part 4

TUTORIAL CHAPTER 3 GATE_LEVEL MINIMIZATION PART 2 TA. Arwa Al Saad. 9 November 2013.

CS 1110 Digital Logic Design

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.

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.

Nonlinear & Neural Networks LAB. CHAPTER 8 Combinational Circuit design and Simulation Using Gate 8.1Review of Combinational Circuit Design 8.2Design of.

Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 4 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:

Digital Integrated Circuit Design Laboratory Department of Computer Science and Information Engineering National Cheng Kung University Experiment on digital.

NAND-NAND and NOR-NOR Circuits and Even and Odd Logic Functions ECE 301 – Digital Electronics.

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.

1 CS 151: Digital Design Chapter 3: Combinational Logic Design 3-1Design Procedure CS 151: Digital Design.

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.

CHAPTER 5 Combinational Logic Analysis

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.

SLIDES FOR CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES

Speaker: Fuw-Yi Yang 楊伏夷伏夷非征番, 道德經察政章(Chapter 58) 伏者潛藏也

CHAPTER 7 MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES

Logic Gates Benchmark Companies Inc PO Box Aurora CO

Boolean Expressions Lecture No. 10.

KS4 Electricity – Electronic systems

KS4 Electricity – Electronic systems

BASIC & COMBINATIONAL LOGIC CIRCUIT

Digital Logic & Design Lecture 05

CSE 370 – Winter Combinational Implementation - 1

SYEN 3330 Digital Systems Chapter 2 Part 7 SYEN 3330 Digital Systems.

KS4 Electricity – Electronic systems

Chapter 3 Overview • Multi-Level Logic

Special Gates Combinational Logic Gates

SYEN 3330 Digital Systems Chapter 2 – Part 1 SYEN 3330 Digital Systems.

Presentation transcript:

SYEN 3330 Digital Systems Jung H. Kim Chapter SYEN 3330 Digital Systems Chapter 2 Part 7

SYEN 3330 Digital Systems Chapter 2-7 Page 2 NAND and NOR Implementation

SYEN 3330 Digital Systems Chapter 2-7 Page 3 NAND Gates

SYEN 3330 Digital Systems Chapter 2-7 Page 4 NAND Gates (Cont.)

SYEN 3330 Digital Systems Chapter 2-7 Page 5 NAND Implementation

SYEN 3330 Digital Systems Chapter 2-7 Page 6 NAND Implementation (Cont.)

SYEN 3330 Digital Systems Chapter 2-7 Page 7 Degenerate AND Term

SYEN 3330 Digital Systems Chapter 2-7 Page 8 NAND-NAND Example

SYEN 3330 Digital Systems Chapter 2-7 Page 9 NAND-NAND Example

SYEN 3330 Digital Systems Chapter 2-7 Page 10 NOR Gates

SYEN 3330 Digital Systems Chapter 2-7 Page 11 NOR Implementation

SYEN 3330 Digital Systems Chapter 2-7 Page 12 Useful Transformations

SYEN 3330 Digital Systems Chapter 2-7 Page 13 Graphical Transformations

SYEN 3330 Digital Systems Chapter 2-7 Page 14 General Two-level Implementations

SYEN 3330 Digital Systems Chapter 2-7 Page 15 General Implementations (Cont.)

SYEN 3330 Digital Systems Chapter 2-7 Page 16 Implementation Example

SYEN 3330 Digital Systems Chapter 2-7 Page 17 Implement F in AND-NOR form Implement the network:

SYEN 3330 Digital Systems Chapter 2-7 Page 18 Multi-level NAND Implementations Add inverters in two-level implementation into the cost picture Attempt to “combine” inverters to reduce the term count Attempt to reduce literal + term count by factoring expression into POSOP or SOPOS

SYEN 3330 Digital Systems Chapter 2-7 Page 19 Multi-level NAND Example 1 F = A B’ + A C’ + B A’ + B C’ = A A’ + A B’ + A C’ + B A’ + B B’ + B C’ = A (A’ + B’ + C’) + B (A’ + B’ + C’) F A C B 7 inputs and 4 gates 15 inputs and 8 gates* * Counting inverters (NOTS) as 1 input and 1 gate

SYEN 3330 Digital Systems Chapter 2-7 Page 20 Multilevel NAND Example 2 F = AB + AD’ + BC + CD’ 12 inputs & 5 gates = A(B + D’) + C(B + D’) 8 inputs & 5 gates F A C B D