lect11 State Assignment and Partitioning

Lect11 State - CSE140 Components and Design Techniques for Digital Systems Tajana Simunic Rosing 1 Sources TSR Katz Boriello Vahid Perkowski Today

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

View Full Document Right Arrow Icon
1 1 Sources: TSR, Katz, Boriello, Vahid, Perkowski CSE140: Components and Design Techniques for Digital Systems Tajana Simunic Rosing 2 Sources: TSR, Katz, Boriello, Vahid, Perkowski Today • HW#6 due Monday at 4pm to TA’s mailbox in CSE dept. • Midterm on Tuesday 11/7 at class time • Finite State Machine optimization – State assignment – State partitioning • Design examples – Counter design with D, T and JK-FFs – Timing analysis – Sequence recognizer design – Datapath and control design example – Latch and FF design examples – ALU design
Background image of page 1

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

View Full DocumentRight Arrow Icon
2 3 Sources: TSR, Katz, Boriello, Vahid, Perkowski CSE140: Components and Design Techniques for Digital Systems FSM Optimization – State Assignment Tajana Simunic Rosing Sources: TSR, Katz, Boriello, Vahid, Perkowski State tables State minimization State assignment Combinational logic optimization netlist identify and remove equivalent states assign unique binary code to each state use unassigned state-codes as don’t care FSM Optimization Flow Chart
Background image of page 2
3 5 Sources: TSR, Katz, Boriello, Vahid, Perkowski State assignment strategies • Choose bit vectors to assign to each “symbolic” state – huge number even for small values of state bits and states • intractable for state machines of any size • heuristics are necessary for practical solutions – no guarantee of optimality – optimize some metric for the combinational logic • size (amount of logic and number of FFs) • speed (depth of logic and fanout) • dependencies (decomposition) • Possible strategies – sequential – just number states as they appear in the state table – random – pick random codes – one-hot – use as many state bits as there are states – output – use outputs to help encode states – heuristic – rules of thumb that seem to work in most cases 6 Sources: TSR, Katz, Boriello, Vahid, Perkowski One-hot state assignment •S im p l e – easy to encode
Background image of page 3

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

View Full DocumentRight Arrow Icon
Image of page 4
This is the end of the preview. Sign up to access the rest of the document.

This note was uploaded on 02/14/2008 for the course CSE 140 taught by Professor Rosing during the Fall '06 term at UCSD.

Page1 / 13

Lect11 State - CSE140 Components and Design Techniques for Digital Systems Tajana Simunic Rosing 1 Sources TSR Katz Boriello Vahid Perkowski Today

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

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