An algorithm for minimizing read only memories for machine control
- 1 October 1968
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 02724847,p. 28-33
- https://doi.org/10.1109/swat.1968.4
Abstract
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.Keywords
This publication has 5 references indexed in Scilit:
- Fourth - generation softwareMicroprocessing and Microprogramming, 1981
- Design of a Printed Card Capacitor Read-Only StoreIBM Journal of Research and Development, 1966
- The Design of Transformer (Dimond Ring) Read-Only StoresIBM Journal of Research and Development, 1964
- A short review of read-only memoriesProceedings of the Institution of Electrical Engineers, 1963
- Fundamental Concepts in the Design of the Flying Spot StoreBell System Technical Journal, 1958