Unit 5: Karnaugh Maps

Similar documents
Unit 3 Boolean Algebra (Continued)

CSEE 3827: Fundamentals of Computer Systems. Standard Forms and Simplification with Karnaugh Maps

Boolean Algebra (cont d) UNIT 3 BOOLEAN ALGEBRA (CONT D) Guidelines for Multiplying Out and Factoring. Objectives. Iris Hui-Ru Jiang Spring 2010

Boolean Algebra Part 1

CH3 Boolean Algebra (cont d)

Karnaugh Maps & Combinational Logic Design. ECE 152A Winter 2012

CSE140: Midterm 1 Solution and Rubric

Simplifying Logic Circuits with Karnaugh Maps

Karnaugh Maps. Circuit-wise, this leads to a minimal two-level implementation

BOOLEAN ALGEBRA & LOGIC GATES

CSE140: Components and Design Techniques for Digital Systems

Class One: Degree Sequences

United States Naval Academy Electrical and Computer Engineering Department. EC262 Exam 1

2.0 Chapter Overview. 2.1 Boolean Algebra

Chapter 2: Boolean Algebra and Logic Gates. Boolean Algebra

Boolean Algebra. Boolean Algebra. Boolean Algebra. Boolean Algebra

Introduction. The Quine-McCluskey Method Handout 5 January 21, CSEE E6861y Prof. Steven Nowick

Sect Greatest Common Factor and Factoring by Grouping

Algebraic Properties and Proofs

Logic Reference Guide

How To Solve Factoring Problems

DESIGN OF GATE NETWORKS

3.Basic Gate Combinations

Intermediate Math Circles October 10, 2012 Geometry I: Angles

PUTNAM TRAINING POLYNOMIALS. Exercises 1. Find a polynomial with integral coefficients whose zeros include

CHAPTER 8, GEOMETRY. 4. A circular cylinder has a circumference of 33 in. Use 22 as the approximate value of π and find the radius of this cylinder.

CM2202: Scientific Computing and Multimedia Applications General Maths: 2. Algebra - Factorisation

Warm-up Tangent circles Angles inside circles Power of a point. Geometry. Circles. Misha Lavrov. ARML Practice 12/08/2013

Karnaugh Maps (K-map) Alternate representation of a truth table

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY

Section 1. Finding Common Terms

Basic Logic Gates Richard E. Haskell

Applications of Fermat s Little Theorem and Congruences

You must have: Ruler graduated in centimetres and millimetres, protractor, compasses, pen, HB pencil, eraser, calculator. Tracing paper may be used.

Geometry Module 4 Unit 2 Practice Exam

1.4. Arithmetic of Algebraic Fractions. Introduction. Prerequisites. Learning Outcomes

How to bet using different NairaBet Bet Combinations (Combo)

1.3 Polynomials and Factoring

Two-level logic using NAND gates

Combinational circuits

Click on the links below to jump directly to the relevant section

Operations with Algebraic Expressions: Multiplication of Polynomials

Geometry Regents Review

Wednesday 15 January 2014 Morning Time: 2 hours

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY. Tuesday, August 13, :30 to 11:30 a.m., only.

Solutions Manual for How to Read and Do Proofs

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY. Thursday, August 16, :30 to 11:30 a.m.

2 : two cube. 5 : five cube. 10 : ten cube.

Functional Dependencies and Normalization

1. True or False? A voltage level in the range 0 to 2 volts is interpreted as a binary 1.

Factoring Polynomials

4. Binomial Expansions

Factoring (pp. 1 of 4)

Sample Test Questions

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY. Thursday, January 24, :15 a.m. to 12:15 p.m.

Lesson 13: Angle Sum of a Triangle

To Evaluate an Algebraic Expression

Factoring Special Polynomials

Relational Database Design

4. How many integers between 2004 and 4002 are perfect squares?

Switching Algebra and Logic Gates

Digital Logic Design. Basics Combinational Circuits Sequential Circuits. Pu-Jen Cheng

SPECIAL PRODUCTS AND FACTORS

Digital circuits make up all computers and computer systems. The operation of digital circuits is based on

Factoring Algebra- Chapter 8B Assignment Sheet

Online EFFECTIVE AS OF JANUARY 2013

Name Date Class. Lines and Segments That Intersect Circles. AB and CD are chords. Tangent Circles. Theorem Hypothesis Conclusion

Quadrilateral Geometry. Varignon s Theorem I. Proof 10/21/2011 S C. MA 341 Topics in Geometry Lecture 19

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY. Wednesday, January 28, :15 a.m. to 12:15 p.m.

Chapter 4.1 Parallel Lines and Planes

Angles in a Circle and Cyclic Quadrilateral

Geometry 1. Unit 3: Perpendicular and Parallel Lines

Vocabulary. Term Page Definition Clarifying Example. biconditional statement. conclusion. conditional statement. conjecture.

