Cart (Loading....) | Create Account
Close category search window

State assignment of finite-state machines

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 $31
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

2 Author(s)
Ahmad, I. ; Dept. of Electr. & Comput. Eng., Kuwait Univ., Safat, Kuwait ; Dhodhi, M.K.

The state assignment problem of finite state machines (FSMs) is addressed. State assignment is a mapping from the set of states (symbolic names) of an FSM to the set of binary codes with the objective of minimising the area of the combinational circuit required to realise the FSM. It is one of the most important optimisation problems in the automatic synthesis of sequential circuits, since it has a major impact on the area, speed, power and testability of the circuits. The problem of finding an optimal state assignment is NP-hard. A new scheme is presented based on mean field annealing (MFA) to solve the graph embedding problem which is the main step in the state assignment process. The MFA algorithm combines the characteristics of simulated annealing and the Hopfield neural network. To solve the problem by MFA, the graph embedding problem is mapped into a neural network and an energy function is formulated. Experiments over the MCNC FSM benchmarks demonstrate that the proposed MFA algorithm can produce superior results, compared with the specialised methods such as the MUSTANG, NOVA and genetic algorithm

Published in:

Computers and Digital Techniques, IEE Proceedings -  (Volume:147 ,  Issue: 1 )

Date of Publication:

Jan 2000

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.