Lecture 4 More Examples of Karnaugh Map. Logic Reduction Using Karnaugh Map Create an Equivalent Karnaugh Map Each circle must be around a power of two.

Slides:



Advertisements
Similar presentations
Techniques for Combinational Logic Optimization
Advertisements

Gate-Level Minimization
Lecture 3 Karnaugh Map Chapter 2 Jack Ou, Ph.D.. Home Alarm Logic.
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.
1 CS 140 Lecture 3 Combinational Logic Professor CK Cheng CSE Dept. UC San Diego.
CSE-221 Digital Logic Design (DLD)
CS 151 Digital Systems Design Lecture 8 Minimization with Karnaugh Maps.

Lecture 6 Karnaugh Map. Logic Reduction Using Karnaugh Map Create a Karnaugh Map Circle (2, 4, 8..) 1’s. OR the minterm generated by each loop.
Digital Design Lecture 10 Sequential Design. State Reduction Equivalent Circuits –Identical input sequence –Identical output sequence Equivalent States.
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.
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.
Eng. Mohammed Timraz Electronics & Communication Engineer University of Palestine Faculty of Engineering and Urban planning Software Engineering Department.
Discrete Mathematics CS 2610 February 19, Logic Gates: the basic elements of circuits Electronic circuits consist of so-called gates connected.
ENEE244-02xx Digital Logic Design Lecture 12. Announcements HW4 due today HW5 is up on course webpage. Due on 10/16. Recitation quiz on Monday, 10/13.
Minimisation ENEL111. Minimisation Last Lecture  Sum of products  Boolean algebra This Lecture  Karnaugh maps  Some more examples of algebra and truth.
+ CS 325: CS Hardware and Software Organization and Architecture Gates and Boolean Algebra Part 3.
Karnaugh Mapping Digital Electronics. Karnaugh Mapping or K-Mapping This presentation will demonstrate how to Create and label two, three, & four variable.
Karnaugh Maps (K maps). What are Karnaugh 1 maps?  Karnaugh maps provide an alternative way of simplifying logic circuits.  Instead of using Boolean.
Digital Logic & Design Vishal Jethava Lecture 11 svbitec.wordpress.com.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
THE K-MAP.
The Circle. Examples (1) – (5) Determine the center and radius of the circle having the given equation. Identify four points of the circle.
Module 11.  In Module 9, we have been introduced to the concept of combinational logic circuits through the examples of binary adders.  Meanwhile, in.
EE2420 – Digital Logic Summer II 2013 Hassan Salamy Ingram School of Engineering Texas State University Set 5: Karnaugh Maps.
Karnaugh Map (K-Map) By Dr. M. Khamis Mrs. Dua’a Al Sinari.
1 Karnaugh Map Method Truth Table -TO- K-Map Y0101Y0101 Z1011Z1011 X0011X0011 minterm 0  minterm 1  minterm 2  minterm 3 
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.
Karnaugh Maps (K maps).
Chapter 4 OPTIMIZED IMPLEMENTATION OF LOGIC FUNCTIONS.
Digital Design Module 2 Decoder Amit Kumar AP SCSE, GU Greater Noida.
CEC 220 Digital Circuit Design Implicants Wed, Sept. 23 CEC 220 Digital Circuit Design Slide 1 of 10.
Solving equations with variable on both sides Part 1.
Review: Algebra. Write numeric expressions:  Numeric expressions are expressions written out as phrases  Example:  Written as: The difference.
Lecture 21: Combinatorial Circuits II Discrete Mathematical Structures: Theory and Applications.
Digital Logic & Design Dr. Waseem Ikram Lecture 11.
4-5 Inequalities (pages ) P6  Represent inequalities on a number line or a coordinate plane.
SLIDES FOR CHAPTER 7 MULTI-LEVEL GATE CIRCUITS NAND AND NOR GATES
MULTI-LEVEL GATE CIRCUITS / NAND AND NOR GATES
NAND as a complete system and Karnaugh Maps
Minimization of Circuits
Minimization of Circuits
Lecture #6 EGR 277 – Digital Logic
Karnaugh Map Method.
Hire Toyota Innova in Delhi for Outstation Tour
BACK SOLUTION:
ECE 331 – Digital System Design
Digital Logic and Design
Karnaugh Maps (K-Maps)
Paging Lecture November 2018.
Simplify Expressions 34 A number divided by 3 is 7. n ÷ 3 = 7.
Karnaugh Mapping Karnaugh Mapping Digital Electronics
Digital Logic & Design Dr. Waseem Ikram Lecture No. 31.
Karnaugh Mapping Digital Electronics
Section 5.1 Solving inequalities
ECE 331 – Digital System Design
ECE 331 – Digital System Design
Karnaugh Mapping Karnaugh Mapping Digital Electronics
The numbers 3,6,and 9 have been placed to guide you.
Karnaugh Mapping Digital Electronics
Karnaugh map Karnaugh map allows viewing the function in a picture form Map is arranged such that two neighbors differ in only one variable It is easy.
13 Digital Logic Circuits.
Lecture No. 32 Sequential Logic.
Chapter 10.3 and 10.4: Combinatorial Circuits
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Karnaugh Maps (K maps).
Recapitulation of Lecture 11
Presentation transcript:

Lecture 4 More Examples of Karnaugh Map

Logic Reduction Using Karnaugh Map Create an Equivalent Karnaugh Map Each circle must be around a power of two number of bits Form the OR sum of all the terms generated by each loop

Generate a Karnaugh Map

Karnaugh Map for 2-Variables

Karnaugh Map for 3-Variables

Karnaugh Map for 4-Variables

Looping Groups of Two Groups of Four Group of Eight

Looping Groups of Two

Looping Groups of Four

Looping Groups of Eight

Problem 1

Solution to Problem 1

Problem 2

Solution to Problem 2

Problem 3

Solution for Problem 4

Two Equally Solutions