Overview - PowerPoint PPT Presentation

1 / 15
About This Presentation
Title:

Overview

Description:

An abstraction tool to visualize and analyze sequential circuits ... snapshot of all the relevant elements of the system at the moment the snapshot is taken. ... – PowerPoint PPT presentation

Number of Views:19
Avg rating:3.0/5.0
Slides: 16
Provided by: larry109
Category:

less

Transcript and Presenter's Notes

Title: Overview


1
Overview
  • Finite State Machines
  • - Sequential circuits with inputs and outputs
  • State Diagrams
  • - An abstraction tool to visualize and
    analyze sequential circuits

2
Combinational vs. Sequential Logic
  • Two types of combination locks

Combinational Success depends only onthe values,
not the order in which they are set.
Sequential Success depends onthe sequence of
values (e.g, R-13, L-22, R-3).
3
State Machine
  • A type of sequential circuit
  • Combines combinational logic with storage
  • Remembers state, and changes output (and state)
    based on inputs and current state

State Machine
Inputs
Outputs
Combinational Logic Circuit
Storage Elements
4
State
  • The state of a system is a snapshot of all the
    relevant elements of the system at the moment the
    snapshot is taken.
  • Examples
  • The state of a basketball game can be represented
    bythe scoreboard.
  • (Number of points, time remaining, possession,
    etc.)
  • The state of a tic-tac-toe game can be
    represented bythe placement of Xs and Os on
    the board.

5
State of Sequential Lock
  • Our lock example has four different states,
    labelled A-DA The lock is not open, and no
    relevant operations have been performed.
  • B The lock is not open, and the user has
    completed the R-13 operation.
  • C The lock is not open, and the user has
    completed R-13, followed by L-22.
  • D The lock is open.

6
State Diagram
  • Shows states and actions that cause a transition
    between states.

7
Finite State Machine
  • A description of a system with the following
    components
  • A finite number of states
  • A finite number of external inputs
  • A finite number of external outputs
  • An explicit specification of all state
    transitions
  • An explicit specification of what determines each
    external output value
  • Often described by a state diagram.
  • - The set of all possible states.
  • - Inputs that trigger state transitions.
  • - Outputs associated with each state (or with
    each transition).

8
The Clock
  • Frequently, a clock circuit triggers transition
    fromone state to the next.
  • At the beginning of each clock cycle, state
    machine makes a transition, based on the current
    state and the external inputs (Synchronous).
  • Not always required. In lock example, the input
    itself triggers a transition (Asynchronous).

1
0
time?
One Cycle
9
Implementing a Finite State Machine
  • Combinational logic
  • Determine outputs at each state.
  • Determine next state.
  • Storage elements
  • Maintain state representation.

State Machine
Inputs
Outputs
Combinational Logic Circuit
Storage Elements
Clock
10
Storage
  • Each master-slave flipflop stores one state bit.
  • The number of storage elements (flipflops)
    neededis determined by the number of states(and
    the representation of each state).
  • Examples
  • Sequential lock
  • Four states two bits
  • Basketball scoreboard
  • 7 bits for each score digit, 5 bits for minutes,
    6 bits for seconds,1 bit for possession arrow, 1
    bit for half,

11
Complete Example Traffic Sign
  • Design a blinking traffic sign which exhibits
    this behavior
  • State 1) No lights on ?
  • State 2) 1 2 on ?
  • State 3) 1, 2, 3, 4 on ?
  • State 4) 1, 2, 3, 4, 5 on ?
  • State 1) No lights on ?
  • .
  • .
  • .
  • ( - Repeat as long as operate
  • switch is turned on.
  • - The system is in state 1 when
  • the operate switch is off)

3
4
1
5
2
DANGERMOVERIGHT
12
Traffic Sign State Diagram
Switch on
Switch off
State bit S1
State bit S0
Outputs
Transition on each clock cycle.
13
Traffic Sign Truth Tables
Outputs (depend only on state S1S0)
Next State S1 S0(depend on state and input)
Switch
Lights 1 and 2
In S1 S0 S1 S0
0 X X 0 0
1 0 0 0 1
1 0 1 1 0
1 1 0 1 1
1 1 1 0 0
Lights 3 and 4
Light 5
S1 S0 Z Y X
0 0 0 0 0
0 1 1 0 0
1 0 1 1 0
1 1 1 1 1
Whenever In0, next state is 00.
14
Traffic Sign Combinational Logic
Master-slaveflipflop
15
Lab Project 1 Traffic Signal (Due 10/29/07)
  • Part 1
  • Clearly explain a design doesnt have to be the
    one we did
  • Show the timing diagrams for the design
    implementation
  • Part 2
  • Implement your design on the LogicWorks5
    Simulator
  • Capture the timing diagrams from the Simulator
    for your report
  • Part 3 (with ONE partner)
  • Build a circuit(s) in the Laboratory
  • Capture the oscilloscope traces for your report
  • Part 4
  • Document your project in a report written to a
    professional audience of your peers Title Page,
    Abstract, Problem Description, Design, Data,
    Conclusions (include descriptions of problems and
    learning), and References)
  • Have fun, explore, and dont be afraid to be
    creative !
Write a Comment
User Comments (0)
About PowerShow.com