1/16/2016 1 CSEE, UQ Lecture 3 Hardware Description Methods, Review of Switching Algebra.

Slides:



Advertisements
Similar presentations
Boolean Algebra and Logic Gates
Advertisements

ENGIN112 L7: More Logic Functions September 17, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 7 More Logic Functions: NAND, NOR,
CT455: Computer Organization Logic gate
Programmable Logic Controllers.
Lecture 6 More Logic Functions: NAND, NOR, XOR and XNOR
Introduction to Logic Circuits
Figure 4.1. The function f (x1, x2, x3) =  m(0, 2, 4, 5, 6).
Morgan Kaufmann Publishers
Chapter 2 Logic Circuits.
Boolean rules for simplification Dr. Ahmed Telba.
CS 151 Digital Systems Design Lecture 7 More Logic Functions: NAND, NOR, XOR.
CS 151 Digital Systems Design Lecture 6 More Boolean Algebra A B.
COMBINATIONAL LOGIC CIRCUITS C.L. x1 x2 xn Z Z = F (x1, x2, ……., Xn) F is a Binary Logic (BOOLEAN ) Function Knowing F Allows Straight Forward Direct Implementation.
Logic Functions and their Representation. Slide 2 Combinational Networks x1x1 x2x2 xnxn f.
2.7 NAND and NOR logic networks
Boolean Algebra and Logic Simplification
Chapter 2: Boolean Algebra and Logic Functions
1 Why study Boolean Algebra? 4 It is highly desirable to find the simplest circuit implementation (logic) with the smallest number of gates or wires. We.
Chapter 2 Combinational Systems And / Or / Not. TRIAD PRINCIPLE: Combinational is about And / Or / Not combinations As well as equivalent functions. It.
Lecture 4 Logic gates and truth tables Implementing logic functions
Switching functions The postulates and sets of Boolean logic are presented in generic terms without the elements of K being specified In EE we need to.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
 Seattle Pacific University EE Logic System DesignSOP-POS-1 The Connection: Truth Tables to Functions abcF abcF
9/15/09 - L27 CountersCopyright Joanne DeGroat, ECE, OSU1 Final Exam Review Exam Time: MONDAY o dark 30 7:30AM this room.
Company LOGO DKT 122/3 DIGITAL SYSTEM 1 WEEK #7 COMBINATIONAL LOGIC ANALYSIS.
EEL-3705 TPS QUIZZES. Quiz 2-1 Use a Venn Diagram to show.
CS/EE 3700 : Fundamentals of Digital System Design Chris J. Myers Lecture 2: Intro. to Logic Circuits Chapter 2.
EE2420 – Digital Logic Summer II 2013 Hassan Salamy Ingram School of Engineering Texas State University Set 4: Other Gates.
Course contents Chapter 1 - section 1.6 Chapter 2 - all sections Chapter – 4.7, and 4.12 Chapter , Chapter 6 - all sections.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
Chapter 2 Two- Level Combinational Logic. Chapter Overview Logic Functions and Switches Not, AND, OR, NAND, NOR, XOR, XNOR Gate Logic Laws and Theorems.
Venn Diagram – the visual aid in verifying theorems and properties 1 E.
Lecture 09 NAND and XOR Implementations. Overview °Developing NAND circuits °Two-level implementations Convert from AND/OR to NAND (again!) °Multi-level.
Figure 2.6. A truth table for the AND and OR operations. 2.3 Truth Tables 1.
ENGIN112 L6: More Boolean Algebra September 15, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 6 More Boolean Algebra A B.
1 EENG 2710 Chapter 2 Algebraic Methods For The Analysis and Synthesis of Logic circuits.
CHAPTER 1 SETS, FUNCTIONs, ELEMENTARY LOGIC & BOOLEAN ALGEBRAs
1 Lect # 2 Boolean Algebra and Logic Gates Boolean algebra defines rules for manipulating symbolic binary logic expressions. –a symbolic binary logic expression.
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.
ECE 3110: Introduction to Digital Systems Chapter #4 Review.
5 - Digital Logic with Boolean Algebra
Chapter-3: BOOLEAN ALGEBRA & LOGIC GATES Analysis and logical design.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Figure 2.1. A binary switch. x1=x0= (a) Two states of a switch S x (b) Symbol for a switch.
Department of Preparatory Year, Umm Al Qura University CSCI 240 Digital Logic.
Lecture 5 More Boolean Algebra A B. Overview °Expressing Boolean functions °Relationships between algebraic equations, symbols, and truth tables °Simplification.
Chapter 5 Boolean Algebra and Reduction Techniques 1.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
Digital Logic. Boolean Algebra to Logic Gates Logic circuits are built from components called logic gates. The logic gates correspond to Boolean operations.
CHAPTER 13 Digital Logic Circuits. Figure Voltage analog of internal combustion engine in-cylinder pressure Figure 13.1.
Department of Preparatory Year, Umm Al Qura University
Chapter 2: Boolean Algebra and Logic Functions
ECE 2110: Introduction to Digital Systems
Instructor: Alexander Stoytchev
Instructor: Alexander Stoytchev
Princess Sumaya University
Digital Signals Digital Signals have two basic states:
ECE 331 – Digital System Design
Instructor: Alexander Stoytchev
Boolean Algebra.
Boolean Algebra & Logic Circuits
Boolean Algebra.
Chapter 2 Introduction to Logic Circuits
13 Digital Logic Circuits.
Digital Logic Chapter-2
XOR Function Logic Symbol  Description  Truth Table 
Instructor: Alexander Stoytchev
Digital Logic Chapter-2
Presentation transcript:

