Computer Architecture CST 250 K-Map Prepared by:Omar Hirzallah.

Slides:



Advertisements
Similar presentations
Techniques for Combinational Logic Optimization
Advertisements

Chapter 3 Gate-Level Minimization
Slide 1 Insert your own content. Slide 2 Insert your own content.
17 February 2011 Track 3: Value Metrics, Value Models and the Value Proposition 1 Ontology Summit 2011: Making the Case for Ontology Track 3: Value Metrics,
ALGEBRAIC EXPRESSIONS
Then/Now You named angle pairs formed by parallel lines and transversals. Use theorems to determine the relationships between specific pairs of angles.
CS1104 – Computer Organization
Princess Sumaya University
Combinational Logic Circuits
Karnaugh Map Adjacent Squares
Digital Logic Design Gate-Level Minimization
Gate-Level Minimization
BOOLEAN ALGEBRA. A Mathematical notation used to represent the function of the Digital circuit. A notation that allows variables & constants to have only.
Karnaugh Map Adjacent Squares
1 st Wave Allen plays Atascosita 9 AM, Ct 1 Allen plays Coppell 10 AM, Ct 1 2 nd Wave If Allen is 1 st in Wave 1, Play at 2:30 and 4:30 on Ct 2 (R2G1P1)
B AB CD C A D m0m1m3m2 m4 m5m7m6 m12 m8m9m11 m10 m13 m15m14 Input combo mintermExpressio n 0000m0A’B’C’D’ 0001m1A’B’C’D 0010m2A’B’CD’
Online Recommendations
Translate the following verbal phrases to mathematical phrases.
CS 121 Digital Logic Design
Properties of Exponents
CS 121 Digital Logic Design
CS 121 Digital Logic Design
Karnaugh Maps ECEn/CS 224.
CS 121 Digital Logic Design
Random-Access Memory (RAM)
Princess Sumaya University
KU College of Engineering Elec 204: Digital Systems Design
CENG 241 Digital Design 1 Lecture 2 Amirali Baniasadi
CENG 241 Digital Design 1 Lecture 3 Amirali Baniasadi
Optimization, terms and don’t cares
ENGIN112 L9: More Karnaugh Maps September 22, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 9 More Karnaugh Maps and Don’t Cares.
CENG 241 Digital Design 1 Lecture 4
Review for Exam 1 Chapters 1 through 3.
I NTRODUCTION TO THE K ARNAUGH M AP 1 Alan Clements.
Gate-level Minimization
ENGIN112 L8: Minimization with Karnaugh Maps September 19, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 8 Minimization with Karnaugh.
Gate-Level Minimization. Digital Circuits The Map Method The complexity of the digital logic gates the complexity of the algebraic expression.
Chapter 3 Boolean Algebra and Logic Gate (Part 2).
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
CSE-221 Digital Logic Design (DLD)
CS 151 Digital Systems Design Lecture 8 Minimization with Karnaugh Maps.
Chapter 2: Combinatorial Logic Circuits Illustration Pg. 32 Logic Circuit Diagrams - Circuit Optimization -2,3,4 level maps 48 elements Optimized to 25.
Simplifying Boolean Expressions Using K-Map Method
Logic Design CS221 1 st Term K-Map Cairo University Faculty of Computers and Information.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. K-Map (1)  Karnaugh Mapping is used to minimize the number of logic gates that are required in a digital circuit.
D IGITAL L OGIC D ESIGN I G ATE -L EVEL M INIMIZATION.
Chapter 3 Gate-Level Minimization
Circuit Minimization. It is often uneconomical to realize a logic directly from the first logic expression that pops into your head. Canonical sum and.
Chapter3: Gate-Level Minimization Part 1 Origionally By Reham S. Al-Majed Imam Muhammad Bin Saud University.
Minimisation ENEL111. Minimisation Last Lecture  Sum of products  Boolean algebra This Lecture  Karnaugh maps  Some more examples of algebra and truth.
Computer Systems 1 Fundamentals of Computing Simplifying Boolean Expressions.
Karnaugh Maps (K-Maps)
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
THE K-MAP.
Karnaugh Map (K-Map) By Dr. M. Khamis Mrs. Dua’a Al Sinari.
1 3- De-Morgan’s Theorems 1.The complement of a product of variables is equal to the sum of the complements of the variables. 2. The complement of a sum.
Karnaugh Maps The minimization method using Boolean Algebra, apart from being laborious and requiring the remembering all the laws, can lead to solutions.
Speaker: Fuw-Yi Yang 楊伏夷 伏夷非征番, 道德經 察政章(Chapter 58) 伏者潛藏也
CHAPTER 3 Simplification of Boolean Functions
Computer Architecture CST 250
Karnaugh Maps (K-Maps)
E- Lesson: Karnaugh Maps (K-Map ).
Boolean Algebra.
Karnaugh map Karnaugh map allows viewing the function in a picture form Map is arranged such that two neighbors differ in only one variable It is easy.
ECB2212-Digital Electronics K-Map
Overview Part 2 – Circuit Optimization
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Analysis of Logic Circuits Example 1
Computer Architecture
Presentation transcript:

Computer Architecture CST 250 K-Map Prepared by:Omar Hirzallah

Contents K-Map Two Variables K-Map Three Variables K-Map Rules for Representation of 3-Variables K-Map Four Variables K-Map Rules for Representation of 4-Variables K-Map

Karnaugh Map m1m1 m0m0 m3m3 m2m2 The traditional way for the simplification of Boolean expressions is awkward as it lacks specific rules to predict each succeeding step in the process. The MAP method provides a simple straightforward procedure for minimizing Boolean functions. This map method is also known as Karnaugh Map or K-Map. There are different representations of K-maps depending on the no. of variables: Two Variable Map: x’yx’y’ xyxy’ x’ y’ x y

Representation of functions in the Map: (a) xy (b) x + y x’ x x y’ y y

Representation of three variables k-map: m2m2 m3m3 m1m1 m0m0 m6m6 m7m7 m5m5 m4m A’BC’ A’BC A’B’C A’B’C’ ABC’ ABC AB’C AB’C’ BC A A B’ C’ B’ C B C B C’ A’ A The Rules (For 3-Variables Representation of K-map) :  One square represents one term of 3-variables.  Two adjacent squares represent a term of two variables.  Four adjacent squares represent a term of one variable.  Eight adjacent squares represent a function that is always equal to 1.

Representation of four variables k-map: m2m2 m3m3 m1m1 m0m0 m6m6 m7m7 m5m5 m4m4 m 14 m 15 m 13 m12m12 m 10 m 11 m9m9 m8m A’B’CD’ A’B’CD A’B’C’D A’B’C’D’ 0 0 A’BCD’ A’BCD A’BC’D 0 1 A’BC’D’ ABCD’ ABCD 1 1 ABC’D ABC’D’ AB’CD’ 1 0 AB’CD AB’C’D AB’C’D’ CD AB C’ D’ C’ D C D C D’ A’B’ A’B AB AB’ CD AB

The Rules (For 4-Variables Representation of K-map) :  One square represents one term of 4-variables.  Two adjacent squares represent a term of three variables.  Four adjacent squares represent a term of two variables.  Eight adjacent squares represent a term of one variable.  Sixteen adjacent squares represent a function that is always equal to 1.