Advertisement

An Edge-Based Channel Definition Algorithm for Rectilinear Cells

  • Carl Sechen
Chapter
  • 76 Downloads
Part of the The Kluwer International Series in Engineering and Computer Science book series (SECS, volume 54)

Abstract

This chapter will describe an edge-based channel definition algorithm for circuits consisting of cells of any rectilinear shape. This algorithm is particularly well suited for channel definition just prior to placement refinement. Furthermore, the algorithm may be employed as a basic channel definer just prior to the execution of global and then detailed routers.

Keywords

Simulated Annealing Critical Region Cell Placement Cell Edge Vertical Edge 
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.
    J. Reed, A. Sangiovanni-Vincentelli, and M. Santamauro, “A New Symbolic Channel Router: YACR2” (1985).Google Scholar
  2. 1.
    A. Sangiovanni-Vincentelli, Private Communication, (1986).Google Scholar
  3. 2.
    C. P. Hsu, “A New Two-Dimensional Routing Algorithm,” (1982).Google Scholar
  4. 3.
    W. K. Luk, “A Greedy Switch-Box Router,” (1984).Google Scholar
  5. 4.
    M. Marek-Sadowska, “Two-Dimensional Router for Double Layer Layout,” (1985).Google Scholar
  6. 5.
    R. Joobbani and D. Siewiorek, “WEAVER: A Knowledge-Based Routing Expert,” (1985).Google Scholar
  7. 6.
    R. Joobbani, “An Artificial Intelligence Approach to VLSI Routing,” (1986).Google Scholar
  8. 7.
    G. Hamachi and J. Ousterhout, “A Switchbox Router with Obstacle Avoidance,” (1984).Google Scholar
  9. 8.
    H. Shin and A. Sangiovanni-Vincentelli, “A Detailed Router Based on Incremental Routing Modifications: MIGHTY,” (1987).Google Scholar
  10. 9.
    N. P. Chen, C. P. Hsu, E. S. Kuh, C. C. Chen, and M. Takahashi. “BBL: A Building-Block Layout System for Custom Chip IC Design,” (1983).Google Scholar
  11. 10.
    N. P. Chen, C. P. Hsu, and E. S. Kuh, “The Berkeley Building-Block (BBL) Layout System for VLSI Design,” (1983).Google Scholar
  12. 11.
    N. P. Chen, “Routing System for Building Block Layout,” (1983).Google Scholar
  13. 12.
    R. Otten, “Automatic Floorplan Design,” (1982).Google Scholar
  14. 13.
    R. Rivest, “The PI (Placement and Interconnect) System,” (1982).Google Scholar
  15. 14.
    J. Ousterhout, G. Hamachi, R. Mayo, W. Scott, and G. Taylor, “Magic: A VLSI Layout System,” (1984).Google Scholar
  16. 15.
    G. Hamachi and J. Ousterhout, “A Switchbox Router with Obstacle Avoidance,” (1984).Google Scholar
  17. 16.
    W. M. Dai, T. Asano, and E. S. Kuh, “Routing Region Definition and Ordering Scheme for Building Block Layout,” (1985).Google Scholar
  18. 17.
    W. M. Dai, T. Asano, and E. S. Kuh, “Routing Region Definition and Ordering Scheme for Building Block Layout,” (1985).Google Scholar
  19. 18.
    R. Otten, “Automatic Floorplan Design,” (1982).Google Scholar
  20. 1.
    J. Ousterhout, G. Hamachi, R. Mayo, W. Scott, and G. Taylor, “Magic: A VLSI Layout System,” (1984).Google Scholar
  21. 2.
    G. Hamachi and J. Ousterhout, “A Switchbox Router with Obstacle Avoidance,” (1984).Google Scholar
  22. 3.
    R. Rivest, “The PI (Placement and Interconnect) System,” (1982).Google Scholar
  23. 4.
    R. Otten,“AutomaticFloorplan Design”(1982).Google Scholar
  24. 5.
    W. M. Dai, T. Asano, and E. S. Kuh, “Routing Region Definition and Ordering Scheme for Building Block Layout,” (1985).Google Scholar
  25. 6.
    A. Sangiovanni-Vincentelli, Private Communication, (1986).Google Scholar
  26. 7.
    N. P. Chen, C. P. Hsu, E. S. Kuh, C. C. Chen and M. Takahashi, “BBL: A Building-Block Layout System for Custom Chip IC Design,” (1983).Google Scholar
  27. 8.
    N. P. Chen, C. P. Hsu and E. S. Kuh, “The Berkeley Building-Block (BBL) Layout System for VLSI Design,” (1983).Google Scholar
  28. 9.
    N. P. Chen, “Routing System for Building Block Layout,” (1983).Google Scholar
  29. 10.
    N. P. Chen, “Routing System for Building Block Layout,” (1983).Google Scholar
  30. 1.
    N. P. Chen, “Routing System for Building Block Layout,” (1983).Google Scholar
  31. 2.
    A. Sangiovanni-Vincentelli, Private Communication, (1986).Google Scholar
  32. 3.
    R. H. Otten, “Automatic Floorplan Design,” (1982).Google Scholar
  33. 1.
    K. Kani. H. Kawanishi, and A. Kishimoto, “ROBIN: A Building Block LSI Routing Program,” (1976).Google Scholar
  34. 2.
    U. Kajitani, “Order of Channels for Safe Routing and Optimal Compaction of Routing Area,” (1983).Google Scholar
  35. 1.
    W. M. Dai, T. Asano, and E. S. Kuh, “Routing Region Definition and Ordering Scheme for Building Block Layout,” (1985).Google Scholar
  36. 1.
    H. Shin and A. Sangiovanni-Vincenlelli, “A Detailed Router Based on Incremental Routing Modifications: MIGHTY,” 1987.Google Scholar

Copyright information

© Kluwer Academic Publishers, Boston 1988

Authors and Affiliations

  • Carl Sechen
    • 1
  1. 1.Yale UniversityUSA

Personalised recommendations