CEC 220 Digital Circuit Design Sequence Detector Design Wednesday, April 01 CEC 220 Digital Circuit Design Slide 1 of 11.

Slides:



Advertisements
Similar presentations
ENGIN112 L23: Finite State Machine Design Procedure October 27, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 23 Finite State Machine.
Advertisements

Some Slides from: U.C. Berkeley, U.C. Berkeley, Alan Mishchenko, Alan Mishchenko, Mike Miller, Mike Miller, Gaetano Borriello Gaetano Borriello Introduction.
CS1Q Computer Systems Lecture 12 Simon Gay. Lecture 12CS1Q Computer Systems - Simon Gay 2 Design of Sequential Circuits The systematic design of sequential.
TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.
Circuits require memory to store intermediate data
Unit 13 Analysis of Clocked Sequential Circuits Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
Sequential Circuit Design
ECE 331 – Digital System Design Introduction to and Analysis of Sequential Logic Circuits (Lecture #20) The slides included herein were taken from the.
ECE 331 – Digital System Design
6/12/20151 Sequence Detectors Lecture Notes – Lab 4 Sequence detection is the act of recognizing a predefined series of inputs A sequence detector is a.
ECE C03 Lecture 101 Lecture 10 Finite State Machine Design Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Give qualifications of instructors: DAP
Contemporary Logic Design Finite State Machine Design © R.H. Katz Transparency No Chapter #8: Finite State Machine Design Finite State.
Sequential Circuit Design
ECE C03 Lecture 121 Lecture 12 Finite State Machine Design Prith Banerjee ECE C03 Advanced Digital Design Spring 1998.
3/13/20081 Lab 6 Solution Part 1: Design a sequence detector for the sequence “00101” Part 2: a b See sm1.vhdSee sm2.vhd See seq1.vhd.
1 Synchronous Sequential Circuit Design. 2 Sequential circuit design In sequential circuit design, we turn some description into a working circuit – We.
ECE 301 – Digital Electronics
ECE 301 – Digital Electronics Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #17)
ECE 331 – Digital Systems Design Introduction to Sequential Logic Circuits (aka. Finite State Machines) and FSM Analysis (Lecture #19)
9/15/09 - L22 Sequential Circuit Design Copyright Joanne DeGroat, ECE, OSU1 Sequential Circuit Design Creating a sequential circuit to address a.
Lecture 17 General finite state machine (FSM) design
ELEC 256 / Saif Zahir UBC / 2000 Counters An (up/down) k-bit counter produces a sequence of k-bit binary numbers in a response to a COUNT pulse. A k-bit.
ECE 331 – Digital Systems Design Sequential Logic Circuits: FSM Design (Lecture #20)
ECE C03 Lecture 101 Lecture 10 Finite State Machine Design Hai Zhou ECE 303 Advanced Digital Design Spring 2002.
Elevator Controller We’re hired to design a digital elevator controller for a four-floor building st try: Design a counter that counts up.
State Machines.
Unit 14 Derivation of State Graphs
ECE2030 Introduction to Computer Engineering Lecture 16: Finite State Machines Prof. Hsien-Hsin Sean Lee School of Electrical and Computer Engineering.
Chapter #8: Finite State Machine Design
Hussein Bin Sama && Tareq Alawneh
Lecture 18 More Moore/Mealy machines.
L6 – Derivation of State Graphs and Tables. State Graphs and Tables  Problem Statement translation To State Graphs To State Tables  Ref: text : Unit.
1 CSE370, Lecture 19 Lecture 19 u Logistics n Lab 8 this week to be done in pairs íFind a partner before your lab period íOtherwise you will have to wait.
1 © 2014 B. Wilkinson Modification date: Dec Sequential Logic Circuits Previously, we described the basic building blocks of sequential circuits,
Unit 13 Analysis of Clocked Sequential Circuits Ku-Yaw Chang Assistant Professor, Department of Computer Science and Information.
Module : FSM Topic : types of FSM. Two types of FSM The instant of transition from the present to the next can be completely controlled by a clock; additionally,
Introduction to State Machine
Vending Machine Using FSM Aalapee Patel Seth Martin.
1 CSE370, Lecture 18 Lecture 20 u Logistics n HW6 due Wednesday n Lab 7 this week (Tuesday exception) n Midterm 2 Friday (covers material up to simple.
Lecture 5. Sequential Logic 2 Prof. Taeweon Suh Computer Science Education Korea University 2010 R&E Computer System Education & Research.
CSIE.NCTU, DL-6-1 Basic Design Approach of FSM Six Step Process 1. Understand the statement of the Specification 2. Obtain an abstract specification of.
DLD Lecture 26 Finite State Machine Design Procedure.
Finite State Machines This work is licensed under the Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported License. To view a copy of this.
Digital Logic Design.
ANALYSIS OF SEQUENTIAL CIRCUITS by Dr. Amin Danial Asham.
CEC 220 Digital Circuit Design Timing Analysis of State Machines
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
1 ENGG 1015 Tutorial Three Examples of Finite State Machines Supplementary notes Learning Objectives  Learn about Design of Finite State Machines Ack.:

CEC 220 Digital Circuit Design Dice Game Wed, April 06 CEC 220 Digital Circuit Design Slide 1 of 15.
CEC 220 Digital Circuit Design Mealy and Moore State Machines Friday, March 27 CEC 220 Digital Circuit Design Slide 1 of 16.
1 ECE 545 – Introduction to VHDL Algorithmic State Machines Sorting Example ECE 656 Lecture 8.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
Instructor: Alexander Stoytchev CprE 281: Digital Logic.
CEC 220 Digital Circuit Design State Machine Charts Friday, April 11 CEC 220 Digital Circuit Design Slide 1 of 13.
Digital Design: With an Introduction to the Verilog HDL, 5e M. Morris Mano Michael D. Ciletti Copyright ©2013 by Pearson Education, Inc. All rights reserved.
Figure 8.1. The general form of a sequential circuit.
Lecture 13 Derivation of State Graphs and Tables
Digital Design Lecture 9
Synchronous Sequential Circuit Design
ECE 301 – Digital Electronics
Finite State Machines Experiment 4 Introduction
Instructor: Alexander Stoytchev
CSE 370 – Winter Sequential Logic-2 - 1
Lecture 20 Logistics Last lecture Today HW6 due Wednesday
Instructor: Alexander Stoytchev
Lecture 22 Logistics Last lecture Today HW7 is due on Friday
Lecture 22 Logistics Last lecture Today HW7 is due on Friday
CSE 370 – Winter Sequential Logic-2 - 1
Presentation transcript:

CEC 220 Digital Circuit Design Sequence Detector Design Wednesday, April 01 CEC 220 Digital Circuit Design Slide 1 of 11

Lecture Outline Wednesday, April 01 CEC 220 Digital Circuit Design More Sophisticated Sequence Detector Design Incompletely Specified State Graph Boolean State Graph Notation Slide 2 of 11

Sequence Detector Design More Sophisticated Sequence Detector Wednesday, April 01 CEC 220 Digital Circuit Design Develop a sequence detector which asserts its output (Z) if either a “010” or “1001” is detected on the serial input (X)  How should the state machine respond to  X= 0,0,1,0,1,0,0,1,0,0,1,…  Z=  Develop the state graph for a Moore machine solution  Develop the state graph for a Mealy machine solution 0,0,0,1,0,1,1,0,1 Slide 3 of 11

Incompletely Specified State Graphs Wednesday, April 01 CEC 220 Digital Circuit Design Design a Vending Machine  Dispense a stick of gum when 15 ¢ or more is collected and then return to “start”  Accept a single nickel or dime at a time  No change is provided BLOCK DIAGRAM Example behavior: N: 0,1,0,0,0,0,… D: 0,0,1,0,1,1,… Assumption: System clock is “high speed” Assumption: System clock is “high speed” Coin Sensor Vending Machine Gum Dispenser N D Z ClkReset Z: 0,0,1,0,0,1,… Slide 4 of 11

Incompletely Specified State Graphs Wednesday, April 01 CEC 220 Digital Circuit Design State Graph  Moore Machine 00 State Name Output Legend : Input=ND S 0¢ 0 RESET S5 ¢ 0 10 S10 ¢ 0 10 S15 ¢ , 01, Present State Next StatePresent Output (Z) ND=00ND=01ND=10ND=11 S 0¢ S 5¢ S1 0¢ S 15¢ Present State Next StatePresent Output (Z) ND=00ND=01ND=10ND=11 S 0¢ 0 S 5¢ 0 S1 0¢ 0 S 15¢ 1 Present State Next StatePresent Output (Z) ND=00ND=01ND=10ND=11 S 0¢ S1 0¢ S 5¢ X 0 S1 5¢ S 10¢ X 0 S1 5¢ X 0 S0 ¢ X 1, 01 The state graph is incompletely specified!! The state graph is incompletely specified!! Slide 5 of 11

Incompletely Specified State Graphs Wednesday, April 01 CEC 220 Digital Circuit Design Circuit design (D-type flip-flops) Present State Next StatePresent Output (Z) Flip-Flop Inputs (D A D B ) S 0¢ S1 0¢ S 5¢ X0 S1 5¢ S 10¢ X0 S1 5¢ X0 S0 ¢ X1 QAQBQAQB S 0¢ = 00 S 5¢ = 01 S1 0¢ = 10 S15 ¢ =11 State Encodings Present Output (Z) Flip-Flop Inputs (D A D B ) XX XX XX XX1 Present Output (Z) Flip-Flop Inputs (D A D B ) XX XX XX XX XX01011 XX 1100 XX100 XX X0 0101X1 1100X0 1011X X1 0111X0 1100X0 1001X1 Slide 6 of 11

Incompletely Specified State Graphs Wednesday, April 01 CEC 220 Digital Circuit Design State Graph  Mealy Machine 00/0 State Name Legend : Input / Output (ND) S 0¢ RESET S5 ¢ 10 /0 S10 ¢ 10 /0 10/1 00/0 01/0 Present State Next StatePresent Output (Z) S 0¢ S 5¢ S1 0¢ The state graph is incompletely specified!! The state graph is incompletely specified!! 01/1 Present State Next StatePresent Output (Z) S 0¢ 000X S 5¢ 010X S1 0¢ 011X Present State Next StatePresent Output (Z) S 0¢ S1 0¢ S 5¢ X000X S 0¢ S1 0¢ X010X S 0¢ X011X Slide 7 of 11

Incompletely Specified State Graphs Wednesday, April 01 CEC 220 Digital Circuit Design Circuit design (D-type flip-flops) QAQBQAQB S 0¢ = 00 S 5¢ = 01 S1 0¢ =10 State Encodings X0 0100X1 11XXXX 1010X X1 0110X0 11XXXX 1000X0 Present State Next StatePresent Output (Z)Flip-Flop In (D A D B ) S 0¢ S1 0¢ S 5¢ X000X S 0¢ S1 0¢ X010X S 0¢ X011X Present State Next StatePresent Output (Z)Flip-Flop In (D A D B ) XX000X XX010X XX011X 11XX Present State Next StatePresent Output (Z)Flip-Flop In (D A D B ) XX000X001001XX XX010X010010XX XX011X1000 XX 11XX XXXX X0 0101X0 11XXXX 1001X1 Slide 8 of 11

Boolean State Graph Notation Wednesday, April 01 CEC 220 Digital Circuit Design Recall the Moore Machine Chart 00 State Name Output Legend : Input=ND S 0¢ 0 RESET S5 ¢ 0 10 S10 ¢ 0 10 S15 ¢ , 01, 10, 01 NDND RESET S15 ¢ Z Boolean State Graph Notation Slide 9 of 11

Boolean State Graph Notation Wednesday, April 01 CEC 220 Digital Circuit Design Recall the Mealy Machine Chart 00/0 S 0¢ RESET S5 ¢ 10 /0 S10 ¢ 10 /0 10/1 00/0 01/0 01/1 State Name Legend : Input / Output (ND) (Z) S 0¢ S5 ¢ S10 ¢ RESET N  D/Z Slide 10 of 11

Next Lecture Wednesday, April 01 CEC 220 Digital Circuit Design More FSM Examples Slide 11 of 11