Introduction to algorithms
Layer Reassignment for Antenna Effect Minimization in 3-Layer Channel Routing
DFT '96 Proceedings of the 1996 Workshop on Defect and Fault-Tolerance in VLSI Systems
Fixing Antenna Problem by Dynamic Diode Dropping and Jumper Insertion
ISQED '00 Proceedings of the 1st International Symposium on Quality of Electronic Design
A Polynomial Time Optimal Diode Insertion/Routing Algorithm for Fixing Antenna Problem
Proceedings of the conference on Design, automation and test in Europe
Multilevel routing with antenna avoidance
Proceedings of the 2004 international symposium on Physical design
Coupling aware timing optimization and antenna avoidance in layer assignment
Proceedings of the 2005 international symposium on Physical design
Proceedings of the 2006 international symposium on Physical design
Proceedings of the 2006 international symposium on Physical design
Optimal jumper insertion for antenna avoidance under ratio upper-bound
Proceedings of the 43rd annual Design Automation Conference
An optimal simultaneous diode/jumper insertion algorithm for antenna fixing
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
| Hi-index | 0.00 |
We study in this paper the problem of jumper insertion on general routing (Steiner/spanning) trees with obstacles for antenna avoidance/fixing at the routing and/or post-layout stages. We formulate the jumper insertion for antenna avoidance/fixing as a tree-cutting problem and present the firstoptimal algorithm for the general tree-cutting problem. We show that the tree-cutting problem exhibits the properties of optimal substructures and greedy choices. With these properties, we present an O((V+D) lg D)-time optimal jumper insertion algorithm that uses the least number of jumpers to avoid/fix the antenna violations on a Steiner/spanning tree with V vertices and D obstacles. Experimental results show the superior effectiveness and efficiency of our algorithm.