Combinational Logic Circuits Chapter 2 Mano and Kime.

Slides:

Advertisements

Similar presentations

Chapter 3 Gate-Level Minimization

Advertisements

Digital Logic Design Gate-Level Minimization

Chapter3: Gate-Level Minimization Part 2

CS 121 Digital Logic Design

CS 121 Digital Logic Design

CS 121 Digital Logic Design

Chapter 2 Logic Circuits.

Gate-Level Minimization

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

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

Lab 6 – Part C2 Circuit for Problem 3.6 p 20. a b s y z = ~s & a w = s & b = ~s & a  s & b b s a ~s w = (b & s ) z = (a & ~s ) y = ~ (z & w) De Morgan’s.

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

Multiplexer as a Universal Function Generator

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

Combinational Logic Circuits Chapter 2 Mano and Kime.

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.

22C:19 Discrete Math Boolean Algebra & Digital Logic Fall 2010 Sukumar Ghosh.

1 Why study Boolean Algebra? 4 It is highly desirable to find the simplest circuit implementation (logic) with the smallest number of gates or wires. We.

Boolean Algebra and Logic Gates CE 40 B 18 June 2003.

1 Logic Gates Digital Computer Logic Kashif Bashir WWW:

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.

Chapter 3 Gate-Level Minimization

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

Physics 343 Advanced Electronics Engineering 343 Digital Systems Electronics Courses.

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

Circuit Minimization. It is often uneconomical to realize a logic directly from the first logic expression that pops into your head. Canonical sum and.

PRASAD A. PAWASKAR SPN. NO DETE 2 SEMESTER lec1-11.

Gate-Level Minimization

Gate-level Minimization

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

Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and

1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.

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

Logic Design (CE1111 ) Lecture 2 (Chapter 2) Prepared by Dr. Lamiaa Elshenawy 1.

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

CHAPTER 2 Boolean algebra and Logic gates

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

Assembly Lab1 - Review.

FIGURE 3.1 Two-variable K-map

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

Combinational Logic Circuits

DIGITAL LOGIC CIRCUITS

ECE 2110: Introduction to Digital Systems

CS2100 Computer Organisation

Lecture #6 EGR 277 – Digital Logic

CS 105 Digital Logic Design

ECE 3110: Introduction to Digital Systems

Princess Sumaya University

DIGITAL LOGIC CIRCUITS

Dr. Clincy Professor of CS

Boolean Algebra Why study Boolean Algebra?

Digital Logic Design I Gate-Level Minimization

Chapter 3 Gate-level Minimization.

CSC 220: Computer Organization Logic Gates and Functions

MINTERMS and MAXTERMS Week 3

Table 2.1 Postulates and Theorems of Boolean Algebra

Chapter 10.3 and 10.4: Combinatorial Circuits

Digital Logic Chapter-2

Digital Logic Chapter-2

Digital Logic Design Basics Combinational Circuits Sequential Circuits.

Circuit Simplification and

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 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 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 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 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 Each square is numbered in the above K-map

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 NAND and NOR Gates Exclusive-OR Gates Integrated Circuits

Prime Implicants F = XY’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 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

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 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

Parity Generation and Checking

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

Fully Complementary CMOS Gate Structure and Examples An Integrated circuit (IC) is a silicon semiconductor crystal, containing the components for the digital gates. The various gates are connected on the chip to form the IC.