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

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

Chapter 3: Sequential Logic

6.3 Sequential Circuits (plus a few Combinational)

ENG2410 Digital Design Registers & Counters

INDIANA UNIVERSITY, DEPT. OF PHYSICS, P400/540 LABORATORY FALL Laboratory #10: Integrated Up-Down Counters and Displays

Embedded and Ambient System Laboratory. Syllabus for FPGA measurements

3. Sequential Logic 1

APPLICATIONS: TELEVISIONS

1722A Global System Clock Streams (aka Media Clock Streams) Principles and Suggestions

Accessing the Options Main Menus

The following example configurations are intended to show how the

How do I use SmartMusic in my everyday classroom instruction?

Introduction to Sequential Circuits

Chapter 8. Digital and Analog Interfacing Methods

Achieve Your Best Design

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

SMART Podium interactive pen display

Chapter. Sequential Circuits

Computer Systems Architecture

COMP2611: Computer Organization. Introduction to Digital Logic

Combinational vs Sequential

ThinManager Certification Test Lab 3

CS 110 Computer Architecture. Finite State Machines, Functional Units. Instructor: Sören Schwertfeger.

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

HD PVR Viewer s Guide V1.02 Page 1 of 30

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

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

CS 261 Fall Mike Lam, Professor. Sequential Circuits

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

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

TMS9927 and TMS9937 Single-Chip Video Timers/Controllers

Media Technology & Instructional Services (MTIS) - Lake Worth Campus

Basics How to cite in-text and at end-of-paper

ELE2120 Digital Circuits and Systems. Tutorial Note 8

Sequential Circuits: Latches & Flip-Flops

6.1 Combinational Circuits

Manual Control. Shutting Down the Mallincam Xtreme

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

ECE 263 Digital Systems, Fall 2015

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

RF-TTC FAQs. September 24. Typical questions about timing signals generated by the RF system and transmitted over fibres to TTC system

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

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

First Name Last Name November 10, 2009 CS-343 Exam 2

COMP12111: Fundamentals of Computer Engineering

Welcome to Palm Beach State College Boca Raton Campus. Use the buttons on the left to assist you in using the Multimedia Classroom Equipment.

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

Logic Devices for Interfacing, The 8085 MPU Lecture 4

CH 11 Latches and Flip-Flops

ECE 250 / CPS 250 Computer Architecture. Basics of Logic Design ALU and Storage Elements

VIEWING PATTERNS BROADEN IN Q2 2015: AUSTRALIAN MULTI-SCREEN REPORT

CHAPTER1: Digital Logic Circuits

The outputs are formed by a combinational logic function of the inputs to the circuit or the values stored in the flip-flops (or both).

MORE SCREENS, MORE OPTIONS TO VIEW: Q AUSTRALIAN MULTI-SCREEN REPORT

SMART Room System for Microsoft Lync

211: Computer Architecture Summer 2016

CS61C : Machine Structures

Hardware Design I Chap. 5 Memory elements

Gfast Analyzer/Field Noise Capture

Go BEARS~ What are Machine Structures? Lecture #15 Intro to Synchronous Digital Systems, State Elements I C

CS 61C: Great Ideas in Computer Architecture

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

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

Lecture 10: Sequential Circuits

WINTER 14 EXAMINATION

Guide to Using Donovan Lounge Technology

#PEAK2019 Sponsorship Opportunities

KEYS TO SUCCESS. September 25, PERCEPTIVE DEVICES LLC 8359 Oakdale Ct, Mason, OH 45040, USA

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

MS Arts Audition Boot Camp Online Application Instructions

Chapter. Synchronous Sequential Circuits

Unit 11. Latches and Flip-Flops

CS3350B Computer Architecture Winter 2015

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

MC9211 Computer Organization

CPS311 Lecture: Sequential Circuits

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

Sequential Logic and Clocked Circuits

Subject guide for MSCIS

EECS150 - Digital Design Lecture 9 - CPU Microarchitecture. CMOS Devices

Sequential logic circuits

DIGITAL CIRCUIT LOGIC UNIT 11: SEQUENTIAL CIRCUITS (LATCHES AND FLIP-FLOPS)

COMP sequential logic 1 Jan. 25, 2016

ELCT201: DIGITAL LOGIC DESIGN

Oxide-based resistive memories: from nanoscale switching to memory circuit

Synchronous Capture of Image Sequences from Multiple Cameras. P. J. Narayanan, Peter Rander, Takeo Kanade CMU-RI-TR-95-25

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

EMT 125 Digital Electronic Principles I CHAPTER 6 : FLIP-FLOP

Congratulations on purchasing your DStv HD PVR 2 P (High Definition Personal Video Recorder) Decoder!

BCN1043. By Dr. Mritha Ramalingam. Faculty of Computer Systems & Software Engineering

Course Administration

Lecture 7: Sequential Networks

Sequential Design Basics

Layered Queueing Network Modeling of Software Systems

Clock Domain Crossing. Presented by Abramov B. 1

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

Release Type: Firmware Software Hardware New Product. WP-577VH Any Yes N/A

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

