Flow Table Simplification-Some Useful Aids
作者： Stephen H. Unger
关键词: Network analysis 、 Algorithm 、 Computer errors 、 Computer science 、 Reduction (complexity) 、 Heuristic 、 Simple (abstract algebra) 、 Arithmetic 、 Flow (mathematics) 、 Closed set 、 Table (database)
摘要: Three results are presented pertinent to the problem of finding minimum-row versions incompletely specified flow tables for sequential or iterative circuits. 1) Conditions precisely stated under which preliminary mergers can be made without danger ruining opportunities ultimately a minimal-row version. 2) A theorem by McCluskey is generalized show that all if optional entries arise only due restrictions as input states may immediately follow one another, then reduction relatively simple. 3) useful heuristic in form diagram illustrating implication relations 2-member compatibles introduced an aid minimal closed sets compatibles.
sci-hub.se 参考文章(5)
E. J. McCluskey, Minimum-State Sequential Circuits for a Restricted Class of Incompletely Specified Flow Tables* Bell System Technical Journal. ,vol. 41, pp. 1759- 1768 ,(1962) , 10.1002/J.1538-7305.1962.TB00491.X
George H. Mealy, A method for synthesizing sequential circuits The Bell System Technical Journal. ,vol. 34, pp. 1045- 1079 ,(1955) , 10.1002/J.1538-7305.1955.TB03788.X
D.A. Huffman, The synthesis of sequential switching circuits Journal of The Franklin Institute-engineering and Applied Mathematics. ,vol. 257, pp. 161- 190 ,(1954) , 10.1016/0016-0032(54)90574-8
M. C. Paull, S. H. Unger, Minimizing the Number of States in Incompletely Specified Sequential Switching Functions Ire Transactions on Electronic Computers. ,vol. 8, pp. 356- 367 ,(1959) , 10.1109/TEC.1959.5222697
Seymour Ginsburg, A Technique for the Reduction of a Given Machine to a Minimal-State Machine Ire Transactions on Electronic Computers. ,vol. 8, pp. 346- 355 ,(1959) , 10.1109/TEC.1959.5222696