Combinational Logic Circuits Chapter 2 Mano and Kime.

Slides:

Advertisements

Similar presentations

Digital Logic Design Gate-Level Minimization

Advertisements

Chapter3: Gate-Level Minimization Part 2

CS 121 Digital Logic Design

CS 121 Digital Logic Design

Combinational Logic Circuits Chapter 2 Mano and Kime.

Gate-Level Minimization

Gate-level Minimization

Karnaugh Maps Discussion D3.1. Karnaugh Maps Minterm X Y F m m m m X Y F(X,Y) = m0 + m2 + m3 =  (0,2,3) = X + Y'

Gate-Level Minimization

Gate-Level Minimization. Digital Circuits The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.

Basic Digital Design Discussion D5.4 Section 13.6.

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

Karnaugh Maps Discussion D6.2 Section Karnaugh Maps Minterm X Y F m m m m X Y F(X,Y) = m0 | m2 | m3 =  (0,2,3)

Integrated Circuits CSE 495/595 Review Supplement.

Basic Digital Design Discussion D5.4 Appendix F. Basic Digital Design Sum-of-Products Design Product-of-Sums Design.

Basic Digital Design Discussion D2.3. Basic Digital Design Sum of Products Design –Minterms Product of Sums Design –Maxterms.

Karnaugh Maps Discussion D6.2 Appendix H. Karnaugh Maps Minterm x y f m m m m x y f(x,y) = m0 | m2 | m3 =  (0,2,3)

Gate-Level Minimization1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

Computer Engineering (Logic Circuits) (Karnaugh Map)

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

ENEE244-02xx Digital Logic Design Lecture 10. Announcements HW4 assigned, due 10/9.

Digital Logic Gates. Sum of Products (Review) Procedure: 1.Form a minterm for each combination of the variables that produces a 1 2.OR all the minterms.

1 Fundamentals of Computer Science Propositional Logic (Boolean Algebra)

1 Logic Gates Digital Computer Logic Kashif Bashir WWW:

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.

F = ∑m(1,4,5,6,7) F = A’B’C+ (AB’C’+AB’C) + (ABC’+ABC) Use X’ + X = 1.

Gate-Level Minimization Chapter 3. Digital Circuits The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.

CS 151: Introduction to Digital Design Chapter 2-9 Exclusive-OR Gates.

Logic and Computer Design Simon Petruc-Naum CS 147 – Dr. S.M. Lee.

October 29, 2015 EASTERN MEDITERRANEAN UNIVERSITY1 Digital Logic Design I Gate-Level Minimization Mustafa Kemal Uyguroğlu.

Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.

Chapter 3 Gate-Level Minimization

Boolean Logic and Circuits ELEC 311 Digital Logic and Circuits Dr. Ron Hayne Images Courtesy of Cengage Learning.

ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.

Gate-Level Minimization

Gate-level Minimization

D IGITAL L OGIC D ESIGN I G ATE -L EVEL M INIMIZATION.

Chap 2. Combinational Logic Circuits. Chap Binary Logic and Gates l 디지털 회로 (Digital circuits) o hardware components that manipulate binary information.

CHAPTER 3: PRINCIPLES OF COMBINATIONAL LOGIC

Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and

CS 1110 Digital Logic Design

Unit 1 Minimization Techniques and Logic Gates. Introduction to Digital Systems Analog devices and systems process time-varying signals that can take.

CS 121 Digital Logic Design Gate-Level Minimization Chapter 3.

Gate-Level Minimization Gate-Level Minimization. Outline 3.1 Introduction 3.2 The map method 3.3 Four-variable map 3.4 Five-variable map 3.5 Product of.

Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.

Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.

Karnaugh Maps (K-Maps)

BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION

ECE/CS 352 Digital System Fundamentals1 ECE/CS 352 Digital Systems Fundamentals Spring 2001 Chapter 2 – Part 5 Tom Kaminski & Charles R. Kime.

Karnaugh Map (K-Map) By Dr. M. Khamis Mrs. Dua’a Al Sinari.

Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.

Chapter 4 OPTIMIZED IMPLEMENTATION OF LOGIC FUNCTIONS.

CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.

BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.

NAND, NOR, and EXOR (more primitive logical gates) CS Computer Architecture David Mayer.

1 논리공학 고려대학교 전기전자전파공학부 김종국. 2  1 or 0, yes or no, true or false …  디지털 시스템을 위한 기초  거의 모든 전기전자제품은 디지털 시스템 e.g., 핸드폰, 전자시계, 컴퓨터 …  이진수  필요성  십진수에서.

Fuw-Yi Yang1 數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi.

Mu.com.lec 9. Overview Gates, latches, memories and other logic components are used to design computer systems and their subsystems Good understanding.

CHAPTER 3 Simplification of Boolean Functions

Table 2.1 Postulates and Theorems of Boolean Algebra

De Morgan’s Theorem,.

Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and

Gate-Level Minimization

ECE 2110: Introduction to Digital Systems

ECE 3110: Introduction to Digital Systems

Princess Sumaya University

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

Chapter 3 Gate-level Minimization.

Table 2.1 Postulates and Theorems of Boolean Algebra

Computer Architecture

Presentation transcript:

Combinational Logic Circuits Chapter 2 Mano and Kime

Combinational Logic Circuits Binary Logic and Gates Boolean Algebra Standard Forms Map Simplification Map Manipulation NAND and NOR Gates Exclusive-OR Gates Integrated Circuits

Digital Logic Gates *

Gates with More than Two Inputs

Combinational Logic Circuits Binary Logic and Gates Boolean Algebra Standard Forms Map Simplification Map Manipulation NAND and NOR Gates Exclusive-OR Gates Integrated Circuits

