Chapter 3: Sequential Logic

Similar documents
Sequential Logic. Introduction to Computer Yung-Yu Chuang

3. Sequential Logic 1

Sequential Logic. Sequential circuits. Reuse circuit elements by storing bits in "memory." Introduction to Computer Yung-Yu Chuang

Read-only memory (ROM) Digital logic: ALUs Sequential logic circuits. Don't cares. Bus

Objectives. Combinational logics Sequential logics Finite state machine Arithmetic circuits Datapath

Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Sequential Circuits

COMP2611: Computer Organization. Introduction to Digital Logic

Combinational vs Sequential

Logic Design ( Part 3) Sequential Logic- Finite State Machines (Chapter 3)

A clock is a free-running signal with a cycle time. A clock may be either high or low, and alternates between the two states.

CSE115: Digital Design Lecture 23: Latches & Flip-Flops

Computer Science 324 Computer Architecture Mount Holyoke College Fall Topic Notes: Sequential Circuits

cascading flip-flops for proper operation clock skew Hardware description languages and sequential logic

Sequential logic. Circuits with feedback. How to control feedback? Sequential circuits. Timing methodologies. Basic registers

Logic Design. Flip Flops, Registers and Counters

CprE 281: Digital Logic

Figure 1 shows a simple implementation of a clock switch, using an AND-OR type multiplexer logic.

55:131 Introduction to VLSI Design Project #1 -- Fall 2009 Counter built from NAND gates, timing Due Date: Friday October 9, 2009.

Advanced Devices. Registers Counters Multiplexers Decoders Adders. CSC258 Lecture Slides Steve Engels, 2006 Slide 1 of 20

11. Sequential Elements

ECE 545 Digital System Design with VHDL Lecture 2. Digital Logic Refresher Part B Sequential Logic Building Blocks

Slide Set 6. for ENCM 369 Winter 2018 Section 01. Steve Norman, PhD, PEng

Final Exam review: chapter 4 and 5. Supplement 3 and 4

EECS150 - Digital Design Lecture 3 Synchronous Digital Systems Review. Announcements

(CSC-3501) Lecture 7 (07 Feb 2008) Seung-Jong Park (Jay) CSC S.J. Park. Announcement

CSE140L: Components and Design Techniques for Digital Systems Lab. CPU design and PLDs. Tajana Simunic Rosing. Source: Vahid, Katz

Chapter 6. Flip-Flops and Simple Flip-Flop Applications

Multiplexor (aka MUX) An example, yet VERY useful circuit!

CprE 281: Digital Logic

Sequential Circuits: Latches & Flip-Flops

Sequencing. Lan-Da Van ( 范倫達 ), Ph. D. Department of Computer Science National Chiao Tung University Taiwan, R.O.C. Fall,

Lecture 8: Sequential Logic

Rangkaian Sekuensial. Flip-flop

Clock Domain Crossing. Presented by Abramov B. 1

Unit 11. Latches and Flip-Flops

EEC 118 Lecture #9: Sequential Logic. Rajeevan Amirtharajah University of California, Davis Jeff Parkhurst Intel Corporation

We are here. Assembly Language. Processors Arithmetic Logic Units. Finite State Machines. Circuits Gates. Transistors

Contents Slide Set 6. Introduction to Chapter 7 of the textbook. Outline of Slide Set 6. An outline of the first part of Chapter 7

Computer Systems Architecture

RS flip-flop using NOR gate

DIGITAL SYSTEM FUNDAMENTALS (ECE421) DIGITAL ELECTRONICS FUNDAMENTAL (ECE422) LATCHES and FLIP-FLOPS

ELE2120 Digital Circuits and Systems. Tutorial Note 8

ECE 545 Digital System Design with VHDL Lecture 1. Digital Logic Refresher Part B Sequential Logic Building Blocks

COMP12111: Fundamentals of Computer Engineering

Difference with latch: output changes on (not after) falling clock edge

ECE 545 Digital System Design with VHDL Lecture 1B. Digital Logic Refresher Part B Sequential Logic Building Blocks

Logic and Computer Design Fundamentals. Chapter 7. Registers and Counters

Lecture 10: Sequential Circuits

Digital Integrated Circuits EECS 312

EECS 270 Final Exam Spring 2012

Slide Set 7. for ENEL 353 Fall Steve Norman, PhD, PEng. Electrical & Computer Engineering Schulich School of Engineering University of Calgary

