Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 3.

Slides:



Advertisements
Similar presentations
Chapter 3 Gate-Level Minimization
Advertisements

Boolean Algebra and Logic Gates
Chapter 4 Gates and Circuits.
Switching circuits Composed of switching elements called “gates” that implement logical blocks or switching expressions Positive logic convention (active.
ENGIN112 L7: More Logic Functions September 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 7 More Logic Functions: NAND, NOR,
Other Gate Types Why? Gate classifications
Digital CMOS Logic Circuits
CT455: Computer Organization Logic gate
Digital Logic Design Gate-Level Minimization
Introduction to Logic Gates
Overview Part 1 – Gate Circuits and Boolean Equations
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.
Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
Overview Part 1 – Gate Circuits and Boolean Equations
Other Gate Types COE 202 Digital Logic Design Dr. Aiman El-Maleh
Exclusive-OR and Exclusive-NOR Gates
1 Computer Programming Boolean Logic Copyright © Texas Education Agency, 2013.
Chapter3: Gate-Level Minimization Part 2
Exclusive-OR and Exclusive-NOR Gates
topics Logic gates Gates types Universal gates
01 Introduction to Digital Logic
Overview Part 2 – Combinational Logic Functions and functional blocks
Chapter 2 Logic Circuits.
Overview Part 3 – Additional Gates and Circuits 2-8 Other Gate Types
Chapter 2 – Combinational Logic Circuits Part 1 – Gate Circuits and Boolean Equations Logic and Computer Design Fundamentals.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 3.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 1 –
EE2174: Digital Logic and Lab Professor Shiyan Hu Department of Electrical and Computer Engineering Michigan Technological University CHAPTER 4 Technology.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 1 –
Based on slides by: Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. ECE/CS 352: Digital System Fundamentals Lecture 10 – Other Gate Types.
Additional Gates BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
Charles Kime & Thomas Kaminski © 2004 Pearson Education, Inc. Terms of Use (Hyperlinks are active in View Show mode) Terms of Use Chapter 2 – Combinational.
Digital Logic Chapter 4 Presented by Prof Tim Johnson
NOCTI Review Lesson 4 Objectives:
Digital Logic Basics Chapter 2 S. Dandamudi To be used with S. Dandamudi, “Fundamentals of Computer Organization and Design,” Springer, 
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 2.
1 KU College of Engineering Elec 204: Digital Systems Design Lecture 7 Transformations Factoring - finding a factored form from SOP or POS expression Decomposition.
CS 151: Introduction to Digital Design Chapter 2-9 Exclusive-OR Gates.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. Circuit Optimization Logic and Computer Design Fundamentals.
Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 3 – Combinational Logic Design Part 1 –
Logic Gates Shashidhara H S Dept. of ISE MSRIT. Basic Logic Design and Boolean Algebra GATES = basic digital building blocks which correspond to and perform.
Chapter 33 Basic Logic Gates. 2 Objectives –After completing this chapter, the student should be able to: Identify and explain the function of the basic.
1 CS 151 Introduction to Digital Design Chapter 2-8 Other Gate Types.
Sneha.  Gates Gates  Characteristics of gates Characteristics of gates  Basic Gates Basic Gates  AND Gate AND Gate  OR gate OR gate  NOT gate NOT.
1 CS 151: Introduction to Digital Design Chapter 2-10 High Impedance Outputs.
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.
Chapter-3: BOOLEAN ALGEBRA & LOGIC GATES Analysis and logical design.
Logic Gates. A logic gate is an elementary building block of a digital circuit. Most logic gates have two inputs and one output. At any given moment,
CS151 Introduction to Digital Design Chapter 2: Combinational Logic Circuits 2-9 Exclusive-OR Operator and Gates 1Created by: Ms.Amany AlSaleh.
Combinational Logic: Other Gate Types
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
BOOLEAN ALGEBRA LOGIC GATES. Introduction British mathematician George Boole( ) was successful in finding the link between logic and mathematics.
ECE 2110: Introduction to Digital Systems Chapter 6 Combinational Logic Design Practices XOR and parity check Circuits.
Mu.com.lec 9. Overview Gates, latches, memories and other logic components are used to design computer systems and their subsystems Good understanding.
1 Digital Systems Design Lecture 7 Transformations Factoring - finding a factored form from SOP or POS expression Decomposition - expression of a function.
Boolean Algebra & Logic Gates
Overview Part 1 – Logic Circuits and Boolean Functions
2-6 Exclusive-OR Operator and Gates
Overview Part 1 – Gate Circuits and Boolean Equations
Overview Part 1 – Gate Circuits and Boolean Equations
King Fahd University of Petroleum and Minerals
CSC 220: Computer Organization Logic Gates and Functions
Overview Part 3 – Additional Gates and Circuits
Overview Part 3 – Additional Gates and Circuits 2-8 Other Gate Types
XOR, XNOR, and Binary Adders
Digital Fundamentals Floyd Chapter 5 Tenth Edition
Digital Logic Design Basics Combinational Circuits Sequential Circuits.
Circuit Simplification and
Presentation transcript:

Charles Kime & Thomas Kaminski © 2008 Pearson Education, Inc. (Hyperlinks are active in View Show mode) Chapter 2 – Combinational Logic Circuits Part 3 – Additional Gates and Circuits Logic and Computer Design Fundamentals

Chapter 2 - Part 3 2 Overview Part 1 – Gate Circuits and Boolean Equations Binary Logic and Gates Boolean Algebra Standard Forms Part 2 – Circuit Optimization Two-Level Optimization Map Manipulation Practical Optimization (Espresso) Multi-Level Circuit Optimization Part 3 – Additional Gates and Circuits Other Gate Types Exclusive-OR Operator and Gates High-Impedance Outputs

Chapter 2 - Part 3 3 Other Gate Types - Buffer A buffer is a gate with the function F = X: In terms of Boolean function, a buffer is the same as a connection! So why use it? A buffer is an electronic amplifier used to improve circuit voltage levels and increase the speed of circuit operation. XF

Chapter 2 - Part 3 4 NAND Gate The basic NAND gate has the following symbol, illustrated for three inputs: AND-Invert (NAND) NAND represents NOT AND The small circle (bubble) represents the invert function. X Y Z ZYX)Z,Y,X(F

Chapter 2 - Part 3 5 NAND Gates (continued) Applying DeMorgan's Law gives Invert-OR (NAND) This NAND symbol is called Invert-OR, since inputs are inverted and then ORed together. The NAND gate is a universal gate. X Y Z ZYX)Z,Y,X(F

Chapter 2 - Part 3 6 NOR Gate The basic NOR gate has the following symbol, illustrated for three inputs: OR-Invert (NOR) NOR represents NOT - OR The small circle (bubble) represents the invert function. X Y Z ZYX)Z,Y,X(F +

Chapter 2 - Part 3 7 NOR Gate (continued) Applying DeMorgan's Law gives Invert-AND (NOR) This NOR symbol is called Invert-AND, since inputs are inverted and then ANDed together. The NOR gate is a universal gate X Y Z

Chapter 2 - Part 3 8 Exclusive OR/ Exclusive NOR The eXclusive OR (XOR) function is an important Boolean function used extensively in logic circuits. The eXclusive NOR function is the complement of the XOR function By our definition, XOR and XNOR gates are complex gates.

Chapter 2 - Part 3 9 Exclusive OR/ Exclusive NOR Uses for the XOR and XNORs gate include: Adders/subtractors/multipliers Counters/incrementers/decrementers Parity generators/checkers Definitions The XOR function is: The eXclusive NOR (XNOR) function, otherwise known as equivalence is: YXYXYX YXYXYX

Chapter 2 - Part 3 10 Truth Tables for XOR/XNOR Operator Rules: XOR XNOR The XOR function means: X OR Y, but NOT BOTH Why is the XNOR function also known as the equivalence function, denoted by the operator ? X Y X Y X Y or X Y (X Y)

Chapter 2 - Part 3 11 XOR/XNOR (Continued) The XOR function can be extended to 3 or more variables. For more than 2 variables, it is called an odd function or modulo 2 sum (Mod 2 sum), not an XOR: The complement of the odd function is the even function. The XOR identities: X1XX0X 1XX0XX XYYX ZYX)ZY(XZ ) YX( ZYXZYXZYXZYXZYX

Chapter 2 - Part 3 12 Symbols For XOR and XNOR XOR symbol: XNOR symbol: Shaped symbols exist only for two inputs

Chapter 2 - Part 3 13 XOR Implementations The simple SOP implementation uses the following structure: A NAND only implementation is: X Y X Y X Y X Y

Chapter 2 - Part 3 14 Example: Odd Function Implementation Design a 3-input odd function F = X Y Z with 2-input XOR gates Factoring, F = (X Y) Z The circuit: X Y Z F

Chapter 2 - Part 3 15 Example: Even Function Implementation Design a 4-input odd function F = W X Y Z with 2-input XOR and XNOR gates Factoring, F = (W X) (Y Z) The circuit: W X Y F Z

Chapter 2 - Part 3 16 Hi-Impedance Outputs Logic gates introduced thus far have 1 and 0 output values, Three-state logic adds a third logic value, Hi- Impedance (Hi-Z), giving three states: 0, 1, and Hi-Z on the outputs.

Chapter 2 - Part 3 17 Hi-Impedance Outputs (continued) What is a Hi-Z value? The Hi-Z value behaves as an open circuit This means that, looking back into the circuit, the output appears to be disconnected. It is as if a switch between the internal circuitry and the output has been opened. Hi-Z may appear on the output of any gate, but we restrict gates to: a 3-state buffer each of which has one data input and one control input.

Chapter 2 - Part 3 18 The 3-State Buffer IN is the data input, and EN, the control input. For EN = 0, regardless of the value on IN (denoted by X), the output value is Hi-Z. For EN = 1, the output value follows the input value. IN EN OUT Symbol Truth Table

Chapter 2 - Part 3 19 More Complex Gates The remaining complex gates are SOP or POS structures with and without an output inverter. The names are derived using: A - AND O - OR I - Inverter Numbers of inputs on first-level gates or directly to second-level gates

Chapter 2 - Part 3 20 More Complex Gates (continued) Example: AOI - AND-OR-Invert consists of a single gate with AND functions driving an OR function which is inverted. Example: AO has two 2-input ANDS driving an OR with one additional OR input These gate types are used because: the number of transistors needed is fewer than required by connecting together primitive gates potentially, the circuit delay is smaller, increasing the circuit operating speed