D IGITAL L OGIC By: Safwan Mawlood Digital Principles and Logic Design, A.Saha &N.Manna K ARNAUGH M APS (K MAPS )

Slides:

Advertisements

Similar presentations

Abdullah Said Alkalbani University of Buraimi

Advertisements

Date of Birth Design Problem

Cs 121 Ch 4-2 Combinational Logic

Karnaugh Map Adjacent Squares

Digital Logic Design Gate-Level Minimization

Lesson Objectives Understand and produce simple logic diagrams using the operation NOT, AND and OR Produce a truth table from a given logic diagram.

Chapter3: Gate-Level Minimization Part 2

Karnaugh Map Adjacent Squares

Topics Adders Half Adder Full Adder Subtracter Half Subtracter

RS Flip Flops Benchmark Companies Inc PO Box Aurora CO

Boolean Logic ITI 1121 N. El Kadri. 2 What is a switching network? Switching Network X1X1 XmXm X2X2 Z1Z1 ZmZm Z2Z2 Combinatorial Network: A stateless.

ADDER, HALF ADDER & FULL ADDER

D IGITAL L OGIC Number Systems By: Safwan Mawlood Digital Principles and Logic Design, A.Saha &N.Manna.

Number Systems Digital Logic By: Safwan Mawlood

CS 121 Digital Logic Design

CS 121 Digital Logic Design

Karnaugh Maps ECEn/CS 224.

CS 121 Digital Logic Design

ENEE244-02xx Digital Logic Design Lecture 10. Announcements HW4 due 10/9 – Please omit last problem 4.6(a),(c) Quiz during recitation on Monday (10/13)

ELECTRONICS TECHNOLOGY Digital Devices I Karnaugh Maps

2 x /10/2015 Know Your Facts!. 8 x /10/2015 Know Your Facts!

Digital Logic Design Lecture 13. Announcements HW5 up on course webpage. Due on Tuesday, 10/21 in class. Upcoming: Exam on October 28. Will cover material.

Node Optimization. Simplification Represent each node in two level form Use espresso to minimize each node Several simplification procedures which vary.

FUNCTION OPTIMIZATION Switching Function Representations can be Classified in Terms of Levels Number of Levels, k, is Number of Unique Boolean (binary)

ENGIN112 L9: More Karnaugh Maps September 22, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 9 More Karnaugh Maps and Don’t Cares.

Cs 1110 Ch 4-1 Combinational Logic. ° Introduction Logic circuits for digital systems may be: °2°2 combinational sequential OR A combinational circuit.

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

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

Give qualifications of instructors: DAP

Design Of Combinational Logic Circuits

Chapter 3 Combinational Logic Design

Unit 8 Combinational Circuit Design and Simulation Using Gates Ku-Yaw Chang Assistant Professor, Department of Computer Science.

In a not gate, if the input is on(1) the output is off (0) and vice versa.

Digital Logic and Design Vishal Jethva Lecture No. 10 svbitec.wordpress.com.

Digital Logic & Design Vishal Jethava Lecture 12 svbitec.wordpress.com.

CSI-2111 Structure of Computers Ipage 4-1 1X Karnaugh Maps and Circuits v Objective: To know how to simplify switching functions by Karnaugh maps,

Logic Function Optimization. Combinational Logic Circuit Regular SOP and POS designs Do not care expressions Digital logic circuit applications Karnaugh.

طراحی مدارهای منطقی نیمسال دوم دانشگاه آزاد اسلامی واحد پرند.

D IGITAL L OGIC D ESIGN I G ATE -L EVEL M INIMIZATION.

1 SOP and POS Expressions from K-maps The examples so far have all generated minimal SOP expressions. POS expressions can be formed as follows: 1.Group.

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

1 Minterm and Maxterm Expressions Definition: a minterm of n variables is a product of the variables in which each appears exactly once in true or complemented.

Assignment 8 solutions 1) Design and draw combinational logic to perform multiplication of two 2-bit numbers (i.e. each 0 to 3) producing a 4-bit result.

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

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

Karnaugh Maps (K maps). What are Karnaugh 1 maps?  Karnaugh maps provide an alternative way of simplifying logic circuits.  Instead of using Boolean.

"Digital Systems"1 7-segment Numeric display b a d g e c f.

Prof. Hsien-Hsin Sean Lee

Digital Logic (Karnaugh Map). Karnaugh Maps Karnaugh maps (K-maps) are graphical representations of boolean functions. One map cell corresponds to a row.

Karnaugh Maps (K maps).

CEC 220 Digital Circuit Design More Karnaugh Maps Monday, February 02 CEC 220 Digital Circuit Design Slide 1 of 11.

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

School of Computer and Communication Engineering, UniMAP DKT 122/3 - DIGITAL SYSTEM I Chapter 4A:Boolean Algebra and Logic Simplification) Mohd ridzuan.

In some Boolean functions there are some input terms that will never occur, for example in BCD code there are sex invalid combinations 1010,1011,1100,

ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.

DeMorgan’s Theorem DeMorgan’s 2nd Theorem

Optimized Implementation of Logic Function

Digital Logic and Design

CHAPTER 5 KARNAUGH MAPS 5.1 Minimum Forms of Switching Functions

Homework Reading Tokheim, Section 5-10, 7-4.

Chapter 3 Gate-level Minimization.

Lecture 6 Karnaugh maps (K-maps) K-maps with “don’t cares”

Optimized Implementation of Logic Function

COE 202: Digital Logic Design Combinational Logic Part 3

3-Variable K-map AB/C AB/C A’B’ A’B AB AB’

Principles & Applications

Laws & Rules of Boolean Algebra

Digital Logic Design.

Presentation transcript:

D IGITAL L OGIC By: Safwan Mawlood Digital Principles and Logic Design, A.Saha &N.Manna K ARNAUGH M APS (K MAPS )

D ON ’ T C ARE In certain digital systems, some input combinations never occur during the process of a normal operation because those input conditions are guaranteed never to occur. Such input combinations are called Don’t- Care Combinations. The function output may be either 1 or 0 and these functions are called incompletely speciﬁes functions. These input combinations can be plotted on the Karnaugh map for further simpliﬁcation of the function. The don’tcare combinations are represented by d or x or F.

D ON ’ T CARE TERM X X1 XX XX AB CD AD

X11X X1 1 1 AB CD

E XERCISE 00X0 11X X00 AB CD C’D