On Control Memory Minimization in Microprogrammed Digital Computers
- 1 September 1973
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Computers
- Vol. C-22 (9) , 845-848
- https://doi.org/10.1109/tc.1973.5009176
Abstract
The problem of minimizing the bit dimension of control memories in microprogrammed digital computers is considered in this paper. We start essentially with the same basic formulation as that of Grasselli and Montanari [2]. However, in order to minimize the computational requirements, we start directly with the set of maximum compatibility classes of microcommands whose number is usually small, and readily obtain near-minimal irredundant solutions. A minimal solution is then obtained from the irredundant solutions.Keywords
This publication has 8 references indexed in Scilit:
- Clause-Column Table Approach for Generating All the Prime Implicants of Switching FunctionsIEEE Transactions on Computers, 1972
- An Approach for Simplifying Switching Functions by Utilizing the Cover Table RepresentationIEEE Transactions on Computers, 1971
- On the Minimization of READ-ONLY Memories in Microprogrammed Digital ComputersIEEE Transactions on Computers, 1970
- On finding maximum compatiblesProceedings of the IEEE, 1969
- An algorithm for minimizing read only memories for machine controlPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1968
- A Method for Minimizing the Number of Internal States in Incompletely Specified Sequential NetworksIEEE Transactions on Electronic Computers, 1965
- A method of determination of all the minimal forms of Boolean functionsProceedings of the IEE Part C: Monographs, 1962
- Minimizing the Number of States in Incompletely Specified Sequential Switching FunctionsIEEE Transactions on Electronic Computers, 1959