Finite State Machine Minimization Advanced Methods based on triangular table and binate covering.

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 9 -- Simplification of Sequential Circuits.
Introduction to Sequential Circuits
Some Slides from: U.C. Berkeley, U.C. Berkeley, Alan Mishchenko, Alan Mishchenko, Mike Miller, Mike Miller, Gaetano Borriello Gaetano Borriello Introduction.
CMPS 3223 Theory of Computation
1 Steps towards State assignment Slides of Mark Schulz used.
VIII - Working with Sequential Logic © Copyright 2004, Gaetano Borriello and Randy H. Katz 1 Finite state machine optimization State minimization  fewer.
TOPIC : Finite State Machine(FSM) and Flow Tables UNIT 1 : Modeling Module 1.4 : Modeling Sequential circuits.
1 State Assignment Using Partition Pairs 2  This method allows for finding high quality solutions but is slow and complicated  Only computer approach.
Digital Logic Design Lecture 27.
CS 151 Digital Systems Design Lecture 25 State Reduction and Assignment.
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
Designing Oracles for Grover Algorithm
08/07/041 CSE-221 Digital Logic Design (DLD) Lecture-8:
ECE C03 Lecture 131 Lecture 13 Finite State Machine Optimization Prith Banerjee ECE C03 Advanced Digital Design Spring 1998.
1 Minimization of Automata It is very likely that problems like this will appear on midterm or final exam. Slides from Tadeusz Luba.
Give qualifications of instructors: DAP
1 COMP541 State Machines Montek Singh Feb 6, 2007.
Spring 2002EECS150 - Lec15-seq2 Page 1 EECS150 - Digital Design Lecture 15 - Sequential Circuits II (Finite State Machines revisited) March 14, 2002 John.
Sources Gang Quan Univ. of Notre Dame Finite State Machines.
ECE 331 – Digital System Design Logic Circuit Design (Lecture #7)
ECE 331 – Digital System Design Sequential Circuit Design (Lecture #23) The slides included herein were taken from the materials accompanying Fundamentals.
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.
ECE Synthesis & Verification, Lecture 17 1 ECE 697B (667) Spring 2006 ECE 697B (667) Spring 2006 Synthesis and Verification of Digital Systems Technology.
Digital Logic Lecture 08 By Amr Al-Awamry. Combinational Logic 1 A combinational circuit consists of an interconnection of logic gates. Combinational.
IKI c-Synthesis of Sequential Logic Bobby Nazief Semester-I The materials on these slides are adopted from: Prof. Daniel Gajski’s transparency.
Zvi Kohavi and Niraj K. Jha 1 Capabilities, Minimization, and Transformation of Sequential Machines.
1 COMP541 State Machines Montek Singh Feb 8, 2012.
Combinatorial Algorithms Unate Covering Binate Covering Graph Coloring Maximum Clique.
Combinational Problems: Unate Covering, Binate Covering, Graph Coloring and Maximum Cliques Example of application: Decomposition.
1 Lecture 22 Sequential Circuits Analysis. 2 Combinational vs. Sequential  Combinational Logic Circuit  Output is a function only of the present inputs.
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.
Introduction to State Machine
Sources Gang Quan Univ. of Notre Dame Finite State Machines.
DLD Lecture 26 Finite State Machine Design Procedure.
Digital Circuits State Reduction and Assignment State Reduction reductions on the number of flip-flops and the number of gates a reduction in the.
CSCI 115 Chapter 8 Topics in Graph Theory. CSCI 115 §8.1 Graphs.
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.
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.
Computer Organization CS345 David Monismith Based upon notes by Dr. Bill Siever and notes from the Patterson and Hennessy Text.
1 COMP541 Sequential Logic – 2: Finite State Machines Montek Singh Feb 29, 2016.
Lecture 1 Gunjeet kaur Dronacharya group of institutions.
Capabilities, Minimization, and Transformation of Sequential Machines
IAY 0600 Digital Systems Design
Richard Anderson Lecture 26 NP-Completeness
COMP541 Sequential Logic – 2: Finite State Machines
Hard Problems Introduction to NP
Asynchronous Inputs of a Flip-Flop
Instructor: Alexander Stoytchev
Example of application: Decomposition
Synthesis of sequential circuits
Synthesis and Verification of Finite State Machines
CH7 Multilevel Gate Network
Synthesis and Verification of Finite State Machines
IAS 0600 Digital Systems Design
Guest Lecture by David Johnston
Combinational Problems: Unate Covering, Binate Covering, Graph Coloring and Maximum Cliques Unit 6 part B.
Instructor: Alexander Stoytchev
Instructor: Alexander Stoytchev
EGR 2131 Unit 12 Synchronous Sequential Circuits
Instructor: Alexander Stoytchev
ECE 352 Digital System Fundamentals
CSE 370 – Winter Sequential Logic-2 - 1
Chapter 9 -- Simplification of Sequential Circuits
Presentation transcript:

Finite State Machine Minimization Advanced Methods based on triangular table and binate covering

Fig 5.17bcd Example 1. Minimize the following Mealy Finite State Machine Input state or combination of input signals Internal state or combination of memory signals Output states or signal combinations

Fig 3.16 Triangular Table Compatibility Graph obtained from the Triangular Table Group {1,2,3,5} 4 Maximum cliques Max cliques are:1235,36,24,46

There are other solutions Can I take {1,2,3,5} and {4,6}?? Solution : {1,2}, {3,5}, {4,6} No, because {1,2,3,5} implies states {3,6} to be in one group. Solution is to split {1,2,3,5} to {1,2} and {3,5} {1,2} implies nothing, {3,5} implies nothing, {4,6} implies {1,2} and {3,5} {1,2} implies nothing, {3,5} implies nothing, {4,6} implies {1,2} and {3,5} I can take all max cliques but solution will be not minimal But how I know to split this way? Heuristics!

Fig5.17a Systematic Method of Creating Maximum Compatible Groups This method is systematic and creates all maximum compatible groups (cliques) In any case creating Maximum Compatible Groups is useful! For small FSMs you can find them by visual inspection

Complete and Closed Subgraph CompleteComplete = all state numbers have been used at least once inside it ClosedClosed = there is no arrow going out of this graph

This way we found other solutions. Please draw machines Closure graph Closure graph for compatibility pairs This method selects subsets of maximum cliques in order to satisfy the completeness and closure conditions for state numbers

This is a final stage of state table minimization It can be done with: 1) ALL groups of compatible states or 2) with the set of complete and closed groups of compatible states Combining groups of compatibles from the cover to single state

