On the Minimization of READ-ONLY Memories in Microprogrammed Digital Computers
暂无分享,去创建一个
An algorithm for minimizing the bit dimension of READ- ONLY memories employed in the control section of microprogrammed digital computers is illustrated. The algorithm employs techniques which are well known in switching theory, such as compatibility classes and covering tables of the prime implicant type.
[1] Stephen H. Unger,et al. Minimizing the Number of States in Incompletely Specified Sequential Switching Functions , 1959, IRE Trans. Electron. Comput..
[2] Scott J. Schwartz. An Algorithm for Minimizing Read Only Memories for Machine Control , 1968, SWAT.
[3] E. McCluskey. Minimization of Boolean functions , 1956 .
[4] A. Grasselli,et al. A note on the derivation of maximal compatibility classes , 1966 .