Presentation is loading. Please wait.

Presentation is loading. Please wait.

Lecture 4: Four Input K-Maps CSE 140: Components and Design Techniques for Digital Systems CK Cheng Dept. of Computer Science and Engineering University.

Published byLambert Morrison Modified over 8 years ago

Similar presentations

Presentation on theme: "Lecture 4: Four Input K-Maps CSE 140: Components and Design Techniques for Digital Systems CK Cheng Dept. of Computer Science and Engineering University."— Presentation transcript:

1 Lecture 4: Four Input K-Maps CSE 140: Components and Design Techniques for Digital Systems CK Cheng Dept. of Computer Science and Engineering University of California, San Diego 1

2 Outlines Boolean Algebra vs. Karnaugh Maps –Algebra: variables, product terms, minterms, consensus theorem –Map: planes, rectangles, cells, adjacency Definitions: implicants, prime implicants, essential prime implicants Implementation Procedures 2

3 3 4-input K-map

4 4

5 5 Arrangement of variables Adjacency and partition

6 Boolean Expression K-Map Variable x i and complement x i ’  Half planes Rx i, and Rx i ’  Intersect of Rx i * for all i in P Each minterm  One element cell Two minterms are adjacent.  The two cells are neighbors Each minterm has n adjacent minterms  Each cell has n neighbors 6

7 7 Procedure for finding the minimal function via K-maps (layman terms) 1.Convert truth table to K-map 2.Group adjacent ones: In doing so include the largest number of adjacent ones (Prime Implicants) 3.Create new groups to cover all ones in the map: create a new group only to include at least one cell (of value 1 ) that is not covered by any other group 4.Select the groups that result in the minimal sum of products (we will formalize this because its not straightforward)

8 8 Reading the reduced K-map

9 Definitions: implicant, prime implicant, essential prime implicant 9 Implicant: A product term that has non-empty intersection with on-set F and does not intersect with off-set R. Prime Implicant: An implicant that is not covered by any other implicant. Essential Prime Implicant: A prime implicant that has an element in on-set F but this element is not covered by any other prime implicants.

10 Definition: Prime Implicant 1.Implicant: A product term that has non-empty intersection with on-set F and does not intersect with off-set R. 2.Prime Implicant: An implicant that is not covered by any other implicant. Q: Is this a prime implicant? 10 A.Yes B.No

11 Definition: Prime Implicant 11 A.Yes B.No Q: How about this one? Is it a prime implicant? 1.Implicant: A product term that has non-empty intersection with on-set F and does not intersect with off-set R. 2.Prime Implicant: An implicant that is not covered by any other implicant.

12 Definition: Prime Implicant 12 A.Yes B.No Q: How about this one? Is it a prime implicant? 1.Implicant: A product term that has non-empty intersection with on-set F and does not intersect with off-set R. 2.Prime Implicant: An implicant that is not covered by any other implicant.

13 Definition: Essential Prime Essential Prime Implicant: A prime implicant that has an element in on-set F but this element is not covered by any other prime implicants. 13 A.Yes B.No Q: Is the blue group an essential prime?

14 14

15 Definition: Non-Essential Prime 15 A.bc’d B.d’b’ C.ac D.abc E.ad’ Q: Which of the following reduced expressions is obtained from a non-essential prime for the given K-map ? ab cd 00 01 0001 11 10 11 10 1 1 1 11 1 1 1 1 1 Non Essential Prime Implicant : Prime implicant that has no element that cannot be covered by other prime implicant

16 16 Procedure for finding the minimal function via K-maps (formal terms) 1.Convert truth table to K-map 2.Include all essential primes 3.Include non essential primes as needed to completely cover the onset (all cells of value one)

17 17 K-maps with Don’t Cares

18 18 K-maps with Don’t Cares

19 19 K-maps with Don’t Cares

20 Reducing Canonical expressions Given F(a,b,c,d) = Σm (0, 1, 2, 8, 14) D(a,b,c,d) = Σm (9, 10) 1. Draw K-map 20 ab cd 00 01 0001 11 10 11 10

21 Reducing Canonical Expressions Given F(a,b,c,d) = Σm (0, 1, 2, 8, 14) D(a,b,c,d) = Σm (9, 10) 1. Draw K-map 21 0 4 12 8 1 5 13 9 3 7 15 11 2 6 14 10 ab cd 00 01 0001 11 10 11 10

