Karnaugh Maps (K-Maps)

Slides:

Advertisements

Similar presentations

Digital Circuits.

Advertisements

Prof. Sin-Min Lee Department of Computer Science

1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.

Gate-level Minimization

ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.

1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.

08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:

Chapter 3 Boolean Algebra and Logic Gate (Part 2).

Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.

Design Of Combinational Logic Circuits

Computer Programming Skills Revision Prepared by: Ghader Kurdi.

ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives

Overview Part 2 – Circuit Optimization 2-4 Two-Level Optimization

Boolean Algebra and Logic Simplification

Logic gates & Boolean Algebra. Introduction Certain components (called logic elements) of the computer combine electric pulses using a set of rules. Electric.

Chapter 3.5 Logic Circuits. How does Boolean algebra relate to computer circuits? Data is stored and manipulated in a computer as a binary number. Individual.

1 Chapter 5 Karnaugh Maps Mei Yang ECG Logic Design 1.

1 Digital Logic Design Week 5 Simplifying logic expressions.

Digital Electronics Lecture 4 Simplification using Boolean Algebra, Combinational Logic Circuit Design.

Digital Circuits. Review – Getting the truth table The first step in designing a digital circuit usually is to get the truth table. That is, for every.

Module 9.  Digital logic circuits can be categorized based on the nature of their inputs either: Combinational logic circuit It consists of logic gates.

ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.

Circuit Minimization. It is often uneconomical to realize a logic directly from the first logic expression that pops into your head. Canonical sum and.

PRASAD A. PAWASKAR SPN. NO DETE 2 SEMESTER lec1-11.

1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.

CS151 Introduction to Digital Design Chapter Map Simplification.

1 Homework Reading –Tokheim, Section 5-1, 5-2, 5-3, 5-7, 5-8 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.

Designing Combinational Logic Circuits

DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan mohd nor

Karnaugh Maps (K-Maps)

Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.

1 3- De-Morgan’s Theorems 1.The complement of a product of variables is equal to the sum of the complements of the variables. 2. The complement of a sum.

ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.

Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 

Lecture 1 Gunjeet kaur Dronacharya group of institutions.

CHAPTER 3 Simplification of Boolean Functions

Homework Reading Machine Projects Labs

Minimization of Circuits

CHAPTER 1 : INTRODUCTION

Combinational Circuit Design

Boolean Expressions Lecture No. 10.

Computer Architecture CST 250

Jeremy R. Johnson Wed. Sept. 29, 1999

Circuits & Boolean Expressions

Jeremy R. Johnson Anatole D. Ruslanov William M. Mongan

Karnaugh Maps References:

Karnaugh Maps References: Lecture 4 from last semester

Instructor: Alexander Stoytchev

Digital Circuits.

BASIC & COMBINATIONAL LOGIC CIRCUIT

Combinational Logic Design Process

Instructor: Alexander Stoytchev

SYEN 3330 Digital Systems Chapter 2 – Part 4 SYEN 3330 Digital Systems.

ECE 331 – Digital System Design

Reading: Hambley Ch. 7 through 7.5

Boolean Algebra.

BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)

ECB2212-Digital Electronics K-Map

Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y

Chapter 10.3 and 10.4: Combinatorial Circuits

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

Analysis of Logic Circuits Example 1

Digital Logic Design Basics Combinational Circuits Sequential Circuits.

Principles & Applications

Laws & Rules of Boolean Algebra

Digital Circuits.

Circuits & Boolean Expressions

Digital Circuits.

Presentation transcript:

Karnaugh Maps (K-Maps) A visual way to simplify logic expressions It gives the most simplified form of the expression

Rules to obtain the most simplified expression Simplification of logic expression using Boolean algebra is awkward because: it lacks specific rules to predict the most suitable next step in the simplification process it is difficult to determine whether the simplest form has been achieved. A Karnaugh map is a graphical method used to obtained the most simplified form of an expression in a standard form (Sum-of-Products or Product-of-Sums). The simplest form of an expression is the one that has the minimum number of terms with the least number of literals (variables) in each term. By simplifying an expression to the one that uses the minimum number of terms, we ensure that the function will be implemented with the minimum number of gates. By simplifying an expression to the one that uses the least number of literals for each terms, we ensure that the function will be implemented with gates that have the minimum number of inputs.

Three-Variable K-Maps

Three-Variable K-Map Examples

Four-Variable K-Maps

Four-Variable K-Maps

Four-Variable K-Maps Examples

Four-Variable K-Maps Examples

Four-Variable K-Maps Examples

Design of combinational digital circuits Steps to design a combinational digital circuit: From the problem statement derive the truth table From the truth table derive the unsimplified logic expression Simplify the logic expression From the simplified expression draw the logic circuit Example: Design a 3-input (A,B,C) digital circuit that will give at its output (X) a logic 1 only if the binary number formed at the input has more ones than zeros.

Design of combinational digital circuits (Cont.) Example: Design a 4-input (A,B,C,D) digital circuit that will give at its output (X) a logic 1 only if the binary number formed at the input is between 2 and 9 (including).

Design of combinational digital circuits (Example) Example: Design a 4-input (A,B,C,D) digital circuit that will give at its output (X) a logic 1 only if there more ones than zeros in the binary number formed at the input.