# Module -7. Karnaugh Maps

Size: px
Start display at page:

Transcription

1 1 Module -7 Karnaugh Maps 1. Introduction 2. Canonical and Standard forms 2.1 Minterms 2.2 Maxterms 2.3 Canonical Sum of Product or Sum-of-Minterms (SOM) 2.4 Canonical product of sum or Product-of-Maxterms(POM) 2.5 Standard Sum-of-Product(SOP) and Product-of-sum(POS) 3. Karnaugh Map 3.1 K-maps with 2, 3, 4 variables 3.2 Minimisation using K-Maps 3.3 K-maps with don t care conditions 4. Summary Learning Objectives: 1. Learn the techniques of simplifying logic expression 2. Understand standard and canonical forms of logic expressions 3. Study the k-map technique for mapping and simplification.

2 2 1. Introduction Boolean algebra is the mathematical basis for logic design. Generating Boolean equations to implement a desired logic function is a necessary step before a circuit can be implemented. Truth tables provide a simple means of describing logical relationships between inputs and outputs. Once a truth table has been created, it is not always easy to convert truth table directly into Boolean equation. This conversion becomes more difficult as the number of variables in an equation increases. The operation of any logic circuit can always be expressed as sum of products form of product of sum form. It is also known that these expressions have longer or unwieldy form to write as well as implement. It is for this reason that minimization of logic expression is so important. This results in simpler circuit and reduced Boolean expression. When circuit with more than two or three variables is involved a better method of circuit reduction that works well is the Karnaugh maps. A graphical means of converting a truth table into a logic equation was invented by Karnaugh and is popularly known as Karnaugh map or K- map. Digital circuits can be minimized using Boolean algebra or Karnaugh maps. K-maps are most commonly used manual method because K-map involves simple representation and inspection of truth table in different way. In this unit, we shall discuss about the minimization technique based on Karnaugh maps. 2. Canonical and Standard and forms There are several forms of Boolean expressions used for representing the logical functions. A given logic function can be represented in terms different combinations of logical variables with complemented as well as un-complemented forms. Any logic function can be represented in terms either canonical form or a standard form. Let us begin the discussion by defining a function using a truth table as shown in fig. 1.

3 3 Row A B C F Figure 1: A logic function defined by truth table. This truth table indicates the output (F) of logic circuit as a function of three variables (A,B,C). This logic function may be defined as F(A,B,C). Let us define product and sum terms as defined in normal algebra. These terms do not literally mean multiplication or addition. In Boolean algebra a product means a logical AND operation while sum is a logical OR operation. Before learning about the sum-of-product term and product-of-sum terms, it is essential to define two important terms namely minterm and maxterm. 2.1 Minterm: A minterm is a product term in which all the variables appear exactly once, either complemented or un-complemented form. Example: (A.B.C.D ). A minterm is TRUE for the minimum number of combinations of inputs i.e. exactly once. As it is required to minimize the coverage, all the variables are coupled through AND operation. Since AND term is TRUE only if all of the inputs are TRUE. The product term contains both complemented as well as un-complemented variable. To generate the output of product term as 1, the un-complemented variable must be 1 and complemented variable must be 0. Let us now show the minterms for the logic function defined in the fig.1.

4 4 Row A B C Minterm Designation F A B C m A B C m A B C m A B C m A B C m A B C m A B C m A B C m7 1 Figure 2: Table of Minterms of 3 variables Figure 2 indicates the assignment of Minterm to each term of the truth table. Each minterm is TRUE only for specific combination of inputs with which it is associated. In order to qualify as the minterm, the product must contain all input variables either in un-complemented form or complemented form. 2.2 Maxterm: A maxterm is a sum term in which all the variables appear exactly once, either complemented or un-complemented form. Example: (A +B+C). A maxterm is TRUE for the maximum number of combinations of inputs i.e. more than once. As it is necessary to maximize the coverage, all the variables are coupled by an OR operation for Boolean operation. The OR operation is TRUE if any of its inputs are TRUE. The sum term contains both complemented as well as un-complemented variable. To generate the output of sum term as 1, the un-complemented variable must be 1 and complemented variable must be 0. Let us now show the assignment of maxterms for the logic function.

5 5 Row A B C Maxterm Designation F A+B+C M A+B+ C M A+ B + C M A+B +C M A + B+ C M A + B+C M A +B + C M A +B + C M7 1 Figure 3: Table of Maxterms of 3 variables Fig. 3 indicates the assignment of Maxterm to each term of the truth table. Each maxterm is TRUE only for specific combination of inputs with which it is associated. In order to qualify as the maxterm, the sum must contain all input variables either in un-complemented form or complemented form. Relation between Minterm and Maxterm In order to understand the relation between minterm and maxterm, consider the minterm and maxterm for a particular row. Following table gives the minterms and maxterms for three variable. Here number of minterms as well as maxterms are 2 3 = 8. Variable Minterm Maxterm A B C m i M i A B C = m0 A+B+C =M A B C = m1 A+B+C =M A B C = m2 A+B +C=M A B C = m3 A+B +C =M A B C = m4 A +B+C=M A B C = m5 A +B+C =M A B C = m6 A +B +C=M A B C = m7 A +B +C =M7 Figure 4: Table for Minterm and Maxterm

