CS61C : Machine Structures

Similar documents
CS61C : Machine Structures

UC Berkeley CS61C : Machine Structures

CS3350B Computer Architecture Winter 2015

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

Review C program: foo.c Compiler Assembly program: foo.s Assembler Object(mach lang module): foo.o. Lecture #14

CS61C : Machine Structures

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

Sequential Elements con t Synchronous Digital Systems

More Digital Circuits

CS61C : Machine Structures

CS 61C: Great Ideas in Computer Architecture

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

D Latch (Transparent Latch)

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

EECS150 - Digital Design Lecture 19 - Finite State Machines Revisited

Logic Design II (17.342) Spring Lecture Outline

Logic Design. Flip Flops, Registers and Counters

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

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

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

Synchronous Sequential Logic

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

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

11. Sequential Elements

Lecture 11: Sequential Circuit Design

Logic Design II (17.342) Spring Lecture Outline

More on Flip-Flops Digital Design and Computer Architecture: ARM Edition 2015 Chapter 3 <98> 98

ASYNCHRONOUS COUNTER CIRCUITS

Flip-Flops. Because of this the state of the latch may keep changing in circuits with feedback as long as the clock pulse remains active.

CHAPTER 4: Logic Circuits

The NOR latch is similar to the NAND latch

YEDITEPE UNIVERSITY DEPARTMENT OF COMPUTER ENGINEERING. EXPERIMENT VIII: FLIP-FLOPS, COUNTERS 2014 Fall

Asynchronous (Ripple) Counters

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).

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

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

Advanced Digital Logic Design EECS 303

Lecture 8: Sequential Logic

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

EE141-Fall 2010 Digital Integrated Circuits. Announcements. Homework #8 due next Tuesday. Project Phase 3 plan due this Sat.

PRE J. Figure 25.1a J-K flip-flop with Asynchronous Preset and Clear inputs

Software Engineering 2DA4. Slides 9: Asynchronous Sequential Circuits

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

Unit 9 Latches and Flip-Flops. Dept. of Electrical and Computer Eng., NCTU 1

MASSACHUSETTS INSTITUTE OF TECHNOLOGY Department of Electrical Engineering and Computer Sciences

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.

Sequential Circuit Design: Part 1

COMP2611: Computer Organization. Introduction to Digital Logic

LATCHES & FLIP-FLOP. Chapter 7

Chapter 5 Synchronous Sequential Logic

CPE/EE 427, CPE 527 VLSI Design I Sequential Circuits. Sequencing

CHAPTER 4: Logic Circuits

1. a) For the circuit shown in figure 1.1, draw a truth table showing the output Q for all combinations of inputs A, B and C. [4] Figure 1.

Sequential Circuits. Output depends only and immediately on the inputs Have no memory (dependence on past values of the inputs)

Switching Circuits & Logic Design, Fall Final Examination (1/13/2012, 3:30pm~5:20pm)

Chapter 5: Synchronous Sequential Logic

EECS 373 Design of Microprocessor-Based Systems

Sequential Circuit Design: Part 1

COMP sequential logic 1 Jan. 25, 2016

Introduction to Microprocessor & Digital Logic

EECS150 - Digital Design Lecture 15 Finite State Machines. Announcements

Digital Design, Kyung Hee Univ. Chapter 5. Synchronous Sequential Logic

ENGG 1203 Tutorial. D Flip Flop. D Flip Flop. Q changes when CLK is in Rising edge PGT NGT

Digital Fundamentals: A Systems Approach

CS 151 Final. Instructions: Student ID. (Last Name) (First Name) Signature

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

Administrative issues. Sequential logic

Switching Circuits & Logic Design

Digital Fundamentals

EE141-Fall 2010 Digital Integrated Circuits. Announcements. Synchronous Timing. Latch Parameters. Class Material. Homework #8 due next Tuesday

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

CMSC 313 Preview Slides

Review of digital electronics. Storage units Sequential circuits Counters Shifters

