L11 – State Machine Analysis

Slides:



Advertisements
Similar presentations
L15 – Specification of State Machines
Advertisements

L23 – Adder Architectures. Adders  Carry Lookahead adder  Carry select adder (staged)  Carry Multiplexed Adder  Ref: text Unit 15 9/2/2012 – ECE 3561.
L9 – State Assignment and gate implementation. States Assignment  Rules for State Assignment  Application of rule  Gate Implementation  Ref: text.
STATE DIAGRAM AND STATE TABLES
L7 – Derivation of State Graphs and Tables – Moore Machines.
9/15/09 - L20 Flip FlopsCopyright Joanne DeGroat, ECE, OSU1 Flip Flops Not a gymnastic movement.
9/15/09 - L14 Functional BlocksCopyright Joanne DeGroat, ECE, OSU1 Combinational Functional Blocks & Rudimentary Logic functions.
9/15/09 - L22 Sequential Circuit Design Copyright Joanne DeGroat, ECE, OSU1 Sequential Circuit Design Creating a sequential circuit to address a.
9/15/09 - L25 Registers & Load Enable Copyright Joanne DeGroat, ECE, OSU1 Registers & Load Enable.
9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexers.
L5 – Sequential Circuit Design
9/15/09 - L7 Two Level Circuit Optimization Copyright Joanne DeGroat, ECE, OSU1 Two Level Circuit Optimiztion An easier way to generate a minimal.
9/15/09 - L27 CountersCopyright Joanne DeGroat, ECE, OSU1 Final Exam Review Exam Time: MONDAY o dark 30 7:30AM this room.
L16 – Testbenches for state machines. VHDL Language Elements  More examples HDL coding of class examples Testbench for example  Testing of examples.
L10 – State Machine Design Topics. States Machine Design  Other topics on state machine design Equivalent sequential machines Incompletely specified.
1/8/ L20 Project Step 8 - Data Path Copyright Joanne DeGroat, ECE, OSU1 State Machine Design with an HDL A methodology that works for documenting.
9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexer Circuits.
10/17/11 - L7a The Problem Statement Copyright Joanne DeGroat, ECE, OSU1 The problem statement.
L6 – Derivation of State Graphs and Tables. State Graphs and Tables  Problem Statement translation To State Graphs To State Tables  Ref: text : Unit.
1/8/ L23 Project Step 9 - Sequential Machine Copyright Joanne DeGroat, ECE, OSU1 Project Step 9 Beyond the ALU and Datapath. Sequential Machine.
Sequential Design Basics. Lecture 2 topics  A review of devices that hold state A review of Latches A review of Flip-Flops 8/22/2012 – ECE 3561 Lect.
9/15/09 - L4 Combinational Logic - Gates Copyright Joanne DeGroat, ECE, OSU1 Combinational Logic Circuits – Gates.
9/15/09 - L21 Sequential Circuit Analaysis Copyright Joanne DeGroat, ECE, OSU1 Sequential Circuit Analysis.
9/15/09 - L24 Other FF TypesCopyright Joanne DeGroat, ECE, OSU1 Other FF Types.
9/15/09 - L15 Decoders, Multiplexers Copyright Joanne DeGroat, ECE, OSU1 Decoders and Multiplexer Circuits.
9/15/09 - L26 Shift RegistersCopyright Joanne DeGroat, ECE, OSU1 Shift Registers.
1/8/ Data Path Design & Control Copyright Joanne DeGroat, ECE, OSU1 Processor Data Paths - ALU and Registers Incorporating the ALU into a.
1/8/ Extra CreditCopyright Joanne DeGroat, ECE, OSU1 PS3xcr Extra Credit Project Modification that can be done to the datapath.
9/15/09 - L19 Sequential CircuitsCopyright Joanne DeGroat, ECE, OSU1 Sequential Cirucits.
Project 1.  Two parts Implement a 3 bit Gray Code Counter Implement a 4-to-1 muxtiplexer  Can be done on Altera (Quartis) or Xilinx 8/22/2012 – ECE.
Common Elements in Sequential Design. Lecture 3 topics  Registers and Register Transfer  Shift Registers  Counters Basic Counter Partial sequence counters.
MicroBaby ALU.
2/2/09 - L15 Presentation Guidelines Copyright Joanne DeGroat, ECE, OSU1 Presentation Guidelines.
State Machine Design with an HDL
LATCHES AND FLIP-FLOPS
L5 – Sequential Circuit Design
Modification that can be done to the datapath.
Copyright Joanne DeGroat, ECE, OSU
Processor Data Paths -ALU and Registers
Project Step 2 – A single bit slice of the ALU
Modification that can be done to the datapath.
L10 – additional State Machine examples
Incrementing and Decrementing
Copyright Joanne DeGroat, ECE, OSU
MicroBaby Datapath.
Project Step 1 Due – see webpage
L25 – Datapath ALU.
MicroBaby Datapath.
State Machine Design with an HDL
L22 – Register Set Debugging
Design Specification Document
ВОМР Подмярка 19.2 Възможности за финансиране
Споразумение за партньорство
Step 2 in behavioral modeling. Use of procedures.
Copyright Joanne DeGroat, ECE, OSU
L11 – Midterm Review.
Beyond the ALU and Datapath. Sequential Machine Modeling exercise.
L7s Multiple Output example
Copyright Joanne DeGroat, ECE, OSU
The IEEE Floating Point Standard and execution units for it
Structural Modeling and the Generate Statement
Project Step 2 – A single bit slice of the ALU
L4 – An overview of Quartis
The transaction problem.
L25 – Final Review AU 15 Final Exam – Classroom – Journalism 300
Copyright Joanne DeGroat, ECE, OSU
Beyond the ALU and Datapath. Sequential Machine Modeling exercise.
Copyright Joanne DeGroat, ECE, OSU
Project Step 2 – A single bit slice of the ALU
Structural Modeling and the Generate Statement
Presentation transcript:

