Day4 - ESE534: Computer Organization Day 4: January 27,...

Info iconThis preview shows pages 1–17. Sign up to view the full content.

View Full Document Right Arrow Icon
Penn ESE534 Spring2010 -- DeHon 1 ESE534: Computer Organization Day 4: January 27, 2010 Sequential Logic (FSMs, Pipelining, FSMD)
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Penn ESE534 Spring2010 -- DeHon 2 Previously Boolean Logic Gates Arithmetic Complexity of computations E.g. area and delay for addition
Background image of page 2
Penn ESE534 Spring2010 -- DeHon 3 Today Sequential Logic Add registers, state Finite-State Machines (FSM) Register Transfer Level (RTL) logic Datapath Reuse Pipelining Latency and Throughput Finite-State Machines with Datapaths (FSMD)
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Preclass Can we solve the problem entirely using Boolean logic functions? Penn ESE534 Spring2010 -- DeHon 4
Background image of page 4
Penn ESE534 Spring2010 -- DeHon 5 Latches, Registers New element is a state element. Canonical instance is a register: remembers the last value it was given until told to change typically signaled by clock D Q >
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Why Registers? Penn ESE534 Spring2010 -- DeHon 6
Background image of page 6
Penn ESE534 Spring2010 -- DeHon 7 Reuse In general, we want to reuse our components in time not disposable logic How do we do allow guarantee disciplined reuse?
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
To Reuse Logic… Make sure all logic completed evaluation Outputs of gates are valid Meaningful to look at them Gates are “finished” with work and ready to be used again Make sure consumers get value Before being overwritten by new calculation (new inputs) Penn ESE534 Spring2010 -- DeHon 8
Background image of page 8
Synchronous Logic Model Data starts Inputs to circuit Registers Perform combinational (boolean) logic Outputs of logic Exit circuit Clocked into registers Given long enough clock Think about registers getting values updated by logic on each clock cycle Penn ESE534 Spring2010 -- DeHon 9
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Penn ESE534 Spring2010 -- DeHon 10 Issues of Timing. .. …many issues in detailed implementation glitches and hazards in logic timing discipline in clocking We’re going to (mostly) work above that level for the most part this term. Will talk about the delay of logic between registers Watch for these details in ESE370/570
Background image of page 10
Preclass How do we build an adder for arbitrary input width? Penn ESE534 Spring2010 -- DeHon 11
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Preclass What did the addition of state register(s) do for us? Penn ESE534 Spring2010 -- DeHon 12
Background image of page 12
Penn ESE534 Spring2010 -- DeHon 13 Added Power Process unbounded input with finite logic State is a finite (bounded) representation of what’s happened before finite amount of stuff can remember to synopsize the past State allows behavior to depend on past (on context)
Background image of page 13

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Penn ESE534 Spring2010 -- DeHon 14 Finite-State Machine (FSM) (Finite Automata) Logic core Plus registers to hold state
Background image of page 14
Penn ESE534 Spring2010 -- DeHon 15 FSM Model FSM – a model of computations More powerful than Boolean logic functions Both Theoretically practically
Background image of page 15

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Penn ESE534 Spring2010 -- DeHon 16 Formal FSM Specification (Abstract from implementation) • An FSM is a sextuple M={K,
Background image of page 16
Image of page 17
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/04/2010 for the course ESE 534 taught by Professor Andredehon during the Spring '10 term at UPenn.

Page1 / 66

Day4 - ESE534: Computer Organization Day 4: January 27,...

This preview shows document pages 1 - 17. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online