DAC '87 Proceedings of the 24th ACM/IEEE Design Automation Conference
A bottom-up layout technique based on two-rectangle routing
Integration, the VLSI Journal
Almost-optimum speed-ups of algorithms for bipartite matching and related problems
STOC '88 Proceedings of the twentieth annual ACM symposium on Theory of computing
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems
Journal of the ACM (JACM)
Wire routing by optimizing channel assignment within large apertures
DAC '71 Proceedings of the 8th Design Automation Workshop
Signal integrity optimization on the pad assignment for high-speed VLSI design
ICCAD '95 Proceedings of the 1995 IEEE/ACM international conference on Computer-aided design
Minimum-Congestion Hypergraph Embedding in a Cycle
IEEE Transactions on Computers
Hi-index | 0.00 |
This paper presents an optimum scheme for interconnecting the chip core and the I/O pads in the final stage of physical design. The pad placement routine, based on linear assignment, determines the dimension of the pad ring and selects the optimum position for each pad with the objective of minimizing the chip area and the total wire length. The router is based on a channel routing algorithm which incorporates additional features to address the special needs of the ring configuration. It attempts to achieve 100% routing completion in a rectangular ring-shaped area with two interconnect layers. The complete package has been implemented as part of the BEAR Layout System for custom chip design.