Experiment 8 Introduction to Latches and Flip-Flops and registers

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

Principles of Computer Architecture. Appendix A: Digital Logic

Chapter 3. Boolean Algebra and Digital Logic

Chapter 3 Unit Combinational

Digital Electronics II 2016 Imperial College London Page 1 of 8

Lab #10 Hexadecimal-to-Seven-Segment Decoder, 4-bit Adder-Subtractor and Shift Register. Fall 2017

3 Flip-Flops. The latch is a logic block that has 2 stable states (0) or (1). The RS latch can be forced to hold a 1 when the Set line is asserted.

Lecture 10: Sequential Circuits

Chapter 5 Synchronous Sequential Logic

UNIT-3: SEQUENTIAL LOGIC CIRCUITS

AIM: To study and verify the truth table of logic gates

Lecture 7: Sequential Networks

CHAPTER 11 LATCHES AND FLIP-FLOPS

Chapter 5 Flip-Flops and Related Devices

Sequential logic circuits

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

Universidad Carlos III de Madrid Digital Electronics Exercises

Computer Systems Architecture

CS8803: Advanced Digital Design for Embedded Hardware

Project 6: Latches and flip-flops

IT T35 Digital system desigm y - ii /s - iii

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

Long and Fast Up/Down Counters Pushpinder Kaur CHOUHAN 6 th Jan, 2003

6.S084 Tutorial Problems L05 Sequential Circuits

Digital System Design

Chapter 5 Synchronous Sequential Logic

Transcription:

inst.eecs.berkeley.edu/~cs61c CS61C : Machine Structures Lecture #21 State Elements: Circuits that Remember 2008-3-14 Scott Beamer, Guest Lecturer www.piday.org 3.14159265358979323 8462643383279502884 1971693993751058209 7494459230781640628620899862803482 5342117067982148086513282306647093 8446095505822317253594081284811174 5028410270193852110555964462294895 CS61C L21 State Elements : Circuits that Remember (1)

Review ISA is very important abstraction layer Contract between HW and SW Clocks control pulse of our circuits Voltages are analog, quantized to 0/1 Circuit delays are fact of life Two types of circuits: Stateless Combinational Logic (&,,~) State circuits (e.g., registers) CS61C L21 State Elements : Circuits that Remember (2)

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 flow of information between combinational logic blocks. State elements are used to hold up the movement of information at the inputs to combinational logic blocks and allow for orderly passage. CS61C L21 State Elements : Circuits that Remember (3)

Accumulator Example Why do we need to control the flow of information? Want: S=0; for (i=0;i<n;i++) S = S + X i Assume: Each X value is applied in succession, one per cycle. After n cycles the sum is present on S. CS61C L21 State Elements : Circuits that Remember (4)

First try Does this work? Feedback Nope! Reason #1 What is there to control the next iteration of the ʻforʼ loop? Reason #2 How do we say: ʻS=0ʼ? CS61C L21 State Elements : Circuits that Remember (5)

Second try How about this? Rough timing Register is used to hold up the transfer of data to adder. CS61C L21 State Elements : Circuits that Remember (6)

Register Details Whatʼs inside? n instances of a Flip-Flop Flip-flop name because the output flips and flops between and 0,1 D is data, Q is output Also called d-type Flip-Flop CS61C L21 State Elements : Circuits that Remember (7)

Whatʼs the timing of a Flip-flop? (1/2) Edge-triggered d-type flip-flop This one is positive edge-triggered On the rising edge of the clock, the input d is sampled and transferred to the output. At all other times, the input d is ignored. Example waveforms: CS61C L21 State Elements : Circuits that Remember (8)

Whatʼs the timing of a Flip-flop? (2/2) Edge-triggered d-type flip-flop This one is positive edge-triggered On the rising edge of the clock, the input d is sampled and transferred to the output. At all other times, the input d is ignored. Example waveforms (more detail): CS61C L21 State Elements : Circuits that Remember (9)

