An exact jumper-insertion algorithm for antenna violation avoidance/fixing considering routing obstacles Academic Article

abstract

• 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 postlayout stages. We formulate the jumper insertion for antenna avoidance/fixing as a tree-cutting problem and present the first optimal 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. 2007 IEEE.

authors

• Hu, Jiang

published proceedings

• IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS

author list (cited authors)

• Su, B., Chang, Y., & Hu, J.

citation count

• 4

complete list of authors

• Su, Bor-Yiing||Chang, Yao-Wen||Hu, Jiang

publication date

• April 2007

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

published in

• IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems  Journal

keywords

• Antenna Effect
• Design For Manufacturability
• Physical Design
• Reliability
• Routing

Digital Object Identifier (DOI)

• 10.1109/TCAD.2007.892338

start page

• 719

end page

• 733

volume

• 26

issue

• 4

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Ftcad.2007.892338