The Organization of Microprogram Stores
ACM Computing Surveys (CSUR)
Asynchronous Sequential Switching Circuit
Asynchronous Sequential Switching Circuit
Discrete Optimization Algorithms with Pascal Programs
Discrete Optimization Algorithms with Pascal Programs
Introduction to VLSI Systems
An approach to optimization of horizontal microprograms
MICRO 7 Conference record of the 7th annual workshop on Microprogramming
On storage optimization of horizontal microprograms
MICRO 7 Conference record of the 7th annual workshop on Microprogramming
Automated synthesis of data paths in digital systems (design space)
Automated synthesis of data paths in digital systems (design space)
| Hi-index | 0.00 |
We address the problem of reducing the word length of microprograms. Two techniques are described: overlaying of fields and encoding of the microprogram. Formal analysis 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 microward 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 general to other similar tools, are discussed.