CS2100 Computer Organisation K-maps: Finding PIs and EPIs (AY2014/5) Semester 2.

Slides:

Advertisements

Similar presentations

IKI b-Simplification of Boolean Functions Bobby Nazief Semester-I The materials on these slides are adopted from Prof. Daniel Gajski’s.

Advertisements

Based on slides by: Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 8 – Systematic Simplification.

1 Combinational Logic Network design Chapter 4 (continued ….)

Karnaugh Maps Discussion D3.1. Karnaugh Maps Minterm X Y F m m m m X Y F(X,Y) = m0 + m2 + m3 =  (0,2,3) = X + Y'

Quine-McClusky Minimization Method Module M4.3 Section 5.3.

Examples Simplify: ab’c + abc + a’bc Show that X + X’Y = X + Y

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

CSCE 211: Digital Logic Design Chin-Tser Huang University of South Carolina.

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

Quine-McClusky Minimization Method Discussion D3.2.

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)

CS 140 Lecture 5 Professor CK Cheng CSE Dept. UC San Diego 1.

EECC341 - Shaaban #1 Lec # 7 Winter Combinational Circuit Minimization Canonical sum and product logic expressions do not provide a circuit.

Simplifying Boolean Expressions Using K-Map Method

Logic Design CS221 1 st Term K-Map Cairo University Faculty of Computers and Information.

CT455: Computer Organization K-Map

Chapter 3 The Karnaugh Map. These K-maps are described by the location. Next, each square will be 1 or 0 depending on the value of the function. ABfm.

Optimization Algorithm

CS2100 Computer Organisation

CS1104: Computer Organisation comp. nus. edu

Examples. Examples (1/11)  Example #1: f(A,B,C,D) =  m(2,3,4,5,7,8,10,13,15) Fill in the 1’s. 1 1 C A B CD AB D 1 1.

ECE 3110: Introduction to Digital Systems Symplifying Products of sums using Karnaugh Maps.

Converting to Minterms Form

Computer Engineering (Logic Circuits) (Karnaugh Map)

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

Chapter3: Gate-Level Minimization Part 1 Origionally By Reham S. Al-Majed Imam Muhammad Bin Saud University.

Chapter 3 The Karnaugh Map

CS2100 Computer Organisation

CHAPTER 3: PRINCIPLES OF COMBINATIONAL LOGIC

Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and

Ahmad Almulhem, KFUPM 2010 COE 202: Digital Logic Design Combinational Logic Part 3 Dr. Ahmad Almulhem ahmadsm AT kfupm Phone: Office:

CONSENSUS THEOREM Choopan Rattanapoka.

Conversion from one number base to another Binary arithmetic Equation simplification DeMorgan’s Laws Conversion to/from SOP/POS Reading equations from.

Prof. Hsien-Hsin Sean Lee

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.

