Notification:
We are currently experiencing intermittent issues impacting performance. We apologize for the inconvenience.
By Topic

New state assignment algorithms for finite state machines using look ahead

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

3 Author(s)
Jai-Joon Yang ; Gold Star Central Res. Lab., Seoul, South Korea ; Hyunchul Shin ; Jong-Wha Chong

Three heuristic algorithms for state assignments in the design of synchronous finite state machines (FSMs) have been developed. The objective is to minimize the estimated area of the implemented FSM. The first method, called look ahead for states (LAS), chooses a state to be assigned and then selects a (locally) optimal code for the state. The second method, called look ahead for codes (LAC), chooses a code and then selects a (locally) optimal state for the code. The third method, called look ahead for states and codes (LASC), considers concurrently states and codes. Experimental results show that the proposed algorithms generate better results on the average than those of several previous approaches

Published in:

Custom Integrated Circuits Conference, 1991., Proceedings of the IEEE 1991

Date of Conference:

12-15 May 1991