Combinational / Sequential Logic

ECE 341. Lecture # 2

Experiment 8 Introduction to Latches and Flip-Flops and registers

CSE140: Components and Design Techniques for Digital Systems. More D-Flip-Flops. Tajana Simunic Rosing. Sources: TSR, Katz, Boriello & Vahid

Chapter 5 Synchronous Sequential Logic

EE 447/547 VLSI Design. Lecture 9: Sequential Circuits. VLSI Design EE 447/547 Sequential circuits 1

Topic 8. Sequential Circuits 1

Logic Design II (17.342) Spring Lecture Outline

1. Convert the decimal number to binary, octal, and hexadecimal.

Sequential Circuits. Sequential Logic. Circuits with Feedback. Simplest Circuits with Feedback. Memory with Cross-coupled Gates.

! Two inverters form a static memory cell " Will hold value as long as it has power applied

Sequential Logic. Sequential Circuits. ! Timing Methodologies " Cascading flip-flops for proper operation " Clock skew

Lec 24 Sequential Logic Revisited Sequential Circuit Design and Timing

Outcomes. Spiral 1 / Unit 6. Flip-Flops FLIP FLOPS AND REGISTERS. Flip-flops and Registers. Outputs only change once per clock period

COE328 Course Outline. Fall 2007

ECE 263 Digital Systems, Fall 2015

Introduction. NAND Gate Latch. Digital Logic Design 1 FLIP-FLOP. Digital Logic Design 1

Chapter 6. sequential logic design. This is the beginning of the second part of this course, sequential logic.

CS/ECE 250: Computer Architecture. Basics of Logic Design: ALU, Storage, Tristate. Benjamin Lee

Laboratory 1 - Introduction to Digital Electronics and Lab Equipment (Logic Analyzers, Digital Oscilloscope, and FPGA-based Labkit)

Lecture #4: Clocking in Synchronous Circuits

VeriLab. An introductory lab for using Verilog in digital design (first draft) VeriLab

Learning Outcomes. Unit 13. Sequential Logic BISTABLES, LATCHES, AND FLIP- FLOPS. I understand the difference between levelsensitive

Good Evening! Welcome!

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

Flip-flop and Registers

D Latch (Transparent Latch)

The word digital implies information in computers is represented by variables that take a limited number of discrete values.

ELCT201: DIGITAL LOGIC DESIGN

211: Computer Architecture Summer 2016

Design for Testability

Logic Design ( Part 3) Sequential Logic (Chapter 3)

Sequential Logic. E&CE 223 Digital Circuits and Systems (A. Kennings) Page 1

COMP sequential logic 1 Jan. 25, 2016

Sequential Logic Design CS 64: Computer Organization and Design Logic Lecture #14

ALGORITHMS IN HW EECS150 ALGORITHMS IN HW. COMBINATIONAL vs. SEQUENTIAL. Sequential Circuits ALGORITHMS IN HW

WINTER 14 EXAMINATION

2.6 Reset Design Strategy

ECEN454 Digital Integrated Circuit Design. Sequential Circuits. Sequencing. Output depends on current inputs

CS 261 Fall Mike Lam, Professor. Sequential Circuits

EECS150 - Digital Design Lecture 19 - Finite State Machines Revisited

EECS150 - Digital Design Lecture 3 - Timing

CS61C : Machine Structures

Logic Devices for Interfacing, The 8085 MPU Lecture 4

Last time, we saw how latches can be used as memory in a circuit

Outline. EECS150 - Digital Design Lecture 27 - Asynchronous Sequential Circuits. Cross-coupled NOR gates. Asynchronous State Transition Diagram

Sequential Circuit Design: Principle

6. Sequential Logic Flip-Flops

ELE2120 Digital Circuits and Systems. Tutorial Note 7

Transcription:

Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005 www.idc.ac.il/tecs Chapter 3: Sequential Logic Usage and Copyright Notice: Copyright 2005 Noam Nisan and Shimon Schocken This presentation contas lecture materials that accompany the textbook The Elements of Computg Systems by Noam Nisan & Shimon Schocken, MIT Press, 2005. The book web site, www.idc.ac.il/tecs, features 13 such presentations, one for each book chapter. Each presentation is designed to support ab 3 hours of classroom or self-study struction. You are welcome to use or edit this presentation for structional and non-commercial purposes. If you use our materials, we will appreciate it if you will clude them a reference to the book s web site. And, if you have any comments, you can reach us at tecs.ta@gmail.com Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 1