22 Reducing Canonical Expressions Given F(a,b,c,d) = Σm (0, 1, 2, 8, 14) D(a,b,c,d) = Σm (9, 10) 1. Draw K-map 22 0 4 12 8 1 5 13 9 3 7 15 11 2 6 14 10 1 0 0 1 1 0 0 X 0 0 0 0 1 0 1 X ab cd 00 01 0001 11 10 11 10

23 Reducing Canonical Expressions 1.Draw K-map 2.Identify Prime implicants 3.Identify Essential Primes 0 4 12 8 1 5 13 9 3 7 15 11 2 6 14 10 1 0 0 1 1 0 0 X 0 0 0 0 1 0 1 X 23 ab cd 00 01 0001 11 10 11 10 PI Q: How many primes (P) and essential primes (EP) are there? A.Four (P) and three (EP) B.Three (P) and two (EP) C.Three (P) and three (EP) D.Four (P) and Four (EP)

24 Reducing Canonical Expressions 0 4 12 8 1 5 13 9 3 7 15 11 2 6 14 10 1 0 0 1 1 0 0 X 0 0 0 0 1 0 1 X 24 ab cd 00 01 0001 11 10 11 10 PI Q: Do the E-primes cover the entire on set? A.Yes B.No 1.Prime implicants: Σm (0, 1, 8, 9), Σm (0, 2, 8, 10), Σm (10, 14) 2.Essential Primes: Σm (0, 1, 8, 9), Σm (0, 2, 8, 10), Σm (10, 14)

25 Reducing Canonical Expressions 1.Prime implicants: Σm (0, 1, 8, 9), Σm (0, 2, 8, 10), Σm (10, 14) 2.Essential Primes: Σm (0, 1, 8, 9), Σm (0, 2, 8, 10), Σm (10, 14) 3.Min exp: Σ (Essential Primes)=Σm (0, 1, 8, 9) + Σm (0, 2, 8, 10) + Σm (10, 14) f(a,b,c,d) = ? 0 4 12 8 1 5 13 9 3 7 15 11 2 6 14 10 1 0 0 1 1 0 0 X 0 0 0 0 1 0 1 X 25 ab cd 00 01 0001 11 10 11 10 PI Q: Do the E-primes cover the entire on set? A.Yes B.No

26 Reducing Canonical Expressions 1.Prime implicants: Σm (0, 1, 8, 9), Σm (0, 2, 8, 10), Σm (10, 14) 2.Essential Primes: Σm (0, 1, 8, 9), Σm (0, 2, 8, 10), Σm (10, 14) 3.Min exp: Σ (Essential Primes)=Σm (0, 1, 8, 9) + Σm (0, 2, 8, 10) + Σm (10, 14) f(a,b,c,d) = b’c’ + b’d’+ acd‘ 0 4 12 8 1 5 13 9 3 7 15 11 2 6 14 10 1 0 0 1 1 0 0 X 0 0 0 0 1 0 1 X 26 ab cd 00 01 0001 11 10 11 10 PI Q: Do the E-primes cover the entire on set? A.Yes B.No

27 Another example Given F(a,b,c,d) = Σm (0, 3, 4, 14, 15) D(a,b,c,d) = Σm (1, 11, 13) 1.Draw the K-Map 27 ab cd 00 01 0001 11 10 11 10

28 Another example Given F(a,b,c,d) = Σm (0, 3, 4, 14, 15) D(a,b,c,d) = Σm (1, 11, 13) 28 0 4 12 8 1 5 13 9 3 7 15 11 2 6 14 10 1 1 0 0 X 0 X 0 1 0 1 X 0 0 1 0 ab cd 00 01 0001 11 10 11 10

29 Reducing Canonical Expressions 29 1.Prime implicants: Σm (0, 4), Σm (0, 1), Σm (1, 3), Σm (3, 11), Σm (14, 15), Σm (11, 15), Σm (13, 15) 2.Essential Primes: Σm (0, 4), Σm (14, 15) 0 4 12 8 1 5 13 9 3 7 15 11 2 6 14 10 1 1 0 0 X 0 X 0 1 0 1 X 0 0 1 0 ab cd 00 01 0001 11 10 11 10

