feedback and flip flops
play

Feedback and Flip-Flops Philipp Koehn 7 September 2019 Philipp - PowerPoint PPT Presentation

Dec 24, 2023 •158 likes •629 views

Feedback and Flip-Flops Philipp Koehn 7 September 2019 Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019 The Story So Far 1 We can encode numbers We can do calculation ... but its all a bit

  1. Feedback and Flip-Flops Philipp Koehn 7 September 2019 Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  2. The Story So Far 1 • We can encode numbers • We can do calculation • ... but it’s all a bit static • How about a counter? → this requires "memory" Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  3. 2 feedback Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  4. A Strange Contraption 3 - + Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  5. Let’s Turn It On 4 - + Electricity is on → this opens the normally closed key Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  6. Let’s Turn It On 5 - + Electricity is off → this closes the normally closed key Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  7. What Do We Have? 6 • A Buzzer • A Clock • An Oscillator NOT (symbol) Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  8. Oscillator 7 • Period of oscillator • Frequency: cycles per second • Unit: 1 cycle per second: 1 Hertz • Modern computes: Billions of Hertz = Gigahertz (GHz) Heinrich Hertz 1857--1894 Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  9. 8 flip flop Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  10. Another Contraption 9 NOR V OUT NOR V Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  11. Closing Upper Key 10 NOR V OUT NOR V Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  12. Opening Upper Key 11 NOR V OUT NOR V Same key configuration as initially But: Now OUT is on --- we remembered the key turn Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  13. Closing Lower Key 12 NOR V OUT NOR V Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  14. Opening Lower Key 13 NOR V OUT NOR V Back to initial state Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  15. Memory 14 • We have memory -- called Reset-Set Flip-Flop • Truth table UPPER LOWER OUT 0 0 OUT 0 1 0 1 0 1 1 1 Illegal • UPPER = SET • LOWER = RESET Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  16. Re-Arranged 15 S NOR Q NOR R Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  17. Symmetric 16 S Q NOR Q NOR R Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  18. Truth Table 17 ¯ S R Q Q 1 0 1 0 0 1 0 1 ¯ 0 0 Q Q 1 1 Illegal Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  19. 18 d-type flip flop Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  20. Vision 19 • Control bit ("clock") – on = write to memory – off = read from memory • Data bit – data item to be written • Output – current state of the memory Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  21. Replace Set/Reset with Data 20 DATA Q NOR NOT Q NOR Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  22. Add Control Bit ("Clock") 21 DATA AND Q NOR NOT CLOCK Q NOR AND Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  23. D-Type Flip-Flop 22 • Also called D-type latch • Circuit latches on one bit of memory and keeps it around • Truth table ¯ Data Clock Q Q 0 1 0 1 1 1 1 0 ¯ X 0 Q Q • Can also build these for multiple data bits Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  24. 23 accumulative adder Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  25. Design Goal 24 • Adder has initially value 0 • Adding a number → value increases • Resetting → value goes back to 0 Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  26. Ingredients 25 A7 A6 A5 A4 A3 A2 A1 A0 B7 B6 B5 B4 B3 B2 B1 B0 8-BIT ADDER CI CO S7 S6 S5 S4 S3 S2 S1 S0 D7 D6 D5 D4 D3 D2 D1 D0 8-BIT LATCH CLK Q7 Q6 Q5 Q4 Q3 Q2 Q1 Q0 Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  27. Ingredients 26 8 8 A B 8-BIT ADDER CI CO S 8 8 D 8-BIT LATCH CLK Q 8 Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  28. Building an Accumulative Adder 27 0 8 • Latch: current sum CLOCK D CLK 8-BIT LATCH Q • Clock on → set it to 0 8 Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  29. Building an Accumulative Adder 28 0 8 • Adder CLOCK D CLK 8-BIT LATCH IN Q • Combines 8 8 – current value A B 8-BIT ADDER – selected input CO S CI 8 OUT Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  30. Building an Accumulative Adder 29 0 8 • Can we pass output CLOCK D CLK 8-BIT LATCH IN directly to latch? Q 8 8 • Concerns A B 8-BIT ADDER – select between 0 and sum CO S CI – only stored when clock on 8 OUT Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  31. Building an Accumulative Adder 30 0 8 8 Clear A B 2-1 SELECTOR S 8 • 2-1 selector CLOCK D CLK 8-BIT LATCH IN Q • Either uses 0 or sum 8 8 A B • Built with AND gates 8-BIT ADDER CO S CI 8 • Still have runaway feedback loop... OUT Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  32. Building an Accumulative Adder 31 0 8 8 Clear A B 2-1 SELECTOR • Two Latches S 8 – one to store the sum CLOCK1 D CLK – one to store input to adder 8-BIT LATCH Q S 8 • Clock 1 CLOCK2 D CLK 8-BIT LATCH – carry out addition IN Q – store result 8 8 A B • Clock 2 8-BIT ADDER CO S CI – transfer to set up next addition 8 OUT Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  33. Building an Accumulative Adder 32 0 8 8 Clear A B 2-1 SELECTOR • Combine the clocks S Add 8 • Pressing the add key D CLK 8-BIT LATCH NOT – carry out addition Q S 8 – store result in upper latch D CLK 8-BIT LATCH IN Q • Release the add key 8 8 – transfer to lower latch A B – set up next addition 8-BIT ADDER CO S CI 8 OUT Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  34. What Else? 33 0 8 8 Clear A B 2-1 SELECTOR S • Remember the oscillator? Add 8 D CLK NOT 8-BIT LATCH NOT Q S 8 D CLK 8-BIT LATCH IN Q 8 8 A B 8-BIT ADDER CO S CI 8 OUT Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  35. What Else? 34 0 8 8 Clear A B 2-1 SELECTOR S 8 D NOT CLK 8-BIT LATCH NOT Q S 8 D CLK 8-BIT LATCH IN Q • Each cycle of oscillator: 8 8 A B keeps adding 8-BIT ADDER CO S CI 8 OUT Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  36. What Else? 35 0 8 8 Clear A B 2-1 SELECTOR S 8 D NOT CLK 8-BIT LATCH NOT Q S 8 D CLK 8-BIT LATCH IN Q • We have something interesting here 8 8 A B 8-BIT ADDER CO S CI 8 OUT Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  37. 36 edge triggered flip-flop Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  38. D-Type Latch 37 D Q LATCH CLK Q • When clock is on, save data • "Level-triggered" Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  39. D-Type Latch 38 D Q D Q LATCH LATCH NOT CLK Q CLK Q • "Edge-triggered": changes value, when switched from 0 to 1 Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  40. Edge Triggered D-Type Latch 39 D Q > CLK Q Symbol Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  41. Truth Table 40 ¯ Data Clock Q Q 0 ↑ 0 1 1 ↑ 1 0 ¯ X 0 Q Q Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  42. 41 ripple counter Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  43. Oscillator and Latch 42 D Q NOT > CLK Q ¯ Data Clock Q Q 1 0 0 1 1 ↑ 1 0 0 1 1 0 0 0 1 0 ↑ 0 0 1 1 1 0 1 1 0 0 1 Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

  44. Oscillator and Latch 43 D Q NOT > CLK Q ¯ Data Clock Q Q 1 0 0 1 1 ↑ 1 0 0 1 1 0 0 0 1 0 ↑ 0 0 1 1 1 0 1 1 0 0 1 Philipp Koehn Computer Systems Fundamental: Feedback and Flip-Flops 7 September 2019

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend

