Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patternson and Hennessy Text.

Slides:

Advertisements

Similar presentations

Registers Computer Organization I 1 September 2009 © McQuain, Feng & Ribbens A clock is a free-running signal with a cycle time. A clock may.

Advertisements

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patternson and Hennessy Text.

Changes in input values are reflected immediately (subject to the speed of light and electrical delays) on the outputs Each gate has an associated “electrical.

Introduction to Sequential Logic Design Latches. 2 Terminology A bistable memory device is the generic term for the elements we are studying. Latches.

Computer Science 210 Computer Organization Clocks and Memory Elements.

Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP

Flip-Flops Computer Organization I 1 June 2010 © McQuain, Feng & Ribbens A clock is a free-running signal with a cycle time. A clock may be.

CS 151 Digital Systems Design Lecture 19 Sequential Circuits: Latches.

Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

Introduction to Sequential Logic Design Bistable elements Latches.

Module 12.  In Module 9, 10, 11, you have been introduced to examples of combinational logic circuits whereby the outputs are entirely dependent on the.

1 © 2014 B. Wilkinson Modification date: Dec Sequential Logic Circuits – I Flip-Flops A sequential circuit is a logic components whose outputs.

EKT 124 / 3 DIGITAL ELEKTRONIC 1

Sequential circuit Digital electronics is classified into combinational logic and sequential logic. In combinational circuit outpus depends only on present.

Latches and Flip-Flops

EECC341 - Shaaban #1 Lec # 13 Winter Sequential Logic Circuits Unlike combinational logic circuits, the output of sequential logic circuits.

Overview Logic Combinational Logic Sequential Logic Storage Devices SR Flip-Flops D Flip Flops JK Flip Flops Registers Addressing Computer Memory.

Sequential Circuits. 2 Sequential vs. Combinational Combinational Logic:  Output depends only on current input −TV channel selector (0-9) Sequential.

Latches and Flip-Flops Discussion D4.1 Appendix J.

Fall 2007 L16: Memory Elements LECTURE 16: Clocks Sequential circuit design The basic memory element: a latch Flip Flops.

Flip Flops. Clock Signal Sequential logic circuits have memory Output is a function of input and present state Sequential circuits are synchronized by.

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patterson and Hennessy Text.

COE 202: Digital Logic Design Sequential Circuits Part 1

Instructor: Alexander Stoytchev CprE 281: Digital Logic.

Flip-Flops and Registers

Company LOGO DKT 122/3 DIGITAL SYSTEM 1 WEEK #12 LATCHES & FLIP-FLOPS.

Sequential Logic Combinatorial components: the output values are computed only from their present input values. Sequential components: their output values.

Synchronous Sequential Circuits by Dr. Amin Danial Asham.

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patternson and Hennessy Text.

Instructor: Alexander Stoytchev CprE 281: Digital Logic.

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patternson and Hennessy Text.

Flip Flop Chapter 15 Subject: Digital System Year: 2009.

Chapter 10 Flip-Flops and Registers 1. Objectives You should be able to: Explain the internal circuit operation of S-R and gated S-R flip-flops. Explain.

Logic Design / Processor and Control Units Tony Diep.

Sequential Logic Computer Organization II 1 © McQuain A clock is a free-running signal with a cycle time. A clock may be either high or.

Synchronous Sequential Logic A digital system has combinational logic as well as sequential logic. The latter includes storage elements. feedback path.

Chapter 6 – Digital Electronics – Part 1 1.D (Data) Flip Flops 2.RS (Set-Reset) Flip Flops 3.T Flip Flops 4.JK Flip Flops 5.JKMS Flip Flops Information.

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patterson and Hennessy Text.

Instructor: Alexander Stoytchev CprE 281: Digital Logic.

Chapter5: Synchronous Sequential Logic – Part 1

Synchronous Sequential Circuits by Dr. Amin Danial Asham.

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patterson and Hennessy Text.

Synchronous Sequential Circuits by Dr. Amin Danial Asham.

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patterson and Hennessy Text.

Latches-1 Feedback Circuits Two inverters, with feedback If the first input is 0, a 0 gets fed back into it If the first input is 1, a 1 gets fed back.

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patterson and Hennessy Text.

7. Latches and Flip-Flops Digital Computer Logic.

