DocumentCode
1943526
Title
A fast algorithm for the optimal state assignment of large finite state machines
Author
Varma, D. ; Trachtenberg, E.A.
Author_Institution
Electr. Comput. Eng. Dept., Drexel Univ., Philadelphia, PA, USA
fYear
1988
fDate
7-10 Nov. 1988
Firstpage
152
Lastpage
155
Abstract
A state-assignment procedure is presented that uses only abstract complexity criteria and produces assignments that are not targeted toward particular implementations. It produces networks similar in complexity to those obtained by contemporary methods but is an order of magnitude faster, because it does not use computationally expensive logic synthesis algorithms to predict the effect of assignment on synthesis. Assignments for finite-state machines typically took about 10 minutes on a VAX 11/780.<>
Keywords
DEC computers; computational complexity; finite automata; logic CAD; 10 min; VAX 11/780; abstract complexity criteria; fast algorithm; large finite state machines; optimal state assignment; Automata; Circuits; Cost function; Delay; Design optimization; Minimization methods; Network synthesis; Polynomials; Prediction algorithms; Programmable logic arrays;
fLanguage
English
Publisher
ieee
Conference_Titel
Computer-Aided Design, 1988. ICCAD-88. Digest of Technical Papers., IEEE International Conference on
Conference_Location
Santa Clara, CA, USA
Print_ISBN
0-8186-0869-2
Type
conf
DOI
10.1109/ICCAD.1988.122483
Filename
122483
Link To Document