Abstract
The authors address the problem of reducing the word length of microprograms. Two techniques are described: overlaying of fields and encoding of the microprogram. Formal analyses are presented of different encoding methods, assuming a VLSI implementation. A maximal encoding strategy appears to be the most area-efficient. Field overlaying is formulated as a clique-partitioning problem, and an efficient and practical clique-partitioning algorithm is presented. Based on these results, a microword compaction strategy that consists of field overlaying followed by maximal encoding has been implemented for the MIMOLA synthesis system (a design tool that generates excessively long microinstructions). Some considerations that are relevant to MIMOLA, and probably to other similar tools, are discussed.
| Original language | English (US) |
|---|---|
| Title of host publication | MICRO |
| Subtitle of host publication | Annual Microprogramming Workshop |
| Publisher | ACM |
| Pages | 97-105 |
| Number of pages | 9 |
| ISBN (Print) | 0897912500 |
| State | Published - Dec 1 1987 |