On computational complexity of a detailed routing problem in two dimensional FPGAs

In this paper, we consider the problem of mapping a given global route to a detailed route for two dimensional homogeneous FPGAs. It has been shown that this problem is NP-complete on a popular Xilinx-4000-like routing architecture. Here, we further prove that this problem remains NP-complete for an...

Full description

Saved in:
Bibliographic Details
Published inGreat Lakes 4th Symposium on VLSI: Design Automation of High Performance VLSI Systems pp. 70 - 75
Main Authors Yu-Liang Wu, Shuji Tsukiyama, Malgorzata Marek-Sadowska
Format Conference Proceeding
LanguageEnglish
Japanese
Published IEEE Comput. Soc. Press 17.12.2002
Subjects
Computational complexity
Costs
Field programmable gate arrays
Hardware
Production
Prototypes
Routing
Switches
Systems engineering and theory
Topology
Online AccessGet full text
ISBN0818656107
9780818656101
DOI10.1109/GLSV.1994.289993

Cover

More Information
Summary:In this paper, we consider the problem of mapping a given global route to a detailed route for two dimensional homogeneous FPGAs. It has been shown that this problem is NP-complete on a popular Xilinx-4000-like routing architecture. Here, we further prove that this problem remains NP-complete for an arbitrary fixed switch box topology of the same connection flexibility, with or without doglegs allowed in detailed routes.< >
ISBN:0818656107
9780818656101
DOI:10.1109/GLSV.1994.289993