Flip-Flop Flip-flops Objectives Upon completion of this chapter, you will be able to :  Construct and analyze the operation of a latch flip-flop made.

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patternson and Hennessy Text.

Computer Science 210 Computer Organization

FLIP FLOPS Binary unit capable of storing one bit – 0 or 1

Clocks A clock is a free-running signal with a cycle time.

Computer Architecture & Operations I

Lecture 8 Dr. Nermi Hamza.

Latches, Flip-Flops and Registers

Computer Science 210 Computer Organization

Latches and Flip-flops

LECTURE 15 – DIGITAL ELECTRONICS

Computer Science 210 Computer Organization

Elec 2607 Digital Switching Circuits

Instructor: Alexander Stoytchev

Instructor: Alexander Stoytchev

Instructor: Alexander Stoytchev

1) Latched, initial state Q =1

Lecture 14: State Tables, Diagrams, Latches, and Flip Flop

Registers and Counters

Presentation transcript:

Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patternson and Hennessy Text

Recall Recall that the RS-Latch allows for storage of a single bit through the use of either two NOR (not OR) gates or two NAND (not AND) gates. Last time We learned that the RS latch allows for storage by feeding the outputs Q and ~Qback into the NAND or NOR gates. On inputs of R = 1 and S = 0, the value stored is reset to 0. That is Q = 0.This resets the latch. On inputs of R = 0 and S = 1, the value stored is set to 1. That is Q = 1.This sets the latch. On inputs of R = 0 and S = 0, the value stored is not modified.

Recall Recall that performing both a set and a reset at the same time is an invalid operation and will result in an oscillating state. It is possible to recover from this state by attempting to set and reset the latch, but it will take time to recover. The minimum time required to recover from an oscillating state is the time to change the signal plus the propagation delay required for the inputs to feed back through the gates.

Oscillation Prevention We will look at methods to prevent oscillating states from occurring. Since an RS-Latch should never have both R and S set to one, we could attempt to create additional logic to prevent such a state from ever occurring. To do so, we will add two AND gates immediately prior to the latch The outputs from these AND gates will be the inputs to the RS-Latch for R and S,respectively.

Oscillation Prevention Changing the meaning of our inputs Instead of using set and reset as inputs we will now pretend to use two inputscalled D and E. E is provided as input to both AND gates. D is provided as an input to the first AND gate. ~D is provided as input to thesecond AND gate. By providing D to the first AND gate as an input and ~D to the second AND gate,the outputs from the AND gates representing set and reset can never both be true at the same time.

Oscillation Prevention contd. D is a signal used to change the data stored. If D is one, we change the value stored in the latch. That is, if one was stored in the latch, the value stored would be changed to zero. If zero was stored in the latch, the value stored is changed to one. E is a signal used to enable or disable the latch. If E is one, changes may be made to the value stored. If E is zero, no changes may be made to the value stored. Now, D works like a push-button. When D is one or we push the button for D, the value stored changes. E works like an on/off switch. When E is on we can modifythe latch.

D Latches The type of latch describe above is called a D-Latch. It is also known as a Level Triggered Flip Flop. A D-Latch contains an RS-Latch, thus it can store one bit. Initially the value stored will oscillate if no signal is provided as input. Stabilization occurs after an initial input is provided for both Enable and Data inputs.

D Latch The D-Latch has an interesting property that can be observed. While the latch is enabled, the value stored may be changed. It is because of this property that the D-Latch is sometimes referred to as a Level-Triggered Flip Flop. Notice that any time the signal on the D line meets the same level as the signal on the E line, while E is one, the value stored will change. Any time E is "off" or zero, the value stored will remain constant. Hence the name level triggered.

JLS D Latch A gate-based example of a D-Latch is available on the examples page of the class website. JLS provides a component based model of a D-Latch, too D input-->| D Q | --> Q output | | \ | E input-->|C > ~Q | --> ~Q output | / | Notice that in the component based representation none of the gates are visible.

D Latch Only the inputs and outputs are accessible. This provides the abstraction necessary to utilize many D-Latches as registers. Notice that a 32 bit register could be represented by 32 D- Latches. Next time we will look at another type of flip flop called an edge-triggered flip flop that only changes state with either the rising or falling edge of the enable input.