Skip to main content

An Edge-Based Channel Definition Algorithm for Rectilinear Cells

  • Chapter
  • 101 Accesses

Part of the book series: The Kluwer International Series in Engineering and Computer Science ((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.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD   169.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Reed, A. Sangiovanni-Vincentelli, and M. Santamauro, “A New Symbolic Channel Router: YACR2” (1985).

    Google Scholar 

  2. A. Sangiovanni-Vincentelli, Private Communication, (1986).

    Google Scholar 

  3. C. P. Hsu, “A New Two-Dimensional Routing Algorithm,” (1982).

    Google Scholar 

  4. W. K. Luk, “A Greedy Switch-Box Router,” (1984).

    Google Scholar 

  5. M. Marek-Sadowska, “Two-Dimensional Router for Double Layer Layout,” (1985).

    Google Scholar 

  6. R. Joobbani and D. Siewiorek, “WEAVER: A Knowledge-Based Routing Expert,” (1985).

    Google Scholar 

  7. R. Joobbani, “An Artificial Intelligence Approach to VLSI Routing,” (1986).

    Google Scholar 

  8. G. Hamachi and J. Ousterhout, “A Switchbox Router with Obstacle Avoidance,” (1984).

    Google Scholar 

  9. H. Shin and A. Sangiovanni-Vincentelli, “A Detailed Router Based on Incremental Routing Modifications: MIGHTY,” (1987).

    Google Scholar 

  10. 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. N. P. Chen, C. P. Hsu, and E. S. Kuh, “The Berkeley Building-Block (BBL) Layout System for VLSI Design,” (1983).

    Google Scholar 

  12. N. P. Chen, “Routing System for Building Block Layout,” (1983).

    Google Scholar 

  13. R. Otten, “Automatic Floorplan Design,” (1982).

    Google Scholar 

  14. R. Rivest, “The PI (Placement and Interconnect) System,” (1982).

    Google Scholar 

  15. J. Ousterhout, G. Hamachi, R. Mayo, W. Scott, and G. Taylor, “Magic: A VLSI Layout System,” (1984).

    Google Scholar 

  16. G. Hamachi and J. Ousterhout, “A Switchbox Router with Obstacle Avoidance,” (1984).

    Google Scholar 

  17. W. M. Dai, T. Asano, and E. S. Kuh, “Routing Region Definition and Ordering Scheme for Building Block Layout,” (1985).

    Google Scholar 

  18. W. M. Dai, T. Asano, and E. S. Kuh, “Routing Region Definition and Ordering Scheme for Building Block Layout,” (1985).

    Google Scholar 

  19. R. Otten, “Automatic Floorplan Design,” (1982).

    Google Scholar 

  20. J. Ousterhout, G. Hamachi, R. Mayo, W. Scott, and G. Taylor, “Magic: A VLSI Layout System,” (1984).

    Google Scholar 

  21. G. Hamachi and J. Ousterhout, “A Switchbox Router with Obstacle Avoidance,” (1984).

    Google Scholar 

  22. R. Rivest, “The PI (Placement and Interconnect) System,” (1982).

    Google Scholar 

  23. R. Otten,“AutomaticFloorplan Design”(1982).

    Google Scholar 

  24. W. M. Dai, T. Asano, and E. S. Kuh, “Routing Region Definition and Ordering Scheme for Building Block Layout,” (1985).

    Google Scholar 

  25. A. Sangiovanni-Vincentelli, Private Communication, (1986).

    Google Scholar 

  26. 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. N. P. Chen, C. P. Hsu and E. S. Kuh, “The Berkeley Building-Block (BBL) Layout System for VLSI Design,” (1983).

    Google Scholar 

  28. N. P. Chen, “Routing System for Building Block Layout,” (1983).

    Google Scholar 

  29. N. P. Chen, “Routing System for Building Block Layout,” (1983).

    Google Scholar 

  30. N. P. Chen, “Routing System for Building Block Layout,” (1983).

    Google Scholar 

  31. A. Sangiovanni-Vincentelli, Private Communication, (1986).

    Google Scholar 

  32. R. H. Otten, “Automatic Floorplan Design,” (1982).

    Google Scholar 

  33. K. Kani. H. Kawanishi, and A. Kishimoto, “ROBIN: A Building Block LSI Routing Program,” (1976).

    Google Scholar 

  34. U. Kajitani, “Order of Channels for Safe Routing and Optimal Compaction of Routing Area,” (1983).

    Google Scholar 

  35. W. M. Dai, T. Asano, and E. S. Kuh, “Routing Region Definition and Ordering Scheme for Building Block Layout,” (1985).

    Google Scholar 

  36. H. Shin and A. Sangiovanni-Vincenlelli, “A Detailed Router Based on Incremental Routing Modifications: MIGHTY,” 1987.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1988 Kluwer Academic Publishers, Boston

About this chapter

Cite this chapter

Sechen, C. (1988). An Edge-Based Channel Definition Algorithm for Rectilinear Cells. In: VLSI Placement and Global Routing Using Simulated Annealing. The Kluwer International Series in Engineering and Computer Science, vol 54. Springer, Boston, MA. https://doi.org/10.1007/978-1-4613-1697-8_7

Download citation

  • DOI: https://doi.org/10.1007/978-1-4613-1697-8_7

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4612-8957-9

  • Online ISBN: 978-1-4613-1697-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics