ENEE244-02xx Digital Logic Design Lecture 6. Announcements Homework 2 due today Homework 3 up on webpage Coming up: First midterm on Sept. 30 – Will cover.

Slides:



Advertisements
Similar presentations
Boolean Algebra and Logic Gates
Advertisements

Logic Gates.
Logic Gates.
CT455: Computer Organization Logic gate
UNIT 8 DIGITAL LOGIC. (1) To study and understand Boolean algebra and Boolean properties. (2) To design and analyze Logic gates. (3) To design and analyze.
Types of Logic Circuits
ECE2030 Introduction to Computer Engineering Lecture 9: Combinational Logic, Mixed Logic Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering.
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.
CS 151 Digital Systems Design Lecture 7 More Logic Functions: NAND, NOR, XOR.
Contemporary Logic Design Two-Level Logic © R.H. Katz Transparency No. 3-1 Chapter #2: Two-Level Combinational Logic Section 2.1, Logic Functions.
Digital Logic Design Lecture 26. Announcements Exams will be returned on Thursday Final small quiz on Monday, 12/8. Final homework will be assigned Thursday,
ENEE244-02xx Digital Logic Design Lecture 7. Announcements Homework 3 due on Thursday. Review session will be held by Shang during class on Thursday.
ENEE x Digital Logic Design Lecture 20. Announcements Homework 6 due today. Homework 7 up on course webpage, due on 11/13. Recitation quiz on Monday,
ENEE244-02xx Digital Logic Design Lecture 4. Announcements HW 1 due today. HW 2 up on course webpage, due on Thursday, Sept. 18. “Small quiz” in recitation.
2.7 NAND and NOR logic networks
Chapter 2: Boolean Algebra and Logic Functions
Introduction to Digital Design Lab Project
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 WEEK #7 COMBINATIONAL LOGIC ANALYSIS.
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.
Module Code MA1032N: Logic Lecture for Week Autumn.
ENEE244-02xx Digital Logic Design Lecture 12. Announcements HW4 due today HW5 is up on course webpage. Due on 10/16. Recitation quiz on Monday, 10/13.
CHAPTER 1 INTRODUCTION TO DIGITAL LOGIC
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
Lecture 4 Introduction to Boolean Algebra. Binary Operators In the following descriptions, we will let A and B be Boolean variables and define a set of.
ENEE244-02xx Digital Logic Design Lecture 5. Announcements Homework 1 solutions are on Canvas Homework 2 due on Thursday Coming up: First midterm on Sept.
Logic Gates M. AL-Towaileb1. Introduction Boolean algebra is used to model the circuitry of electronic devices. Each input and each output of such a device.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
Logic Design CS221 1 st Term combinational circuits Cairo University Faculty of Computers and Information.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
A Presentation to EECS Faculty By G. Serpen 8 April 2009.
ENGG 340 Midterm Review. Introduced the Concept of Variables and Functions Introduced the Concept of AND, OR, and NOT Introduced the Concept of Truth.
CHAPTER 5 Combinational Logic Analysis
ECE 331 – Digital System Design Basic Logic Operations, Boolean Expressions and Truth Tables, and Standard Logic Gates The slides included herein were.
Combinational Logic Logic gates. and, or, not Derived gates. nand, nor, xor John F. Wakerly – Digital Design. 4 th edition. Chapter 4.
The inverter performs the Boolean NOT operation. When the input is LOW, the output is HIGH; when the input is HIGH, the output is LOW. The Inverter AX.
Combinational Logic Analysis. Basic Combinational Logic Circuits AND-OR logic AND-OR logic AND-OR logic produces an SOP expression. AND-OR logic produces.
Lecture 07 Digital logic By Amr Al-Awamry. 4 variables K-Map.
Logic Gates and Boolean Algebra Introduction to Logic II.
Circuit Synthesis A logic function can be represented in several different forms:  Truth table representation  Boolean equation  Circuit schematic 
Digital Logic Design Lecture 29. Announcements Homework 9 due today Please fill out Course Evaluations online. Final exam will be on Thursday, Dec. 18.
Digital Fundamentals Floyd Chapter 3 Tenth Edition
Combinational Logic Logic gates. and, or, not Derived gates.
Digital Fundamentals Floyd Chapter 3 Tenth Edition
ECE 331 – Digital System Design
Logic Gates.
Logic Gates Benchmark Companies Inc PO Box Aurora CO
EI205 Lecture 5 Dianguang Ma Fall 2008.
Boolean Expressions Lecture No. 10.
KS4 Electricity – Electronic systems
KS4 Electricity – Electronic systems
Dr. Clincy Professor of CS
Instructor: Alexander Stoytchev
Logic Gates L Al-zaid Math110.
Schematics 201 Lecture Topic: Electrical Symbols
Digital Fundamentals Floyd Chapter 3 Tenth Edition
CS Chapter 3 (3A and ) Part 3 of 8
Logic Gates.
Logic Gates.
KS4 Electricity – Electronic systems
CS Chapter 3 (3A and ) – Part 2 of 5
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
Instructor: Alexander Stoytchev
Logic Gates Dr.Halimah Alshehri.
Instructor: Alexander Stoytchev
Chapter 4 Gates and Circuits.
Truth tables Mrs. Palmer.
Agenda Lecture Content: Combinatorial Circuits Boolean Algebras
Reading: Hambley Ch. 7 through 7.5
Presentation transcript:

ENEE244-02xx Digital Logic Design Lecture 6

Announcements Homework 2 due today Homework 3 up on webpage Coming up: First midterm on Sept. 30 – Will cover material form Lectures 1-7. – List of topics for exam will be posted by the end of the week on course webpage. – Lecture on Thursday, Sept. 25 will be a review session.

Agenda Last time: – Manipulations of Boolean Formulas (3.6) – Gates and Combinational Networks (3.7) – Incomplete Boolean Functions and Don’t Care Conditions (3.8 ) This time: – Universal Gates (3.9.3) – NAND/NOR/XOR Gate Realizations ( ) – Gate Properties (3.10)

Some Terminology System specification: A description of the function of a system and of other characteristics required for its use. – A function (table, algebraic) on a finite set of inputs. Double-rail logic: both variables and their complements are considered as primary inputs. Single-rail logic: only variables are considered as primary inputs. Need inverters for their complements.

Universal Gates

NAND is Universal

NOR is Universal

More on Universal Gates

NAND-Gate Realizations Naïve approach: build network out of AND/OR/NOT gates, use the universal property above to replace each one with several NAND gates. A better approach: manipulate Boolean expression into the form NAND(A, B,...,C)

NAND-Gate Realizations

NOR-Gate Realizations Essentially the same procedure. See Section in the textbook.

XOR-Gate Realizations Properties of XOR (a)(b) (i) (ii) (iii) (iv) (v) (vi) (vii) (viii) (ix) (x)

Gate Properties

Noise Margins

Gate 1Gate 2 Noise

Fan-Out The signal value at the output of a gate is dependent upon the number of gates to which the output is connected. Limitation on number of gates output can connect to. This is known as the fan-out capability of the gate. Manufacturers specify this limitation. Circuits known as buffers serve as amplifiers for this purpose.

Propagation Delays

Power Dissipation Digital circuit consumes power as a result of the flow of currents. Called power dissipation. Desirable to have low power dissipation and low propagation delay times. These two performance parameters are in conflict with each other. Common measure of gate preformance is the product of the propagation delay and the power dissipation of the gate. This is known as the delay-power product.