Issue No.04 - April (1979 vol.28)
E.L. Robertson , Department of Computer Science, Indiana University
The general problem of formatting microinstructions so as to minimize the width of words in control memory is shown to be computationally difficult. Hence, we should not attempt to solve the general case, but concentrate on heuristics for reasonable subcases.
parallelism., Control memory, microprogrammming, minimization, NP-completeness
E.L. Robertson, "Microcode Bit Optimization is NP-Complete", IEEE Transactions on Computers, vol.28, no. 4, pp. 316-319, April 1979, doi:10.1109/TC.1979.1675353