Wire type assignment for FPGA routing

Seokjin Lee, Hua Xiang, D. F. Wong, Richard Y. Sun

Research output: Contribution to conferencePaperpeer-review


The routing channels of an FPGA consist of wire segments of various types providing the tradeoff between performance and routability. In the routing architectures of recently developed FPGAs (e.g., Virtex-II), there are more versatile wire types and richer connections between them than those of the older generations of FPGAs (e.g. XC4000). To fully exploit the potential of the new routing architectures, it is beneficial to perform wire type assignment for all channels as an intermediate stage between global routing and detailed routing. In this paper, we present a wire-type assignment algorithm that is based on iteratively applying min-cost maxflow technique to simultaneously route many nets. At each stage of the network flow computation, we have guaranteed optimal result in terms of routability and delay cost. We use the routing architecture of the Virtex-II FPGAs from Xilinx as a target architecture in our experiments. Experimental results show that our algorithm outperforms the traditional sequential net-by-net approach.

Original languageEnglish (US)
Number of pages7
StatePublished - 2003
EventACM/SIGDA 11th ACM International Symposium on Field Programmable Gate Arrays - Monterey, CA, United States
Duration: Feb 23 2003Feb 25 2003


OtherACM/SIGDA 11th ACM International Symposium on Field Programmable Gate Arrays
Country/TerritoryUnited States
CityMonterey, CA


  • FPGA routing
  • Min-cost flow algorithm
  • Wire type assignment

ASJC Scopus subject areas

  • Computer Science(all)


Dive into the research topics of 'Wire type assignment for FPGA routing'. Together they form a unique fingerprint.

Cite this