Introduction This application note describes the VSB-ENC-150E 8-VSB Modulator and its applications.

Logic Design. Flip Flops, Registers and Counters

Transcription:

Sequential Lgic Intrductin t Cmputer Yung-Yu Chuang Review f Cmbatinal Circuits Cmbatinal circuits. Basic abstractin = switch. In prciple, can build TOY cmputer with a cmbatinal circuit. 255 6 = 4,8 puts 2 48 rws truth table! n simple pattern each circuit element used at mst nce Sequential circuits. Reuse circuit elements by strg bits "memry." ALU cmbatinal with slides by Sedgewick & Wayne (trcs.cs.prcetn.edu), Nisan & Schcken (www.nand2tetris.rg) and Harris & Harris (DDCA) Memry state 2 Cmbatinal vs. Sequential Circuits Cmbatinal circuits. Output determed slely by puts. Can draw with n lps. Ex: majrity, adder, ALU. Sequential circuits. Output determed by puts and previus puts. Ex: memry, prgram cunter, CPU. Flip-Flp Flip-flp A small and useful sequential circuit Abstractin that remembers ne bit Basis f imprtant cmputer cmpnents fr register memry cunter There are several flavrs 3 4

S-R flip flp Q=S+RQ R S Q Relay-based flip-flp Ex. Simplest feedback lp. Tw relays A and B, bth cnnected t pwer, each blcked by the ther. State determed by whichever switches first. The state is latched. Stable. put put2 put put2 5 6 SR Flip Flp SR flip flp. Tw crss-cupled NOR gates. Q=R(S+Q) R S Flip-Flp Flip-flp. A way t cntrl the feedback lp. Abstractin that "remembers" ne bit. Basic buildg blck fr memry and registers. Q R S Q Caveat. Need t deal with switchg delay. 7 8

Truth Table and Timg Diagram Truth table. Values vary ver time. S(t), R(t), Q(t) dente value at time t. Sample timg diagram fr SR flip-flp. SR Flip Flp Truth Table S(t) R(t) Q(t) Q(t+ ) Clck. Clck Fundamental abstractin: regular n-ff pulse. n: fetch phase ff: execute phase External analg device. Synchrnizes peratins f different circuit elements. Requirement: clck cycle lnger than max switchg time. cycle time Q R S time Clck n ff 9 Hw much des it Hert? Frequency is verse f cycle time. Expressed hertz. Frequency f Hz means that there is cycle per secnd. kilhertz (khz) means cycles/sec. megahertz (MHz) means millin cycles/sec. gigahertz (GHz) means billin cycles/sec. terahertz (THz) means trillin cycles/sec. Clcked S-R flip-flp Herich Rudlf Hertz (857-894) 2

Clcked D flip-flp Stand-Alne Register 3 4 Register file terface Register file implementatin 5 6

Multiplexer When s=, return x; therwise, return y. Example: (Y S) (X S) X Y S mux Z Tw-put multiplexer 4-t- multiplexer x x x 2 4MUX z x 3 s s 7 8 4-t- multiplexer 8-t- Multiplexer x x x 2 4MUX z x x 2MUX 2MUX z 2 N -t- multiplexer N select puts, 2 N data puts, put Cpies selected data put bit t put x 3 x 2 x 3 2MUX s s s s 9 2

8-t- Multiplexer 2 N -t- multiplexer N select puts, 2 N data puts, put Cpies selected data put bit t put 4-Wide 2-t- Multiplexer Gal: select frm ne f tw 4-bit buses 2 22 4-Wide 2-t- Multiplexer Gal: select frm ne f tw 4-bit buses Implemented by layerg 4 2-t- multiplexer k-wide n-t- Multiplexer Gal: select frm ne f n k-bit buses Implemented by layerg k n-t- multiplexer 23 24

Register file implementatin Memry Overview Cmputers and TOY have several memry cmpnents. Prgram cunter. Registers. Ma memry. Implementatin. Use ne flip-flp fr each bit f memry. Access. Memry cmpnents have different access mechanisms. TOY has 6 bit wrds, 8 bit memry addresses, and 4 bit register names. Organizatin. Need mechanism t manipulate grups f related bits. 25 26 Register Register bit. Extend a flip-flp t allw easy access t values. Register Register bit. Extend a flip-flp t allw easy access t values. D W DW DW 27 28

Memry : Interface Memry bit. Extend a flip-flp t allw easy access t values. Memry : Switch Level Implementatin Memry bit. Extend a flip-flp t allw easy access t values. [ TOY PC, IR ] [ TOY ma memry ] [ TOY registers ] [ TOY PC, IR ] [ TOY ma memry ] [ TOY registers ] 29 3 Prcessr Register Prcessr register. Stres k bits. Register cntents always available n put bus. If enable write is asserted, k put bits get cpied t register. Ex. TOY prgram cunter (PC) hlds 8-bit address. Ex 2. TOY structin register (IR) hlds 6-bit current structin. Prcessr Register Prcessr register. Stres k bits. Register cntents always available n put bus. If enable write is asserted, k put bits get cpied t register. Ex. TOY prgram cunter (PC) hlds 8-bit address. Ex 2. TOY structin register (IR) hlds 6-bit current structin. 3 32