Latches and Flip-flops Latches and flip-flops are circuits with memory function. They are part of

Latches and Flip-flops Latches and flip-flops are circuits with memory function. They are part of

Latches and Flip-flops Latches and flip-flops are circuits with memory function. They are part of the computer's memory and processors registers. SR latch is basically the computer memory cell Q=1 Q=0 William Sandqvist william@kth.se

830 views • 56 slides
T flip flop (toggle) TODAY: from flip flops to RAM lecture 6 Sequential circuits 2 Assume

T flip flop (toggle) TODAY: from flip flops to RAM lecture 6 Sequential circuits 2 Assume

T flip flop (toggle) TODAY: from flip flops to RAM lecture 6 Sequential circuits 2 Assume falling edge - T flipflops, counters and timers (finishing last lecture) triggered. - register array - RAM m January 27, 2016 cm Q:

321 views • 4 slides
Lecture 12: Sequential Networks Flip flops and registers CSE 140: Components and Design

Lecture 12: Sequential Networks Flip flops and registers CSE 140: Components and Design

Lecture 12: Sequential Networks Flip flops and registers CSE 140: Components and Design Techniques for Digital Systems Diba Mirza Dept. of Computer Science and Engineering University of California, San Diego 1 D Flip-Flop vs. D Latch

216 views • 19 slides
Lecture 5: Sequential Circuit Design Circuits using flip-flops Now that we know Inputs

Lecture 5: Sequential Circuit Design Circuits using flip-flops Now that we know Inputs

Lecture 5: Sequential Circuit Design Circuits using flip-flops Now that we know Inputs Outputs Combinational Circuit about flip-flops and what they do, how do we use them in circuit Storage Units design? Whats the benefit in

631 views • 33 slides
Synthesizable Verilog Code Examples Last update August 2000 D Type Flip Flops: Two things to note

Synthesizable Verilog Code Examples Last update August 2000 D Type Flip Flops: Two things to note