CDA 3200 Digital Systems. Instructor: Dr. Janusz Zalewski Developed by: Dr. Dahai Guo Spring 2012

Benchmark Databases for Testing Big-Data Analytics In Cloud Environments

AMC 10 Solutions Pamphlet TUESDAY, FEBRUARY 13, 2001 Sponsored by Mathematical Association of America University of Nebraska

MATH Fundamental Mathematics IV

5.1 FACTORING OUT COMMON FACTORS

THREE DIMENSIONAL GEOMETRY

Logic in Computer Science: Logic Gates

Veterans Upward Bound Algebra I Concepts - Honors

Chapter 3.1 Angles. Geometry. Objectives: Define what an angle is. Define the parts of an angle.

CAIU Geometry - Relationships with Triangles Cifarelli Jordan Shatto

2004 Solutions Ga lois Contest (Grade 10)

HOW TO USE MINITAB: DESIGN OF EXPERIMENTS. Noelle M. Richard 08/27/14

L 2 : x = s + 1, y = s, z = 4s Suppose that C has coordinates (x, y, z). Then from the vector equality AC = BD, one has

Circle Name: Radius: Diameter: Chord: Secant:

The University of the State of New York REGENTS HIGH SCHOOL EXAMINATION GEOMETRY. Wednesday, January 29, :15 a.m. to 12:15 p.m.

Advanced GMAT Math Questions

Math 10C. Course: Polynomial Products and Factors. Unit of Study: Step 1: Identify the Outcomes to Address. Guiding Questions:

Section IV.21. The Field of Quotients of an Integral Domain

A single register, called the accumulator, stores the. operand before the operation, and stores the result. Add y # add y from memory to the acc

MATRIX ALGEBRA AND SYSTEMS OF EQUATIONS. + + x 2. x n. a 11 a 12 a 1n b 1 a 21 a 22 a 2n b 2 a 31 a 32 a 3n b 3. a m1 a m2 a mn b m

Algebra Cheat Sheets

Digital Electronics Part I Combinational and Sequential Logic. Dr. I. J. Wassell

Topic: Special Products and Factors Subtopic: Rules on finding factors of polynomials

Math 0306 Final Exam Review

A. The answer as per this document is No, it cannot exist keeping all distances rational.

Transcription:

Unit 5: Karnaugh Maps 5. Minimum Forms of Switching Functions Minimum sum-of-products: a sum of product terms which; a) has a minimum number of terms and b) of all those expressions which have the same minimum number of terms, has a minimum number of literals. To obtain a minimum sum-of-products from the minterm expansion:. Combine terms using XY' + XY = X. Repeat as much as possible. Remember X + X = X can be used to have a term appear more than once. 2. Eliminate redundant terms using the consensus theorem or other theorems. Ex. Minimum sum-of-products F (a, b, c) = Σ m (0,, 2, 5, 6, 7) F = a'b'c' + a b c + a'bc' + ab c + abc + abc F = a'b' + bc' + ac Minimum product-of-sums: a product of sum terms which; a) has a minimum number of factors and b) of all those expressions which have the same minimum number of factors, has a minimum number of literals. To obtain a minimum product-of-sums from the minterm expansion:. Combine terms using (X + Y')(X + Y) = X. Repeat as much as possible. 2. Eliminate redundant terms using the consensus theorem or other theorems. Ex. Minimum product-of-sums F = (A+B'+C+D')(A+B'+C'+D')(A+B'+C'+D)(A'+B'+C'+D)(A+B+C'+D)(A'+B+C'+D) = (A + B' +D') (B' + C' + D) (B + C' + D) = (A + B' +D') (C' + D) ECEN 52 Page of

5.2 Two and Three Variable Karnaugh Maps Karnaugh Maps specify the values of a function for every combination of values of independent variables. A B 0 0 Truth Table vs. Karnaugh Map A B F 0 0 0 0 0 0 A B 0 0 0 0 Note: Each in both the truth table and Karnaugh map represent a minterm. In a Karnaugh map, adjacent minterms can be combined since they differ by only one variable (i.e. a'b' + a b = a ) 3 Variables: A B C F 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 A BC 0 0 * 0* 0 0 0 0 * The rows are written in sequence so adjacent rows differ by only one variable. ECEN 52 Page 2 of

Again adjacent minterms differ by only one variable and can be reduced by XY'+XY = X. Note: The top and bottom rows are also considered adjacent since they differ by only one variable. Minterm Expansion: Given a minterm expansion plot a in each square corresponding to a minterm. F (A, B, C) = m + m 3 + m 5 A B C F 0 0 0 m 0 0 0 m 0 0 m 2 0 m 3 0 0 m 4 0 m 5 0 m 6 m 7 A BC 0 0 * 0* m 0 m 4 m m 5 m 3 m 7 m 2 m 6 A BC 0 0 * 0* 0 0 0 0 0 Note: For a maxterm expansion, 0 s are plotted in the squares corresponding to the maxterms and the remaining squares are s. Product Terms: a Karnaugh map can be created directly from product terms f (a, b, c) = abc' + b'c + a'. Term abc' is when a = and bc' = 0 2. Term b'c is when b'c = 0 ( 2 locations) 3. Term a' is when a = 0 a bc 0 0 0 ECEN 52 Page 3 of

Simplification: a bc 0 0 Minterms 0 0 5 3 f (a, b, c) = Σ m (, 3, 5) 0 T = a'b'c + a'bc T 2 = a'b'c + ab'c = a'c = b'c f = a'c + b'c Complement: To map a complement of the function, replace the 0 s with s and the s with 0 s Given: f (a, b, c) = Σ m (, 3, 5) f' =? a bc 0 T = a'b'c' + ab'c' + a'bc' + abc' T 2 = abc + abc' 0 0 = b'c' + bc' = ab = c' f' = c' + ab ECEN 52 Page 4 of

Consensus Theorem: XY + X'Z + YZ = XY + X'Z X YZ 0 X YZ 0 0 0 0 0 Factors with Two Minimum Forms: a bc 0 a bc 0 0 0 0 0 F = a'b' + ac +bc' F = a'c' + b'c + ab 5.3 Four Variable Karnaugh Maps f (a, b, c, d) = acd + a'b + d' ECEN 52 Page 5 of

AB CD 0 0 Simplifying AB CD 0 0 F = T + T 2 + T 3 F = bc' + a'b'd + ab'cd' Incompletely Specified Functions: When choosing terms, all s must be circle but don t cares are only used when helping to simplify. AB CD 0 0 X X X ECEN 52 Page 6 of

f = Σ m (, 3, 5, 7, 9) + Σ d (6, 2, 3) = c'd + a'd Sum of Products: Because the 0 s of f are the s of f', the minimum sum of products for f' can be found by looping the 0 s of f. The complement of the minimum sum of products for f' is the minimum sum of products for f. f = x'z' + wyz + w'y'z' + x'y wx yz 0 0 0 0 0 0 0 0 0 0 f' = y'z + wxz' + w'xy Minimum product of sums: (f')' = (y'z + wxz' + w'xy)' f = (y'z)'(wxz')'(w'xy)' f = (y + z')(w' + x' +z)(w + x' + y') 5.4 Determination of Minimum Expressions Using Essential Prime Implicants Implicant: a product term represented by any single or group of s which can be combined together on a map of the function F Prime Implicant: an implicant which cannot be combined with another term to eliminate a variable All prime implicants can be obtained from a Karnaugh map All single s not adjacent to another Two adjacent s if not in a group of four Four adjacent s if not in a group of eight Etc. ECEN 52 Page 7 of

