Sciweavers

868 search results - page 66 / 174
» Optimizing Logic Design Using Boolean Transforms
Sort
View
POPL
2010
ACM
15 years 7 months ago
Generating Compiler Optimizations from Proofs
We present an automated technique for generating compiler optimizations from examples of concrete programs before and after improvements have been made to them. The key technical ...
Ross Tate, Michael Stepp, Sorin Lerner
DAC
2004
ACM
15 years 10 months ago
Quantum logic synthesis by symbolic reachability analysis
Reversible quantum logic plays an important role in quantum computing. In this paper, we propose an approach to optimally synthesize quantum circuits by symbolic reachability anal...
William N. N. Hung, Xiaoyu Song, Guowu Yang, Jin Y...
ICCAD
2002
IEEE
112views Hardware» more  ICCAD 2002»
15 years 2 months ago
ATPG-based logic synthesis: an overview
The ultimate goal of logic synthesis is to explore implementation flexibility toward meeting design targets, such as area, power, and delay. Traditionally, such flexibility is exp...
Chih-Wei Jim Chang, Malgorzata Marek-Sadowska
PEPM
2004
ACM
15 years 3 months ago
Imperative program optimization by partial evaluation
We implement strength reduction and loop-invariant code motion by specializing instrumented interpreters; we define a novel program transformation that uses bisimulation to ident...
Søren Debois
ISLPED
2004
ACM
169views Hardware» more  ISLPED 2004»
15 years 3 months ago
Delay optimal low-power circuit clustering for FPGAs with dual supply voltages
This paper presents a delay optimal FPGA clustering algorithm targeting low power. We assume that the configurable logic blocks of the FPGA can be programmed using either a high s...
Deming Chen, Jason Cong