Metraipolis › archive › dc_f053c50d4ffd

A Global Routing Method for Electronic Circuit Design Integrating Flow Matching and Constrained A* — arXiv:2611.02304

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.02304
License (as archived)
CC0-1.0
Archived
2026-11-03T11:54:48.172Z
SHA-256 of the archived text
b0764202e1b684a1ab84c1119947dcf0852dbf9d94aae452a7f4bcbe70306355
Stable URL of this page
https://metraipolis.com/documento/dc_f053c50d4ffd

How to cite

A Global Routing Method for Electronic Circuit Design Integrating Flow Matching and Constrained A* — arXiv:2611.02304 — arXiv (en), https://arxiv.org/abs/2611.02304 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_f053c50d4ffd (Metraipolis archive dc_f053c50d4ffd, sha256 b0764202e1b684a1ab84c1119947dcf0852dbf9d94aae452a7f4bcbe70306355)
BibTeX
@misc{dcf053c50d4ffd,
  title = {A Global Routing Method for Electronic Circuit Design Integrating Flow Matching and Constrained A* — arXiv:2611.02304},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.02304},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_f053c50d4ffd; sha256 b0764202e1b684a1ab84c1119947dcf0852dbf9d94aae452a7f4bcbe70306355},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02304. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Global routing is a fundamental issue in the design of electronic circuits, as it directly relates to the efficiency, reliability, and compactness of the overall layout of integrated systems. As the demand for higher functionality and reliability within a limited chip area increases, the importance of routing as a design consideration has never been greater. Efficient global routing optimization techniques are therefore required to connect all pins with minimal wirelength (WL), while avoiding congestion and interference across multiple nets within the design space. As the number of nets to be routed increases, global routing inherently suffers from a combinatorial explosion in the design space, making it increasingly difficult to obtain feasible solutions. In this paper, we focus on solving constrained global routing problems based on a heuristic A*-based framework. Based on this concept, a hybrid approach is proposed by integrating constrained A* with flow matching (FM). The method utilizes FM to construct a global cost map that captures routing tendencies across the design space, which is then used to guide the constrained A* search process. This enables efficient exploration of the solution space while satisfying routing constraints. Experimental results demonstrate that the proposed method achieves comparable WL and via usage to baseline methods while maintaining constraint satisfaction across a wide range of scenarios. Notably, the framework shows strong capability in solving complex routing instances that are difficult to handle using conventional approaches. Additionally, the method shows robust generalization performance across different problem sizes and net configurations.

Tema degli esploratori: calcolo e infrastrutture (elenco arXiv eess.SY, nuovi lavori del giorno).
Categorie arXiv: Systems and Control (eess.SY).
Pagina del lavoro: https://arxiv.org/abs/2611.02304 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:15:22.675Z dalla pagina https://arxiv.org/list/eess.SY/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).