CS61C : Machine Structures

Similar documents
CS3350B Computer Architecture Winter 2015

UC Berkeley CS61C : Machine Structures

CS61C : Machine Structures

CS61C : Machine Structures

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

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

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

CS61C : Machine Structures

More Digital Circuits

CS 61C: Great Ideas in Computer Architecture

Sequential Elements con t Synchronous Digital Systems

Lecture 8: Sequential Logic

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

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

Chapter 3. Boolean Algebra and Digital Logic

EE292: Fundamentals of ECE

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

Logic Design II (17.342) Spring Lecture Outline

The basic logic gates are the inverter (or NOT gate), the AND gate, the OR gate and the exclusive-or gate (XOR). If you put an inverter in front of

ELCT201: DIGITAL LOGIC DESIGN

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

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.

CS8803: Advanced Digital Design for Embedded Hardware

CPS311 Lecture: Sequential Circuits

COMP2611: Computer Organization. Introduction to Digital Logic

Advanced Digital Logic Design EECS 303

Logic Design II (17.342) Spring Lecture Outline

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

ECE 301 Digital Electronics

COMP sequential logic 1 Jan. 25, 2016

Asynchronous (Ripple) Counters

Combinational vs Sequential

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

CHAPTER 4: Logic Circuits

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

Introduction to Microprocessor & Digital Logic

Chapter 5 Sequential Circuits

CHAPTER 4: Logic Circuits

Course Administration

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

Lecture 11: Synchronous Sequential Logic

Chapter 1: Switching Algebra Chapter 2: Logical Levels, Timing & Delays. Introduction to latches Chapter 9: Binary Arithmetic

Part II. Chapter2: Synchronous Sequential Logic

Computer Architecture and Organization

RS flip-flop using NOR gate

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

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

Digital Electronics II 2016 Imperial College London Page 1 of 8

EECS150 - Digital Design Lecture 19 - Finite State Machines Revisited

Principles of Computer Architecture. Appendix A: Digital Logic

Department of CSIT. Class: B.SC Semester: II Year: 2013 Paper Title: Introduction to logics of Computer Max Marks: 30

REPEAT EXAMINATIONS 2002

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

Digital Logic Design ENEE x. Lecture 19

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

Using minterms, m-notation / decimal notation Sum = Cout = Using maxterms, M-notation Sum = Cout =

EXPERIMENT: 1. Graphic Symbol: OR: The output of OR gate is true when one of the inputs A and B or both the inputs are true.

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

1.b. Realize a 5-input NOR function using 2-input NOR gates only.

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

More design examples, state assignment and reduction. Page 1

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

EECS150 - Digital Design Lecture 15 Finite State Machines. Announcements

NH 67, Karur Trichy Highways, Puliyur C.F, Karur District UNIT-III SEQUENTIAL CIRCUITS

Chapter 5 Sequential Circuits

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


Find the equivalent decimal value for the given value Other number system to decimal ( Sample)

Computer Systems Architecture

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.

Counter dan Register

Flip-Flops and Sequential Circuit Design

Chapter 5: Synchronous Sequential Logic

Lecture 7: Sequential Networks

Unit 11. Latches and Flip-Flops

Dr. Shahram Shirani COE2DI4 Midterm Test #2 Nov 19, 2008

University of Victoria. Department of Electrical and Computer Engineering. CENG 290 Digital Design I Lab Manual

EECS 270 Midterm 1 Exam Closed book portion Winter 2017

Digital Fundamentals: A Systems Approach

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

Chapter. Synchronous Sequential Circuits

Spring 2017 EE 3613: Computer Organization Chapter 5: The Processor: Datapath & Control - 1

CS Part 1 1 Dr. Rajesh Subramanyan, 2005

SEMESTER ONE EXAMINATIONS 2002

RS flip-flop using NOR gate

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

MODU LE DAY. Class-A, B, AB and C amplifiers - basic concepts, power, efficiency Basic concepts of Feedback and Oscillation. Day 1

Sequential Logic Circuits

MC9211 Computer Organization

Chapter Contents. Appendix A: Digital Logic. Some Definitions

North Shore Community College

Chapter 4: One-Shots, Counters, and Clocks

CS8803: Advanced Digital Design for Embedded Hardware

D Latch (Transparent Latch)

