Sciweavers

373 search results - page 26 / 75
» Learning Arithmetic Circuits
Sort
View
IOLTS
2008
IEEE
117views Hardware» more  IOLTS 2008»
14 years 3 months ago
Verification and Analysis of Self-Checking Properties through ATPG
Present and future semiconductor technologies are characterized by increasing parameters variations as well as an increasing susceptibility to external disturbances. Transient err...
Marc Hunger, Sybille Hellebrand
CASES
2008
ACM
13 years 10 months ago
Design space exploration for field programmable compressor trees
The Field Programmable Compressor Tree (FPCT) is a programmable compressor tree (e.g., a Wallace or Dadda Tree) intended for integration in an FPGA or other reconfigurable device....
Seyed Hosein Attarzadeh Niaki, Alessandro Cevrero,...
FPGA
2008
ACM
168views FPGA» more  FPGA 2008»
13 years 9 months ago
Architectural improvements for field programmable counter arrays: enabling efficient synthesis of fast compressor trees on FPGAs
The Field Programmable Counter Array (FPCA) was introduced to improve FPGA performance for arithmetic circuits. An FPCA is a reconfigurable IP core that can be integrated into an ...
Alessandro Cevrero, Panagiotis Athanasopoulos, Had...
JC
2008
92views more  JC 2008»
13 years 8 months ago
Characterizing Valiant's algebraic complexity classes
Valiant introduced 20 years ago an algebraic complexity theory to study the complexity of polynomial families. The basic computation model used is the arithmetic circuit, which ma...
Guillaume Malod, Natacha Portier
DATE
2000
IEEE
114views Hardware» more  DATE 2000»
14 years 1 months ago
Automating RT-Level Operand Isolation to Minimize Power Consumption in Datapaths
Designs which do not fully utilize their arithmetic datapath components typically exhibit a significant overhead in power consumption. Whenever a module performs an operation who...
Michael Münch, Norbert Wehn, Bernd Wurth, Ren...