Sciweavers

105 search results - page 7 / 21
» Constant Multipliers for FPGAs
Sort
View
ARC
2012
Springer
256views Hardware» more  ARC 2012»
12 years 2 months ago
Table-Based Division by Small Integer Constants
Computing cores to be implemented on FPGAs may involve divisions by small integer constants in fixed or floating point. This article presents a family of architectures addressing...
Florent de Dinechin, Laurent-Stéphane Didie...
FPL
2010
Springer
104views Hardware» more  FPL 2010»
13 years 5 months ago
Multiplicative Square Root Algorithms for FPGAs
Abstract--Most current square root implementations for FPGAs use a digit recurrence algorithm which is well suited to their LUT structure. However, recent computing-oriented FPGAs ...
Florent de Dinechin, Mioara Joldes, Bogdan Pasca, ...
VLSID
2007
IEEE
92views VLSI» more  VLSID 2007»
14 years 7 months ago
Floorplanning in Modern FPGAs
State-of-the-art FPGA architectures have millions of gates in CLBs, Block RAMs, and Multiplier blocks which can host fairly large designs. While their physical design calls for oor...
Pritha Banerjee, Susmita Sur-Kolay, Arijit Bishnu
FPGA
2004
ACM
133views FPGA» more  FPGA 2004»
14 years 13 days ago
FPGAs vs. CPUs: trends in peak floating-point performance
Moore’s Law states that the number of transistors on a device doubles every two years; however, it is often (mis)quoted based on its impact on CPU performance. This important co...
Keith D. Underwood
CAI
2004
Springer
13 years 7 months ago
An Evolvable Combinational Unit for FPGAs
A complete hardware implementation of an evolvable combinational unit for FPGAs is presented. The proposed combinational unit consisting of a virtual reconfigurable circuit and evo...
Lukás Sekanina, Stepan Friedl