Sequential VS combational logic Combational devices: operate on data only; provide calculation services (e.g. Nand ALU) Sequential devices: conta state and (optionally) operate on data; provide storage / synchronization services (e.g. flip-flop RAM) Sequential devices are clock-based; the clock cycles determe when the states are committed The low-level behavior of clocked / sequential gates is tricky The good news: the complex clock-dependency details can be encapsulated at a very elementary level the computer s logic design. Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 2

Lecture plan Clock A hierarchy of memory chips: Flip-flop gates Bary cells Registers RAM Counters Perspective. Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 3

The Clock HW simulator demo tock tock tock tock clock signal tick tick tick tick cycle cycle cycle cycle In our jargon, a clock cycle = tick-phase (low), followed by a tock-phase (high) In real hardware, the clock is implemented by an oscillator In our hardware simulator, clock cycles can be simulated either Manually, by the user, or Automatically, by a test script. Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 4

Flip-flop HW simulator demo DFF (t) = (t-1) A fundamental state-keepg device For now, let us not worry ab the DFF implementation Memory devices are made from numerous flip-flops All regulated by the same master clock signal Notational convention: sequential chip = (notation) sequential chip clock signal Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 5

1-bit register () Objective: build a storage unit that can: (a) Change its state to a given put (b) Mata its state over time (until changed) DFF load if load(t-1) then (t)=(t-1) else (t)=(t-1) (t) = (t-1) DFF load Basic buildg block (t) = (t-1)? (t) = (t-1)? MUX DFF Won t work if load(t-1) then (t)=(t-1) else (t)=(t-1) OK Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 6

1-bit register (cont.) HW simulator demo Interface load Implementation load MUX DFF if load(t-1) then (t)=(t-1) else (t)=(t-1) Load bit Read logic Write logic Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 7

Multi-bit registers HW simulator demo load load w... w if load(t-1) then (t)=(t-1) else (t)=(t-1) 1-bit register if load(t-1) then (t)=(t-1) else (t)=(t-1) w-bit register Register s width: a trivial parameter Read logic Write logic Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 8

Aside: Hardware Simulation HW simulator tutorial: HW simulator demo Built- chips Clocked chips GUI-empowered chips. Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 9

Random Access Memory (RAM) load HW simulator demo (word) register 0 register 1 register 2. register n-1 (word) address (0 to n-1) RAM n Direct Access Logic Read logic Write logic. Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 10

RAM terface load 16 bits address RAMn 16 bits log 2 n bits Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 11

RAM anatomy RAM 64 RAM8 RAM 8. 8 Register register. register 8 RAM8... register... Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 12

Historical aside: One of Intel s first RAM chips (c. 1972) Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 13

Counter Needed: a storage device that can: (a) set its state to some base value (b) crement the state every clock cycle (c) mata its state (stop crementg) over clock cycles (d) reset its state c load reset w bits PC (counter) w bits If reset(t-1) then (t)=0 else if load(t-1) then (t)=(t-1) else if c(t-1) then (t)=(t-1)+1 else (t)=(t-1) Typical function: program counter Implementation: register chip + some combational logic. Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 14

Sequential VS combational logic (revisited) Combational chip Sequential chip (optional) time delay (optional) comb. logic comb. logic DFF gate(s) comb. logic = some function of () (t) = some function of ((t-1), (t-1)) Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 15

Time matters tock tock tock tock clock signal tick tick tick tick cycle cycle cycle cycle Durg a tick-tock, the ternal states of all the clocked chips are allowed to change, but their puts are latched At the begng of the next tick, the puts of all the clocked chips the architecture commit to the new values. a Reg1 Implications: Challenge: propagation delays Solution: clock synchronization + Cycle length and processg speed. b Reg2 Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 16

Perspective All the memory units described this lecture are standard Typical memory hierarchy (listed creasg access time and decreasg cost): SRAM ( static ), typically used for the cache DRAM ( dynamic ), typically used for ma memory Disk (Elaborate cachg / pagg algorithms) A Flip-flop can be built from Nand gates But... real memory units are highly optimized, usg a great variety of storage technologies. Elements of Computg Systems, Nisan & Schocken, MIT Press, 2005, www.idc.ac.il/tecs, Chapter 3: Sequential Logic slide 17