L11 – State Machine Analysis

Copyright 2012 - Joanne DeGroat, ECE, OSU Topics Covered Material is that on a typical Fundamentals of Engineering Exam 9/2/2012 – ECE 3561 Lect 10 Copyright 2012 - Joanne DeGroat, ECE, OSU

Example analysis problem 9/2/2012 – ECE 3561 Lect 10 Copyright 2012 - Joanne DeGroat, ECE, OSU

Copyright 2012 - Joanne DeGroat, ECE, OSU Timing Analysis 9/2/2012 – ECE 3561 Lect 10 Copyright 2012 - Joanne DeGroat, ECE, OSU

Copyright 2012 - Joanne DeGroat, ECE, OSU Analysis 9/2/2012 – ECE 3561 Lect 10 Copyright 2012 - Joanne DeGroat, ECE, OSU

Minimum Clock Frequency Is there a minimum frequency? 9/2/2012 – ECE 3561 Lect 10 Copyright 2012 - Joanne DeGroat, ECE, OSU

Copyright 2012 - Joanne DeGroat, ECE, OSU Valid States? 9/2/2012 – ECE 3561 Lect 10 Copyright 2012 - Joanne DeGroat, ECE, OSU

Copyright 2012 - Joanne DeGroat, ECE, OSU Next state logic 9/2/2012 – ECE 3561 Lect 10 Copyright 2012 - Joanne DeGroat, ECE, OSU

Using the State diagram 9/2/2012 – ECE 3561 Lect 10 Copyright 2012 - Joanne DeGroat, ECE, OSU

Copyright 2012 - Joanne DeGroat, ECE, OSU Clock Skew What is clock skew? Skew is the time difference between rising edges 9/2/2012 – ECE 3561 Lect 10 Copyright 2012 - Joanne DeGroat, ECE, OSU

Copyright 2012 - Joanne DeGroat, ECE, OSU More analysis 9/2/2012 – ECE 3561 Lect 10 Copyright 2012 - Joanne DeGroat, ECE, OSU

Copyright 2012 - Joanne DeGroat, ECE, OSU analysis If any of the inputs are high Y will be high. For Y toBe low all the input need to be low. So theCombination needs to be 101 or C. 9/2/2012 – ECE 3561 Lect 10 Copyright 2012 - Joanne DeGroat, ECE, OSU

Copyright 2012 - Joanne DeGroat, ECE, OSU Another Example 9/2/2012 – ECE 3561 Lect 10 Copyright 2012 - Joanne DeGroat, ECE, OSU

Copyright 2012 - Joanne DeGroat, ECE, OSU Timing analysis 9/2/2012 – ECE 3561 Lect 10 Copyright 2012 - Joanne DeGroat, ECE, OSU