Sciweavers

120 search results - page 5 / 24
» Functions Definable by Arithmetic Circuits
Sort
View
ICCAD
1995
IEEE
127views Hardware» more  ICCAD 1995»
13 years 11 months ago
Hybrid decision diagrams
Abstract: Functions that map boolean vectors into the integers are important for the design and veri cation of arithmetic circuits. MTBDDs and BMDs have been proposed for represent...
Edmund M. Clarke, Masahiro Fujita, Xudong Zhao
CASES
2009
ACM
13 years 11 months ago
Exploiting residue number system for power-efficient digital signal processing in embedded processors
2's complement number system imposes a fundamental limitation on the power and performance of arithmetic circuits, due to the fundamental need of cross-datapath carry propaga...
Rooju Chokshi, Krzysztof S. Berezowski, Aviral Shr...
JSYML
2002
66views more  JSYML 2002»
13 years 7 months ago
Proving Consistency of Equational Theories in Bounded Arithmetic
We consider equational theories for functions defined via recursion involving equations between closed terms with natural rules based on recursive definitions of the function symb...
Arnold Beckmann
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
14 years 1 months ago
Pre-synthesis optimization of multiplications to improve circuit performance
Conventional high-level synthesis uses the worst case delay to relate all inputs to all outputs of an operation. This is a very conservative approximation of reality, especially i...
Rafael Ruiz-Sautua, María C. Molina, Jos&ea...
DATE
1999
IEEE
101views Hardware» more  DATE 1999»
13 years 11 months ago
Polynomial Methods for Allocating Complex Components
Methods for performing component matching by expressing an arithmetic specification and a bit-level description of an implementation as word-level polynomials have been demonstrat...
James Smith, Giovanni De Micheli