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

Slides:

Advertisements

Similar presentations

Digital Logic & Design Vishal Jethva Lecture 13 SVBITEC.WORDPRESS.COM.

Advertisements

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

ECE 301 – Digital Electronics Karnaugh Maps (Lecture #7) The slides included herein were taken from the materials accompanying Fundamentals of Logic Design,

CS 140 Lecture 2 Combinational Logic CK Cheng 4/04/02.

Combinational Logic Discussion D2.5. Combinational Logic Combinational Logic inputsoutputs Outputs depend only on the current inputs.

Give qualifications of instructors: DAP

ENGIN112 L13: Combinational Design Procedure October 1, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 13 Combinational Design Procedure.

CS 151 Digital Systems Design Lecture 13 Combinational Design Procedure.

ECE 331 – Digital System Design Karnaugh Maps and Determining a Minimal Cover (Lecture #7) The slides included herein were taken from the materials accompanying.

Chapter 3 Combinational Logic Design

AOI Logic Implementation © 2014 Project Lead The Way, Inc.Digital Electronics.

Computer Programming Skills Revision Prepared by: Ghader Kurdi.

AOI Logic Implementation

Lecture No. 14 Combinational Functional Devices svbitec.wordpress.com.

Boolean Algebra and Logic Simplification

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

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

ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices Decoders.

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

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

K-map Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.

Chapter 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.

Ch. 4 Boolean Algebra and Logic Simplification

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.

AOI Logic Implementation

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.

ECE 2110: Introduction to Digital Systems PoS minimization Don’t care conditions.

ECE 3110: Introduction to Digital Systems Symplifying Products of sums using Karnaugh Maps.

Figure 4–1 Application of commutative law of addition. Thomas L. Floyd Digital Fundamentals, 9e Copyright ©2006 by Pearson Education, Inc. Upper Saddle.

Lecture 11 Combinational Design Procedure

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

ECE 3110: Introduction to Digital Systems Chapter #4 Review.

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.

ECE 320 Homework #3 1. Simplify the Boolean function F using the don’t care conditions d, in both S.O.P. and P.O.S. form: a) F=A’B’D’+A’CD+A’BC d=A’BC’D+ACD+AB’D’

1 CS 151: Digital Design Chapter 3: Combinational Logic Design 3-1Design Procedure CS 151: Digital Design.

CS151 Introduction to Digital Design Chapter 3: Combinational Logic Design 3-1 Design Procedure 1Created by: Ms.Amany AlSaleh.

Karnaugh Maps (K-Maps)

Prof. Hsien-Hsin Sean Lee

BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION

CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC

CEC 220 Digital Circuit Design

 Seattle Pacific University EE Logic System DesignKMaps-1 Two-Level Simplification All Boolean expressions can be represented in two- level forms.

Logic Simplification-Using K-Maps

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).

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

K-map Dr. Bernard Chen Ph.D. University of Central Arkansas Spring 2009.

CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.

ECE DIGITAL LOGIC LECTURE 8: BOOLEAN FUNCTIONS Assistant Prof. Fareena Saqib Florida Institute of Technology Spring 2016, 02/11/2016.

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,

CEC 220 Digital Circuit Design Minterms and Maxterms Monday, January 26 CEC 220 Digital Circuit Design Slide 1 of 11.

ECE DIGITAL LOGIC LECTURE 11: STANDARD CIRCUITS Assistant Prof. Fareena Saqib Florida Institute of Technology Fall 2015, 09/24/2015.

Chapter 3 Simplification of Switching Functions. Simplification Goals Goal -- minimize the cost of realizing a switching function Cost measures and other.

ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.

Digital Logic & Design Dr. Waseem Ikram Lecture 11.

1 EENG 2710 Chapter 3 Simplification of Switching Functions.

CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC:K-Map. K-Map (1)  Karnaugh Map provides a systematic method for simplifying Boolean expressions and may produce.

Lecture No. 14 Combinational Functional Devices. Digital Logic &Design Dr. Waseem Ikram Lecture 14.

Digital Logic & Design Dr. Waseem Ikram Lecture 09.

CHAPTER 1 : INTRODUCTION

Digital Logic and Design

Karnaugh Maps (K-Maps)

Digital Logic & Design Dr. Waseem Ikram Lecture 12.

Digital Logic & Design Dr. Waseem Ikram Lecture 13.

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

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

Laws & Rules of Boolean Algebra

Presentation transcript:

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

Recap Karnaugh Maps Mapping Standard SOP expressions Mapping Non-Standard SOP expressions Simplification of K-maps Don’t care states svbitec.wordpress.com

Mapping a Standard POS expression Selecting n-variable K-map 0 marked in cell for each maxterm Remaining cells marked with 1 svbitec.wordpress.com

Mapping of Standard POS expression POS expression AB\C A\BC svbitec.wordpress.com

Simplification of POS expressions using K-map Mapping of expression Forming of Groups of 0s Each group represents sum term 3-variable K-map 1 cell group yields a 3 variable sum term 2 cell group yields a 2 variable sum term 4 cell group yields a 1 variable sum term 8 cell group yields a value of 0 for function svbitec.wordpress.com

Simplification of POS expressions using K-map3 4-variable K-map 1 cell group yields a 4 variable sum term 2 cell group yields a 3 variable sum term 4 cell group yields a 2 variable sum term 8 cell group yields a 1 variable sum term 16 cell group yields a value of 0 for function svbitec.wordpress.com

Simplification of POS expressions using K-map AB\C A\BC svbitec.wordpress.com

Simplification of POS expressions using K-map AB\C A\BC svbitec.wordpress.com

Simplification of POS expressions using K-map AB\CD svbitec.wordpress.com

Simplification of POS expressions using K-map AB\CD svbitec.wordpress.com

Simplification of POS expressions using K-map AB\CD svbitec.wordpress.com

Conversion between SOP & POS using K-map Groups of 1s represents SOP expression Groups of 0s represents POS expression svbitec.wordpress.com

Conversion between SOP & POS using K-map AB\CD svbitec.wordpress.com

5-Variable K-map Represented as two, 4 variable K-map svbitec.wordpress.com

5-Varaible K-map BC\DE svbitec.wordpress.com

5-Varaible K-map BC\DE svbitec.wordpress.com

Simplification of a 5-Variable K-map 5 variable K-map mapping 5 variable K-map grouping 5 variable K-map simplification svbitec.wordpress.com

5-Varaible K-map simplification BC\DE svbitec.wordpress.com

5-Varaible K-map simplification BC\DE svbitec.wordpress.com

Functions having multiple outputs Ckt receives a BCD number input Displays decimal number 0 to 9 on a single digit 7-segment display Ckt receives two 2-bit numbers A and B Sets one of three outputs to >, =, or < svbitec.wordpress.com

7-Segment Display svbitec.wordpress.com

InputsOutput ABCDa InputsOutput ABCDa X 1011X 1100X 1101X 1110X 1111X Function Table for Segment ‘a’ svbitec.wordpress.com

InputsOutput ABCDb InputsOutput ABCDb X 1011X 1100X 1101X 1110X 1111X Function Table for Segment ‘b’ svbitec.wordpress.com

InputsOutput ABCDc InputsOutput ABCDc X 1011X 1100X 1101X 1110X 1111X Function Table for Segment ‘c’ svbitec.wordpress.com

InputsOutput ABCDd InputsOutput ABCDd X 1011X 1100X 1101X 1110X 1111X Function Table for Segment ‘d’ svbitec.wordpress.com

InputsOutput ABCDe InputsOutput ABCDe X 1011X 1100X 1101X 1110X 1111X Function Table for Segment ‘e’ svbitec.wordpress.com

InputsOutput ABCDf InputsOutput ABCDf X 1011X 1100X 1101X 1110X 1111X Function Table for Segment ‘f’ svbitec.wordpress.com

InputsOutput ABCDg InputsOutput ABCDg X 1011X 1100X 1101X 1110X 1111X Function Table for Segment ‘g’ svbitec.wordpress.com

Karnaugh Map for Segment ‘a’ AB\CD xxxx 1011xx svbitec.wordpress.com

Karnaugh Map for Segment ‘b’ AB\CD xxxx 1011xx svbitec.wordpress.com

Karnaugh Map for Segment ‘c’ AB\CD xxxx 1011xx svbitec.wordpress.com

Karnaugh Map for Segment ‘d’ AB\CD xxxx 1011xx svbitec.wordpress.com

Karnaugh Map for Segment ‘e’ AB\CD xxxx 1010xx svbitec.wordpress.com

Karnaugh Map for Segment ‘f’ AB\CD xxxx 1011xx svbitec.wordpress.com

Karnaugh Map for Segment ‘g’ AB\CD xxxx 1011xx svbitec.wordpress.com

7-Segment Circuit svbitec.wordpress.com