E- Lesson: Karnaugh Maps (K-Map ).

Slides:



Advertisements
Similar presentations
Techniques for Combinational Logic Optimization
Advertisements

BOOLEAN ALGEBRA. A Mathematical notation used to represent the function of the Digital circuit. A notation that allows variables & constants to have only.
Prof. Sin-Min Lee Department of Computer Science
Chapter 3 Simplification of Switching Functions. Karnaugh Maps (K-Map) A K-Map is a graphical representation of a logic function’s truth table.
Gate-level Minimization
ECE 301 – Digital Electronics Karnaugh Maps (Lecture #7) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,
ENGIN112 L8: Minimization with Karnaugh Maps September 19, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 8 Minimization with Karnaugh.
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
CS 151 Digital Systems Design Lecture 8 Minimization with Karnaugh Maps.
Simplifying Boolean Expressions Using K-Map Method
BOOLEAN ALGEBRA Saras M. Srivastava PGT (Computer Science)
K-map Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
1 Chapter 5 Karnaugh Maps Mei Yang ECG Logic Design 1.
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.
1 Digital Logic Design Week 5 Simplifying logic expressions.
Combinational Logic Part 2: Karnaugh maps (quick).
Circuit Minimization. It is often uneconomical to realize a logic directly from the first logic expression that pops into your head. Canonical sum and.
CHAPTER 3: PRINCIPLES OF COMBINATIONAL LOGIC
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
LOGIC GATES & BOOLEAN ALGEBRA
CS1Q Computer Systems Lecture 7
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
LOGIC CIRCUITLOGIC CIRCUIT. Goal To understand how digital a computer can work, at the lowest level. To understand what is possible and the limitations.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
BR 2/1/991 Truth Tables (again) Recall that a boolean equation can be represented by a Truth Table A B C F
THE K-MAP.
Karnaugh Maps (K-Map) A K-Map is a graphical representation of a logic function’s truth table.
C.S.Choy39 TERMINOLOGY Minterm –product term containing all input variables of a function in either true or complementary form Maxterm – sum term containing.
Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.
K-map Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.
Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.
Karnaugh Maps The minimization method using Boolean Algebra, apart from being laborious and requiring the remembering all the laws, can lead to solutions.
CE1110: Digital Logic Design Gate Level Minimization Karnaugh Maps (K-Maps)
EET 1131 Unit 5 Boolean Algebra and Reduction Techniques
CHAPTER 3 Simplification of Boolean Functions
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
Minimization of Circuits
Prof. Sin-Min Lee Department of Computer Science
Plotting functions not in canonical form
ECE/CS 352 Digital Systems Fundamentals
Boolean Algebra and Combinational Logic
Karnaugh Map Method.
ECE 2110: Introduction to Digital Systems
Lecture 3 Gunjeet Kaur Dronacharya Group of Institutions
Karnaugh Maps.
EEL 3705 / 3705L Digital Logic Design
Digital Logic and Design
Optimized Implementation of Logic Function
BASIC & COMBINATIONAL LOGIC CIRCUIT
Digital Logic & Design Dr. Waseem Ikram Lecture 12.
CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions
Karnaugh Mapping Karnaugh Mapping Digital Electronics
Karnaugh Maps Topics covered in this presentation: Karnaugh Maps
SYEN 3330 Digital Systems Chapter 2 – Part 4 SYEN 3330 Digital Systems.
Karnaugh Mapping Digital Electronics
ECE 331 – Digital System Design
ECE 331 – Digital System Design
Karnaugh Mapping Karnaugh Mapping Digital Electronics
ECE 331 – Digital System Design
Karnaugh Mapping Digital Electronics
MINTERMS and MAXTERMS Week 3
COE 202: Digital Logic Design Combinational Logic Part 3
Minimization of Switching Functions
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
Laws & Rules of Boolean Algebra
Chapter 2 Digital Design and Computer Architecture, 2nd Edition
Circuit Simplification and
Computer Architecture
Presentation transcript:

E- Lesson: Karnaugh Maps (K-Map )

Subject: Computer Science (083) Section: Boolean Algebra Topic: Minimization of Boolean Expression using K-Map Category: Senior Secondary Class: XII

Instructional Objective The instructional objective of lesson is…… To enable the students to acquire the knowledge of Simplifying boolean expression. To Understand Need of Simplifying boolean expression To implement the knowledge for Simplifying boolean expression

Learning Objective After successfully completion of this module students should be able to, Understand Need of Simplifying expression List of different Methods for minimization. Algebraic Method Karnaugh Map

Pre- Requisites Information Mintern Maxterm Canonical SOP Canonical POS Logic Gates

Importance of K-Map. A K-Map provide a pictorial method of grouping together expression with common factors and therefore eliminating unwanted variables from function. K- Map is extensively used for simplification of boolen expression with up to six variables. The Map consists of 2n squares for n variable function.

Graphical Representation of K-Map

Addressing the Cells Address of K- Maps must be ordered such that the value for adjacent columns vary by a single bit. Like (00,01,11,10). This ordering is known as Gray Code and it is a key factor in the way in which K- Map works. The Example for Mapping are:

Two Variable K-Map

Question ??? Question: Draw the Map for 3 Variable function.

Three-Variable K-Map Where m1,m2……. M7 are shorthand notation for each term.

Four-variable K-Map

Four-variable K-Map

Four-variable K-Map Edges are adjacent Edges are adjacent

Plotting Functions on the K-map SOP Form

using shorthand notation Canonical SOP Form Three Variable Example using shorthand notation

Three-Variable K-Map Example Plot 1’s (minterms) of switching function 1 1 1 1

Four-variable K-Map Example 1 1 1 1 1

Guidelines for grouping Functions In grouping, the No. of groups should be minimum and the size of group should be maximize. First of all make octet by using straight combination and then Roll Mapping method. After finding all Octet, make the Quads by using straight combination and Roll Mapping.

Pair Reduction Rule Simplification Procedure for K – Map Remove the variable which changes its state from complemented to un complemented or vice versa. Pair removes one variable only.

Quad Reduction Rule Remove the two variables which change their state from complemented to un complemented or vice versa. Quad removes two variables.

Octet Reduction Rule Remove three variables which change their state from complemented to un complemented or vice versa.

Map Rolling Map rolling means roll the map considering the map as if its left edges are touching the right edges and top edges are touching bottom edges. While marking the pairs quads and octet, map must be rolled.

Overlapping Groups Overlapping means same 1 can be encircled more than once. Overlapping always leads to simpler expressions.

Redundant Group It is a group whose all 1's are overlapped by other groups. Redundant groups must be removed. Removal of redundant group leads to much simpler expression.

Guidelines for grouping Functions After finding all Quads, make the Pairs by using straight combination and Roll Mapping. Finally remove the completely overlap group and then apply simplification method.

K-map Simplification Procedure To minimize the boolean funtion, remove the variables which vary in rows and columns. ----------------------------------------- No. of. Variable in group Eliminate Variable ----------------------------------------------------------- 2 (Pair) 1 4 (Quad) 2 8 (Octet) 3 -------------------------------------------------------

Example- 1

Example- 2

Example- 3

Example-4

Question-1 Represent the following boolean expression in a K-map and simplify. F = x'yz + x'yz' + xy'z' + xy'z

Solution : Hence the simplified expression is  F = x'y + xy'

Question-2 F = a'bc + ab'c' + abc + abc' Represent the following boolean expression in a K-map and simplify. F = a'bc + ab'c' + abc + abc'

Solution : Hence the simplified expression is  F = bc + ac'

Any Question?