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

Slides:



Advertisements
Similar presentations
Boolean Algebra and Combinational Logic
Advertisements

1 Homework Reading –Tokheim, Section 5-10, 7-4 Machine Projects –Continue on MP4 Labs –Continue labs with your assigned section.
ENGIN112 L8: Minimization with Karnaugh Maps September 19, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 8 Minimization with Karnaugh.
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 6 Dr. Shi Dept. of Electrical and Computer Engineering.
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
Give qualifications of instructors: DAP
CS 151 Digital Systems Design Lecture 13 Combinational Design Procedure.

ECE 331 – Digital System Design Logic Circuit Design (Lecture #7)
Computer Engineering (Logic Circuits) (Karnaugh Map)
COE 202: Digital Logic Design Combinational Circuits Part 1
Chapter 3 Combinational Logic Design
ENGIN112 L12: Circuit Analysis Procedure September 29, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 12 Circuit Analysis Procedure.
Combinational Logic Design
Lecture 13 Problems (Mano)
IKI a-Simplification of Boolean Functions Bobby Nazief Semester-I The materials on these slides are adopted from those in CS231’s Lecture.
Computer Programming Skills Revision Prepared by: Ghader Kurdi.
Overview Part 2 – Circuit Optimization 2-4 Two-Level Optimization
Boolean Algebra and Logic Simplification
Digital Logic and Design Vishal Jethva Lecture No. 10 svbitec.wordpress.com.
Digital Logic Lecture 08 By Amr Al-Awamry. Combinational Logic 1 A combinational circuit consists of an interconnection of logic gates. Combinational.
Logic Function Optimization. Combinational Logic Circuit Regular SOP and POS designs Do not care expressions Digital logic circuit applications Karnaugh.
Overview of Chapter 4 °Design digital circuit from specification °Digital inputs and outputs known Need to determine logic that can transform data °Start.
KARNAUGH MAP – Digital Circuit 1 Choopan Rattanapoka.
Boolean Algebra and Digital Circuits
Department of Computer Engineering
1 Digital Logic Design Week 5 Simplifying logic expressions.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. Circuit Optimization Logic and Computer Design Fundamentals.
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.
Computer Engineering (Logic Circuits) (Karnaugh Map)
Abdullah Said Alkalbani University of Buraimi
Lecture 11 Combinational Design Procedure
Karnaugh Mapping Digital Electronics. Karnaugh Mapping or K-Mapping This presentation will demonstrate how to Create and label two, three, & four variable.
1 Digital Logic Design Week 5&6 cont’d Revision for Quiz 2/Exam.
1 Lecture 12 More about Combinational Analysis and Design Procedures.
1 Chapter 4 Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables,
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’
Chapter 3 Special Section Focus on Karnaugh Maps.
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.
Digital Logic & Design Vishal Jethava Lecture 11 svbitec.wordpress.com.
Designing Combinational Logic Circuits
Boolean Expressions Lecture 3 Digital Design and Computer Architecture Harris & Harris Morgan Kaufmann / Elsevier, 2007.
Karnaugh Maps (K-Maps)
Prof. Hsien-Hsin Sean Lee
ECEN 248: INTRODUCTION TO DIGITAL SYSTEMS DESIGN Lecture 4 Dr. Shi Dept. of Electrical and Computer Engineering.
1 Gate Level Minimization EE 208 – Logic Design Chapter 3 Sohaib Majzoub.
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).
ECE 301 – Digital Electronics Logic Circuit Design (Lecture #9)
ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.
Digital Logic & Design Dr. Waseem Ikram Lecture 11.
Mu.com.lec 9. Overview Gates, latches, memories and other logic components are used to design computer systems and their subsystems Good understanding.
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
Computer Organization Computer Organization Review: Combinational circuits Week 1 Lecture Notes Adapted by Dr. Adel Ammar.
CHAPTER 3 Simplification of Boolean Functions
Combinational Logic Design&Analysis.
Dr. Clincy Professor of CS
Optimized Implementation of Logic Function
Digital Logic and Design
Karnaugh Maps (K-Maps)
Homework Reading Tokheim, Section 5-10, 7-4.
Dr. Clincy Professor of CS
Optimized Implementation of Logic Function
Dr. Clincy Professor of CS
CS Chapter 3 (3A and ) – Part 3 of 5
Dr. Clincy Professor of CS
Overview Part 2 – Circuit Optimization
3-Variable K-map AB/C AB/C A’B’ A’B AB AB’
Presentation transcript:

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

ENGIN112 L13: Combinational Design Procedure October 1, 2003 Overview °Design digital circuit from specification °Digital inputs and outputs known Need to determine logic that can transform data °Start in truth table form °Create K-map for each output based on function of inputs °Determine minimized sum-of-product representation °Draw circuit diagram

ENGIN112 L13: Combinational Design Procedure October 1, 2003 Design Procedure (Mano) Design a circuit from a specification. 1.Determine number of required inputs and outputs. 2.Derive truth table 3.Obtain simplified Boolean functions 4.Draw logic diagram and verify correctness A A B B C C R R S S S = A + B + C R = ABC

ENGIN112 L13: Combinational Design Procedure October 1, 2003 Previously, we have learned… °Boolean algebra can be used to simplify expressions, but not obvious: how to proceed at each step, or if solution reached is minimal. °Have seen five ways to represent a function: Boolean expression truth table logic circuit minterms/maxterms Karnaugh map

ENGIN112 L13: Combinational Design Procedure October 1, 2003 Combinational logic design °Use multiple representations of logic functions °Use graphical representation to assist in simplification of function. °Use concept of “don’t care” conditions. °Example - encoding BCD to seven segment display. °Similar to approach used by designers in the field.

ENGIN112 L13: Combinational Design Procedure October 1, 2003 BCD to Seven Segment Display °Used to display binary coded decimal (BCD) numbers using seven illuminated segments. °BCD uses 0’s and 1’s to represent decimal digits Need four bits to represent required 10 digits. °Binary coded decimal (BCD) represents each decimal digit with four bits a b c g e d f

ENGIN112 L13: Combinational Design Procedure October 1, 2003 BCD to seven segment display 0a,b,c,d,e,f 1b,c 2a,b,d,e,g 3a,b,c,d,g 4b,c,f,g 5a,c,d,f,g 6a,c,d,e,f,g 7a,b,c 8a,b,c,d,e,f,g 9a,b,c,d,f,g a b c g e d f °List the segments that should be illuminated for each digit.

ENGIN112 L13: Combinational Design Procedure October 1, 2003 BCD to seven segment display edcbazyxwDec  °Derive the truth table for the circuit. °Each output column in one circuit. InputsOutputs

ENGIN112 L13: Combinational Design Procedure October 1, 2003 BCD to seven segment display yz wx For segment “a” : Note: Have only filled in ten squares, corresponding to the ten numerical digits we wish to represent. °Find minimal sum-of-products representation for each output

ENGIN112 L13: Combinational Design Procedure October 1, 2003 Don’t care conditions (BCD display) XX XXXX yz wx For segment “a” : Put in “X” (don’t care), and interpret as either 1 or 0 as desired …. °Fill in don’t cares for undefined outputs. Note that these combinations of inputs should never happen. °Leads to a reduced implementation

ENGIN112 L13: Combinational Design Procedure October 1, 2003 Don’t care conditions (BCD display)... For segment “a” : XX XXXX yz wx °Circle biggest group of 1’s and Don’t Cares. °Leads to a reduced implementation

ENGIN112 L13: Combinational Design Procedure October 1, 2003 Don’t care conditions (BCD display) For segment “a” : XX XXXX yz wx °Circle biggest group of 1’s and Don’t Cares. °Leads to a reduced implementation

ENGIN112 L13: Combinational Design Procedure October 1, 2003 Don’t care conditions (BCD display)... For segment “a” : XX XXXX yz wx XX XXXX yz wx °Circle biggest group of 1’s and Don’t Cares. °All 1’s should be covered by at least one implicant

ENGIN112 L13: Combinational Design Procedure October 1, 2003 Don’t care conditions (BCD display)... For segment “a” : XX XXXX yz wx ° Put all the terms together °Generate the circuit

ENGIN112 L13: Combinational Design Procedure October 1, 2003

ENGIN112 L13: Combinational Design Procedure October 1, 2003 BCD to seven segment display edcbazyxwDec  °Derive the truth table for the circuit. °Each output column in one circuit. InputsOutputs

ENGIN112 L13: Combinational Design Procedure October 1, 2003 BCD to seven segment display yz wx For segment “b” : See if you complete this example. °Find minimal sum-of-products representation for each output

ENGIN112 L13: Combinational Design Procedure October 1, 2003 Summary °Need to formulate circuits from problem descriptions 1.Determine number of inputs and outputs 2.Determine truth table format 3.Determine K-map 4.Determine minimal SOP oThere may be multiple outputs per design oSolve each output separately oCurrent approach doesn’t have memory. oThis will be covered next week.