Lab. on Finite State Machine - PowerPoint PPT Presentation

About This Presentation
Title:

Lab. on Finite State Machine

Description:

Lab. on Finite State Machine Sequence Recognizer Output Z=1 when 1101 is recognized Thus, the sequential machine must remember that the first two one's have occurred ... – PowerPoint PPT presentation

Number of Views:96
Avg rating:3.0/5.0
Slides: 5
Provided by: SUPER346
Category:
Tags: finite | lab | machine | state

less

Transcript and Presenter's Notes

Title: Lab. on Finite State Machine


1
Lab. on Finite State Machine
  • Sequence Recognizer

2
Homework 3 Design a circuit to recognize the
sequence 1101 in a input sequence
  • Output Z1 when 1101 is recognized
  • Thus, the sequential machine must remember that
    the first two one's have occurred as it receives
    another symbol.
  • Also, the sequence 1101101 contains 1101 as both
    an initial subsequence and a final subsequence
    with some overlap, i. e., 1101101 or 1101101.
  • The sequence 1101 must be recognized each time it
    occurs in the input sequence.

3
State Diagram (Moore model)
  • Use
  • JK F.F.
  • binary coding for the states
  • dont care for unused states

4
Simulation
  • Feed a sequence containing 1101 into the designed
    circuit
  • Show the output and states of the circuit
Write a Comment
User Comments (0)
About PowerShow.com