6 6 Let us consider the first minterm form table. Minterm = A B C Let us take complement of Minterm i.e. (A B C ) = (A ) +(B ) +(C ) (Appling De Morgans theorm) = A+B+C = Maxterm It is clear that each minterm is the logical inverse of the corresponding maxterm and vice versa. This indicates when the minterm is TRUE only when that combination is present while the maxterm is FALSE only when that combination is present. 2.3 Canonical Sum of Product or Sum-of-Minterms (SOM) When a Boolean function is expressed as the logical sum of all the minterms from the rows of a truth table, for which the value of function is 1 then it is known as the canonical sum of minterm form. Let us find out Sum of minterm for Fig.1. F(A,B,C) = (0,3,6,7) = m0+m3+m6+m7 = A B C + A B C+ A B C + A B C 2.4 Canonical product of sum or Product-of-Maxterms (POM) When a Boolean function is expressed as the logical product of all the maxterms from the rows of a truth table, for which the value of function is 0 then it is known as the canonical product of maxterm form. Let us find out product of maxterm for Fig.1. F(A,B,C) = (1,2,4,5) = M1 M2 M4 M5

7 7 = (A+B+ C ) (A+ B + C) (A + B+ C) (A + B+C ) Note, the relation between the sum of products and product of sum in canonical form of an expression is m i = M i Here m i is the minterm for row i an M i is the maxterm for row i. To convert from one canonical form to another, interchange and signs and replace the row numbers with those not included in the original form. For example m(0,3,6,7) = M(1,2,4,5) 2.5 Standard Sum-of-Product (SOP) and Product-of-sum(POS) Another important form of a Boolean expression is standard form. Standard form of Boolean expression facilitates simplification. The result after simplification provides more desirable implementations. The standard form of a Boolean expression has the same canonical sum-ofproducts and product-of-sum form except that the product and sum terms need not be minterms and maxterms respectively. The standard form of Boolean expression is Product of Sums (POS). It contains two level implementation of the Boolean expression. First level is the Oring to provide sum term and then at second level ANDing results in Product term. Both SOP and POS are the two standard forms of Boolean expression. Both includes the sum and product terms for the two level implementations of Boolean expression. A sum of product expression contains terms with product of literals or variable. F(A,B,C) = B + A BC +AB Similarly, the product of sum expression contains terms with sum of literals. F(A,B,C) = (A+C). (A+B+C). C

8 8 Both these expressions represent standard SOP and POS forms of Boolean expressions. From the above expressions it is also clear that all the individual terms do not involve all the three variables. If each term of SOP or POS form involves all the three variables in each term then these expressions are known as Canonical SOP and POS forms. Each individual term in canonical SOP form is known as Minterm (e.g. ABC) and each individual term in canonical POS form is known as Maxterm (e.g. A B C ). SOP from can be converted to canonical SOP by ANDing the term with the ORing term of missing variable and its complement. f = AB = AB.(C+C ) = ABC +ABC Similarly, POS from can be converted to canonical POS by ORing the term with the ANDing term of missing variable and its complement. f = (A+C) = (A+B.B +C) = (A+B+C) (A+B +C) 3. Karnaugh Map A Karnaugh map (K-map) is a graphical method used to minimize Boolean expressions without using Boolean algebra rules, laws and theorems. A K-map can be thought of as a special version of a truth table. Using a K-map, it is possible to minimize expressions with two to four variables easily and preferred for many small design problems. Many larger digital designs prefer computer implementation of different algorithms. The Quine-McCluskey method is a technique suitable for reduction of Boolean expression using computer algorithms. Karnaugh maps (K-maps) contain exactly the same information as truth tables. The difference is that the K-map uses a matrix format to hold the output values. The K-map is arranged so that logically adjacent terms are also adjacent in the matrix. These terms can be logically combined and hence minimized. More importantly, the minimization process is performed visually as compared to traditional minimization techniques.

9 9 3.1 : K-map of 2,3,and 4 variables: The K-map consists of a number of squares called cells. Each square cell represents a minterm (or maxterm). Fig. 5 indicates graphical representation of k-maps for 2, 3 and 4 variables. Y X m0 m1 YZ X 1 m2 m m0 m1 m3 m2 1 m4 m5 m7 m6 ZW XY m0 m1 m3 m2 01 m4 m5 m7 m6 11 m12 m13 m15 m14 10 m8 m9 m11 m10 Figure 5:Graphical representation for k-map of 2, 3 and 4 variables.

11 4. Group/ Draw loops around neighbouring cells in pairs or quads or octets 1s together on the map. 5. Eliminate the variable. When a variable and its complement are within a loop, that variable is eliminated. 6. OR the terms that remain to generate simplified minterm Boolean expressions 11 Example 1: Let us consider an example to understand the procedure of converting truth table into a simplified Boolean expression using K-map. (a) Given Truth table Inputs Outputs A B Y A.B A.B A.B (b) Minterm Boolean expression Y= A B + A.B + A.B (c) Let us draw a K-map of two variables (d) Plotting 1s on map B B B B A A 1 A A 1 1 (e) Looping 1s B B A 1 Eliminate A A 1 1 Eliminate B

