Steering Gates, Timing Diagrams & Combinational Logic Technician Series Steering 1.1 ©Paul Godin Created Jan 2014.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

Digital Circuits.
1 Combinational Logic Design&Analysis. 2 Introduction We have learned all the prerequisite material: – Truth tables and Boolean expressions describe functions.
Chapter 3 Basic Logic Gates 1.
ECE 2373 Modern Digital System Design Exam 2. ECE 2372 Exam 2 Thursday March 5 You may use two 8 ½” x 11” pages of information, front and back, write.
Relationship Between Basic Operation of Boolean and Basic Logic Gate The basic construction of a logical circuit is gates Gate is an electronic circuit.
Chapter 4 Logic Gates and Boolean Algebra. Introduction Logic gates are the actual physical implementations of the logical operators. These gates form.
Gates CS105. Electrical Signals Transmission of data Any electrical signal has a level of voltage – Interpretation of 1s and 0s Generally speaking: –
ENGG 1203 Tutorial Combinational Logic (I) 1 Feb Learning Objectives
In this module you will learn: What the various logic gates do. How to represent logic gates on a circuit diagram. The truth tables for the logic gates.
Module 3.  Binary logic consists of :  logic variables  designated by alphabet letters, e.g. A, B, C… x, y, z, etc.  have ONLY 2 possible values:
Introduction to Computer Science David Goldschmidt, Ph.D. Computer Science The College of Saint Rose CIS September 6, 2007.
The NAND gate as a universal gate Logic function NAND gate only AA A B A.BA.B A B A+B A B A B A B A A A B A.BA.B B A A B A B A B.
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.
Basic Logic Operations and Standard Logic Gates (Lecture #1) ECE 331 – Digital System Design.
LOGIC GATES.
Week 6: Gates and Circuits: PART I READING: Chapter 4.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
ACOE1611 Combinational Logic Circuits Reference: M. Mano, C. Kime, “Logic and Computer Design Fundamentals”, Chapter 2.
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.
Basic Gates 3.1 Basic Digital Logic: NAND and NOR Gates ©Paul Godin Created September 2007 Last Update Sept 2009.
Abdullah Said Alkalbani University of Buraimi
Basic Digital Logic: NAND and NOR Gates Technician Series ©Paul Godin Last Update Dec 2014.
Boolean Logic 1 Technician Series Boolean 1.1 ©Paul Godin Created Jan 2015 gmail.com.
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.
Basic Gates 1.1 Basic Digital Logic: AND, OR and NOT gates ©Paul Godin Created August 2007 Last Update Sept 2013.
Designing Combinational Logic Circuits
Boolean 4.1 Boolean Logic 4 ©Paul Godin Created September 2007 gmail.com.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
Circuits & Boolean Expressions. A ABC BC ABC C B A Example # 1: Boolean Expression: Develop a Boolean expression from a circuit.
Basic Logic Operations and Standard Logic Gates [Lecture:1] Instructor: Sajib Roy Lecturer, ETE, ULAB ETE 204 – Digital Electronics.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC. De Morgan’s Theorem De Morgan’s Theorem.
DE MORGAN’S THEOREM. De Morgan’s Theorem De Morgan’s Theorem.
1 Ch.3 Logic Gates and Boolean Algebra – Part 1
Circuits, Truth Tables & Boolean Algebra. Expressions Can describe circuits in terms of Boolean expression.
ACOE161Digital Circuit Design1 Design Of Combinational Logic Circuits.
Programmable Logic Controller
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.
Hoda Roodaki Boolean Algebra Hoda Roodaki
CSIS-110 Introduction to Computer Science
Eng. Mai Z. Alyazji October, 2016
Logic Gates and Boolean Algebra
Chapter 3 Notes – Part II Review Questions
De Morgan’s Theorem,.
Questions Describe the following gates
Logic Gates and Boolean Algebra
Logic Gates.
Boolean Algebra.
Boolean Expressions Lecture No. 10.
Circuits & Boolean Expressions
Latches and Flip-Flops 2
Circuits, Truth Tables & Boolean Algebra
Waveforms & Timing Diagrams
Latch Practice Problems 1
Basic Digital Logic: X-OR and X-NOR Gates
Logic Gates.
Boolean Algebra.
Princess Sumaya University
Logic Gates.
Boolean Logic 2 ©Paul Godin Created September 2007 Last edit Sept 2009
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Basic Digital Logic: AND, OR and NOT gates Technician Series
Circuits, Truth Tables & Boolean Algebra
Latches and Flip-Flops 2
Combinational Logic Practice Problems gmail.com Jan 2015.
Logic Gates AIM: To know the different types of logic gate
Principles & Applications
Eng. Ahmed M Bader El-Din October, 2018
Laws & Rules of Boolean Algebra
Circuits & Boolean Expressions
Presentation transcript:

Steering Gates, Timing Diagrams & Combinational Logic Technician Series Steering 1.1 ©Paul Godin Created Jan 2014

Timing Diagrams Steering 1.2

Timing ◊Timing diagrams are the best means of comparing the input and output logic values of a digital circuit over time, such as would be found in a functioning circuit. ◊The output of digital circuit analysis tools such as oscilloscopes and logic analyzers essentially display timing diagrams. Steering 1.3

Timing Diagram sample: AND ABAB Y A The output Y is determined by looking at the input A and B states and comparing them to the truth table for the gate. Logic 0 B Y Logic 1 Steering 1.4

Timing Diagram sample: OR ABAB Z ABZABZ Steering 1.5

Complete the Timing Diagram: Exercise 1 ABAB Z ABZABZ Steering 1.6

Complete the Timing Diagram: Exercise 2 ABAB Z ABZABZ Steering 1.7

Steering or Control Gates Steering 1.8

Introduction ◊An application for a logic circuit is to control one digital signal with another digital signal. ◊The AND and the OR gates can function as signal Control, or Steering Gates. Steering 1.9

Steering Gates ◊Digital gates can be used to control the flow of one digital signal with another. 1 1 Control Output 1 0 Signal 1Control Signal Output Animated Steering 1.10

Steering Gates 0 1 Control Output 1 0 Signal 0Control Signal Output 0 0 Animated Steering 1.11

Exercise: Control Gates Worksheet (AND, OR) ControlSignalYStatus ControlSignalZZ’Status Control Signal Y Z Z’ Steering 1.12

Combinational Logic Steering 1.13

Combinational Logic ◊Combinational logic describes digital logic circuits that are based on arrays of logic gates. Combinational logic circuits have no retention of states. ◊Combinational logic circuits can be described with: ◊English Terms ◊Boolean equations ◊Truth Tables ◊Logic diagrams ◊Timing Diagrams Steering 1.14

Combinational Logic Example 1 The circuit below is a combinational logic circuit. A B C Y Steering 1.15

Combinational Logic Example 1 It can be described in English terms: A B C Y A AND B, OR C equals output Y A AND B Steering 1.16

Combinational Logic Example 1 It can be described using a Boolean equation: A B C Y (A ● B) + C = Y A ● B Steering 1.17

Combinational Logic Example 1 It can be described using a Truth Table: A B C Y ABCY (A ● B) + C = Y Only instances where the output of the AND gate = 1 If C is 1, Y is 1 Steering 1.18

Combinational Logic Example 1 It can be described using a Timing Diagram: A B C Y (A ● B) + C = Y A B C Y ABCY Steering 1.19

Combinational Logic Example 2 This is a combinational Logic equation: It can be described as “NOT A AND B AND C equals Y”. It can be drawn this way: A ● B ● C = Y A B C Y A Steering 1.20

Combinational Logic Example 2 The Truth Table and Timing diagram describes its function A ● B ● C = Y A B C Y A AA’BCY A B C Y Steering 1.21

Boolean from a Circuit Diagram ◊A step-by-step process is used to determine the Boolean equation from a circuit diagram. ◊Begin at the inputs and include the logic expressions while working toward the outputs. Steering 1.22

Example 1: Circuit to Boolean Step 1: AB Step 2: AB Step 3: AB+C Steering 1.23

Circuit to Boolean Exercise 1: Step 1: Step 2: Convert the following circuit to its Boolean Expression Steering 1.24

Circuit to Boolean Exercise 2: Step 1: Step 2: Convert the following circuit to its Boolean Expression Step 3: Step 4: Steering 1.25

Circuit to Boolean Exercise 3: Step 1: Step 2: Convert the following circuit to its Boolean Expression Step 3: Steering 1.26

Circuit to Boolean Exercise 4: Convert the following circuit to its Boolean Expression Steering 1.27

Boolean to Circuit Conversion Example ◊Take a step-by-step approach when converting from Boolean to a circuit. Work outward from the expression that brings together groupings found within the expression. ◊Example: Convert (ABC) + BC = Y Step 1: ABC is OR’d with BC Y ABC BC Steering 1.28

Step 2: One side, ABC BC Boolean to Circuit Conversion Example A B C Step 3: Other side, BC B C ABC (ABC) + BC = Y Step 4: Put it all together Steering 1.29

Step 5: Tidy up the circuit (inputs on left, outputs on right) BC Boolean to Circuit Conversion Example A B C B C ABC (ABC) + BC = Y Steering 1.30

Step 6: Common the B and the C inputs BC Boolean to Circuit Conversion Example A B C ABC (ABC) + BC = Y Done Steering 1.31

Boolean to Circuit Exercise 1: Draw the circuit whose expression is: (AB)+(CD) Steering 1.32

Boolean to Circuit Exercise 2: Draw the circuit whose expression is: (A+B)(BC) Steering 1.33

Boolean to Circuit Exercise 3: Draw the circuit whose expression is: (AB) + (AC) Steering 1.34

END ©Paul R. Godin prgodin gmail.com The Resistor and his Ohmies Steering 1.35