Synthesizable Verilog Code Examples Last update August 2000 D Type Flip Flops: Two things to note about inferring flip flops: Non blocking signal assignment ( <= ) should always be used The sensitivity list must have the keyword posedge

557 views • 11 slides
Lecture 13: Sequential Networks Flip flops and Finite State Machines CSE 140: Components

Lecture 13: Sequential Networks Flip flops and Finite State Machines CSE 140: Components

Lecture 13: Sequential Networks Flip flops and Finite State Machines CSE 140: Components and Design Techniques for Digital Systems Diba Mirza Dept. of Computer Science and Engineering University of California, San Diego 1 T Flip-Flop

416 views • 29 slides
Goals The Clock introduce clock signal. logical level clock fall clock rise Chapter 11:

Goals The Clock introduce clock signal. logical level clock fall clock rise Chapter 11:

Goals The Clock introduce clock signal. logical level clock fall clock rise Chapter 11: Flip-Flops define edge-triggered flip-flops. clock period discuss parameters of flip-flops: setup time, hold time, 1 Computer Structure pulse width

408 views • 8 slides
Digital Design Discussion: Flip-Flops D-Latch Design Latch vs. Flip-Flop Timing D-latch Design

Digital Design Discussion: Flip-Flops D-Latch Design Latch vs. Flip-Flop Timing D-latch Design

Principles Of Digital Design Discussion: Flip-Flops D-Latch Design Latch vs. Flip-Flop Timing D-latch Design Design a gated D-latch using NAND gates and inverters. Draw the schematic and create a truth table for it. An implementation of

54 views • 4 slides
Spiral 1 / Unit 6 Flip-flops and Registers 1-5.2 Outcomes I know the difference between

Spiral 1 / Unit 6 Flip-flops and Registers 1-5.2 Outcomes I know the difference between

1-5.1 Spiral 1 / Unit 6 Flip-flops and Registers 1-5.2 Outcomes I know the difference between combinational and sequential logic and can name examples of each. I understand latency, throughput, and at least 1 technique to improve

595 views • 25 slides
Lecture 6: Sequential Networks: Latches and flip flops CSE 140: Components and Design Techniques

Lecture 6: Sequential Networks: Latches and flip flops CSE 140: Components and Design Techniques

Lecture 6: Sequential Networks: Latches and flip flops CSE 140: Components and Design Techniques for Digital Systems Diba Mirza Dept. of Computer Science and Engineering University of California, San Diego 1 Flight attendant call button

488 views • 32 slides
Digital Logic Design: a rigorous approach c Chapters 17-20: Flip-Flops, Synchronous Circuits,

Digital Logic Design: a rigorous approach c Chapters 17-20: Flip-Flops, Synchronous Circuits,

Digital Logic Design: a rigorous approach c Chapters 17-20: Flip-Flops, Synchronous Circuits, and Finite State Machines Guy Even Moti Medina School of Electrical Engineering Tel-Aviv Univ. May 31, 2020 Book Homepage:

1.08k views • 75 slides
Flip Flops Lecture 10 CAP 3103 06-18-2014 Uses for State Elements 1. As a place to store

Flip Flops Lecture 10 CAP 3103 06-18-2014 Uses for State Elements 1. As a place to store

Flip Flops Lecture 10 CAP 3103 06-18-2014 Uses for State Elements 1. As a place to store values for some indeterminate amount of time: Register files (like $1-$31 on the MIPS) Memory (caches, and main memory) 2. Help control the

397 views • 23 slides
Digital Logic Design: a rigorous approach c Chapter 17: Flip-Flops Guy Even Moti Medina

Digital Logic Design: a rigorous approach c Chapter 17: Flip-Flops Guy Even Moti Medina

Digital Logic Design: a rigorous approach c Chapter 17: Flip-Flops Guy Even Moti Medina School of Electrical Engineering Tel-Aviv Univ. January 4, 2016 Book Homepage: http://www.eng.tau.ac.il/~guy/Even-Medina 1 / 1 Preliminary

452 views • 20 slides
UMBC A B M A L T F O U M B C I M Y O R T 1 (12/6/04) I E S R C E O V U

UMBC A B M A L T F O U M B C I M Y O R T 1 (12/6/04) I E S R C E O V U

Advanced VLSI Design Sequential Logic Design II CMPE 640 Smaller Static Flip-Flops Positive feedback is not the only means to implement a memory function. A capacitor can act as a memory element as well. In this case, a periodic refresh is

266 views • 22 slides
Flip-Flops Assume the an edge-triggered flip-flop FF implements a Boolean function f with

Flip-Flops Assume the an edge-triggered flip-flop FF implements a Boolean function f with

