1 ENGG 1015 Tutorial Three Examples of Finite State Machines Supplementary notes Learning Objectives  Learn about Design of Finite State Machines Ack.:

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

Chapter #8: Finite State Machine Design Contemporary Logic Design

FSM Word Problems Today:

Chapter #10: Finite State Machine Implementation

10/2/0810/2/2008ECE 561 -ECE Lecture 51 State Machine Implementation 10/2/20081ECE Lecture 5.

Finite State Machines (FSMs)

Combinational Circuits CS370 – Spring BCD to 7 Segment Display Controller Understanding the problem: input is a 4 bit bcd digit output is the control.

1 Design a state machine to display a character of string HELLO using a seven segment display How many state we need? –Five, one for each character –In.

TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.

Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.

Chapter 3 Digital Logic Structures

Sequential Logic Design Process A sequential circuit that controls Boolean outputs and a specific time- ordered behavior is called a controller. StepDescription.

08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:

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

ECE C03 Lecture 101 Lecture 10 Finite State Machine Design Hai Zhou ECE 303 Advanced Digital Design Spring 2002.

Basic Register A register is a sequential component that can store multiple bits.

Lab 5 Shift Registers and Counters Presented By Neha Kumar but while we wait for that to happen…

Contemporary Logic Design Finite State Machine Design © R.H. Katz Transparency No Chapter #8: Finite State Machine Design 8.5 Finite State Machine.

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.

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

Spring 2002EECS150 - Lec0-intro Page 1 EECS150 - Digital Design Lecture 9 - Finite State Machines 1 February 19, 2002 John Wawrzynek.

Basic Register Typically, we store multi-bit items

Overview Finite State Machines

1 Synchronous Sequential Circuit Design. 2 Sequential circuit design In sequential circuit design, we turn some description into a working circuit – We.

1 Chapter 5: Datapath and Control CS 447 Jason Bakos.

Midterm Wednesday Chapter 1-3: Number /character representation and conversion Number arithmetic CMOS logic elements Combinational logic elements and design.

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Building Functions.

ITEC 352 Lecture 5 Low level components(3). Low level components Review Multiplexers Demultiplexer Minterm/Maxterm Karnaugh Map.

1 Survey of Computer Science CSCI 110, Spring 2011 Lecture 16 Digital Circuits, binary Numbers.

1 COMP541 State Machines Montek Singh Feb 8, 2012.

Elevator Controller We’re hired to design a digital elevator controller for a four-floor building st try: Design a counter that counts up.

Chapter #8: Finite State Machine Design

Quiz What are the results of the following 4-bit bitwise logical operations? NOT OR NOR AND

Introduction to Computer Engineering ECE/CS 252, Fall 2010 Prof. Mikko Lipasti Department of Electrical and Computer Engineering University of Wisconsin.

Introduction to Sequential Logic Design Finite State-Machine Design.

1 Lecture 22 Sequential Circuits Analysis. 2 Combinational vs. Sequential  Combinational Logic Circuit  Output is a function only of the present inputs.

Introduction to State Machine

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Complete Example.

1 Lecture 13 Overview of sequential logic  Basic concepts  An example.

1 ENGG 1015 Tutorial Digital Logic (II) (70 pages) 15 Oct Learning Objectives  Learn about Boolean Algebra (SoP/PoS, DrMorgan's Theorem, simplification),

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.

Digital Logic Design.

1 Ethics of Computing MONT 113G, Spring 2012 Session 1 Digital Circuits, binary Numbers Course webpage:

1 ENGG 1203 Tutorial Combinational Logic (II) and Sequential Logic (I) 8 Feb Learning Objectives  Apply Karnaugh map for logic simplification  Design.

Chapter 3 Digital Logic Structures. Copyright © The McGraw-Hill Companies, Inc. Permission required for reproduction or display. 3-2 Transistor: Building.

1 CS 151: Digital Design Chapter 3: Combinational Logic Design 3-1Design Procedure CS 151: Digital Design.

Digital System Design using VHDL

1 COMP541 Finite State Machines - 1 Montek Singh Sep 22, 2014.

© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.

1 COMP541 Sequential Logic – 2: Finite State Machines Montek Singh Feb 29, 2016.

Lecture 1 Gunjeet kaur Dronacharya group of institutions.

Digital Logic Structures: Chapter 3 COMP 2610 Dr. James Money COMP

Finite State Machines Mealy machine inputs Outputs next state function

COMP541 Sequential Logic – 2: Finite State Machines

Synchronous Sequential Circuit Design

CSE 140L Discussion Finite State Machines.

Instructor: Alexander Stoytchev

Hakim Weatherspoon CS 3410 Computer Science Cornell University

CSE 370 – Winter Sequential Logic - 1

Introduction to Sequential Circuits

LAB #2 Xilinix ISE Foundation Tools Schematic Capture “A Tutorial”

Lecture 17 Logistics Last lecture Today HW5 due on Wednesday

Objectives Construct truth tables for the following logic gates:

XOR Function Logic Symbol  Description  Truth Table 

Lecture 17 Logistics Last lecture Today HW5 due on Wednesday

Instructor: Alexander Stoytchev

Instructor: Alexander Stoytchev

Presentation transcript:

1 ENGG 1015 Tutorial Three Examples of Finite State Machines Supplementary notes Learning Objectives  Learn about Design of Finite State Machines Ack.: ISU CprE 281x, PSU CMPEN270, UPRM

To Detect if # of 1’s in Input is Divisible by 3 Design a state machine with 1 bit of input and 1 bit of output The output bit will be 1 whenever the number of bits in input sequence is divisible by 3 How many states do we need?  In state S0 (00), remainder = 0 (i.e., divisible by 3)  In state S1 ( 01), remainder = 1  In state S2 (10), remainder = 2 Output is 1 whenever in state S0 2

Display Control Design a state machine to display the characters in the string HELLO using a seven segment display Five states in the FSM  In state S0 (000) we display H  In state S1 (001) we display E  In state S2 (010) we display L  In state S3 (011) we display L  In state S4 (100) we display O State transitions are S0  S1, S1  S2, S2  S3, S3  S4, S4  S0 3

Display Control 4

Digital Combination Lock Three bit serial lock controls entry to locked room  Locks generates an UNLOCK signal when key matches internal combination. ERROR light illuminated if key does not match combination. Inputs: RESET, ENTER, 2 position switch for bit of key data. Sequence  Press RESET  Enter key bit  Press ENTER  Repeat (2) & (3) two more times. 5

Digital Combination Lock Problem specification is incomplete  How do you set the internal combination?  Exactly when is the ERROR light asserted? Make reasonable assumptions  Assert as soon as error is detected vs. wait until full combination has been entered Our design  Registered combination plus error after full combination 6

Digital Combination Lock After understanding the problem, we draw a block diagram Inputs: Reset, Enter, Key-In, L0, L1, L2 Outputs: Unlock, Error Then derive the state transition diagram 7

Digital Combination Lock Abstractions in machine design  Based on the requirement, we design the FSM  Based on the FSM, we compute truth table, and then derive Boolean expressions for state transition logic and output logic  Based on Boolean expressions, we design circuits  Based on the designed circuit, we implement the circuit on FPGA. 8