Prcessr Register Prcessr register. Stres k bits. Register cntents always available n put bus. If enable write is asserted, k put bits get cpied t register. Ex. TOY prgram cunter (PC) hlds 8-bit address. Ex 2. TOY structin register (IR) hlds 6-bit current structin. Memry Bank Memry bank. Bank f n registers; each stres k bits. Read and write frmatin t ne f n registers. Address puts specify which ne. lg 2 n address bits needed Addressed bits always appear n put. If write enabled, k put bits are cpied t addressed register. Ex. TOY ma memry. 256-by-6 memry bank. (fur 6-bit wrds) 6-bit put bus Ex 2. TOY registers. 6-by-6 memry bank. Tw put buses. 2-bit address 6-bit put bus 33 34 Memry: Interface Memry: Cmpnent Level Implementatin (fur 6-bit wrds) 35 36

Memry: Switch Level Implementatin (fur 6-bit wrds) Summary Sequential circuits add "state" t digital hardware. Flip-flp. [represents bit] TOY wrd. [6 flip-flps] TOY registers. [6 wrds] TOY ma memry. [256 wrds] Mdern technlgies fr registers and ma memry are different. Few registers, easily accessible, high cst per bit. Huge ma memries, less accessible, lw cst per bit. Drastic evlutin f technlgy ver time. Next. Build a cmplete TOY cmputer. 37 38 The Clck Flip-flp clck signal tck tck cycle cycle cycle cycle In ur jargn, a clck cycle = -phase (lw), fllwed by a tck-phase (high) tck tck DFF (t) = (t-) A fundamental state-keepg device Fr nw, let us nt wrry ab the DFF implementatin Memry devices are made frm numerus flip-flps, all regulated by the same master clck signal Ntatinal cnventin: In real hardware, the clck is implemented by an scillatr In ur hardware simulatr, clck cycles can be simulated either sequential chip = (ntatin) sequential chip Manually, by the user, r Autmatically, by a test script. clck signal

-bit register (we call it ) register (cnt.) Objective: build a strage unit that can: (a) Change its state t a given put (b) Mata its state ver time (until changed) lad Interface Implementatin if lad(t-) then (t)=(t-) else (t)=(t-) lad lad MUX DFF DFF DFF if lad(t-) then (t)=(t-) else (t)=(t-) (t) = (t-) Basic buildg blck (t) = (t-)? (t) = (t-)? Wn t wrk Lad bit Read lgic Write lgic lad Multi-bit register if lad(t-) then (t)=(t-) else (t)=(t-) -bit register w lad... w-bit register if lad(t-) then (t)=(t-) else (t)=(t-) Register s width: a trivial parameter Read lgic Write lgic w Aside: Hardware Simulatin Relevant tpics frm the HW simulatr tutrial: Clcked chips: When a clcked chip is laded t the simulatr, the clck icn is enabled, allwg clck cntrl Built- chips: feature a standard HDL terface yet a Java implementatin Prvide behaviral simulatin services May feature GUI effects (at the simulatr level nly).

Randm Access Memry (RAM) lad RAM terface register lad register (wrd) address ( t n-) register 2. register n- RAM n Direct Access Lgic (wrd) 6 bits address lg 2 n bits RAMn 6 bits Read lgic Write lgic. RAM anatmy RAM 64 Needed: a strage device that can: (a) set its state t sme base value Cunter (b) crement the state every clck cycle RAM8 (c) mata its state (stp crementg) ver clck cycles (d) reset its state c lad reset Register... RAM 8 register. register register 8. RAM8 8... w bits PC (cunter) w bits If reset(t-) then (t)= else if lad(t-) then (t)=(t-) else if c(t-) then (t)=(t-)+ else (t)=(t-) Recursive ascent Typical functin: prgram cunter Implementatin: register chip + sme cmbatinal lgic.

Recap: Sequential VS cmbatinal lgic Cmbatinal chip cmb. lgic (ptinal) cmb. lgic Sequential chip time delay DFF gate(s) (ptinal) cmb. lgic clck signal tck Time matters tck cycle cycle cycle cycle Durg a -tck cycle, the ternal states f all the clcked chips are allwed t change, but their puts are latched tck tck = sme functin f () (t) = sme functin f ((t-), (t-)) At the begng f the next cycle, the puts f all the clcked chips the architecture cmmit t the new values. a Reg Implicatins: Challenge: prpagatin delays sel + Slutin: clck synchrnizatin b Reg2 Cycle length and prcessg speed. Perspective All the memry units described this lecture are standard Typical memry hierarchy Access time Cst SRAM ( static ), typically used fr the cache DRAM ( dynamic ), typically used fr ma memry Disk (Elabrate cachg / pagg algrithms) A Flip-flp can be built frm Nand gates But... real memry units are highly ptimized, usg a great variety f strage technlgies.