Sciweavers

93 search results - page 6 / 19
» Timing optimization of FPGA placements by logic replication
Sort
View
ICDT
2005
ACM
124views Database» more  ICDT 2005»
15 years 3 months ago
Optimal Distributed Declustering Using Replication
A common technique for improving performance for database query retrieval is to decluster the database among multiple disks so that retrievals can be parallelized. In this paper we...
Keith B. Frikken
74
Voted
FPGA
2004
ACM
136views FPGA» more  FPGA 2004»
15 years 3 months ago
Active leakage power optimization for FPGAs
We consider active leakage power dissipation in FPGAs and present a “no cost” approach for active leakage reduction. It is well-known that the leakage power consumed by a digi...
Jason Helge Anderson, Farid N. Najm, Tim Tuan
FCCM
2006
IEEE
162views VLSI» more  FCCM 2006»
15 years 3 months ago
Power Visualization, Analysis, and Optimization Tools for FPGAs
This paper introduces the Low-Power Intelligent Tool Environment (LITE), an object oriented tool set designed for power visualization, analysis, and optimization. These tools lever...
Matthew French, Li Wang, Michael J. Wirthlin
ICCAD
1999
IEEE
99views Hardware» more  ICCAD 1999»
15 years 1 months ago
Concurrent logic restructuring and placement for timing closure
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...
Jinan Lou, Wei Chen, Massoud Pedram
GLVLSI
2006
IEEE
90views VLSI» more  GLVLSI 2006»
15 years 3 months ago
Low-power clustering with minimum logic replication for coarse-grained, antifuse based FPGAs
This paper presents a minimum area, low-power driven clustering algorithm for coarse-grained, antifuse-based FPGAs under delay constraints. The algorithm accurately predicts logic...
Chang Woo Kang, Massoud Pedram