Fundamentals of data structures in PASCAL
Fundamentals of data structures in PASCAL
Models and algorithms for structured layout
Computer-Aided Design
Place-router for “Sea-of Gates” design style
Progress in computer-aided VLSI design
Optimal algorithms for tree partitioning
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
Fundamentals of Computer Alori
Fundamentals of Computer Alori
Linear ordering and application to placement
DAC '83 Proceedings of the 20th Design Automation Conference
The Standard Transistor Array (star) (Part II automatic cell placement techniques)
DAC '80 Proceedings of the 17th Design Automation Conference
Prediction of wiring space requirements for LSI
DAC '77 Proceedings of the 14th Design Automation Conference
Efficient Construction of Pipelined Multibit-Trie Router-Tables
IEEE Transactions on Computers
| Hi-index | 0.00 |
We study the problem of folding an ordered list of standard and custom cells into rows of a chip so as to minimize either the routing area or the total chip area. Nine versions of the folding problem are formulated and fast polynomial time algorithms are obtained for each. Two of our formulations correspond to problems formulated in Paik and Sahni [1993] for the folding of a stack of bit-slice components. Our algorithms for these two formulations are asymptotically superior to those of Paik and Sahni [1993].