By Topic

Synthesis and Implementation of Hierarchical Finite State Machines with Implicit Modules

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Sklyarov, V. ; DETI, Univ. of Aveiro, Aveiro, Portugal ; Skliarova, I. ; Mihhailov, D. ; Sudnitson, A.

The paper describes a hierarchical finite state machine (HFSM) with implicit modules, which inherits capabilities of existing models (in particular, provides support for modularity, hierarchy, and recursion), requires a very simple stack memory, and permits optimization methods developed for conventional FSMs to be reused. The HFSM has been tested in several practical applications briefly characterized in the paper. It is shown that the same hardware can implement different algorithms through the proposed reconfiguration technique. The results of experiments, reported in the paper, clearly demonstrate advantages of the proposed model.

Published in:

Reconfigurable Computing and FPGAs (ReConFig), 2010 International Conference on

Date of Conference:

13-15 Dec. 2010