An Evolutionary Algorithm for the Synthesis of RAM-Based FSMs

Authors:
Valery Sklyarov
Affiliations:
-
Venue:
IEA/AIE '02 Proceedings of the 15th international conference on Industrial and engineering applications of artificial intelligence and expert systems: developments in applied artificial intelligence
Year:
2002

Citing 3
Cited 1

How to solve it: modern heuristics

How to solve it: modern heuristics
Synthesis and Implementation of RAM-Based Finite State Machines in FPGAs

FPL '00 Proceedings of the The Roadmap to Reconfigurable Computing, 10th International Workshop on Field-Programmable Logic and Applications
Synthesis of Control Circuits with Dynamically Modifiable Behavior on the Basis of Statically Reconfigurable FPGAs

SBCCI '00 Proceedings of the 13th symposium on Integrated circuits and systems design

Reconfigurable models of finite state machines and their implementation in FPGAs

Journal of Systems Architecture: the EUROMICRO Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

It is known that RAM-based finite state machines (FSMs) can be very effectively implemented in reconfigurable hardware with distributed memory blocks. One possible approach to the engineering design of such circuits is based on a fuzzy-state encoding technique. This approach allows rapid construction of high-speed devices based on RAM-blocks of a modest size. The key point in the engineering design process is the development of a state encoding and this problem has a high combinatorial complexity, especially for FSMs with a large number of states. This paper proposes a novel evolutionary algorithm for the solution of this problem.