EECS 270 Lecture 10. K-map “rules” – Only circle adjacent cells (remember edges are adjacent!) – Only circle groups that are powers of 2 (1, 2,

Review. Boolean Algebra.

State university of New York at New Paltz Electrical and Computer Engineering Department Logic Synthesis Optimization Lect10: Two-level Logic Minimization.

ECE 301 – Digital Electronics Minimizing Boolean Expressions using K-maps, The Minimal Cover, and Incompletely Specified Boolean Functions (Lecture #6)

Lecture 6 Quine-McCluskey Method

Computer Organisation

Plotting functions not in canonical form

CSCE 211: Digital Logic Design

Simplifying Variable Expressions

CSCE 211: Digital Logic Design

CSCE 211: Digital Logic Design

CSCE 211: Digital Logic Design

CSCE 211: Digital Logic Design

ECE 331 – Digital System Design

Simplifying Variable Expressions

Karnaugh Maps Introduction Venn Diagrams 2-variable K-maps

Chapter 3 Gate-level Minimization.

Function Minimization Algorithms

Quine-McClusky Minimization Method

CSCE 211: Digital Logic Design

Objectives The student will be able to:

Bell Ringer 10/27/10 What is the GCF? 18x³y² and 24x² ab and a³b².

Minimization of Switching Functions

Simplifying Variable Expressions

Simplifying Variable Expressions

CSCE 211: Digital Logic Design

Factoring using the greatest common factor (GCF).

Simplifying Variable Expressions

Objectives The student will be able to:

DIGITAL DESIGN MORRIS MANO UNIT 3 ANSWERS OF THE PROBLEMS 1-29

ECE 331 – Digital System Design

Presentation transcript:

CS2100 Computer Organisation K-maps: Finding PIs and EPIs (AY2014/5) Semester 2

CS2100 K-maps: Finding PIs and EPIs 2 ESSENTIAL PRIME IMPLICANTS (1/5) Essential Prime Implicants (EPIs) – how to determine? 11 W Z WX YZ 11 X Y W'∙X ∙ Y' W∙X∙ZW∙X∙Z Prime Implicants (PIs) X∙Y' ∙ Z

CS2100 K-maps: Finding PIs and EPIs 3 ESSENTIAL PRIME IMPLICANTS (2/5) Essential Prime Implicants (EPIs) – how to determine? W'∙X∙Y' W∙X∙Z 11 W Z WX YZ 11 X Y Prime Implicants (PIs) X∙Y'∙Z Can we remove this? NO! EPI

CS2100 K-maps: Finding PIs and EPIs 4 ESSENTIAL PRIME IMPLICANTS (3/5) Essential Prime Implicants (EPIs) – how to determine? W'∙X∙Y' W∙X∙Z 11 W Z WX YZ 11 X Y Prime Implicants (PIs) X∙Y'∙Z EPI Can we remove this? NO! EPI

CS2100 K-maps: Finding PIs and EPIs 5 ESSENTIAL PRIME IMPLICANTS (4/5) Essential Prime Implicants (EPIs) – how to determine? W'∙X∙Y' W∙X∙Z 11 W Z WX YZ 11 X Y Prime Implicants (PIs) X∙Y'∙Z EPI Can we remove this? Yes. Not an EPI

CS2100 K-maps: Finding PIs and EPIs 6 ESSENTIAL PRIME IMPLICANTS (5/5) Essential Prime Implicants (EPIs) – how to determine? W'∙X∙Y' W∙X∙Z 11 W Z WX YZ 11 X Y Prime Implicants (PIs) X∙Y'∙Z EPI CONCLUSION Simplified SOP: W'∙X ∙ Y' + W∙X ∙ Z

CS2100 K-maps: Finding PIs and EPIs 7 EPI – ONE MORE TIME (1/3) 1.If it is an EPI, it must appear in answer. 2.If it is not an EPI, it may or may not appear in answer. 11 A D 1 B C 1 1 Prime Implicants (PIs) A'∙C'∙D' A'∙B∙C' A'∙B∙D B∙C∙D

CS2100 K-maps: Finding PIs and EPIs 8 EPI – ONE MORE TIME (2/3) 1.If it is an EPI, it must appear in answer. 2.If it is not an EPI, it may or may not appear in answer. 11 A D 1 B C 1 1 Prime Implicants (PIs) A'∙C'∙D' A'∙B∙C' A'∙B∙D B∙C∙D Which are the EPIs? EPI Answer: A'∙C'∙D + B∙C∙D ? Is the answer complete?

CS2100 K-maps: Finding PIs and EPIs 9 EPI – ONE MORE TIME (3/3) 1.If it is an EPI, it must appear in answer. 2.If it is not an EPI, it may or may not appear in answer. 11 A D 1 B C 1 1 Prime Implicants (PIs) A'∙C'∙D' A'∙B∙C' A'∙B∙D B∙C∙D EPI Answer: A'∙C'∙D + B∙C∙D ? Is the answer complete? No, there is still a minterm not covered. Correct answer: A'∙C'∙D + B∙C∙D + A'∙B∙C' or A'∙C'∙D + B∙C∙D + A'∙B∙D

CS2100 K-maps: Finding PIs and EPIs 10 IVLE ASSESSMENT Q31 (1/4) What are the Prime Implicants (PIs)? 1 1 A D 1 1 B C 11

CS2100 K-maps: Finding PIs and EPIs 11 IVLE ASSESSMENT Q31 (2/4) A'∙B' ∙ C A'∙B ∙ D Prime Implicants (PIs): A'∙C ∙ D 1 1 A D 1 1 B C 11 A∙B ∙ C' B∙C' ∙ D What are the Essential Prime Implicants (EPIs)?

CS2100 K-maps: Finding PIs and EPIs 12 IVLE ASSESSMENT Q31 (3/4) A' ∙ B' ∙ C A' ∙ B ∙ D Prime Implicants (PIs): A' ∙ C ∙ D 1 1 A D 1 1 B C 11 A ∙ B ∙ C' B ∙ C' ∙ D EPI So what is the simplified SOP expression?

CS2100 K-maps: Finding PIs and EPIs 13 IVLE ASSESSMENT Q31 (4/4) A'∙B ∙ D A' ∙ B' ∙ C A' ∙ B ∙ D Prime Implicants (PIs): A' ∙ C ∙ D 1 1 A D 1 1 B C 11 A ∙ B ∙ C' B ∙ C' ∙ D EPI So what is the simplified SOP expression? A'∙B' ∙ C + A∙B ∙ C' +

CS2100 K-maps: Finding PIs and EPIs 14 END