Loading...
Please wait, while we are loading the content...
Optimal Folding of Bit Sliced Stacks (1991)
| Content Provider | CiteSeerX |
|---|---|
| Author | Paik, Doowon Sahni, Sartaj |
| Abstract | We develop fast polynomial time algorithms to optimally fold stacked bit sliced architectures to minimize area subject to height or width constraints. These algorithms may also be applied to folding problems that arise in standard cell and sea-of-gates designs. KEYWORDS and PHRASES Stacked bit sliced architectures, folding, area + Research supported, in part, by the National Science Foundation under grant MIP 86-17374. 2 1. Introduction A stack of bit sliced components ([LARM90] and [WU90]) consists of n components of varying height and width with their left ends vertically aligned as in Figure 1(a). The intra component (i.e., inter slice but local to a component) routing is done on metal layer 1 while the inter component (i.e., intra slice but across components) routing is done on metal layer 2. A component stack may be folded at component i 1 by rotating components i 1 +1, ... , i n by 180 ° so that their aligned ends are now on the right and the component order is i 1 +1, ... , i ... |
| File Format | |
| Volume Number | 12 |
| Journal | IEEE Trans. on CAD of Integrated Circuits and Systems, Vol |
| Language | English |
| Publisher Date | 1991-01-01 |
| Access Restriction | Open |
| Subject Keyword | Bit Sliced Stack Optimal Folding Metal Layer Grant Mip 86-17374 Component Stack Sea-of-gates Design Stacked Bit Sliced Architecture Phrase Stacked Bit Sliced Architecture Intra Component Inter Slice Inter Component Width Constraint Fast Polynomial Time Algorithm Bit Sliced Component Intra Slice National Science Foundation Component Order Area Research Standard Cell Area Subject |
| Content Type | Text |
| Resource Type | Article |