Method to combine State Minimization and State Assignment The method shown now is a small modification to state minimization discussed before. However, the differences may be large since we combine state assignment procedure into state minimization loop. We make such choices of compatibles that allow to find a better state assignment. Any state assignment method can be used in this loop.

This is non- deterministic FSM, you can make a choice to simplify state assignment Combining ALL groups of compatibles from the cover to single state Now let us go back to fast method, remember that it is not optimal

Select states from groups to create large groups of the same state Combining ALL groups of compatibles from the cover to single state Select B in whole column Select A in whole column Select C As you see, it is a good idea to combine FSM minimization and state assignment. Many methods are based on this idea.

Creating new table by combining states from groups of compatible states The same method of combining states can be applied to any set of compatible and closed

Fig.5.18 Problem for possible homework: Find an FSM table for which the following triangular table exists:

Fig.5.21.bcd Example 3 of FSM Minimization /- 6/0 3/1 8/0 4/0 8/0 3/0 1/0 -/- 6/0 5/0 1/0 3/1 -/- 2/1 1/ /0 1/0 3/1 8/0 4/0 8/0 3/0 1/0 2/1 1/ {1,6} {2,7} {3} {4,5} {8}

Homework Problems Use a method of combined state minimization and state assignment to realize machines from this and previous lectures and compare the cost of logic circuit realized as a PLA. Write a program for state minimization reducing the problem to binate covering and using existing software for binate covering.