Accumulator Revisited (proper timing 1/2) Reset input to register is used to force it to all zeros (takes priority over D input). S i-1 holds the result of the i th -1 iteration. Analyze circuit timing starting at the output of the register. CS61C L21 State Elements : Circuits that Remember (10)

Accumulator Revisited (proper timing 2/2) reset signal shown. Also, in practice X might not arrive to the adder at the same time as S i-1 S i temporarily is wrong, but register always captures correct value. In good circuits, instability never happens around rising edge of clk. CS61C L21 State Elements : Circuits that Remember (11)

Maximum Clock Frequency Hint Frequency = 1/Period What is the maximum frequency of this circuit? Max Delay = Setup Time + CLK-to-Q Delay +CL Delay CS61C L21 State Elements : Circuits that Remember (12)

Pipelining to improve performance (1/2) Extra Register are often added to help speed up the clock rate. Timing Note: delay of 1 clock cycle from input to output. Clock period limited by propagation delay of adder/shifter. CS61C L21 State Elements : Circuits that Remember (13)

Pipelining to improve performance (2/2) Insertion of register allows higher clock frequency. More outputs per second. Timing CS61C L21 State Elements : Circuits that Remember (14)

Recap of Timing Terms Clock (CLK) - steady square wave that synchronizes system Setup Time - when the input must be stable before the rising edge of the CLK Hold Time - when the input must be stable after the rising edge of the CLK CLK-to-Q Delay - how long it takes the output to change, measured from the rising edge Flip-flop - one bit of state that samples every rising edge of the CLK Register - several bits of state that samples on rising edge of CLK or on LOAD CS61C L21 State Elements : Circuits that Remember (15)

Finite State Machines (FSM) Introduction You have seen FSMs in other classes. Same basic idea. The function can be represented with a state transition diagram. With combinational logic and registers, any FSM can be implemented in hardware. CS61C L21 State Elements : Circuits that Remember (16)

Finite State Machine Example: 3 ones FSM to detect the occurrence of 3 consecutive 1ʼs in the input. Draw the FSM Assume state transitions are controlled by the clock: on each clock cycle the machine checks the inputs and moves to a new state and produces a new output CS61C L21 State Elements : Circuits that Remember (17)

Hardware Implementation of FSM Therefore a register is needed to hold the a representation of which state the machine is in. Use a unique bit pattern for each state. + =? Combinational logic circuit is used to implement a function maps from present state and input to next state and output. CS61C L21 State Elements : Circuits that Remember (18)

Hardware for FSM: Combinational Logic Next lecture we will discuss the detailed implementation, but for now can look at its functional specification, truth table form. Truth table PS 00 00 01 01 10 10 Input 0 1 0 1 0 1 NS 00 01 00 10 00 00 Output 0 0 0 0 0 1 CS61C L21 State Elements : Circuits that Remember (19)

General Model for Synchronous Systems Collection of CL blocks separated by registers. Registers may be back-to-back and CL blocks may be back-toback. Feedback is optional. Clock signal(s) connects only to clock input of registers. CS61C L21 State Elements : Circuits that Remember (20)

Peer Instruction A. HW feedback akin to SW recursion B. The minimum period of a usable synchronous circuit is at least the CLK-to-Q delay C. You can build a FSM to signal when an equal number of 0s and 1s CS61C has L21 State Elements appeared : Circuits that Remember in (21) the input. ABC 1: FFF 2: FFT 3: FTF 4: FTT 5: TFF 6: TFT 7: TTF 8: TTT

And In conclusion State elements are used to: Build memories Control the flow of information between other state elements and combinational logic D-flip-flops used to build registers Clocks tell us when D-flip-flops change Setup and Hold times important We pipeline long-delay CL for faster clock Finite State Machines extremely useful Youʼll see them again (150,152) & 164 CS61C L21 State Elements : Circuits that Remember (23)