Issue No. 02 - February (1994 vol. 43)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/12.262130
<p>In the design of microprogrammed processors, the minimization of microcode width is very crucial to reduce the required microcode ROM area. The paper suggests two different procedures which are complementary in nature: first an integer linear programming formulation which guarantees an optimal solution for small or medium size problems; and second, a heuristic algorithm based on the graph bipartitioning to deal with large size problems. Experimental results show that the proposed heuristic algorithm yields near-optimal solutions with polynomial time complexity.</p>
minimisation; linear programming; microprogramming; computational complexity; microcode bit optimization; microprogrammed processors; minimization; microcode width; integer linear programming; graph bipartitioning; heuristic algorithm; polynomial time complexity; microprogramming.
S. Hong, I. Park and C. Kyung, "Two Complementary Approaches for Microcode Bit Optimization," in IEEE Transactions on Computers, vol. 43, no. , pp. 234-239, 1994.