170 search results - page 5 / 34 » On two-step routing for FPGAS |
DAC
2003
ACM
13 years 12 months ago
2003
ACM
In this paper we propose a partitioning-based placement algorithm for FPGAs. The method incorporates simple, but effective heuristics that target delay minimization. The placement...
ISVLSI
2005
IEEE
14 years 8 days ago
2005
IEEE
Mesh interconnect can be efficiently utilized while tree networks encourage the short routing distances. In this paper, we present the property analysis of a cluster-based interc...
FPL
2005
Springer
14 years 7 days ago
2005
Springer
As the logic capacity of FPGA increases, there has been a corresponding increase in the variety of FPGA building blocks. From a mere collection of the conventional logic blocks, F...
FPGA
1998
ACM
13 years 11 months ago
1998
ACM
Three factors are driving the demand for rapid FPGA compilation. First, as FPGAs have grown in logic capacity, the compile computation has grown more quickly than the compute powe...
ASPDAC
2004
ACM
14 years 4 days ago
2004
ACM
- This paper presents a solution to the problem of designing interconnects for memory devices. More precisely, it solves the automatic routing problem of memory peripheral circuits...