Name
Abstract | ||
|---|---|---|
A new approach is presented for the minimization of the word length of the control store in microprogrammed computers. Given the set of microinstructions and the set of microcommands of a microprogrammed computer a minimal subset of microcommands are determined so that every other microcommand not contained in this minimal subset to be generated from it by a single AND or OR gate. The problem of finding such minimal subsets of microcommands is formulated as a Boolean function simplification problem and is based upon an extension of the notion of the minimal dependence sets of a Boolean function. |
Year | DOI | Venue |
|---|---|---|
1978 | 10.1109/TC.1978.1675024 | Tutorial: microprogramming and firmware engineering |
Keywords | DocType | Volume |
microprogramming,boolean function,minimization,control store | Journal | 27 |
Issue | ISSN | ISBN |
12 | 0018-9340 | 0-8186-0839-0 |
Citations | PageRank | References |
7 | 2.04 | 5 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| C. Halatsis | 1 | 7 | 2.04 |
| N. Gaitanis | 2 | 117 | 19.48 |