WINTER 15 EXAMINATION Model Answer

To design a sequential logic circuit using D-Flip-flop. To implement the designed circuit.

1. What does the signal for a static-zero hazard look like?

Sequential logic circuits

CS T34-DIGITAL SYSTEM DESIGN Y2/S3

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

Transcription:

CS 6C L4 State () inst.eecs.berkeley.edu/~cs6c/su5 CS6C : Machine Structures Lecture #4: State and FSMs Outline Waveforms State Clocks FSMs 25-7-3 Andy Carle CS 6C L4 State (2) Review (/3) (2/3): Circuit & Algebraic Simplification Use this table and techniques we learned to transform from to another CS 6C L4 State (3) CS 6C L4 State (4) (3/3):Laws of Boolean Algebra Signals and Waveforms Outputs of CL change over time With what? Change in inputs Can graph changes with waveforms CS 6C L4 State (5) CS 6C L4 State (6)

CS 6C L4 State (7) Signals and Waveforms: Adders Signals and Waveforms: Grouping CS 6C L4 State (8) Signals and Waveforms: Circuit Delay State With CL, output is always a function of CURRENT input With some (variable) propagation delay Clearly, we need a way to introduce state into computation CS 6C L4 State (9) CS 6C L4 State () Accumulator Example First try Does this work? Feedback! Want: S=; for i from to n- S = S + X i Nope! Reason # What is there to control the next iteration of the for loop? Reason #2 How do we say: S=? Need a way to store partial sums! CS 6C L4 State () CS 6C L4 State (2)

CS 6C L4 State (3) Circuits with STATE (e.g., register) Register Details What s in it anyway? Need a Logic Block that will:. store output (partial sum) for a while, 2. until we tell it to update with a new value. n instances of a Flip-Flop, called that because the output flips and flops betw., D is data Q is output Also called d-q Flip-Flop, d-type Flip-Flop CS 6C L4 State (4) What s the timing of a Flip-flop? (/2) 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. 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. CS 6C L4 State (5) CS 6C L4 State (6) Bus a bunch of D FFs together Second try How about this? Yep! Register of size N: n instances of D Flip-Flop Rough timing CS 6C L4 State (7) CS 6C L4 State (8)

CS 6C L4 State (9) Accumulator Revisited (proper timing /2) Accumulator Revisited (proper timing 2/2) CS 6C L4 State (2) Pipelining to improve performance (/2) Pipelining to improve performance (2/2) Timing Timing CS 6C L4 State (2) CS 6C L4 State (22) Peer Instruction Administrivia Simplify the following Boolean algebra equation: Q =!(A*B) +!(!A * C) Use algebra, individual steps, etc. Don t just look at it and figure it out, or I ll have to start using harder examples. HW 45 due Monday Project 2 will be released soon If you want to get a little bit ahead (in a moderately fun sort of way), start playing with Logisim: http://ozark.hendrix.edu/~burch/logisim/ CS 6C L4 State (23) CS 6C L4 State (24)

CS 6C L4 State (25) Clocks Clocks Need a regular oscillator: Wire up three inverters in feedback? Not stable enough -> and -> transitions not symmetric. Solution: Base oscillation on a natural resonance. But of what? Crystals and the Piezoelectric effect: Voltage deformation voltage Deformations have a resonant freq. - Function of crystal cut CS 6C L4 State (26) Clocks Signals and Waveforms: Clocks Controller puts AC across crystal: At anything but resonant freqs destructive interference Resonant freq CONSTRUCTIVE! CS 6C L4 State (27) CS 6C L4 State (28) FSMs Finite State Machines Introduction With state elements, we can build circuits whose output is a function of inputs and current state. next state input output Combinational Logic FlipFlop present state State transitions will occur on clock edges. CS 6C L4 State (29) CS 6C L4 State (3)

CS 6C L4 State (3) Finite State Machine Example: 3 ones Hardware Implementation of FSM Draw the FSM + PS Input NS Output =? CS 6C L4 State (32) General Model for Synchronous Systems Peer Instruction 2 Two bit counter: 4 States:,, 2, 3 When input c is high, go to next state - (3->) When input is low, don t change state On the transition from state 3 to state, output a. At all other times, output. CS 6C L4 State (33) CS 6C L4 State (34)