1) Latched, initial state Q =1

Slides:



Advertisements
Similar presentations
Lab 08: SR Flip Flop Fundamentals:
Advertisements

Lecture on Flip-Flops.
Flip-Flops Basic concepts. A. Yaicharoen2 Flip-Flops A flip-flop is a bi-stable device: a circuit having 2 stable conditions (0 or 1) A flip-flop circuit.
Registers and Counters. Register Register is built with gates, but has memory. The only type of flip-flop required in this class – the D flip-flop – Has.
Circuiti sequenziali1 Progettazione di circuiti e sistemi VLSI Anno Accademico Lezione Circuiti sequenziali.
Galen SasakiEE 260 University of Hawaii1 Building D Flip Flops Combinational circuit components D Clocked Latch: similar to a flip flop but simpler D flip.
Latches CS370 –Spring 2003 Section 4-2 Mano & Kime.
ECE 331 – Digital System Design Latches and Flip-Flops (Lecture #17) The slides included herein were taken from the materials accompanying Fundamentals.
Digital Logic Design Brief introduction to Sequential Circuits and Latches.
ECE 3130 – Digital Electronics and Design Lab 5 Latches and Flip-Flops Fall 2012 Allan Guan.
Latches Module M10.1 Section 7.1. Sequential Logic Combinational Logic –Output depends only on current input Sequential Logic –Output depends not only.
Latches Section 4-2 Mano & Kime. Sequential Logic Combinational Logic –Output depends only on current input Sequential Logic –Output depends not only.
CS 151 Digital Systems Design Lecture 20 Sequential Circuits: Flip flops.
Flip-Flops Section 4.3 Mano & Kime. D Latch Q !Q CLK D !S !R S R X 0 Q 0 !Q 0 D CLK Q !Q Note that Q follows D when the clock in high, and.
Lecture #23 Page 1 ECE 4110– Sequential Logic Design Lecture #23 Agenda 1.Latches and Flip-Flops Review Announcements 1.HW #11assigned.
Objectives: Given input logice levels, state the output of an RS NAND and RS NOR. Given a clock signal, determine the PGT and NGT. Define “Edge Triggered”
Latch Flip flop.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
© BYU 11b MSFF Page 1 ECEn 224 MSFF Master/Slave Flip Flops.
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.
Dept. of Electrical and Computer Eng., NCTU 1 Lab 8. D-type Flip-Flop Presenter: Chun-Hsien Ko Contributors: Chung-Ting Jiang and Lin-Kai Chiu.
Lab 12 :JK Flip Flop Fundamentals: Slide 2 Slide 3 JK Flip-Flop. JK Flip-Flop and waveform diagrams.
CENG 241 Digital Design 1 Lecture 7 Amirali Baniasadi
ECE 301 – Digital Electronics Brief introduction to Sequential Circuits and Latches (Lecture #14)
ECE 331 – Digital System Design Introduction to Sequential Circuits and Latches (Lecture #16)
7. Latches and Flip-Flops Digital Computer Logic.
Sequential logic circuits First Class 1Dr. AMMAR ABDUL-HAMED KHADER.
Computer Science 210 Computer Organization
Computer Architecture & Operations I
Flip Flops.
Lab 08: SR Flip Flop Fundamentals:
Summary Latch & Flip-Flop
Latches. Flip-Flops. Remember the state. Bistable elements.
ECE 3130 – Digital Electronics and Design
Flip-FLops and Latches
Flip Flops.
FIGURE 5.1 Block diagram of sequential circuit
Digital Design Lecture 9
ECE 4110–5110 Digital System Design
FLIP FLOPS.
Flip-Flops SHAH KEVAL EN. NO.: EC DEPARTMENT,
Flip-Flop.
Digital Electronics Flip-Flops
CISE204: Design of Digital Systems Lecture 18 : Sequential Circuits
Latches, Flip-Flops and Registers
Flip Flop.
Computer Science 210 Computer Organization
Flip-FLops and Latches
Latches and Flip-flops
Flip-FLops and Latches
Latches and Flip-Flops 2
Computer Science 210 Computer Organization
Elec 2607 Digital Switching Circuits
Excitation Vectors Input Combinational Logic Memory Output States.
Flip-FLops and Latches
Flip-FLops and Latches
Instructor: Alexander Stoytchev
Lecture 16 Logistics Last lecture Today HW5 out, due next wednesday
Instructor: Alexander Stoytchev
Excitation Vectors Input Combinational Logic Memory Output States.
Storage Elements.
Lecture 16 Logistics Last lecture Today HW5 out, due next wednesday
CSE 370 – Winter Sequential Logic-2 - 1
FLIP-FLOPS.
Latches and Flip-Flops 2
Flip Flops Unit-4.
Flip-FLops and Latches
FLIPFLOPS.
Presentation transcript:

1) Latched, initial state Q =1 NAND Gate Based Latch Transitions A B (AB)’ 0 0 1 0 1 1 1 0 1 1 1 0 S R Clk Q 1 A 1 1 1 B 1) Latched, initial state Q =1 S R Clk Q 1 0->1 A B 2) Latched to transparent, Clk:0->1, no change in Q, neither S nor R are asserted

