By Topic

Decomposition and factorization of sequential 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
$33 $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

2 Author(s)
S. Devadas ; Dept. of Electr. Eng. & Comput. Sci., MIT, Cambridge, MA, USA ; A. R. Newton

Algorithms for decomposing a finite-state machine into smaller interacting machines so as to optimize area and performance of the eventual logic implementation are presented. Cascade decomposition algorithms, which decompose a given machine into an independent and dependent component, have been proposed in the past. However, good cascade decompositions rarely exist in finite-state machine designs. A more powerful form of decomposition whereby both components of the decomposed machine interact with each other is proposed. This form of decomposition involves identifying subroutines or factors in the original machine, extracting these factors, and representing them as a separate factoring machine. The occurrences of these factors become calls to the factoring machine from the factored machine. Given a state-transition-graph description of a machine, algorithms which can identify factors in the machine that produce good decompositions have been developed. Experimental results indicate that this factoring technique is superior to cascade decomposition techniques.<>

Published in:

Computer-Aided Design, 1988. ICCAD-88. Digest of Technical Papers., IEEE International Conference on

Date of Conference:

7-10 Nov. 1988