Optimum State Assignment for Synchronous Sequential Circuits
- 1 December 1972
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-21 (12) , 1365-1373
- https://doi.org/10.1109/T-C.1972.223508
Abstract
The problem of encoding the internal states of synchronous sequential switching circuits so as to minimize the combinational network cost is treated. Cost is defined as the number of AND-OR inputs required in the two-level implementation of each memory element input equation separately ( i.e., the cost is not reduced initially by the existence of common terms between equations). An algorithm has been developed that considers implicitly all distinct state-assignment schemes for a given state table, thus ensuring that the state assignment that results in the least "cost" combinational network is selected. Since any optimum state-assignment scheme is dependent on the type of memory element, the algorithm is designed for use with J-K flip-flop memory elements because of their wide use and versatility.Keywords
This publication has 15 references indexed in Scilit:
- Systematic Procedures for Realizing Synchronous Sequential Machines Using Flip-Flop Memory: Part IIIEEE Transactions on Computers, 1970
- Systematic Procedures for Realizing Synchronous Sequential Machines Using Flip-Flop Memory: Part IIEEE Transactions on Computers, 1969
- Optimization of Reduced Dependencies for Synchronous Sequential MachinesIEEE Transactions on Electronic Computers, 1967
- An Approach to the Assignment of Input CodesIEEE Transactions on Electronic Computers, 1967
- On the structure of realizations using flip-flop memory elementsInformation and Control, 1967
- Some Techniques of State Assignment for Synchronous Sequential MachinesIEEE Transactions on Electronic Computers, 1964
- On the Efficient Assignment of Internal Codes to Sequential MachinesIEEE Transactions on Electronic Computers, 1962
- A Programmed Algorithm for Assigning Internal Codes to Sequential MachinesIEEE Transactions on Electronic Computers, 1962
- Multiple Reduction of Variable Dependency of Sequential MachinesJournal of the ACM, 1962
- A Note on the Number of Internal Variable Assignments for Sequential Switching CircuitsIEEE Transactions on Electronic Computers, 1959