Referenced Items are not available for this document.
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
- Page(s):
- 11.2/1 - 11.2/4
- Meeting Date :
- 12 May 1991-15 May 1991
- Print ISBN:
- 0-7803-0015-7
- INSPEC Accession Number:
- 4183342
- Conference Location :
- San Diego, CA
- Digital Object Identifier :
- 10.1109/CICC.1991.163988
- Product Type:
- Conference Publications
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 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
