scholarly journals Pioneer: A New Tool for Coding of Multi-Level Finite State Machines Based on Evolution Programming

VLSI Design ◽  
1994 ◽  
Vol 2 (2) ◽  
pp. 105-116
Author(s):  
S. Muddappa ◽  
R. Z. Makki ◽  
Z. Michalewicz ◽  
S. Isukapalli
Keyword(s):  
Finite State Machines ◽  
Mutation Rates ◽  
Natural Phenomenon ◽  
State Machines ◽  
State Assignment ◽  
Wide Range ◽  
Finite State ◽  
Multi Level ◽  
Crossover And Mutation ◽  
Evolution Programs

In this paper we present a new tool for the encoding of multi-level finite state machines based on the concept of evolution programming. Evolution programs are stochastic adaptive algorithms, based on the paradigm of genetic algorithms whose search methods model some natural phenomenon: genetic inheritance and Darwinian strife for survival. Crossover and mutation rates were tailored to the state assignment problem experimentally. We present results over a wide range of MCNC benchmarks which demonstrate the effectiveness of the new tool. The results show that evolution programs can be effectively applied to state assignment.

scholarly journals Synthesis of finite state machines for CPLDs

2009 ◽  
Vol 19 (4) ◽  
pp. 647-659 ◽  
Author(s):  
Robert Czerwiński ◽  
Dariusz Kania
Keyword(s):  
Finite State Machines ◽  
Second Step ◽  
State Machines ◽  
State Assignment ◽  
Original State ◽  
Assignment Method ◽  
Area Minimization ◽  
Finite State ◽  
Multi Level

Synthesis of finite state machines for CPLDsThe paper presents a new two-step approach to FSM synthesis for PAL-based CPLDs that strives to find an optimum fit of an FSM to the structure of the CPLD. The first step, the original state assignment method, includes techniques of two-level minimization and aims at area minimization. The second step, PAL-oriented multi-level optimization, is a search for implicants that can be shared by several functions. It is based on the graph of outputs. Results of experiments prove that the presented approach is especially effective for PAL-based CPLD structures containing a low number of product terms.

State assignment in finite state machines for minimal switching power consumption

1994 ◽  
Vol 30 (8) ◽  
pp. 627-629 ◽  
Author(s):  
S.K. Hong ◽  
I.C. Park ◽  
C.M. Kyung ◽  
S.H. Hwang
Keyword(s):  
Power Consumption ◽  
Finite State Machines ◽  
State Machines ◽  
State Assignment ◽  
Switching Power ◽  
Finite State
Sign in / Sign up

Export Citation Format

Share Document