Advertisement

Channel Height Estimation for VLSI Design

  • Yuannian Liu
Conference paper
Part of the Advances in Intelligent and Soft Computing book series (AINSC, volume 145)

Abstract

Given an instance of channel routing problem (CRP) in VLSI design, the number of tracks used in a solution for the instance is called the channel height of the solution. The objective of CRP is to minimize the channel heights, that is, to find a solution with minimum channel height. In an instance of CRP, HCG and VCG denote the horizontal and vertical constraint graphs, respectively. Let GM be the graph obtained from HCG by adding edges whose ends are connected by a directed path in VCG. Pal et al. first gave lower bounds on the channel heights in terms of the clique number of GM, and presented algorithms to find such lower bounds. In this paper, we find some interesting theoretic properties, about the structure of the cliques in GM, which can be used to improve Pal’s algorithms. So far, little is known about upper bounds on the channel heights. We find that CRP can be translated into an orientation problem on HCG with arcs in VCG oriented and keeping directed acyclic, and it is also proved that the channel height is determined by the longest directed path in the orientation. Moreover,we show that a lemma on the lower bound in [2] is incorrect and thus another lemma is given to modify it.

Keywords

Vertex Cover Channel Height Interval Graph Chordal Graph VLSI Design 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Sait, S.M., Youssef, H.: VLSI Physical Design Automation: Theory and Practice. McGraw-Hill, New York (2006)Google Scholar
  2. 2.
    Pal, R.K., Saha, D., Sarma, S.S.: A Mimetic Algorithm for Computing a Nontrivial Lower Bound on Number of Tracks in Two-Layer Channel Routing. Journal of Physical Sciences 11, 199–210 (2007)Google Scholar
  3. 3.
    Pal, R.K., Pal, S.P., Pal, A.: An Algorithm for Finding a non-Trivial Lower Bound for Channel Routing. Intergration, the VLSI Journal 25, 71–84 (1998)zbMATHCrossRefGoogle Scholar
  4. 4.
    Kaufmann, M., Mehlhorn, K.: Routing Problems in Grid Graphs. In: Korte, B., Lovasz, L., Promel, H.J., Schrijver, A. (eds.) Paths, Flows, and VLSI-Layout, Algorithms and Combinatorics, vol. 9, pp. 165–184. Springer, Heidelberg (1990)Google Scholar
  5. 5.
    Korte, B., Vygen, J.: Combinatorial Optimization: Theory and Algorithms. Springer, Heidelberg (2006)zbMATHGoogle Scholar
  6. 6.
    Gerez, S.H.: Algorithms for VLSI Design Automation. John Wiley & Sons, Inc. (1999)Google Scholar
  7. 7.
    Alain Ghouilá, H.: Caractérisation Des Graphes non Orientés Dont on Peut Orienter les Arrêtes de Manièreà Obtenir le Graphe d’une Relation d’ordre. C.R.Acad. Sci. Aaris 254, 1370–1371 (1962)zbMATHGoogle Scholar
  8. 8.
    Burstein, M.: Channel Routing. Layout Design and VeriTcation, 133–167 (1986)Google Scholar
  9. 9.
    Yoshimura, T., Kuh, E.S.: Efficient Algorithms for Channel Routing. IEEE Trans. CAD Integrated Circuits and Systems 1, 25–35 (1992)CrossRefGoogle Scholar
  10. 10.
    Shenvani, N.: Algorithms for VLSI Physical Design Automation, 3rd edn. Kluwer Academic Publishers (1999)Google Scholar
  11. 11.
    Gallai, T.: Über extreme Punkt-und Kantenmengen. Ann. Univ. Scibudapes. Eötvös Sect. Math. 2, 2133–2138 (1959)MathSciNetGoogle Scholar
  12. 12.
    Saxena, P., Shelar, R.S., Sapatnekar, S.S.: Routing Congestion in VLSI Circuits. Springer, Heidelberg (2007)Google Scholar

Copyright information

© Springer-Verlag GmbH Berlin Heidelberg 2012

Authors and Affiliations

  1. 1.Center for Discrete Mathematics and Theoretical Computer ScienceFuzhou UniversityFuzhouP.R.China

Personalised recommendations