Channel routing

Figure 1: A channel routing problem. The numbered pins on the top and bottom of the channel must be connected. The nets specified on the left and right of the channel must be brought to that end of the channel

Channel routing is a specific variety of routing for integrated circuits. Normally using two layers of interconnect, it must connect the specified pins on the top and bottom of the channel. Specified nets must also be brought out to the left and right of the channel, but may be brought out in any order. The height of the channel is not specified - the router computes what height is needed.

Figure 2: A solution to the channel routing problem shown above. Solutions are not unique, and this is just one of the many possible.

The density of a channel, defined for every x within the channel, is the number of nets that appear on both the left and right of a vertical line at that x. The maximum density is a lower bound on the height of the channel. A "cyclic constraint" occurs when two pins occur in the same column (but with different orders) in at least two columns. In the example shown, nets 1 and 3 suffer from cyclic constraints. This can only be solved by "doglegs" as shown on net 1 of the example.

Channel routers were one of the first forms of routers for integrated circuits,[1] and were heavily used for many years, with YACR[2] perhaps the best known program. However, modern chips have many more than 2 interconnect layers. Although the effort was made to extend channel routers to more layers,[3][4] this approach was never very popular, since it did not work well with over-the-cell routing where pins are not movable. In recent years, area routers have in general taken over.

See also

References

  1. ^ Feller, A. 1976. Automatic layout of low-cost quick-turnaround random-logic custom LSI devices. In Proceedings of the 13th Conference on Design Automation (San Francisco, California, United States, June 28–30, 1976). DAC '76. ACM Press, New York, NY, 79-85.
  2. ^ Reed, J., Sangiovanni-Vincentelli, A., Santomauro, M.; A New Symbolic Channel Router: YACR2, Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, Vol.4, Iss.3, July 1985 Pages: 208- 219
  3. ^ Braun, D., Burns, J., Davadas, S., Ma, H. K., Mayaram, K., Romeo, F., and Sangiovanni-Vincentelli, A. 1986. Chameleon: a new multi-layer channel router. In Proceedings of the 23rd ACM/IEEE Conference on Design Automation (Las Vegas, Nevada, United States). Annual ACM IEEE Design Automation Conference. IEEE Press, Piscataway, NJ, 495-502.
  4. ^ Fang, S., Feng, W., and Lee, S. 1992. A new efficient approach to multilayer channel routing problem. In Proceedings of the 29th ACM/IEEE Conference on Design Automation (Anaheim, California, United States, June 08–12, 1992). Annual ACM IEEE Design Automation Conference. IEEE Computer Society Press, Los Alamitos, CA, 579-584

Content Disclaimer

Informasi ini disarikan dari Wikipedia dan disajikan kembali untuk tujuan edukasi. Konten tersedia di bawah lisensi CC BY-SA 3.0. Kami tidak bertanggung jawab atas ketidakakuratan data yang bersumber dari kontribusi publik tersebut.

  1. The information displayed on this website is sourced in part or in whole from Wikipedia and has been adapted for the purpose of restating it. We strive to provide accurate and relevant information, however:
  2. There is no guarantee of absolute accuracy. Wikipedia is an open, collaborative project that can be edited by anyone, so information is subject to change.
  3. It is not intended to constitute professional advice. The content displayed is for informational and educational purposes only. For important decisions (e.g., medical, legal, or financial), please consult a professional.
  4. Content copyright. Wikipedia is licensed under the Creative Commons Attribution-ShareAlike License (CC BY-SA). This means that content may be reused with appropriate attribution and shared under a similar license.
  5. Responsible use. Any risk arising from the use of information from this website is entirely the responsibility of the user.