
Accession Number : AD0260781
Title : A STATE ASSIGNMENT TECHNIQUE FOR SYNCHRONOUS SEQUENTIAL NETWORKS
Corporate Author : STANFORD UNIV CALIF STANFORD ELECTRONICS LABS
Personal Author(s) : DAVIDOW,W.H.
Report Date : 20 JUL 1961
Pagination or Media Count : 1
Abstract : The way in which states are assigned in synchronous sequential networks greatly influences the cost of the associated logic. The state assignment problem is discussed, and an assignment technique is described that is very effective for noncyclic circuits whose logical equations contain les than five variables. The principal advantages of this technique are that it is simple and that it can be applied effectively to find lowcost assignments for almost all synchronous sequential networks. A new approach to the assignment problem is introduced. Statistical predictions rather than absolute minimality are used as a criterion for evaluating the quality of an assignment. An assignment is considered to be good if the probability of finding a better assignment is small. (Author)
Descriptors : *CODING, *DIGITAL COMPUTERS, *DIGITAL SYSTEMS, *ELECTRICAL NETWORKS, ALGEBRAS, COMBINATORIAL ANALYSIS, COMPUTER LOGIC, COMPUTERS, DIODES, MATHEMATICAL ANALYSIS, PROBABILITY, STATISTICAL ANALYSIS
Distribution Statement : APPROVED FOR PUBLIC RELEASE