Section 2. Overview Finite state machine Homework 2 preparation Q&A.

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 8
Finite State Machines Finite state machines with output
Introduction to Sequential Circuits
TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.
Finite Automata CPSC 388 Ellen Walker Hiram College.
Give qualifications of instructors: DAP
Sequential Circuits1 DIGITAL LOGIC DESIGN by Dr. Fenghui Yao Tennessee State University Department of Computer Science Nashville, TN.
Lecture # 14 Theory Of Automata By Dr. MM Alam 1.
CS 151 Digital Systems Design Lecture 37 Register Transfer Level
CS 151 Digital Systems Design Lecture 25 State Reduction and Assignment.
DISCUSSION CSE 140L 3 rd November 2010 Vikram Murali.
ECE 331 – Digital System Design
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.
ENEE 408C Lab Capstone Project: Digital System Design Fall 2005 Sequential Circuit Design.
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)
ENGIN112 L25: State Reduction and Assignment October 31, 2003 ENGIN 112 Intro to Electrical and Computer Engineering Lecture 25 State Reduction and Assignment.
Rosen 5th ed., ch. 11 Ref: Wikipedia
ECE 331 – Digital Systems Design Sequential Logic Circuits: FSM Design (Lecture #20)
Unit 14 Derivation of State Graphs
REGULAR LANGUAGES.
CSE 311 Foundations of Computing I Lecture 21 Finite State Machines Autumn 2011 CSE 3111.
CSE 311 Foundations of Computing I Lecture 21 Finite State Machines Spring
EEE2243 Digital System Design Chapter 4: Verilog HDL (Sequential) by Muhazam Mustapha, January 2011.
Important Components, Blocks and Methodologies. To remember 1.EXORS 2.Counters and Generalized Counters 3.State Machines (Moore, Mealy, Rabin-Scott) 4.Controllers.
TRANSITION DIAGRAM BASED LEXICAL ANALYZER and FINITE AUTOMATA Class date : 12 August, 2013 Prepared by : Karimgailiu R Panmei Roll no. : 11CS10020 GROUP.
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,
DLD Lecture 26 Finite State Machine Design Procedure.
SM2220 – Class 06 Finite Automata. SM2220 – Class 06 Topic in theoretical computing. A subset of computation machines. Closely related to formal language.
1 ENGG 1015 Tutorial Three Examples of Finite State Machines Supplementary notes Learning Objectives  Learn about Design of Finite State Machines Ack.:
Digital System Design using VHDL
Finite State Machines 1.Finite state machines with output 2.Finite state machines with no output 3.DFA 4.NDFA.
UNIT - I Formal Language and Regular Expressions: Languages Definition regular expressions Regular sets identity rules. Finite Automata: DFA NFA NFA with.
Testing of Synchronous Sequential Circuits By Dr. Amin Danial Asham.
© 2009 Pearson Education, Upper Saddle River, NJ All Rights ReservedFloyd, Digital Fundamentals, 10 th ed Digital Logic Design Dr. Oliver Faust.
using Deterministic Finite Automata & Nondeterministic Finite Automata
Deterministic Finite Automata Nondeterministic Finite Automata.
COMBINATIONAL AND SEQUENTIAL CIRCUITS Guided By: Prof. P. B. Swadas Prepared By: BIRLA VISHVAKARMA MAHAVDYALAYA.
Govt. Engineering College- Gandhinagar. It is all about……  STATE MACHINE.
Mealy and Moore Machines Lecture 8 Overview Moore Machines Mealy Machines Sequential Circuits.
WELCOME TO A JOURNEY TO CS419 Dr. Hussien Sharaf Dr. Mohammad Nassef Department of Computer Science, Faculty of Computers and Information, Cairo University.
Figure 8.1. The general form of a sequential circuit.
Finite State Machines Dr K R Bond 2009
© Copyright 2004, Gaetano Borriello and Randy H. Katz
Lecture 13 Derivation of State Graphs and Tables
Control & Execution Finite State Machines for Control MIPS Execution.
Testing of Synchronous Sequential Circuits
Asynchronous Inputs of a Flip-Flop
ECE 301 – Digital Electronics
ECE 448 Lecture 6 Finite State Machines State Diagrams vs. Algorithmic State Machine (ASM) Charts.
FINITE STATE MACHINES (FSMs)
Control & Execution Finite State Machines for Control MIPS Execution.
CSE 140L Discussion Finite State Machines.
Instructor: Alexander Stoytchev
CSE 370 – Winter Sequential Logic-2 - 1
CSE 370 – Winter Sequential Logic-2 - 1
Lecture 17 Logistics Last lecture Today HW5 due on Wednesday
Instructor: Alexander Stoytchev
Instructor: Alexander Stoytchev
Lecture 17 Logistics Last lecture Today HW5 due on Wednesday
Instructor: Alexander Stoytchev
EGR 2131 Unit 12 Synchronous Sequential Circuits
Instructor: Alexander Stoytchev
Lecture 5 Scanning.
Mealy and Moore Machines
What is it? The term "Automata" is derived from the Greek word "αὐτόματα" which means "self-acting". An automaton (Automata in plural) is an abstract self-propelled.
Part Two : Nondeterministic Finite Automata
Presentation transcript:

Section 2

Overview Finite state machine Homework 2 preparation Q&A

Finite State Machine

FSM Finite automata / State machines Mathematical abstraction Wide application – Digital design – Communication protocol – Language parsing – Neural System modeling – …

DFA and NFA Deterministic and Non-deterministic Deterministic means there is only one outcome for each state transition DeterministicNon-deterministic

Design an FSM We will design a synchronization circuitry that is used in Gigabit Ethernet. Connection running at 1 Gbit/s … ….

FSM example: sync_fsm FSM that looks for a specific sequence of bits, called comma character. The Gigabit Ethernet standard specifies a few comma characters, – – – in this example, we will design for this pattern: xxx. The leading zero is the first bit received.

Example Bit Stream For example, if the incoming bit streams is …… The synchronization circuitry will catch the patterns in red, and flags the output sync bit to 1, (0 for not-in-sync).

Similar to … Remember when you learn about regular expression? ab*(c|ε) denotes the set of strings starting with a, then zero or more bs and finally optionally a c: {a, ac, ab, abc, abb, abbc,...} The circuit we design operates on 0 or 1 instead of a, b, c…

Elements of FSM Combinational logic that computes next state Memory element that remembers the current state Input and output

State Machine Design Process 1. Determine the inputs and outputs sync_fsm – Input: bit_in, 1-bit – Output: comma_detect, 1-bit

State Machine Design Process 2. Determine the machine states sync_fsm, xxx – S0, initial state – S1, received first 0 – S2, received second 0 – S3 ~ S7, received 1s – S8 ~ S10, received either 0 or 1. – In S10, signal comma_detect

State Machine Design Process 3. Create state/bubble diagram – Mealy or Moore?

State Machine Design Process 4. State assignment – give each state a particular value. – We have 11 states Needs at least 4 bits to encode (compact) One hot encoding (minimize decoding logic) – We use the 4 bit encode.

State Machine Design Process 5. Create Transition/Output Table Current State Next State (Input == 0 ) Next State (Input == 1) Output Current State Next State (Input == 0 ) Next State (Input == 1) Output

State Machine Design Process 6. Derive Next State Logic for each state element.

State Machine Design Process Derive Output Logic Ouput = S[3] & ~S[2] & S[1] & ~S[0]

State Machine Design Process 8. Implement in Logisim

Homework 2 preparation Use tunnel Demo

8-bit input => 10-bit output 8-bit input divided into – 3-bit blocks (HGF) – 5-bit blocks (EDCBA) 10-bit output divided into – 4-bit blocks (fghj) – 6-bit blocks (abcdei)

Running Disparity The difference between the number of 1s transmitted and the number of 0s transmitted is always limited to ±2, and at the end of each state, it is either +1 or 1. This difference is known as the running disparity (RD). This scheme only needs two states for running disparity of +1 and 1. It starts at 1.

Difference between RD- and RD+ for an encoding is XOR. Can minimize to figure out when to XOR and when not.

Split the circuit into smaller components – Cleaner design and easier for testing – 5b/6b encoder, 3b/4b encoder, circuit to figure out more 1 or zero, fsm Find resource (or ask for help) to understand how the encoding works – Make sure any resource you find is the same as what we have on the appendix (Wikipedia isnt always right)

Hints Split the circuit into smaller components – Cleaner design and easier for testing – 5b/6b encoder, 3b/4b encoder, circuit to figure out more 1 or zero, fsm Find resource (or ask for help) to understand how the encoding works – Make sure any resource you find is the same as what we have on the appendix (Wikipedia isnt always right)