Accession Number : AD0455645

Title :   SOME STATE-ASSIGNMENT TECHNIQUES FOR LARGE SEQUENTIAL CIRCUITS,

Corporate Author : STANFORD UNIV CA STANFORD ELECTRONICS LABS

Personal Author(s) : Starner, Duane L.

Report Date : AUG 1964

Pagination or Media Count : 54

Abstract : Two state-assignment algorithms are developed, one of which has been programmed for a computer and will handle sequential machines as large as 128 states and 64 inputs. A flow table is used as the machine representation, and properties of the flow table are used to establish state-pair adjacency relationships. For these adjacency relationships a weighting procedure is presented which is used in determining the state codes. The set of state codes used in the algorithms is selected from those sets having some special properties which not only allow preselection of the codes but also reduce the enumeration required in the algorithms. In general, low-cost assignments were obtained without expending large amounts of time. (Author)

Descriptors :   (*COMPUTER LOGIC, MATHEMATICAL LOGIC), (*MATHEMATICAL LOGIC, COMPUTER LOGIC), CODING, CIRCUITS, TABLES(DATA).

Distribution Statement : APPROVED FOR PUBLIC RELEASE