Accession Number : AD0284973

Title :   SOME ASPECTS OF THE STATE ASSIGNMENT PROBLEM FOR SEQUENTIAL CIRCUITS

Corporate Author : MASSACHUSETTS INST OF TECH CAMBRIDGE ELECTRONIC SYSTEMS LAB

Personal Author(s) : HARING,DONALD RUSSELL

Report Date : SEP 1962

Pagination or Media Count : 1

Abstract : One of the major steps in the synthesis of switching circuits containing memory is the binary coding of the internal states. The choice of code, called the state assignment, strongly affects the complexity of the circuit realization. Hence, the objective is to find, for a given sequential machine (SM) as typically specified by a flow table and an output table, that state assignment (SA) which minimizes the sequential circuit (SC) complexity. The point of view is taken that the greatest lack in promoting an understanding of the SA problem is a knowledge of the structure of the relationship between the properties of the SM and the properties of the logic required by its SC realization. Consequently, a large part of this report is devoted to developing and using some new techniques for studying the structure of this SM-SC relationship. (Author)

Descriptors :   *SWITCHING CIRCUITS, CODING, COMPUTER LOGIC, MEMORY DEVICES, COMPUTERS, DATA STORAGE SYSTEMS, DIGITAL SYSTEMS, SYNTHESIS

Distribution Statement : APPROVED FOR PUBLIC RELEASE