On routing for custom integrated circuits

Authors:
Zahir Syed;Abbas El Gamal;M. A. Breuer
Affiliations:
-;-;-
Venue:
DAC '82 Proceedings of the 19th Design Automation Conference
Year:
1982

Citing 7
Cited 3

Efficient Algorithms for Shortest Paths in Sparse Networks

Journal of the ACM (JACM)
Introduction to VLSI Systems

Introduction to VLSI Systems
Fundamentals of Computer Alori

Fundamentals of Computer Alori
A generalized channel router

DAC '80 Proceedings of the 17th Design Automation Conference
A “Dogleg” channel router

DAC '76 Proceedings of the 13th Design Automation Conference
A solution to line-routing problems on the continuous plane

DAC '69 Proceedings of the 6th annual Design Automation Conference
Advanced LILAC - an Automated Layout Generation system for MOS/LSIs

DAC '74 Proceedings of the 11th Design Automation Workshop

Optimal Algorithms for the Channel-Assignment Problem on a Reconfigurable Array of Processors with Wider Bus Networks

IEEE Transactions on Parallel and Distributed Systems
The effect of register-transfer design tradeoffs on chip area and performance

DAC '83 Proceedings of the 20th Design Automation Conference
CAF: A computer-assisted floorplanning tool

DAC '83 Proceedings of the 20th Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a novel and effective strategy for routing custom integrated circuits as well as solutions to subproblems associated with this strategy. Given an initial placement of rectangular blocks, the routing strategy includes the following major steps: construction of a channel graph, estimation of channel widths (based on a statistical model for signal nets and topological routing of power and ground nets), placement modification to include the estimated channel widths, topological routing for signal nets, and finally track assignment. Besides presenting an overview of our strategy, the following topics will be discussed in some detail: (1) necessary and sufficient conditions and a simple algorithm for single layer topological routing of power and ground nets, (2) a quadratic programming formulation for the placement modification problem, and (3) a fast algorithm for obtaining topological routes for signal nets.