12 12 (f) Eliminating variables to form simplified Boolean expressions Y= A+ B Example-2: Let us consider a truth table with three variables. Inputs Output A B C Y A B C A BC AB C ABC ABC Unsimplified Boolean expression is Y= A B C+A BC+AB C+ABC +ABC Let us draw K-map & map 1s C C A B 1 A B 1 A B 1 1 A B 1 Grouping together C C A B 1 A B 1 A B 1 1 A B 1 Eliminate A & B Eliminate C Simplified Boolean expression is Y= C + A B

13 13 Example -3: Let us consider a truth table of 4 variables. Plotting and grouping 1s on K-map Inputs Outputs A B C D Y C D C D CD CD A B 1 1 A B 1 1 A B A B 1 1 Eliminate A, B & C Eliminate D The simplified Boolean expression is Y = D + ABC C C A B 1 A B A B A B 1 (a) (b) (c) Fig. 6: Some unusual groups / loops C D C D CD CD A B 1 1 A B A B A B 1 1 C D C D CD CD A B 1 1 A B A B A B 1 1

14 14 The K-map of Figure 6(a) contains two 1s. Let us think of the top and bottom edges of the map as being connected and as if rolled into a tube, The 1s can then be looped into a group of two and one variable can be eliminated. Consider a K-map of four variables in figure 6 (b). The top and bottom edges of the map are considered as if tolled into a tube and connected for looping. In figure 6 (c) loop can be formed if the corners of the map are considered connected as if the map is wrapped around a ball. The four 1s in the corner of the map are then grouped into a single loop and thus two variables can be eliminated. 3.3 K-maps with don t care conditions Consider a truth table which accepts inputs 4-bit BCD and generates one output. Note that the binary numbers 0000 to 1001 on the table are used to specify decimal numbers from 0 to 9 BCD number Decimal equivalent Output A B C D number Y Not used X Not used X Not used X Not used X Not used X Not used X

15 15 In 4 variable truth table, there are six combinations (1010 through 1111) are not used in the code. These combinations are called don t cares when plotted on K maps. The don t care may have some effect on simplifying any logic diagram that might be constructed. Let us consider a problem that generates a warning light when BCD count reaches (1001) i.e. decimal 9. Let us represent the truth table for this example. C D C D CD CD A B X A B X X A B X X A B 1 X Y = A.D For unsimplified Boolean expression without don t care condition would have resulted in Y = A.B C D. But using 6 don t care conditions in K-map, We can form a quad so that B and C can be eliminated so as to result in Y = A.D 4. Summary Any Boolean function F( ) can be expressed as a unique sum of minterms and a unique product of maxterms. In other words, every function F() has two canonical forms: Canonical Sum-Of-Products (sum of minterms) Canonical Product-Of-Sums (product of maxterms) Another important form of a Boolean expression is standard form. Standard form of Boolean expression facilitates simplification. The result after simplification provides more desirable

16 implementations. Sum of Products and product of sum are two standard forms of Boolean expression. 16 A Karnaugh map (K-map) is a graphical method used to minimize Boolean expressions without using Boolean algebra rules, laws and theorems. A K-map can be thought of as a special version of a truth table. The K-map consists of a number of squares called cells. Each square cell represents a minterm (or maxterm). Using a K-map, it is possible to minimize expressions with two to four variables easily and preferred for many small design problems. Many larger digital designs prefer computer implementation of different algorithms. Neighbouring cells in pairs or quads or octets containing 1 or X are used for term reduction.

### Combinational Logic Circuits

Chapter 3 Combinational Logic Circuits 12 Hours 24 Marks 3.1 Standard representation for logical functions Boolean expressions / logic expressions / logical functions are expressed in terms of logical

### CHAPTER-2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, K-Map and Quine-McCluskey

CHAPTER-2 STRUCTURE OF BOOLEAN FUNCTION USING GATES, K-Map and Quine-McCluskey 2. Introduction Logic gates are connected together to produce a specified output for certain specified combinations of input

### Specifying logic functions

CSE4: Components and Design Techniques for Digital Systems Specifying logic functions Instructor: Mohsen Imani Slides from: Prof.Tajana Simunic and Dr.Pietro Mercati We have seen various concepts: Last

### Chapter 2. Boolean Expressions:

Chapter 2 Boolean Expressions: A Boolean expression or a function is an expression which consists of binary variables joined by the Boolean connectives AND and OR along with NOT operation. Any Boolean

### Experiment 3: Logic Simplification

Module: Logic Design Name:... University no:.. Group no:. Lab Partner Name: Mr. Mohamed El-Saied Experiment : Logic Simplification Objective: How to implement and verify the operation of the logical functions

### DKT 122/3 DIGITAL SYSTEM 1

Company LOGO DKT 122/3 DIGITAL SYSTEM 1 BOOLEAN ALGEBRA (PART 2) Boolean Algebra Contents Boolean Operations & Expression Laws & Rules of Boolean algebra DeMorgan s Theorems Boolean analysis of logic circuits

### Unit-IV Boolean Algebra

