Research Note Microcode B i t Optimization is .A-Hard Edward L. Robertson Computer Science Department The Pennsylvania State U n i v e r s i t y Abstract The general problem of formating m i c r o i n s t r u c t i o n 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 h e u r i s t i c s f o r reasonable subcases. I. Introduction The problem o f minimizing the b i t dimension of control memory in a microprogrammed d i g i t a l computer has been considered by Schwartz [ I ] and by Grasselli and Montanari [ 2 ] . i t y of the s o l u t i o n in a l l cases. These attempts do not guarantee minimalThe purpose of t h i s note is to observe to compute. t h a t any method which guarantees m i n i m a l i t y must be d i f f
/lp/association-for-computing-machinery/research-note-microcode-bit-optimization-is-np-hard-XUpzOxMwMy