Sciweavers

373 search results - page 15 / 75
» Learning Arithmetic Circuits
Sort
View
DATE
2006
IEEE
104views Hardware» more  DATE 2006»
14 years 2 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...
SODA
2012
ACM
235views Algorithms» more  SODA 2012»
11 years 11 months ago
Fast zeta transforms for lattices with few irreducibles
We investigate fast algorithms for changing between the standard basis and an orthogonal basis of idempotents for M¨obius algebras of finite lattices. We show that every lattice...
Andreas Björklund, Mikko Koivisto, Thore Husf...
LICS
1998
IEEE
14 years 26 days ago
On Proofs about Threshold Circuits and Counting Hierarchies
Hierarchies (Extended Abstract) Jan Johannsen Chris Pollett Department of Mathematics Department of Computer Science University of California, San Diego Boston University La Jolla,...
Jan Johannsen, Chris Pollett
TCAD
2008
102views more  TCAD 2008»
13 years 8 months ago
Quantum Circuit Simplification and Level Compaction
Abstract--Quantum circuits are time-dependent diagrams describing the process of quantum computation. Usually, a quantum algorithm must be mapped into a quantum circuit. Optimal sy...
Dmitri Maslov, Gerhard W. Dueck, D. Michael Miller...
VTS
1995
IEEE
99views Hardware» more  VTS 1995»
14 years 4 days ago
Arithmetic built-in self test for high-level synthesis
In this paper, we propose an entirely new Built-In Self Test scheme for high-level synthesis of data path architectures that makes use of the arithmetic blocks in the data path to...
Nilanjan Mukherjee, H. Kassab, Janusz Rajski, Jerz...