Two COMPLEMENTARY APPROACHES FOR MICROCODE BIT OPTIMIZATION

In the design of microprogrammed processors, the minimization of microeode width is very crucial to reduce the required microcode ROM area. This brief contribution 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.
Publisher
IEEE COMPUTER SOC
Issue Date
1994-02
Language
English
Citation

IEEE TRANSACTIONS ON COMPUTERS, v.43, no.2, pp.234 - 239

ISSN
0018-9340
URI
http://hdl.handle.net/10203/59499
Appears in Collection
EE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
  • Hit : 218
  • Download : 0
  • Cited 0 times in thomson ci
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡClick to seewebofscience_button
⊙ Cited 2 items in WoSClick to see citing articles inrecords_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0