Issue No. 10 - October (1984 vol. 33)
R.A. Mueller , Department of Computer Science, Colorado State University
We consider the complexity of the problem of encoding microoperations into the fields of a control word on a horizontally microprogrammed machine, and show it to be NP-complete. The major result of this correspondence is a formalization of the microinstruction encoding problem, which makes the complexity argument straightforward.
NP-completeness, Bit encodings, horizontal microinstructions, microprogramming
J. Varghese, R. Mueller and V. Allan, "The Complexity of Horizontal Word Encoding in Microprogrammed Machines," in IEEE Transactions on Computers, vol. 33, no. , pp. 938-939, 1984.