Abstract
Minimization of control memory bit dimension constitutes a major problem in the synthesis of a microprogrammed digital computer. This paper investigates the problem in both the cases of static and dynamic microprogramming, i.e., the problems of ROM, as well as WCS minimization. It develops certain useful results and pre-estimates about the possible minimal cost of implementation and finally describes a simple reduction methodology to pick-up one of the near minimal or engineering solutions with much less computational labor and, if necessary, the true minimal solution with some extra computation.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. J. Schwartz, “An Algorithm for Minimizing Read Only Memories for Machine Control,”Proceedings of 10th Ann. IEEE Symp. Switching and Automata Theory, 28–33 (1968).
A. Graselli and U. Montanari, “On the Minimization of Read-Only Memories in Microprogrammed Digital Computers,”IEEE Trans. Comput.,C19:111–114 (November 1970).
S. R. Das, D. K. Banerjee, and A. K. Chattopadhyay, “On Control Memory Minimization in Microprogrammed Digital Computers,”IEEE Trans. Comput.,C22:845–848 (September 1973).
T. Agarwala, “Microprogram Optimization: A Survey,”IEEE Trans. Comput.,C25:962–973 (October 1976).
C. Montangero, “An Approach to the Optimal Specification of Read-Only Memories in Microprogrammed Digital Computers,”IEEE Trans. Comput.,C23:375–384 (April 1974).
M. Tsuchiya and M. J. Gonzalez, “Toward Optimization of Horizontal Microprograms,”IEEE Trans. Comput.,C25:992–999 (October 1976).
P. K. Srimani, B. P. Sinha, and A. K. Choudhury, “On Certain Investigations on Control Memory Minimization in Microprogrammed Digital Computers,”J. Inst. Electron. Telecomm. Engrs.,23:542–548 (September 1977).
S. R. Das, Z. Chen, and C. L. Sheng, “An Approach to Microprogram Optimisation Through Bit Dimension Reduction in a Given Control Store Specification,”J. Comp. and Elect. Eng.,6:93–97 (February 1979).
L. W. Jackson and S. Dasgupta, “Identification of Parallel Microoperations,”Inform. Proc. Lett.,2:180–184 (1974).
S. Dasgupta and J. Tartar, “On the Minimization of Control Memories,”Inform. Proc. Lett.,3:71–74 (1975).
E. J. McCluskey, “Minimization of Boolean Functions,”Bell Sys. Tech. J.,35:1417–1444 (November 1956).
J. B. Pyne and E. J. McCluskey, “The Reduction of Redundancy in Solving Prime Implicant Tables,”IRE Trans. Electr. Comput.,EC11:473–482 (August 1962).
A. K. Chaudhury and S. R. Das, “Some Studies on Connected Cover Term Matrices of Swiching Functions,”Inter. J. Control,2:441–501 (November 1965).
S. R. Das, “An Approach for Simplifying Switching Functions by Utilizing the Cover Table Representations,”IEEE Trans. Comput.,C20:355–357 (March 1971).
S. R. Das and N. S. Khabra, “Clause Column Table Approach for Generating all the Prime Implicants of Switching Functions,”IEEE Trans. Comput.,C21:1239–1246 (November 1972).
A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms (Addison-Wesley, Reading, MA, 1974).
Author information
Authors and Affiliations
Additional information
Formerly with Informatik Kolleg, G.M.D., Bonn, West Germany and Indian Statistical Institute, Calcutta, India.
Formerly with Informatik Kolleg, G.M.D., Bonn, West Germany.
Rights and permissions
About this article
Cite this article
Srimani, P.K., Sinha, B.P. A simple way to near minimization of microprogram control memory. International Journal of Computer and Information Sciences 12, 47–64 (1983). https://doi.org/10.1007/BF00996803
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF00996803