Basic Identities of Boolean Algebra

Implementation of Boolean Function with Gates

Combinational Logic Circuits Binary Logic and Gates Boolean Algebra Standard Forms Map Simplification Map Manipulation NAND and NOR Gates Exclusive-OR Gates Integrated Circuits

Minterms for Three Variables

Sum of Products Design X Y minterms 0 0 m0 = !X & !Y 0 1 m1 = !X & Y 1 0 m2 = X & !Y 1 1 m3 = X & Y

Sum of Products Design X Y Z Design an XOR gate m1 = !X & Y m2 = X & !Y Z = m1 # m2 = (!X & Y) # (X & !Y)

Sum of Products: Exclusive-OR !X & Y X & !Y Z = (!X & Y) # (X & !Y)

Maxterms for Three Variables

Product of Sums Design Maxterms: A maxterm is NOT a minterm maxterm M0 = NOT minterm m0 M0 = !m0 = !(!X & !Y) = !!(!!X # !!Y) = X # Y

Product of Sums Design X Y minterms maxterms 0 0 m0 = !X & !Y M0 = !m0 = X # Y 0 1 m1 = !X & Y M1 = !m1 = X # !Y 1 0 m2 = X & !Y M2 = !m2 = !X # Y 1 1 m3 = X & Y M3 = !m3 = !X # !Y

Product of Sums Design X Y Z Design an XOR gate Z is NOT minterm m0 AND it is NOT minterm m3

Product of Sums Design X Y Z Design an XOR gate M0 = X # Y M3 = !X # !Y Z = M0 & M3 = (X # Y) & (!X # !Y)

Product of Sums: Exclusive-OR

Three- Level and Two- Level Implementation

Combinational Logic Circuits Binary Logic and Gates Boolean Algebra Standard Forms Map Simplification Map Manipulation NAND and NOR Gates Exclusive-OR Gates Integrated Circuits

Two-Variable Map

Three-Variable Map

Three- Variable Map: Flat and on a Cylinder to Show Adjacent Squares

Three-variable K-Maps X YZ F = !X & !Y # X & Z

Three-variable K-Maps X YZ F = !X & !Y & !Z # !X & !Y & Z # X & !Y & Z # X & Y & Z F = !X & !Y & (!Z # Z) # X & Z & (!Y # Y) = !X & !Y # X & Z

Three-variable K-Maps X YZ F = Y & !Z # X 1

Three-variable K-Maps X YZ F = !X & !Y # X & y # Z

Three-variable K-Maps X YZ F = X & Z # !X & !Z

Three-variable K-Maps X YZ F = Y # !Z

Three-variable K-Maps X YZ F = m0 # m2 # m5 # m7 =  (0,2,5,7)

Four-Variable Map

Four-Variable Map: Flat and on a Torus to Show Adjacencies

Four-variable K-Maps WX YZ

Four-variable K-Maps WX YZ F(W,X,Y,Z) =  (2,4,5,6,7,9,13,14,15)

Four-variable K-Maps WX YZ F = !W & X # X & Y # !W & Y & !Z # W & !Y & Z

Combinational Logic Circuits Binary Logic and Gates Boolean Algebra Standard Forms Map Simplification Map Manipulation NAND and NOR Gates Exclusive-OR Gates Integrated Circuits

Prime Implicants F = X & !Y & Z # !X & !Z # !X & Y Each product term is an implicant A product term that cannot have any of its variables removed and still imply the logic function is called a prime implicant.

Combinational Logic Circuits Binary Logic and Gates Boolean Algebra Standard Forms Map Simplification Map Manipulation NAND and NOR Gates Exclusive-OR Gates Integrated Circuits

Digital Logic Gates >

>

Logical Operations with NAND Gates

Alternative Graphics Symbols for NAND and NOT Gates

Logical Operations with NOR Gates

Two Graphic Symbols for NOR Gate

Demonstration of Positive and Negative Logic

Generalized De Morgan’s Theorem NOT all variables Change & to # and # to & NOT the result F = X & Y # X & Z # Y & Z F = !((!X # !Y) & (!X # !Z) & (!Y # !Z)) F = !(!(X & Y) & !(X & Z) & !(Y & Z))

NAND Gate

X Y X Z Y Z F F = X & Y # X & Z # Y & Z

Combinational Logic Circuits Binary Logic and Gates Boolean Algebra Standard Forms Map Simplification Map Manipulation NAND and NOR Gates Exclusive-OR Gates Integrated Circuits

Exclusive-OR Gate XOR X Y Z Z = X $ Y X Y Z X $ 0 = X X $ 1 = !X X $ X = 0 X $ !X = 1 X $ !Y = !(X $ Y) !X $ Y = !(X $ Y) A $ B = B $ A (A $ B) $ C = A $ (B $ C) = A $ B $ C

Exclusive-OR Constructed with NAND gates X & (!X # !Y) # Y & (!X # !Y) = X & !X # X & !Y # Y & !X # Y & !Y = X & !Y # Y & !X = X & !Y # !X & Y = X $ Y

Odd Function X $ Y $ Z = (X & !Y # !X & Y) & !Z # (X & Y # !X & !Y) & Z = X & !Y & !Z # !X & Y & !Z # !X & !Y & Z # X & Y & Z

Odd Function

Parity Generation and Checking

Combinational Logic Circuits Binary Logic and Gates Boolean Algebra Standard Forms Map Simplification Map Manipulation NAND and NOR Gates Exclusive-OR Gates Integrated Circuits

Fully Complementary CMOS Gate Structure and Examples

F = A + B*C

Transmission Gate (TG)

Selector and Exclusive- OR Constructed with Transmission Gates