Accession Number : AD0778765

Title :   Research Proposal for Minimal Cost Sequential Machines,

Corporate Author : NORTH CAROLINA STATE UNIV RALEIGH DEPT OF ELECTRICAL ENGINEERING

Personal Author(s) : Staudhammer,John

Report Date : JAN 1974

Pagination or Media Count : 69

Abstract : The state assignment problem for minimal logic required for a general synchronous machine is conceded to be a computationally intractable problem. However research conducted here over the last 18 months indicates that a realistic lower limit may be found on the logic required and that the procedures used to calculate this limit may be taken as a basis for guiding the state assignment such that a circuit approaching this limit may be obtained. Furthermore, the procedure may be used to decide on the kind of memory element to be used. It is proposed to extend these preliminary results to asynchronous machines, to incompletely specified machinenes, and to include output considerations. Further it is proposed to consolidate these findings in a set of algorithms which give an acceptably good state assignment for arbitrary, nontrivial machines. (Modified author abstract)

Descriptors :   *Gates(Circuits), *Logic circuits, Memory devices, Computations, Algorithms, Costs

Subject Categories : Electrical and Electronic Equipment
      Computer Hardware

Distribution Statement : APPROVED FOR PUBLIC RELEASE