4a) Transparent, R:1->0, B:0->1, no change in Q NAND Gate Based Latch Transitions A B (AB)’ 0 0 1 0 1 1 1 0 1 1 1 0 S R Clk Q 1 0->1 1->0 A B 3) Transparent, reset is asserted, R: 0->1, B:1->0, Q’:0->1,Q:1->0, Q Flips to 0 S R Clk Q 1 0->1 1->0 A B 4a) Transparent, R:1->0, B:0->1, no change in Q

5) Latched, R: 1->0, no change in Q NAND Gate Based Latch Transitions A B (AB)’ 0 0 1 0 1 1 1 0 1 1 1 0 S R Clk Q 1 0->1 1->0 A B 4b) Starting from 3), transparent to latched, CLK: 1->0, B:0->1, no change In Q S R Clk Q 1 1->0 A B 5) Latched, R: 1->0, no change in Q

6) Latched, S:0->1, no Change In Q NAND Gate Based Latch Transitions A B (AB)’ 0 0 1 0 1 1 1 0 1 1 1 0 S R Clk Q 0->1 1 A B 6) Latched, S:0->1, no Change In Q S R Clk Q 1 1->0 0->1 A B 7) Latched to transparent, Clk:0->1, A:1->0, Q:0->1, Q’:1->0, Q Sets to 1

8) Transparent to latched, CLK: 1->0, A:0->1, no change in Q NAND Gate Based Latch Transitions A B (AB)’ 0 0 1 0 1 1 1 0 1 1 1 0 S R Clk Q 1 0->1 1->0 A B 8) Transparent to latched, CLK: 1->0, A:0->1, no change in Q

Rising Edge Triggered D Flip-Flop Transitions A B (AB)’ 0 0 1 0 1 1 1 0 1 1 1 0 D Clock P4 P3 P1 P2 5 6 1 2 3 Q 4 1 1 TRANSPARENT CLK=0 Holds P1=1 1 1 1 LATCHED 1 1 1 TRANSPARENT CLK=0 Holds P2=1 1 1 1) Initial state, latched, Q=0

2) Rising clock edge, Clk: 0->1, loads the value on D so Q=1=D Rising Edge Triggered D Flip-Flop Transitions A B (AB)’ 0 0 1 0 1 1 1 0 1 1 1 0 D Clock P4 P3 P1 P2 5 6 1 2 3 Q 4 1 1->0 1 1->0 0->1 0->1 1->0 0->1 0->1 1->0 0->1 1 1->0 1 1 2) Rising clock edge, Clk: 0->1, loads the value on D so Q=1=D

Rising Edge Triggered D Flip-Flop Transitions A B (AB)’ 0 0 1 0 1 1 1 0 1 1 1 0 0->1 D Clock P4 P3 P1 P2 5 6 1 2 3 Q 4 1 1 1 1 1 1 1 1 0->1 1 0->1 1->0 3) D changes, doesn’t change Q, Q only changes on the rising edge of Clk

4) Clk goes low, Q doesn’t change and is latched Rising Edge Triggered D Flip-Flop Transitions A B (AB)’ 0 0 1 0 1 1 1 0 1 1 1 0 1 D Clock P4 P3 P1 P2 5 6 1 2 3 Q 4 1->0 0->1 1->0 0->1 1->0 1 1->0 1 0->1 1->0 1 1 1 1 4) Clk goes low, Q doesn’t change and is latched

5) No signal changes Flip-flop is loaded with Q = 1 Rising Edge Triggered D Flip-Flop Transitions A B (AB)’ 0 0 1 0 1 1 1 0 1 1 1 0 1 D Clock P4 P3 P1 P2 5 6 1 2 3 Q 4 1 1 1 1 1 1 1 1 1 5) No signal changes Flip-flop is loaded with Q = 1