Hierarchical finite-state machines and their use for digital control

Authors:
Valery Sklyarov
Affiliations:
Univ. of Aveiro, Aveiro, Portugal
Venue:
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Year:
1999

Citing 0
Cited 6

FPGA-Based Implementation of Genetic Algorithm for the Traveling Salesman Problem and Its Industrial Application

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
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
Reconfigurable models of finite state machines and their implementation in FPGAs

Journal of Systems Architecture: the EUROMICRO Journal
Hardware implementation of hierarchical FSMs

WISICT '05 Proceedings of the 4th international symposium on Information and communication technologies
Synthesis of FSMs on the basis of reusable hardware templates

ISTASC'06 Proceedings of the 6th WSEAS International Conference on Systems Theory & Scientific Computation
Recursion and hierarchy in digital design and prototyping: a case study

Proceedings of the 12th International Conference on Computer Systems and Technologies

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper discusses the behavioral description, logic synthesis, and practical use of control units modeled as hierarchical finite-state machines with virtual states. The technique considered here provides a natural mechanism for top-down decomposition and enables us to develop any complex control algorithm step-by-step, where, at each stage, we are only dealing with a particular level of abstraction. Within any level, the specification encapsulates the control data and functions and allows recursive calls. Finally, the approach enables control units to be designed such that they incorporate new properties such as flexibility and extensibility. The primary functional components of a control algorithm can be reused in future applications.