Sciweavers

120 search results - page 8 / 24
» Timing-driven placement for FPGAs
Sort
View
FPGA
1999
ACM
139views FPGA» more  FPGA 1999»
13 years 12 months ago
Trading Quality for Compile Time: Ultra-Fast Placement for FPGAs
The demand for high-speed FPGA compilation tools has occurred for three reasons: first, as FPGA device capacity has grown, the computation time devoted to placement and routing h...
Yaska Sankar, Jonathan Rose
GLVLSI
2000
IEEE
110views VLSI» more  GLVLSI 2000»
14 years 3 days ago
A sensitivity based placer for standard cells
We present a new timing driven method for global placement. Our method is based on the observation that similar net length reductions in the different nets that make up a path may...
Bill Halpin, C. Y. Roger Chen, Naresh Sehgal
FPGA
2003
ACM
125views FPGA» more  FPGA 2003»
14 years 28 days ago
I/O placement for FPGAs with multiple I/O standards
In this paper, we present the first exact algorithm to solve the constrained I/O placement problem for FPGAs that support multiple I/O standards. We derive a compact integer line...
Wai-Kei Mak
DATE
2000
IEEE
142views Hardware» more  DATE 2000»
14 years 3 days ago
Power and Delay Reduction via Simultaneous Logic and Placement Optimization in FPGAs
Traditional FPGA design flows have treated logic synthesis and physical design as separate steps. With the recent advances in technology, the lack of information on the physical ...
Balakrishna Kumthekar, Fabio Somenzi
FPL
2007
Springer
100views Hardware» more  FPL 2007»
14 years 1 months ago
Clock-Aware Placement for FPGAs
The programmable clock networks in FPGAs have a significant impact on overall power, area, and delay. Not only does the clock network itself dissipate a significant amount of powe...
Julien Lamoureux, Steven J. E. Wilton