An edge-triggered flip-flop is not a combinational circuit. Claim: An edge-triggered flip-flop is not a combinational circuit.

214 views • 3 slides
Chapter 5 Synchronous Sequential Logic 5-1 Outline ! Sequential Circuits ! Latches ! Flip-Flops

Chapter 5 Synchronous Sequential Logic 5-1 Outline ! Sequential Circuits ! Latches ! Flip-Flops

Chapter 5 Synchronous Sequential Logic 5-1 Outline ! Sequential Circuits ! Latches ! Flip-Flops ! Analysis of Clocked Sequential Circuits ! State Reduction and Assignment ! Design Procedure 5-2 1 Sequential Circuits ! Consist of a

595 views • 30 slides
Towards a verified Lustre compiler with modular reset Timothy Bourke 1,2 Llio Brun 1,2 Marc

Towards a verified Lustre compiler with modular reset Timothy Bourke 1,2 Llio Brun 1,2 Marc

Towards a verified Lustre compiler with modular reset Timothy Bourke 1,2 Llio Brun 1,2 Marc Pouzet 3,2,1 1 Inria Paris 2 DI ENS 3 UPMC SCOPES 2018 May 30, 2018 Screenshot from ANSYS/Esterel Techologies SCADE Suite 1 / 14 Screenshot from

1.41k views • 92 slides
Q ( 5) Elliptic Curves over Q ( 5) Stein William Stein, University of Washington This is

Q ( 5) Elliptic Curves over Q ( 5) Stein William Stein, University of Washington This is

Curves Over Q ( 5) Elliptic Curves over Q ( 5) Stein William Stein, University of Washington This is part of the NSF-funded AIM FRG project on Databases of L -functions. This talk had much valuable input from Noam Elkies, John Voight,

567 views • 40 slides
Copatterns Programming Infinite Objects by Observations Andreas Abel Department of Computer

Copatterns Programming Infinite Objects by Observations Andreas Abel Department of Computer

Copatterns Programming Infinite Objects by Observations Andreas Abel Department of Computer Science Ludwig-Maximilians-University Munich, Germany Institute of Cybernetics Tallinn, Estonia 4 July 2013 Andreas Abel () Copatterns IOC 2013 1

611 views • 33 slides
Terms in Time and Times in Context: A Graph-based Term-Time Ranking Model Andreas Spitz, Jannik

Terms in Time and Times in Context: A Graph-based Term-Time Ranking Model Andreas Spitz, Jannik

Terms in Time and Times in Context: A Graph-based Term-Time Ranking Model Andreas Spitz, Jannik Str otgen, Thomas B ogel and Michael Gertz Heidelberg University Institute of Computer Science Database Systems Research Group

517 views • 34 slides
A Saucerful of Proofs in Coq Olivier Danvy Department of Computer Science Aarhus University

A Saucerful of Proofs in Coq Olivier Danvy Department of Computer Science Aarhus University

A Saucerful of Proofs in Coq Olivier Danvy Department of Computer Science Aarhus University danvy@cs.au.dk Annapolis, Maryland 8 November 2012 Olivier Danvy, 2.8, Annapolis November 8, 2012 1 / 40 Summing the first odd numbers The

717 views • 60 slides
Pattern and Copattern matching Anton Setzer Swansea University, Swansea UK Leeds Logic Seminar,

Pattern and Copattern matching Anton Setzer Swansea University, Swansea UK Leeds Logic Seminar,

Pattern and Copattern matching Anton Setzer Swansea University, Swansea UK Leeds Logic Seminar, 13 May 2015 Anton Setzer (Swansea) Pattern and Copattern matching 1/ 46 Iteration, Recursion, Induction Coiteration, Corecursion Bisimilarity

701 views • 51 slides
Introduction to the Calculus of Inductive Constructions Workshop X . X , Vienna Summer of

Introduction to the Calculus of Inductive Constructions Workshop X . X , Vienna Summer of

Introduction to the Calculus of Inductive Constructions Workshop X . X , Vienna Summer of Logic Christine Paulin-Mohring e Paris Sud & INRIA Saclay - Universit Ile-de-France July 18, 2014 C. Paulin (Paris-Sud) Calculus of

580 views • 36 slides
of Early Childhood Counties with Funded CECCs (a) Early childhood advocate; Per KRS 200.707(1),

of Early Childhood Counties with Funded CECCs (a) Early childhood advocate; Per KRS 200.707(1),

History of KidsNow Governors Office of Early Childhood Counties with Funded CECCs (a) Early childhood advocate; Per KRS 200.707(1), A council shall (b) Faith community; (c) Family resource center; be composed of no fewer than (d)

400 views • 10 slides

More recommend