Abdullah Said Alkalbani University of Buraimi

Slides:



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

CS 151 Digital Systems Design Lecture 21 Analyzing Sequential Circuits.
ECE 301 – Digital Electronics Minterm and Maxterm Expansions and Incompletely Specified Functions (Lecture #6) The slides included herein were taken from.
ECE 331 – Digital System Design
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
Lecture 14 Today we will Learn how to implement mathematical logical functions using logic gate circuitry, using Sum-of-products formulation NAND-NAND.
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.
CS 151 Digital Systems Design Lecture 8 Minimization with Karnaugh Maps.
ENGIN112 L12: Circuit Analysis Procedure September 29, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 12 Circuit Analysis Procedure.
AOI Logic Implementation © 2014 Project Lead The Way, Inc.Digital Electronics.
Lecture 13 Problems (Mano)
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
Boolean Algebra and Logic Simplification. Boolean Addition & Multiplication Boolean Addition performed by OR gate Sum Term describes Boolean Addition.
Digital Logic Design Adil Waheed. BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION AND gate F = A.B OR gate F = A + B NOT gate F = A NAND gate F = A.B NOR gate.
Digital Logic Lecture 08 By Amr Al-Awamry. Combinational Logic 1 A combinational circuit consists of an interconnection of logic gates. Combinational.
Overview of Chapter 3 °K-maps: an alternate approach to representing Boolean functions °K-map representation can be used to minimize Boolean functions.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Lecture 12 – Design Procedure.
Based on slides by: Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 9 – Multilevel Optimization.
9/15/09 - L7 Two Level Circuit Optimization Copyright Joanne DeGroat, ECE, OSU1 Two Level Circuit Optimiztion An easier way to generate a minimal.
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.
Digital Electronics Lecture 6 Combinational Logic Circuit Design.
Combination of logic gates  Logic gates can be combined to produce more complex functions.  They can also be combined to substitute one type of gate.
CH51 Chapter 5 Combinational Logic By Taweesak Reungpeerakul.
Lecture 11 Combinational Design Procedure
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
Basic Gates 2.1 Basic Digital Logic: Application of Digital Gates using AND / OR / NOT ©Paul Godin Created August 2007 Last Update Sept 2013 Basic Gates.
CEC 220 Digital Circuit Design Boolean Algebra I Wed, Sept 2 CEC 220 Digital Circuit Design Slide 1 of 13.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
1 Lecture 12 More about Combinational Analysis and Design Procedures.
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.
Designing Combinational Logic Circuits
Karnaugh Maps (K-Maps)
Combinational Circuits
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
THE K-MAP.
Karnaugh Maps Not in textbook. Karnaugh Maps K-maps provide a simple approach to reducing Boolean expressions from a input-output table. The output from.
Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.
CEC 220 Digital Circuit Design SOP and POS forms Friday, January 23 CEC 220 Digital Circuit Design Slide 1 of 17.
Unit II Fundamentals of Logic Design By Roth and Kinney.
Figure 5–5 Exclusive-OR logic diagram and symbols. Open file F05-05 to verify the operation. Thomas L. Floyd Digital Fundamentals, 9e Copyright ©2006 by.
Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.
CEC 220 Digital Circuit Design SOP and POS forms Friday, Sept 11 CEC 220 Digital Circuit Design Slide 1 of 17.
Circuits, Truth Tables & Boolean Algebra. Expressions Can describe circuits in terms of Boolean expression.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Digital Logic Design. Truth Table  Logic Circuit 1. Start with truth table 2. When your output is a 1, figure out the combination of inputs, ANDs, and.
Combinational Design, Part 2: Procedure. 2 Topics Positive vs. negative logic Design procedure.
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
Digital Systems Design 1 Signal Expressions Multiply out: F = ((X + Y)  Z) + (X  Y  Z) = (X  Z) + (Y  Z) + (X  Y  Z)
CS151 Introduction to Digital Design Chapter 3: Combinational Logic Design 3-4 Verification 1Created by: Ms.Amany AlSaleh.
Logic Gates and Boolean Algebra
ECE 2110: Introduction to Digital Systems
Logic Gates.
CHAPTER 1 : INTRODUCTION
Combinational Logic Logic circuits for digital systems may be combinational or sequential. A combinational circuit consists of input variables, logic gates,
Boolean Expressions Lecture No. 10.
Computer Architecture CST 250
Karnaugh Maps (K-Maps)
AOI Design: Logic Analysis
Logic Gates.
BOOLEAN ALGEBRA AND LOGIC SIMPLIFICATION Part (a)
AOI Design: Logic Analysis
AOI Design: Logic Analysis
Laws & Rules of Boolean Algebra
Circuit Analysis Procedure by Dr. M
Presentation transcript:

Abdullah Said Alkalbani alklbany@hotmail.com University of Buraimi ECEN2102 Digital Logic Design Lecture 5 Combinational logic circuit Analysis & Design (part1) Circuit Analysis Procedure Abdullah Said Alkalbani alklbany@hotmail.com University of Buraimi

Important concept – analyze digital circuits Overview Important concept – analyze digital circuits Given a circuit Create a truth table Create a minimized circuit Approaches Boolean expression approach Truth table approach Leads to minimized hardware Provides insights on how to design hardware Tie in with K-maps (next time) credential: bring a computer die photo wafer : This can be an hidden slide. I just want to use this to do my own planning. I have rearranged Culler’s lecture slides slightly and add more slides. This covers everything he covers in his first lecture (and more) but may We will save the fun part, “ Levels of Organization,” at the end (so student can stay awake): I will show the internal stricture of the SS10/20. Notes to Patterson: You may want to edit the slides in your section or add extra slides to taylor your needs.

The Problem How can we convert from a circuit drawing to an equation or truth table? Two approaches Create intermediate equations Create intermediate truth tables A B C C’ Out

Label Gate Outputs Label all gate outputs that are a function of input variables. Label gates that are a function of input variables and previously labeled gates. Repeat process until all outputs are labelled. A B C C’ Out R S T

Approach 1: Create Intermediate Equations Step 1: Create an equation for each gate output based on its input. R = ABC S = A + B T = C’S Out = R + T A B C C’ Out R S T

Approach 1: Substitute in subexpressions Step 2: Form a relationship based on input variables (A, B, C) R = ABC S = A + B T = C’S = C’(A + B) Out = R+T = ABC + C’(A+B) A B C C’ Out R S T

Approach 1: Substitute in subexpressions Step 3: Expand equation to SOP final result Out = ABC + C’(A+B) = ABC + AC’ + BC’ A B C Out A C’ B C’

Approach 2: Truth Table Step 1: Determine outputs for functions of input variables. A 1 B C R S A B C C’ Out R S T

Approach 2: Truth Table Step 2: Determine outputs for functions of intermediate variables. A 1 B 1 C 1 R 1 S T C’ T = S * C’ A B C C’ Out R S T

Approach 2: Truth Table Step 3: Determine outputs for function. A 1 B 1 B C R S T Out R + T = Out A B C C’ Out R S T

More Difficult Example Step 3: Note labels on interior nodes

More Difficult Example: Truth Table Remember to determine intermediate variables starting from the inputs. When all inputs determined for a gate, determine output. The truth table can be reduced using K-maps. A 1 B 1 C 1 F2 1 F’2 1 T1 1 T2 1 T3 1 F1 1

Two approaches illustrated Summary Important to be able to convert circuits into truth table and equation form WHY? ---- leads to minimized sum of product representation Two approaches illustrated Approach 1: Create an equation with circuit output dependent on circuit inputs Approach 2: Create a truth table which shows relationship between circuit inputs and circuit outputs Both results can then be minimized using K-maps. Next time: develop a minimized SOP representation from a high level description credential: bring a computer die photo wafer : This can be an hidden slide. I just want to use this to do my own planning. I have rearranged Culler’s lecture slides slightly and add more slides. This covers everything he covers in his first lecture (and more) but may We will save the fun part, “ Levels of Organization,” at the end (so student can stay awake): I will show the internal stricture of the SS10/20. Notes to Patterson: You may want to edit the slides in your section or add extra slides to taylor your needs.