{[ promptMessage ]}

Bookmark it

{[ promptMessage ]}

Day4 - ESE534 Computer Organization Day 4 Sequential...

Info icon This 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)
Image of page 1

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

View Full Document Right Arrow Icon
Penn ESE534 Spring2010 -- DeHon 2 Previously Boolean Logic Gates Arithmetic Complexity of computations E.g. area and delay for addition
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)
Image of page 3

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

View Full Document Right Arrow Icon
Preclass Can we solve the problem entirely using Boolean logic functions? Penn ESE534 Spring2010 -- DeHon 4
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 >
Image of page 5

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

View Full Document Right Arrow Icon
Why Registers? Penn ESE534 Spring2010 -- DeHon 6
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?
Image of page 7

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

View Full Document Right 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
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
Image of page 9

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

View Full Document Right 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
Image of page 10
Preclass How do we build an adder for arbitrary input width? Penn ESE534 Spring2010 -- DeHon 11
Image of page 11

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

View Full Document Right Arrow Icon
Preclass What did the addition of state register(s) do for us? Penn ESE534 Spring2010 -- DeHon 12
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)
Image of page 13

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

View Full Document Right Arrow Icon
Penn ESE534 Spring2010 -- DeHon 14 Finite-State Machine (FSM) (Finite Automata) Logic core Plus registers to hold state
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
Image of page 15

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

View Full Document Right Arrow Icon
Penn ESE534 Spring2010 -- DeHon 16 Formal FSM Specification (Abstract from implementation) An FSM is a sextuple M={K, Σ , δ ,s,F, Σ o } K is finite set of states Σ is a finite alphabet for inputs s K is the start state F K is the set of final states Σ o is a finite set of output symbols δ is a transition function from K × Σ to K × Σ o
Image of page 16
Image of page 17
This is the end of the preview. Sign up to access the rest of the document.

{[ snackBarMessage ]}

What students are saying

  • Left Quote Icon

    As a current student on this bumpy collegiate pathway, I stumbled upon Course Hero, where I can find study resources for nearly all my courses, get online help from tutors 24/7, and even share my old projects, papers, and lecture notes with other students.

    Student Picture

    Kiran Temple University Fox School of Business ‘17, Course Hero Intern

  • Left Quote Icon

    I cannot even describe how much Course Hero helped me this summer. It’s truly become something I can always rely on and help me. In the end, I was not only able to survive summer classes, but I was able to thrive thanks to Course Hero.

    Student Picture

    Dana University of Pennsylvania ‘17, Course Hero Intern

  • Left Quote Icon

    The ability to access any university’s resources through Course Hero proved invaluable in my case. I was behind on Tulane coursework and actually used UCLA’s materials to help me move forward and get everything together on time.

    Student Picture

    Jill Tulane University ‘16, Course Hero Intern