Simultaneous antenna avoidance and via optimization in layer assignment of multi-layer global routing

17Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Antenna effect is an important issue that needs to be considered in the routing stage for modern design. In this paper, we study a layer assignment problem that arises during multi-layer global routing and takes antenna avoidance into account. The problem asks to transform a given 2-dimensional global routing result into a 3-dimensional one (i.e., a multi-layer one) and to minimize the amount of antenna violations and the via count subject to given wire congestion constraints. We present an algorithm that tackles the addressed layer assignment problem in a netby-net manner. An existing dynamic-programming- based single-net layer assignment method that can only consider the via count Is judiciously modified and adopted by our algorithm to handle both antenna avoidance and via count minimization for each net. To further reduce the via count but without increasing the amount of antenna violations, a refinement procedure based on min-cost max-flow is developed and added to our algorithm. The experiment results show that when compared with the layer assignment approach adopted by a state-of-the-art academic global router, our algorithm not only can improve the via count slightly but also can significantly reduce the amount of antenna violations. © 2010 IEEE.

Cite

CITATION STYLE

APA

Lee, T. H., & Wang, T. C. (2010). Simultaneous antenna avoidance and via optimization in layer assignment of multi-layer global routing. In IEEE/ACM International Conference on Computer-Aided Design, Digest of Technical Papers, ICCAD (pp. 312–318). Institute of Electrical and Electronics Engineers Inc. https://doi.org/10.1109/ICCAD.2010.5654184

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free