DocumentCode
911218
Title
Optimal state chains and state codes in finite state machines
Author
Amann, Rainer ; Baitinger, Utz G.
Author_Institution
IBM Almaden Res. Center, San Jose, CA, USA
Volume
8
Issue
2
fYear
1989
fDate
2/1/1989 12:00:00 AM
Firstpage
153
Lastpage
170
Abstract
A method is presented for the synthesis of optimal regular digital control structures in VLSI circuits. The controllers are modeled as finite-state machines and implemented using counter-based programmable-logic-array structures. Although those structures have already been used in the past, their complete automated design was impossible, due to missing state-assignment algorithms. The state-assignment algorithms presented to close this gap optimize the required silicon area of the controllers. They are divided into two steps: state-chain calculation and state-chain coding. In state-chain calculation the internal states of a finite-state machine are ordered to maximally exploit the counter characteristics. In state-chain coding the internal states are coded so that the state sequences are maintained, while coding constraints are satisfied that permit a further minimization of the circuit
Keywords
VLSI; finite automata; logic arrays; VLSI circuits; counter-based programmable-logic-array structures; finite state machines; internal states; minimization; optimal regular digital control structures; required silicon area; state codes; state-assignment algorithms; state-chain calculation; state-chain coding; Automata; Automatic control; Circuit synthesis; Design methodology; Digital control; Logic design; Minimization; Programmable logic arrays; Silicon; Very large scale integration;
fLanguage
English
Journal_Title
Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on
Publisher
ieee
ISSN
0278-0070
Type
jour
DOI
10.1109/43.21834
Filename
21834
Link To Document