DocumentCode
3140346
Title
Algebraic decomposition of MCNC benchmark FSMs for logic synthesis
Author
Muller-Wipperfurth, T. ; Geiger, Martin
Author_Institution
Johannes Kepler Univ. Linz, Inst. of Syst. Sci., Austria
fYear
1991
fDate
27-31 May 1991
Firstpage
146
Lastpage
151
Abstract
An interactive application of algebraic structure theory is presented to decompose finite state machines (FSMs) for logic synthesis purposes. Parallel and serial decompositions with symbolic states are achieved. CASTOR, JEDI ESPRESSO, and MIS are utilized to perform state assignment and logic minimization. Experimental results of two-level and multi-level implementations of MCNC benchmark FSMs are presented.<>
Keywords
finite state machines; logic CAD; MCNC benchmark FSMs; algebraic decomposition; algebraic structure theory; finite state machines decomposition; logic minimization; logic synthesis; multi-level implementations; state assignment; Automata; Clocks; Control system synthesis; Control systems; Hardware design languages; Logic design; Logic functions; Minimization methods; Research and development; Testing;
fLanguage
English
Publisher
ieee
Conference_Titel
Euro ASIC '91
Conference_Location
Paris, France
Print_ISBN
0-8186-2185-0
Type
conf
DOI
10.1109/EUASIC.1991.212876
Filename
212876
Link To Document