1/16/ CSEE, UQ Lecture 3 Hardware Description Methods, Review of Switching Algebra

1/16/ CSEE, UQ x1=x0= (a) Two states of a switch S x (b) Symbol for a switch A binary switch

1/16/ CSEE, UQ (a) Simple connection to a battery S x (b) Using a ground connection as the return path L BatteryLight x Power supply S L A light controlled by a switch

1/16/ CSEE, UQ (a) The logical AND function (series connection) S x 1 L Power supply S x 2 S x 1 L Power supplyS x 2 (b) The logical OR function (parallel connection) Light Two basic functions

1/16/ CSEE, UQ S x 1 L Power supplyS x 2 Light S x 3 A series parallel connection

1/16/ CSEE, UQ S x L Power supply R An inverting circuit

1/16/ CSEE, UQ Truth table for AND and OR

1/16/ CSEE, UQ Three input AND and OR

1/16/ CSEE, UQ x 1 x 2 x n x 1 x 2 x 1 x 2. x 1 x 2 … x n. (a) AND gates (b) OR gates x 1 x 2 x 1 x 2 + x 1 x 2 x n x 1 x 2 … x n +++ Basic gates x x (c) NOT gate x 1 x 2 x 1 x 2. x 1 x 2 x 1 x 2 + (d) NAND gate (e) NOR gate

1/16/ CSEE, UQ x 1 x f (a) Network that implements fx1x1 x1x1 x2x2 += x 1 x 2 fx 1 x 2,() (b) Truth table for f A B Logic network

1/16/ CSEE, UQ x 1 x 2 A B f Time (c) Timing diagram g x 1 x 2 (d) Network that implementsgx 1 x 2 += Logic network

1/16/ CSEE, UQ Boolean algebra - axioms 0*0 = = 1 1*1 = = 0 0* 1 = 1* 0 = = = 1 x*0 = 0 x + 1 = 1 x*1 = x x +0 = x x* x = x x + x = x x* x = 0 x+ x = 1 x = x x*y = x + y x + y = x*y x + x*y = x + y x*(x + y) = x*y DeMorgan laws

1/16/ CSEE, UQ DeMorgan’s theorem

1/16/ CSEE, UQ Figure 2.12 The Venn diagram representation Please see “portrait orientation” PowerPoint file for Chapter 2

1/16/ CSEE, UQ Figure 2.13 Verification of the distributive property Please see “portrait orientation” PowerPoint file for Chapter 2

1/16/ CSEE, UQ Please see “portrait orientation” PowerPoint file for Chapter 2 Figure 2.14 Verification example

1/16/ CSEE, UQ A function to be synthesised

1/16/ CSEE, UQ f (a) Canonical sum-of-products f (b) Minimal-cost realization x 2 x 1 x 1 x 2 Two implementations

1/16/ CSEE, UQ Minterms and maxterms

1/16/ CSEE, UQ A three variable function

1/16/ CSEE, UQ (a) A minimal sum-of-products (b) A minimal product-of-sums f x 1 x 2 x 3 f x 2 x 1 x 3 Two implementations

1/16/ CSEE, UQ Three way light controller A room with three doors. Light switch at each door. Light turned on/off at each door. 1 - turned on. 0 – turned off. Specification (for logic only):

1/16/ CSEE, UQ f x 1 x 2 x 3 Sum of Products – SOP

1/16/ CSEE, UQ f x 1 x 2 x 3 Products of Sums – POS

1/16/ CSEE, UQ (a) Truth table f s x 1 x (c) Graphical symbol (b) Circuit (d) More compact truth table sx1x1 x2x2 f (s, x 1, x 2 ) 0 1 s x1x1 x2x2 f x 1 x 2 s Multiplexer

1/16/ CSEE, UQ (a) Truth table (c) XOR Graphical symbol (b) One of XOR Circuits XOR, XNOR gates x1x1 x2x2 XOR XNOR f x 1 x 2 (d) XNOR Graphical symbol

1/16/ CSEE, UQ Waveform Editor

1/16/ CSEE, UQ Graphic Editor

1/16/ CSEE, UQ Please see “portrait orientation” PowerPoint file for Chapter 2

1/16/ CSEE, UQ f x 3 x 1 x 2 first touch of VHDL

1/16/ CSEE, UQ A bit more of VHDL

1/16/ CSEE, UQ f g x 3 x 1 x 2 x 4 Four-input function