Gap Channel Routing with Fixed Wires
Recent 3D IC designs need to realize high connectivity demand in one direction by utilizing limited routing resources. This paper proposes a fast greedy heuristic, practical criticality-based ceiling and packing (PC-CAP), for a gap channel to complete the allocation of trunks with a small number of gaps and to achieve small vertical wire congestion as much as possible while meeting the constraints on allocation. PC-CAP repeatedly assigns a trunk according to the priority defined in terms of criticality against an estimated vertical congestion, and obtains near optimal allocation in a short time.
Authors
- T Iwasawa
- Toshiyuki Watanabe (ORCID: https://orcid.org/0000-0001-5324-2968)
- Masayuki Shimoda (ORCID: https://orcid.org/0000-0003-4627-0957)
- Chikaaki Kodama (ORCID: https://orcid.org/0000-0002-1955-7357)
- Kosuke Yanagidaira
- Atsushi Takahashi (ORCID: https://orcid.org/0000-0003-3821-5325)
- Muneyuki Hirai
Institutions
- Shanghai Institute for Science of Science (CN)
- Institute of Science Tokyo (JP)
Publication Details
- Published
- 2025-05-25
- DOI
- https://doi.org/10.1109/iscas56072.2025.11043681
- Citations
- 1
- Primary Topic
- VLSI and FPGA Design Techniques
- Type
- article
- Field-Weighted Citation Impact
- 0.73