Unit-IV Boolean Algebra Boolean Algebra Chapter: 08 Truth table: Truth table is a table, which represents all the possible values of logical variables/statements along with all the possible results of

### To write Boolean functions in their standard Min and Max terms format. To simplify Boolean expressions using Karnaugh Map.

3.1 Objectives To write Boolean functions in their standard Min and Max terms format. To simplify Boolean expressions using. 3.2 Sum of Products & Product of Sums Any Boolean expression can be simplified

### A graphical method of simplifying logic

4-5 Karnaugh Map Method A graphical method of simplifying logic equations or truth tables. Also called a K map. Theoretically can be used for any number of input variables, but practically limited to 5

### 2.6 BOOLEAN FUNCTIONS

2.6 BOOLEAN FUNCTIONS Binary variables have two values, either 0 or 1. A Boolean function is an expression formed with binary variables, the two binary operators AND and OR, one unary operator NOT, parentheses

Get Free notes at Module-I One s Complement: Complement all the bits.i.e. makes all 1s as 0s and all 0s as 1s Two s Complement: One s complement+1 SIGNED BINARY NUMBERS Positive integers (including zero)

### Points Addressed in this Lecture. Standard form of Boolean Expressions. Lecture 4: Logic Simplication & Karnaugh Map

Points Addressed in this Lecture Lecture 4: Logic Simplication & Karnaugh Map Professor Peter Cheung Department of EEE, Imperial College London Standard form of Boolean Expressions Sum-of-Products (SOP),

### IT 201 Digital System Design Module II Notes

IT 201 Digital System Design Module II Notes BOOLEAN OPERATIONS AND EXPRESSIONS Variable, complement, and literal are terms used in Boolean algebra. A variable is a symbol used to represent a logical quantity.

### Digital Logic Lecture 7 Gate Level Minimization

Digital Logic Lecture 7 Gate Level Minimization By Ghada Al-Mashaqbeh The Hashemite University Computer Engineering Department Outline Introduction. K-map principles. Simplification using K-maps. Don t-care

### A B AB CD Objectives:

Objectives:. Four variables maps. 2. Simplification using prime implicants. 3. "on t care" conditions. 4. Summary.. Four variables Karnaugh maps Minterms A A m m m3 m2 A B C m4 C A B C m2 m8 C C m5 C m3

### Karnaugh Map (K-Map) Karnaugh Map. Karnaugh Map Examples. Ch. 2.4 Ch. 2.5 Simplification using K-map