30 Reducing Canonical Expressions 30 1. Prime implicants: Σm (0, 4), Σm (0, 1), Σm (1, 3), Σm (3, 11), Σm (14, 15), Σm (11, 15), Σm (13, 15) 2.Essential Primes: Σm (0, 4), Σm (14, 15) 3.Min exp: Σm (0, 4), Σm (14, 15), (Σm (3, 11) or Σm (1,3) ) 4. f(a,b,c,d) = a’c’d’+ abc+ b’cd (or a’b’d) 0 4 12 8 1 5 13 9 3 7 15 11 2 6 14 10 1 1 0 0 X 0 X 0 1 0 1 X 0 0 1 0 ab cd 00 01 0001 11 10 11 10

Download ppt "Lecture 4: Four Input K-Maps CSE 140: Components and Design Techniques for Digital Systems CK Cheng Dept. of Computer Science and Engineering University."

Similar presentations

CSE20 Lecture 15 Karnaugh Maps Professor CK Cheng CSE Dept. UC San Diego 1.

CSE20 Lecture 15 Karnaugh Maps Professor CK Cheng CSE Dept. UC San Diego 1.
1 CK Cheng CSE Dept. UC San Diego CS 140, Lecture 2 Combinational Logic.

1 CK Cheng CSE Dept. UC San Diego CS 140, Lecture 2 Combinational Logic.
Gate-level Minimization

Gate-level Minimization
CS 140 Lecture 5 Professor CK Cheng 10/10/02. Part I. Combinational Logic 1.Spec 2.Implementation K-map: Sum of products Product of sums.

CS 140 Lecture 5 Professor CK Cheng 10/10/02. Part I. Combinational Logic 1.Spec 2.Implementation K-map: Sum of products Product of sums.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 6 Dr. Shi Dept. of Electrical and Computer Engineering.

ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 6 Dr. Shi Dept. of Electrical and Computer Engineering.
1 CS 140 Lecture 3 Combinational Logic Professor CK Cheng CSE Dept. UC San Diego.

1 CS 140 Lecture 3 Combinational Logic Professor CK Cheng CSE Dept. UC San Diego.
Examples Simplify: ab’c + abc + a’bc Show that X + X’Y = X + Y

Examples Simplify: ab’c + abc + a’bc Show that X + X’Y = X + Y
1 CS 20 Lecture 14 Karnaugh Maps Professor CK Cheng CSE Dept. UC San Diego.

1 CS 20 Lecture 14 Karnaugh Maps Professor CK Cheng CSE Dept. UC San Diego.
CS 140 Lecture 3 Professor CK Cheng Tuesday 4/09/02.

CS 140 Lecture 3 Professor CK Cheng Tuesday 4/09/02.
Chapter 3 Simplification of Switching Functions

Chapter 3 Simplification of Switching Functions
CS 140 Lecture 4 Professor CK Cheng Tuesday 5/08/02.

CS 140 Lecture 4 Professor CK Cheng Tuesday 5/08/02.
CS 140 Lecture 6 Professor CK Cheng Tuesday 10/15/02.

CS 140 Lecture 6 Professor CK Cheng Tuesday 10/15/02.
Give qualifications of instructors: DAP

Give qualifications of instructors: DAP
CS 140 Lecture 4 Combinational Logic: K-Map Professor CK Cheng CSE Dept. UC San Diego 1.

CS 140 Lecture 4 Combinational Logic: K-Map Professor CK Cheng CSE Dept. UC San Diego 1.
Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 4-1 Chapter #2: Two-Level Combinational Logic Section 2.3, 2.4 -- Switches and Tools.

Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 4-1 Chapter #2: Two-Level Combinational Logic Section 2.3, Switches and Tools.
CS 140 Lecture 6 Professor CK Cheng UC San Diego.

CS 140 Lecture 6 Professor CK Cheng UC San Diego.
CS 140 Lecture 4 Professor CK Cheng 4/11/02. Part I. Combinational Logic Implementation K-Map Given F R D Obj: Minimize sum of products Proc: Draw K-Map.

CS 140 Lecture 4 Professor CK Cheng 4/11/02. Part I. Combinational Logic Implementation K-Map Given F R D Obj: Minimize sum of products Proc: Draw K-Map.

Computer Engineering (Logic Circuits) (Karnaugh Map)

Computer Engineering (Logic Circuits) (Karnaugh Map)
ECE 331 – Digital System Design Karnaugh Maps and Determining a Minimal Cover (Lecture #7) The slides included herein were taken from the materials accompanying.

ECE 331 – Digital System Design Karnaugh Maps and Determining a Minimal Cover (Lecture #7) The slides included herein were taken from the materials accompanying.

Similar presentations

Ads by Google