FIGURE 3.1 Two-variable K-map

Slides:



Advertisements
Similar presentations
Chapter 3 Gate-Level Minimization
Advertisements

Digital Logic Design Gate-Level Minimization
CS 121 Digital Logic Design
Documentation Standards
Combinational Logic Circuits Chapter 2 Mano and Kime.
CS370 – Spring 2003 Programmable Logic Devices PALs/PLAs.
ECE 238L Computer Logic Design Spring 2010
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.
Give qualifications of instructors: DAP
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.
Unit 8 Combinational Circuit Design and Simulation Using Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science.
Boolean Algebra Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
F = ∑m(1,4,5,6,7) F = A’B’C+ (AB’C’+AB’C) + (ABC’+ABC) Use X’ + X = 1.
ECE 331 – Digital System Design
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.
D IGITAL L OGIC D ESIGN I G ATE -L EVEL M INIMIZATION.
October 29, 2015 EASTERN MEDITERRANEAN UNIVERSITY1 Digital Logic Design I Gate-Level Minimization Mustafa Kemal Uyguroğlu.
Exclusive OR Gate. Logically, the exclusive OR (XOR) operation can be seen as either of the following operations:exclusive OR (XOR) 1. A AND NOT B OR.
Chapter 3 Gate-Level Minimization
Logic Design CS221 1 st Term Logic-Circuit Implementation Cairo University Faculty of Computers and Information.
Gate-level Minimization
D IGITAL L OGIC D ESIGN I G ATE -L EVEL M INIMIZATION.
3.Gate-Level Minimization
Chapter 3 Gate-level Minimization. 3-7 NAND and NOR Implementation Digital circuits are frequently constructed with NAND or NOR gates rather than with.
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.
Chapter 3 Gate-Level Minimization
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.
Chap 2. Combinational Logic Circuits
Digital Integrated Circuit Design Laboratory Department of Computer Science and Information Engineering National Cheng Kung University Experiment on digital.
Boolean Algebra & Logic Circuits Dr. Ahmed El-Bialy Dr. Sahar Fawzy.
Conversion from one number base to another Binary arithmetic Equation simplification DeMorgan’s Laws Conversion to/from SOP/POS Reading equations from.
1 Example: Groupings on 3-Variable K-Maps BC F(A,B,C) = A ’ B ’ A BC F(A,B,C) = B ’ A
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.
CMPUT Computer Organization and Architecture II1 CMPUT329 - Fall 2003 Topic 4: Cost of Logic Circuits and Karnaugh Maps José Nelson Amaral.
CEC 220 Digital Circuit Design More Karnaugh Maps Monday, February 02 CEC 220 Digital Circuit Design Slide 1 of 11.
Boolean Algebra. BOOLEAN ALGEBRA Formal logic: In formal logic, a statement (proposition) is a declarative sentence that is either true(1) or false (0).
Fuw-Yi Yang1 數位系統 Digital Systems Department of Computer Science and Information Engineering, Chaoyang University of Technology 朝陽科技大學資工系 Speaker: Fuw-Yi.
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
Lecture 7 Multi-Level Gate Networks
CHAPTER 3 Simplification of Boolean Functions
Eng. Mai Z. Alyazji October, 2016
Logic Gates and Boolean Algebra
Chapter 2: Boolean Algebra and Logic Functions
Boolean Algebra.
PROPAGATION DELAY.
Exclusive OR Gate.
CSE 140 : Components and Design Techniques for Digital Systems
Digital Logic and Design
Figure 5. 1 An example of AND-OR logic
مدار منطقی Logic Circuits
Digital Logic & Design Dr. Waseem Ikram Lecture 13.
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
Optimization Algorithm
Digital Logic Design I Gate-Level Minimization
Chapter 3 Gate-level Minimization.
13 Digital Logic Circuits.
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Overview Part 2 – Circuit Optimization
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Principles & Applications
Dept of Electronics Engineering
Computer Architecture
Presentation transcript:

FIGURE 3.1 Two-variable K-map

FIGURE 3.2 Representation of functions in the map

FIGURE 3.3 Three-variable K-map

FIGURE 3.4 Map for Example 3.1, F(x, y, z) = Σ(2, 3, 4, 5) = x’y + xy’

FIGURE 3.5 Map for Example 3.2, F(x, y, z) = Σ(3, 4, 6, 7) = yz + xz’

FIGURE 3.6 Map for Example 3.3, F(x, y, z) = Σ(0, 2, 4, 5, 6) = z’ + xy’

FIGURE 3.7 Map of Example 3.4, A’C + A’B + AB’C + BC = C + A’B

FIGURE 3.8 Four-variable map

FIGURE 3.9 Map for Example 3.5, F(w, x, y, z) = Σ(0, 1, 2, 4, 5, 6, 8, 9, 12, 13, 14) = y’ + w’z’ + xz’

FIGURE 3.10 Map for Example 3.6, A’B’C’ + B’CD’ + A’BCD’ + AB’C’ = B’D’ + B’C’ + A’CD’

FIGURE 3.11 Simplification using prime implicants

FIGURE 3.12 Map for Example 3.7, F(A, B, C, D) = Σ(0, 1, 2, 5, 8, 9, 10) = B’D’ + B’C’ + A’C’D = (A’ + B’) (C’ + D’)(B’ + D)

FIGURE 3.13 Gate implementations of the function of Example 3.7

Table 3.1 Truth Table of Function F

FIGURE 3.14 Map for the function of Table 3.1

FIGURE 3.15 Example with don’t-care conditions

FIGURE 3.16 Logic operations with NAND gates

FIGURE 3.17 Two graphic symbols for a three-input NAND gate

FIGURE 3.18 Three ways to implement F = AB + CD

FIGURE 3.19 Solution to Example 3.9

FIGURE 3.20 Implementing F = A(CD + B) + BC’

FIGURE 3.21 Implementing F = (AB’ + A’B) (C + D’)

FIGURE 3.22 Logic operations with NOR gates

FIGURE 3.23 Two graphic symbols for the NOR gate

FIGURE 3.24 Implementing F = (A + B)(C + D)E

FIGURE 3.25 Implementing F = (AB’ + A’B)(C + D’) with NOR gates

FIGURE 3.26 Wired logic: (a) Wired-AND logic with two NAND gates (b) Wired-OR in emitter-coupled logic (ECL) gates

FIGURE 3.27 AND–OR–INVERT circuits, F = (AB + CD + E )’

FIGURE 3.28 OR–AND–INVERT circuits, F = [(A + B )(C + D)E]’

Table 3.2 Implementation with Other Two-Level Forms

FIGURE 3.29 Other two-level implementations

FIGURE 3.30 Exclusive-OR implementations

FIGURE 3.31 Map for a three-variable exclusive-OR function

FIGURE 3.32 Logic diagram of odd and even functions

FIGURE 3.33 Map for a four-variable exclusive-OR function

Table 3.3 Even-Parity-Generator Truth Table

FIGURE 3.34 Logic diagram of a parity generator and checker

Table 3.4 Even-Parity-Checker Truth Table

FIGURE 3.35 Circuit to demonstrate an HDL

Table 3.5 Output of Gates after Delay

FIGURE 3.36 Simulation output of HDL Example 3.3

FIGURE 3.37 Schematic for Circuit with_UDP_02467