Karnaugh Map (K-Map) Ch. 2.4 Ch. 2.5 Simplification using K-map A graphical map method to simplify Boolean function up to 6 variables A diagram made up of squares Each square represents one minterm (or

### LSN 4 Boolean Algebra & Logic Simplification. ECT 224 Digital Computer Fundamentals. Department of Engineering Technology

LSN 4 Boolean Algebra & Logic Simplification Department of Engineering Technology LSN 4 Key Terms Variable: a symbol used to represent a logic quantity Compliment: the inverse of a variable Literal: a

### Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions

Assignment (3-6) Boolean Algebra and Logic Simplification - General Questions 1. Convert the following SOP expression to an equivalent POS expression. 2. Determine the values of A, B, C, and D that make

### 4 KARNAUGH MAP MINIMIZATION

4 KARNAUGH MAP MINIMIZATION A Karnaugh map provides a systematic method for simplifying Boolean expressions and, if properly used, will produce the simplest SOP or POS expression possible, known as the

### Computer Science. Unit-4: Introduction to Boolean Algebra

Unit-4: Introduction to Boolean Algebra Learning Objective At the end of the chapter students will: Learn Fundamental concepts and basic laws of Boolean algebra. Learn about Boolean expression and will

### X Y Z F=X+Y+Z

This circuit is used to obtain the compliment of a value. If X = 0, then X = 1. The truth table for NOT gate is : X X 0 1 1 0 2. OR gate : The OR gate has two or more input signals but only one output

### Lecture 5. Chapter 2: Sections 4-7

Lecture 5 Chapter 2: Sections 4-7 Outline Boolean Functions What are Canonical Forms? Minterms and Maxterms Index Representation of Minterms and Maxterms Sum-of-Minterm (SOM) Representations Product-of-Maxterm

### DIGITAL CIRCUIT LOGIC UNIT 5: KARNAUGH MAPS (K-MAPS)

DIGITAL CIRCUIT LOGIC UNIT 5: KARNAUGH MAPS (K-MAPS) 1 Learning Objectives 1. Given a function (completely or incompletely specified) of three to five variables, plot it on a Karnaugh map. The function

### Chapter 2 Combinational Logic Circuits

Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Overview Part Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard

### Summary. Boolean Addition

Summary Boolean Addition In Boolean algebra, a variable is a symbol used to represent an action, a condition, or data. A single variable can only have a value of or 0. The complement represents the inverse

### Chapter 3 Simplification of Boolean functions

3.1 Introduction Chapter 3 Simplification of Boolean functions In this chapter, we are going to discuss several methods for simplifying the Boolean function. What is the need for simplifying the Boolean

### Date Performed: Marks Obtained: /10. Group Members (ID):. Experiment # 04. Boolean Expression Simplification and Implementation

Name: Instructor: Engr. Date Performed: Marks Obtained: /10 Group Members (ID):. Checked By: Date: Experiment # 04 Boolean Expression Simplification and Implementation OBJECTIVES: To understand the utilization

### Combinational Circuits Digital Logic (Materials taken primarily from:

Combinational Circuits Digital Logic (Materials taken primarily from: http://www.facstaff.bucknell.edu/mastascu/elessonshtml/eeindex.html http://www.cs.princeton.edu/~cos126 ) Digital Systems What is a

### Introduction to Computer Architecture

Boolean Operators The Boolean operators AND and OR are binary infix operators (that is, they take two arguments, and the operator appears between them.) A AND B D OR E We will form Boolean Functions of

### UNIT-4 BOOLEAN LOGIC. NOT Operator Operates on single variable. It gives the complement value of variable.

UNIT-4 BOOLEAN LOGIC Boolean algebra is an algebra that deals with Boolean values((true and FALSE). Everyday we have to make logic decisions: Should I carry the book or not?, Should I watch TV or not?

### Bawar Abid Abdalla. Assistant Lecturer Software Engineering Department Koya University

Logic Design First Stage Lecture No.6 Boolean Algebra Bawar Abid Abdalla Assistant Lecturer Software Engineering Department Koya University Outlines Boolean Operations Laws of Boolean Algebra Rules of

### Chapter 2 Combinational

Computer Engineering 1 (ECE290) Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization HOANG Trang 2008 Pearson Education, Inc. Overview Part 1 Gate Circuits and Boolean Equations Binary Logic

### Gate Level Minimization

Gate Level Minimization By Dr. M. Hebaishy Digital Logic Design Ch- Simplifying Boolean Equations Example : Y = AB + AB Example 2: = B (A + A) T8 = B () T5 = B T Y = A(AB + ABC) = A (AB ( + C ) ) T8 =

### BOOLEAN ALGEBRA. Logic circuit: 1. From logic circuit to Boolean expression. Derive the Boolean expression for the following circuits.

COURSE / CODE DIGITAL SYSTEMS FUNDAMENTAL (ECE 421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE 422) BOOLEAN ALGEBRA Boolean Logic Boolean logic is a complete system for logical operations. It is used in countless

### Ch. 5 : Boolean Algebra &

Ch. 5 : Boolean Algebra & Reduction elektronik@fisika.ui.ac.id Objectives Should able to: Write Boolean equations for combinational logic applications. Utilize Boolean algebra laws and rules for simplifying

### Experiment 4 Boolean Functions Implementation

Experiment 4 Boolean Functions Implementation Introduction: Generally you will find that the basic logic functions AND, OR, NAND, NOR, and NOT are not sufficient to implement complex digital logic functions.

### Combinational Logic Circuits

Chapter 2 Combinational Logic Circuits J.J. Shann (Slightly trimmed by C.P. Chung) Chapter Overview 2-1 Binary Logic and Gates 2-2 Boolean Algebra 2-3 Standard Forms 2-4 Two-Level Circuit Optimization

### Gate Level Minimization Map Method

Gate Level Minimization Map Method Complexity of hardware implementation is directly related to the complexity of the algebraic expression Truth table representation of a function is unique Algebraically

### Combinational Logic & Circuits

Week-I Combinational Logic & Circuits Spring' 232 - Logic Design Page Overview Binary logic operations and gates Switching algebra Algebraic Minimization Standard forms Karnaugh Map Minimization Other

### CMPE223/CMSE222 Digital Logic

CMPE223/CMSE222 Digital Logic Optimized Implementation of Logic Functions: Strategy for Minimization, Minimum Product-of-Sums Forms, Incompletely Specified Functions Terminology For a given term, each

### Digital Logic Design (CEN-120) (3+1)

Digital Logic Design (CEN-120) (3+1) ASSISTANT PROFESSOR Engr. Syed Rizwan Ali, MS(CAAD)UK, PDG(CS)UK, PGD(PM)IR, BS(CE)PK HEC Certified Master Trainer (MT-FPDP) PEC Certified Professional Engineer (COM/2531)

### Philadelphia University Faculty of Information Technology Department of Computer Science. Computer Logic Design. By Dareen Hamoudeh.

Philadelphia University Faculty of Information Technology Department of Computer Science Computer Logic Design By Dareen Hamoudeh Dareen Hamoudeh 1 Canonical Forms (Standard Forms of Expression) Minterms

### Switching Circuits & Logic Design

Switching Circuits & Logic Design Jie-Hong Roland Jiang 江介宏 Department of Electrical Engineering National Taiwan University Fall 23 5 Karnaugh Maps K-map Walks and Gray Codes http://asicdigitaldesign.wordpress.com/28/9/26/k-maps-walks-and-gray-codes/

### Digital Techniques. Lecture 1. 1 st Class

Digital Techniques Lecture 1 1 st Class Digital Techniques Digital Computer and Digital System: Digital computer is a part of digital system, it based on binary system. A block diagram of digital computer

### CS470: Computer Architecture. AMD Quad Core

CS470: Computer Architecture Yashwant K. Malaiya, Professor malaiya@cs.colostate.edu AMD Quad Core 1 Architecture Layers Building blocks Gates, flip-flops Functional bocks: Combinational, Sequential Instruction

### Simplification of Boolean Functions

Simplification of Boolean Functions Contents: Why simplification? The Map Method Two, Three, Four and Five variable Maps. Simplification of two, three, four and five variable Boolean function by Map method.

### UNIT II. Circuit minimization

UNIT II Circuit minimization The complexity of the digital logic gates that implement a Boolean function is directly related to the complexity of the algebraic expression from which the function is implemented.

### ECE380 Digital Logic

ECE38 Digital Logic Optimized Implementation of Logic Functions: Strategy for Minimization, Minimum Product-of-Sums Forms, Incompletely Specified Functions Dr. D. J. Jackson Lecture 8- Terminology For

### Combinational Logic Circuits Part III -Theoretical Foundations

Combinational Logic Circuits Part III -Theoretical Foundations Overview Simplifying Boolean Functions Algebraic Manipulation Karnaugh Map Manipulation (simplifying functions of 2, 3, 4 variables) Systematic

### Boolean Analysis of Logic Circuits

Course: B.Sc. Applied Physical Science (Computer Science) Year & Sem.: IInd Year, Sem - IIIrd Subject: Computer Science Paper No.: IX Paper Title: Computer System Architecture Lecture No.: 7 Lecture Title:

### Gate-Level Minimization. BME208 Logic Circuits Yalçın İŞLER

Gate-Level Minimization BME28 Logic Circuits Yalçın İŞLER islerya@yahoo.com http://me.islerya.com Complexity of Digital Circuits Directly related to the complexity of the algebraic expression we use to

### ELCT201: DIGITAL LOGIC DESIGN

ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 3 Following the slides of Dr. Ahmed H. Madian محرم 1439 ه Winter

### CSCI 220: Computer Architecture I Instructor: Pranava K. Jha. Simplification of Boolean Functions using a Karnaugh Map

CSCI 22: Computer Architecture I Instructor: Pranava K. Jha Simplification of Boolean Functions using a Karnaugh Map Q.. Plot the following Boolean function on a Karnaugh map: f(a, b, c, d) = m(, 2, 4,

### Announcements. Chapter 2 - Part 1 1

Announcements If you haven t shown the grader your proof of prerequisite, please do so by 11:59 pm on 09/05/2018 (Wednesday). I will drop students that do not show us the prerequisite proof after this

### Menu. Algebraic Simplification - Boolean Algebra EEL3701 EEL3701. MSOP, MPOS, Simplification

Menu Minterms & Maxterms SOP & POS MSOP & MPOS Simplification using the theorems/laws/axioms Look into my... 1 Definitions (Review) Algebraic Simplification - Boolean Algebra Minterms (written as m i ):

### Switching Theory And Logic Design UNIT-II GATE LEVEL MINIMIZATION

Switching Theory And Logic Design UNIT-II GATE LEVEL MINIMIZATION Two-variable k-map: A two-variable k-map can have 2 2 =4 possible combinations of the input variables A and B. Each of these combinations,

### Simplification of Boolean Functions

COM111 Introduction to Computer Engineering (Fall 2006-2007) NOTES 5 -- page 1 of 5 Introduction Simplification of Boolean Functions You already know one method for simplifying Boolean expressions: Boolean

### CS8803: Advanced Digital Design for Embedded Hardware

CS883: Advanced Digital Design for Embedded Hardware Lecture 2: Boolean Algebra, Gate Network, and Combinational Blocks Instructor: Sung Kyu Lim (limsk@ece.gatech.edu) Website: http://users.ece.gatech.edu/limsk/course/cs883

### Chapter 2 Boolean algebra and Logic Gates

Chapter 2 Boolean algebra and Logic Gates 2. Introduction In working with logic relations in digital form, we need a set of rules for symbolic manipulation which will enable us to simplify complex expressions

Class Subject Code Subject Prepared By Lesson Plan for Time: Lesson. No 1.CONTENT LIST: Introduction to UnitI 2. SKILLS ADDRESSED: Listening I year, 02 sem CS6201 Digital Principles & System Design S.Seedhanadevi

### ENGIN 112 Intro to Electrical and Computer Engineering

ENGIN 2 Intro to Electrical and Computer Engineering Lecture 8 Minimization with Karnaugh Maps Overview K-maps: an alternate approach to representing oolean functions K-map representation can be used to

### Incompletely Specified Functions with Don t Cares 2-Level Transformation Review Boolean Cube Karnaugh-Map Representation and Methods Examples

Lecture B: Logic Minimization Incompletely Specified Functions with Don t Cares 2-Level Transformation Review Boolean Cube Karnaugh-Map Representation and Methods Examples Incompletely specified functions

### R.M.D. ENGINEERING COLLEGE R.S.M. Nagar, Kavaraipettai

L T P C R.M.D. ENGINEERING COLLEGE R.S.M. Nagar, Kavaraipettai- 601206 DEPARTMENT OF ELECTRONICS AND COMMUNICATION ENGINEERING EC8392 UNIT - I 3 0 0 3 OBJECTIVES: To present the Digital fundamentals, Boolean

### Chapter 3. Gate-Level Minimization. Outlines

Chapter 3 Gate-Level Minimization Introduction The Map Method Four-Variable Map Five-Variable Map Outlines Product of Sums Simplification Don t-care Conditions NAND and NOR Implementation Other Two-Level

### (Refer Slide Time 6:48)

Digital Circuits and Systems Prof. S. Srinivasan Department of Electrical Engineering Indian Institute of Technology Madras Lecture - 8 Karnaugh Map Minimization using Maxterms We have been taking about

### Binary logic. Dr.Abu-Arqoub

Binary logic Binary logic deals with variables like (a, b, c,, x, y) that take on two discrete values (, ) and with operations that assume logic meaning ( AND, OR, NOT) Truth table is a table of all possible

### Review: Standard forms of expressions

Karnaugh maps Last time we saw applications of Boolean logic to circuit design. The basic Boolean operations are AND, OR and NOT. These operations can be combined to form complex expressions, which can

### 3.4 QUINE MCCLUSKEY METHOD 73. f(a, B, C, D, E)¼AC ĒþB CD þ BCDþĀBD.

3.4 QUINE MCCLUSKEY METHOD 73 FIGURE 3.22 f(a, B, C, D, E)¼B CD þ BCD. FIGURE 3.23 f(a, B, C, D, E)¼AC ĒþB CD þ BCDþĀBD. A¼1map are, 1, and 1, respectively, whereas the corresponding entries in the A¼0

### Standard Forms of Expression. Minterms and Maxterms

Standard Forms of Expression Minterms and Maxterms Standard forms of expressions We can write expressions in many ways, but some ways are more useful than others A sum of products (SOP) expression contains:

### Literal Cost F = BD + A B C + A C D F = BD + A B C + A BD + AB C F = (A + B)(A + D)(B + C + D )( B + C + D) L = 10

Circuit Optimization Goal: To obtain the simplest implementation for a given function Optimization is a more formal approach to simplification that is performed using a specific procedure or algorithm

### ELCT201: DIGITAL LOGIC DESIGN

ELCT201: DIGITAL LOGIC DESIGN Dr. Eng. Haitham Omran, haitham.omran@guc.edu.eg Dr. Eng. Wassim Alexan, wassim.joseph@guc.edu.eg Lecture 3 Following the slides of Dr. Ahmed H. Madian ذو الحجة 1438 ه Winter

### Synthesis 1. 1 Figures in this chapter taken from S. H. Gerez, Algorithms for VLSI Design Automation, Wiley, Typeset by FoilTEX 1

Synthesis 1 1 Figures in this chapter taken from S. H. Gerez, Algorithms for VLSI Design Automation, Wiley, 1998. Typeset by FoilTEX 1 Introduction Logic synthesis is automatic generation of circuitry

### Slide Set 5. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary

Slide Set 5 for ENEL 353 Fall 207 Steve Norman, PhD, PEng Electrical & Computer Engineering Schulich School of Engineering University of Calgary Fall Term, 207 SN s ENEL 353 Fall 207 Slide Set 5 slide

### Digital logic fundamentals. Question Bank. Unit I

Digital logic fundamentals Question Bank Subject Name : Digital Logic Fundamentals Subject code: CA102T Staff Name: R.Roseline Unit I 1. What is Number system? 2. Define binary logic. 3. Show how negative

### SEE1223: Digital Electronics

SEE223: Digital Electronics 3 Combinational Logic Design Zulkifil Md Yusof Dept. of Microelectronics and Computer Engineering The aculty of Electrical Engineering Universiti Teknologi Malaysia Karnaugh

### S1 Teknik Telekomunikasi Fakultas Teknik Elektro FEH2H3 2016/2017

S1 Teknik Telekomunikasi Fakultas Teknik Elektro FEH2H3 2016/2017 Karnaugh Map Karnaugh maps Last time we saw applications of Boolean logic to circuit design. The basic Boolean operations are AND, OR and

### Outcomes. Unit 9. Logic Function Synthesis KARNAUGH MAPS. Implementing Combinational Functions with Karnaugh Maps

.. Outcomes Unit I can use Karnaugh maps to synthesize combinational functions with several outputs I can determine the appropriate size and contents of a memory to implement any logic function (i.e. truth

### EECS150 Homework 2 Solutions Fall ) CLD2 problem 2.2. Page 1 of 15

1.) CLD2 problem 2.2 We are allowed to use AND gates, OR gates, and inverters. Note that all of the Boolean expression are already conveniently expressed in terms of AND's, OR's, and inversions. Thus,

### Chapter 2 Combinational Logic Circuits

Logic and Computer Design Fundamentals Chapter 2 Combinational Logic Circuits Part 2 Circuit Optimization Charles Kime & Thomas Kaminski 2008 Pearson Education, Inc. (Hyperlinks are active in View Show

### SYNERGY INSTITUTE OF ENGINEERING & TECHNOLOGY,DHENKANAL LECTURE NOTES ON DIGITAL ELECTRONICS CIRCUIT(SUBJECT CODE:PCEC4202)

Lecture No:5 Boolean Expressions and Definitions Boolean Algebra Boolean Algebra is used to analyze and simplify the digital (logic) circuits. It uses only the binary numbers i.e. 0 and 1. It is also called

28 The McGraw-Hill Companies, Inc. All rights reserved. 28 The McGraw-Hill Companies, Inc. All rights reserved. All or Nothing Gate Boolean Expression: A B = Y Truth Table (ee next slide) or AB = Y 28

### EEE130 Digital Electronics I Lecture #4_1

EEE130 Digital Electronics I Lecture #4_1 - Boolean Algebra and Logic Simplification - By Dr. Shahrel A. Suandi 4-6 Standard Forms of Boolean Expressions There are two standard forms: Sum-of-products form

### Code No: 07A3EC03 Set No. 1

Code No: 07A3EC03 Set No. 1 II B.Tech I Semester Regular Examinations, November 2008 SWITCHING THEORY AND LOGIC DESIGN ( Common to Electrical & Electronic Engineering, Electronics & Instrumentation Engineering,

### 1. Mark the correct statement(s)

1. Mark the correct statement(s) 1.1 A theorem in Boolean algebra: a) Can easily be proved by e.g. logic induction b) Is a logical statement that is assumed to be true, c) Can be contradicted by another

### 2.1 Binary Logic and Gates

1 EED2003 Digital Design Presentation 2: Boolean Algebra Asst. Prof.Dr. Ahmet ÖZKURT Asst. Prof.Dr Hakkı T. YALAZAN Based on the Lecture Notes by Jaeyoung Choi choi@comp.ssu.ac.kr Fall 2000 2.1 Binary

### Computer Organization

Computer Organization (Logic circuits design and minimization) KR Chowdhary Professor & Head Email: kr.chowdhary@gmail.com webpage: krchowdhary.com Department of Computer Science and Engineering MBM Engineering

### Graduate Institute of Electronics Engineering, NTU. CH5 Karnaugh Maps. Lecturer: 吳安宇教授 Date:2006/10/20 ACCESS IC LAB

CH5 Karnaugh Maps Lecturer: 吳安宇教授 Date:2006/0/20 CCESS IC L Problems in lgebraic Simplification The procedures are difficult to apply in a systematic way. It is difficult to tell when you have arrived

### Code No: R Set No. 1

Code No: R059210504 Set No. 1 II B.Tech I Semester Supplementary Examinations, February 2007 DIGITAL LOGIC DESIGN ( Common to Computer Science & Engineering, Information Technology and Computer Science

### ENGIN 112. Intro to Electrical and Computer Engineering

ENIN 2 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra ENIN2 L6: More Boolean Algebra September 5, 23 A B Overview Epressing Boolean functions Relationships between algebraic

### Contents. Chapter 3 Combinational Circuits Page 1 of 34

Chapter 3 Combinational Circuits Page of 34 Contents Contents... 3 Combinational Circuits... 2 3. Analysis of Combinational Circuits... 2 3.. Using a Truth Table... 2 3..2 Using a Boolean unction... 4

### 2. BOOLEAN ALGEBRA 2.1 INTRODUCTION

2. BOOLEAN ALGEBRA 2.1 INTRODUCTION In the previous chapter, we introduced binary numbers and binary arithmetic. As you saw in binary arithmetic and in the handling of floating-point numbers, there is

### SWITCHING THEORY AND LOGIC CIRCUITS

SWITCHING THEORY AND LOGIC CIRCUITS COURSE OBJECTIVES. To understand the concepts and techniques associated with the number systems and codes 2. To understand the simplification methods (Boolean algebra

### Chapter 3. Boolean Algebra and Digital Logic

Chapter 3 Boolean Algebra and Digital Logic Chapter 3 Objectives Understand the relationship between Boolean logic and digital computer circuits. Learn how to design simple logic circuits. Understand how

### Chapter 2: Combinational Systems

Uchechukwu Ofoegbu Chapter 2: Combinational Systems Temple University Adapted from Alan Marcovitz s Introduction to Logic and Computer Design Riddle Four switches can be turned on or off. One is the switch

### TWO-LEVEL COMBINATIONAL LOGIC

TWO-LEVEL COMBINATIONAL LOGIC OVERVIEW Canonical forms To-level simplification Boolean cubes Karnaugh maps Quine-McClusky (Tabulation) Method Don't care terms Canonical and Standard Forms Minterms and

### QUESTION BANK FOR TEST

CSCI 2121 Computer Organization and Assembly Language PRACTICE QUESTION BANK FOR TEST 1 Note: This represents a sample set. Please study all the topics from the lecture notes. Question 1. Multiple Choice

### Introduction to Microprocessors and Digital Logic (ME262) Boolean Algebra and Logic Equations. Spring 2011

Introduction to Microprocessors and Digital (ME262) lgebra and Spring 2 Outline. lgebra 2. 3. Karnaugh Maps () 4. Two-variable 5. 6. 7. 2 lgebra s of Simplifying equations are defined in terms of inary

### CprE 281: Digital Logic

CprE 28: Digital Logic Instructor: Alexander Stoytchev http://www.ece.iastate.edu/~alexs/classes/ Minimization CprE 28: Digital Logic Iowa State University, Ames, IA Copyright Alexander Stoytchev Administrative