CSC258H1 Lecture Notes - Finite-State Machine, Alarm Clock, State Diagram

112 views2 pages
20 Apr 2013
School
Course
Professor

Document Summary

Example #3: counters moved to feb04ce. Finite state machines: let green = 00, yellow = 01, red = 10, state table, from theory courses, mainly used to describe the grammars of a. Derive state table from state diagram: 3. Number of flip-flops needed is ceiling(log2(# of states): 4. Redraw state table with flip-flop values: 5. Derive combinational circuit for output and for each flip-flop input. Fsm example #4: recognizer: recognize a sequence of input values, and raise a signal if that input has been seen, example: three high values in a row. Understood to mean that the input has been high for three rising clock edges. Assumes a single input x and a single output z: 1. In this case, the states are labeled with the input values that have been seen up to now. Transitions between states are indicated by the values on the transition arrows: 2.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents