DocumentCode :
1355960
Title :
Minimizing the Number of States in Incompletely Specified Sequential Switching Functions
Author :
Paull, M.C. ; Unger, S.H.
Author_Institution :
Bell Telephone Labs., Inc., Whippany, N. J.
Issue :
3
fYear :
1959
Firstpage :
356
Lastpage :
367
Abstract :
Given a sequential switching function in the form of a flow table in which some of the entries are unspecified, the problem of reducing the number of rows in that flow table is extremely complex, and cannot, in general, be solved by any simple extension of the methods used for completely specified functions. An analysis of the problem is presented, and a partially enumerative solution is evolved. A rough indication of the efficiency of the given procedures may be obtained from the fact that these techniques have been successfully applied to approximately two dozen tables ranging up to about 15 rows. No solution required more than two hours.
Keywords :
Circuit synthesis; Minimization methods; Sequential circuits; Switching circuits;
fLanguage :
English
Journal_Title :
Electronic Computers, IRE Transactions on
Publisher :
ieee
ISSN :
0367-9950
Type :
jour
DOI :
10.1109/TEC.1959.5222697
Filename :
5222697
Link To Document :
بازگشت