Sciweavers

7 search results - page 1 / 2
» Progressive Decomposition: A Heuristic to Structure Arithmet...
Sort
View
DAC
2007
ACM
14 years 5 months ago
Progressive Decomposition: A Heuristic to Structure Arithmetic Circuits
Despite the impressive progress of logic synthesis in the past decade, finding the best architecture for a given circuit still remains an open problem and largely unsolved. In mos...
Ajay K. Verma, Philip Brisk, Paolo Ienne
ASPDAC
2004
ACM
105views Hardware» more  ASPDAC 2004»
13 years 10 months ago
Improved symbolic simulation by functional-space decomposition
Abstract — This paper presents a functional-space decomposition approach to enhance the capability of symbolic simulation. In our symbolic simulator, the control part and datapat...
Tao Feng, Li-C. Wang, Kwang-Ting Cheng
ASPDAC
2007
ACM
124views Hardware» more  ASPDAC 2007»
13 years 8 months 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
DATE
2007
IEEE
112views Hardware» more  DATE 2007»
13 years 11 months ago
Automatic synthesis of compressor trees: reevaluating large counters
Despite the progress of the last decades in electronic design automation, arithmetic circuits have always received way less attention than other classes of digital circuits. Logic...
Ajay K. Verma, Paolo Ienne
CORR
2011
Springer
161views Education» more  CORR 2011»
12 years 8 months ago
Quadratic Goldreich-Levin Theorems
Decomposition theorems in classical Fourier analysis enable us to express a bounded function in terms of few linear phases with large Fourier coefficients plus a part that is pseu...
Madhur Tulsiani, Julia Wolf