9th Annual Symposium on Switching and Automata Theory (swat 1968) (1968)
Oct. 15, 1968 to Oct. 18, 1968
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SWAT.1968.4
This paper describes an algorithm for minimizing the storage required of a Read Only Memory that is going to be used as the control element for a digital machine. The technique is based upon the fact that not all sub-commands are required in all words so that bits of the memory may be time shared between subcommands. The algorithm provides a means for determining what sub-commands should share a common set of bits. The algorithm is essentially one of exhaustive evaluation but it is one that directs you toward the solution rather than one which randomly tries all possible solutions and chooses the best. In addition certain bounds on the "size" of the solution are derived and these in turn eliminate a large segment of the possible solution set from consideration. Finally, the algorithm is quite iterative and as such lends itself readily to implementation of a digital machine.
S. J. Schwartz, "An algorithm for minimizing read only memories for machine control," 9th Annual Symposium on Switching and Automata Theory (swat 1968)(FOCS), vol. 00, no. , pp. 28-33, 1968.