Revision Mid 2 Prof. Sin-Min Lee Department of Computer Science.

Slides:



Advertisements
Similar presentations
Logic Gates.
Advertisements

1 A latch is a pair of cross-coupled inverters –They can be NAND or NOR gates as shown –Consider their behavior (each step is one gate delay in time) –From.
Department of Computer and Information Science, School of Science, IUPUI CSCI 240 Digital Logic.
Logic Gates.
Computer Science 210 Computer Organization Introduction to Logic Circuits.
State-machine structure (Mealy)
Prof. Sin-Min Lee Department of Computer Science
Multiplexer as a Universal Function Generator Lecture L6.7 Section 6.2.
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Multiplexors Sequential Circuits and Finite State Machines Prof. Sin-Min Lee Department of Computer Science.
CS 151 Digital Systems Design Lecture 21 Analyzing Sequential Circuits.
1 Lecture 23 More Sequential Circuits Analysis. 2 Analysis of Combinational Vs. Sequential Circuits °Combinational : Boolean Equations Truth Table Output.
CS 300 – Lecture 3 Intro to Computer Architecture / Assembly Language Sequential Circuits.
Sequential Circuits and Finite State Machines Prof. Sin-Min Lee
CHAPTER 3 Digital Logic Structures
Section 10.3 Logic Gates.
Multiplexer as a Universal Function Generator
Sequential Circuits Problems(I) Prof. Sin-Min Lee Department of Mathematics and Computer Science Algorithm = Logic + Control.
Revision Mid 2 Prof. Sin-Min Lee Department of Computer Science.
ECE 301 – Digital Electronics Multiplexers and Demultiplexers (Lecture #12)
Lecture 3. Boolean Algebra, Logic Gates
Overview Part 1 - Storage Elements and Sequential Circuit Analysis
Example of a Combinatorial Circuit: A Multiplexer (MUX)
Decoders and Multiplexers Prof. Sin-Min Lee Department of Computer Science San Jose State University.
Lecture 3. Boolean Algebra, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
Lecture 3. Error Detection and Correction, Logic Gates Prof. Sin-Min Lee Department of Computer Science 2x.
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:
Unit 14 Derivation of State Graphs
Digital Logic Problems (II) Prof. Sin-Min Lee Department of Mathematics and Computer Science.
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.
4. Computer Maths and Logic 4.2 Boolean Logic Logic Circuits.
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
Hamming Code,Decoders and D,T-flip flops Prof. Sin-Min Lee Department of Computer Science.
Sequential Circuit: Analysis BIL- 223 Logic Circuit Design Ege University Department of Computer Engineering.
1 CS 151: Digital Design Chapter 3: Combinational Logic Design 3-1Design Procedure CS 151: Digital Design.
Revision Mid 2, Cache Prof. Sin-Min Lee Department of Computer Science.
Revision Mid 1 Prof. Sin-Min Lee Department of Computer Science.
Department of Preparatory Year, Umm Al Qura University CSCI 240 Digital Logic.
IKI b-Analysis of Sequential Logic Bobby Nazief Semester-I The materials on these slides are adopted from: CS231’s Lecture Notes at.
Logic Gates and Boolean Algebra Introduction to Logic II.
Digital Logic. Boolean Algebra to Logic Gates Logic circuits are built from components called logic gates. The logic gates correspond to Boolean operations.
Prof. Sin-Min Lee Department of Computer Science
Department of Preparatory Year, Umm Al Qura University
Eng. Mai Z. Alyazji October, 2016
Lecture 4 Nand, Nor Gates, CS147 Circuit Minimization and
Lecture 6: Universal Gates
Prof. Sin-Min Lee Department of Computer Science
Finite State Machine, Memory Systems
And Decoders Prof. Sin-Min Lee Department of Computer Science
And Decoders Prof. Sin-Min Lee Department of Computer Science
Logic Gates.
EI205 Lecture 5 Dianguang Ma Fall 2008.
CSE 140 MT 2 Review By Daniel Knapp.
Digital Design Fundamentals
Computer Science 210 Computer Organization
UNIVERSAL GATES.
Lecture 6: Universal Gates
CSE 370 – Winter Sequential Logic - 1
Logic Gates.
Digital Logic.
Lecture 6: Universal Gates
Gates Type AND denoted by X.Y OR denoted by X + Y NOR denoted by X + Y
GCSE Computer Science – Logic Gates & Boolean Expressions
CS 140 Lecture 6: Other Types of Gates
Multiplexers For the rest of the day, we’ll study multiplexers, which are just as commonly used as the decoders we presented last time. Again, These serve.
Truth tables Mrs. Palmer.
Design of Digital Circuits Lab 1 Supplement: Drawing Basic Circuits
CSE 140 Lecture 9 Sequential Networks
Department of Electronics
Logic Gates By: Asst Lec. Besma Nazar Nadhem
Presentation transcript:

Revision Mid 2 Prof. Sin-Min Lee Department of Computer Science

Example Problem  A hall light is controlled by two light switches, one at each end. Find (a) a truth function, (b) a Boolean expression, and (c) a logic network that allows the light to be switched on or off by either switch. xy f( x, y ) (What kind of gate has this truth table? Let x and y be the switches:

Example (cont)  One possible equation is the complete sum-of- products form: f(X,Y) = XY* + X*Y  Use The Most Complex Machine xLogicCircuit Module to implement the equation. xy f( x, y )

How to use NAND gates to build an OR gate? Truth Table ABCDQ Hint 1 : Use 3 NAND gates Hint 2 : Use 2 NAND gates to build 2 NOT gates Hint 3 : Put the 3 rd NAND gate after the 2 “NOT” gates A B C D Q

How to use NAND gates to build a NOR gate? Truth Table ABCDEQ A B C D Q E Hint 4 : Put the “NOT” gate after “OR” gate Hint 3 : Use a NOR gate to build a NOT gate Hint 2 : Use 3 NAND gates to build an OR gate Hint 1 : Use 4 NAND gates

Multiplexers  A combinational circuit that selects info from one of many input lines and directs it to the output line.  The selection of the input line is controlled by input variables called selection inputs.  They are commonly abbreviated as “ MUX ”.

These pictures have errors.

T CLK Q1

T CLK Q1

How to use D to implement T Flip- Flop D = TQ’ + T’Q T

How to use T to implement D Flip- Flop TQ+Q QQ’QQ’ DQ+Q T = DQ’ + D’Q Q D01D

How to use T to implement D Flip- Flop T = DQ’ + D’Q D

Implementing with a D AND a T flip-flop Using this FSM with three states, an operating only on inputs and transitions from one state to another, we will be using both D and T flip-flops.

Implementing with a D AND a T flip-flop Since we have no state “11”, our Q(t+1) is “don't care” = “XX” for both of these transitions. Consider the first column of the Q(t+1) values to be “D” and the second to be “T” and then we derive two corresponding charts. DT

Implementing with a D AND a T flip-flop Then we need to derive the corresponding equations.

Implementing with a D AND a T flip-flop We assume that Q(t) is actually a pair of Q D Q T. Now, with these equations, we can graph the results.

Implementing with a D AND a T flip-flop