Sciweavers

373 search results - page 20 / 75
» Learning Arithmetic Circuits
Sort
View
ASPDAC
2007
ACM
124views Hardware» more  ASPDAC 2007»
14 years 19 days ago
Improving XOR-Dominated Circuits by Exploiting Dependencies between Operands
Logic synthesis has made impressive progress in the last decade and has pervaded digital design replacing almost universally manual techniques. A remarkable exception is computer ...
Ajay K. Verma, Paolo Ienne
APPROX
2009
Springer
104views Algorithms» more  APPROX 2009»
14 years 3 months ago
Improved Polynomial Identity Testing for Read-Once Formulas
An arithmetic read-once formula (ROF for short) is a formula (a circuit whose underlying graph is a tree) in which the operations are {+, ×} and such that every input variable la...
Amir Shpilka, Ilya Volkovich
CORR
2010
Springer
130views Education» more  CORR 2010»
13 years 6 months ago
Interactive Learning Based Realizability and 1-Backtracking Games
Abstract. We prove that interactive learning based classical realizability (introduced by Aschieri and Berardi for first order arithmetic [1]) is sound with respect to Coquand game...
Federico Aschieri
SASP
2009
IEEE
222views Hardware» more  SASP 2009»
14 years 3 months ago
Arithmetic optimization for custom instruction set synthesis
Abstract—One of the ways that custom instruction set extensions can improve over software execution is through the use of hardware structures that have been optimized at the arit...
Ajay K. Verma, Yi Zhu, Philip Brisk, Paolo Ienne
PDPTA
2003
13 years 10 months ago
Quaternary Arithmetic Logic Unit on a Programmable Logic Device
Common binary arithmetic operations such as addition/subtraction and multiplication suffer from O(n) carry propagation delay where n is the number of digits. Carry lookahead helps...
Songpol Ongwattanakul, Phaisit Chewputtanagul, Dav...