ab cd 0 0 Prime implicants = a'b'c, a'cd', and ac Note: In order to find the minimum sum of products from a map, you must find the minimum number of prime implicant that cover all the on the map. ab cd 0 0 Minimum sum of products f = a'b'd + bc' + ac Prime implicants = = a'b'd, bc', ac, a'c'd, ab, and b'cd Note: In finding prime implicants don t cares are treated like s, however a prime implicant of all don t cares is never part of the minimum solution. Essential prime implicant: a minterm that is only covered by one prime implicant and must be included in the minimum sum of products. ECEN 52 Page 8 of

ab cd 0 0 F = a'c' + a'b'd' + acd + (a'bd OR + bcd) Procedure for finding the minimum sum of products from a Karnaugh Map. Choose a minterm (a ) which has not yet been covered. 2. Find all s and X s adjacent to that minterm. (Check the n adjacent squares on an n-variable map.) 3. If a single term covers the minterm and all of the adjacent s and X s, then that term is an essential prime implicant, so select the term. (Note that don t care terms are treated like s in steps 2 and 3 but not step.) 4. Repeat steps, 2, and 3 until all essential prime implicants have been chosen. 5. Find a minimum set of prime implicants which cover the remaining s on the map. (If there is more than one such set, choose a set with a minimum number of literals.) See Figure 5-9 on page 32 5.5 Five Variable Karnaugh Maps ECEN 52 Page 9 of

Each term can be adjacent to exactly five other terms, four in the same layer and one in the other layer. 5.6 Other Uses of Karnaugh Maps Minterm and Maxterm: From a Karnaugh map, the minterm and maxterm expansion for an equation can be determined Proofs: Two functions can be proven equal by plotting each on a map and showing that they have the sane Karnaugh map. Factoring: By inspecting a Karnaugh map, you can reveal terms that have one or more variable in common AB CD 0 0 F = A'B'(C' + D) + AC(B +D') 5.7 Other Forms of Karnaugh Maps Veitch Diagrams: Useful for plotting functions given algebraic forms rather than minterm/maxterm form ECEN 52 Page 0 of

Alternate Forms for Five Variable Karnaugh Maps BC DE BC DE 0 0 0 0 A = 0 A = F = D'E' + B'C'D' + BCE + A'BC'E' + ACDE ECEN 52 Page of