Sciweavers

68 search results - page 9 / 14
» From boolean to quantitative synthesis
Sort
View
99
Voted
ISCAS
2006
IEEE
94views Hardware» more  ISCAS 2006»
15 years 3 months ago
On the sensitivity of BDDs with respect to path-related objective functions
— Reduced ordered Binary Decision Diagrams (BDDs) are a data structure for efficient representation and manipulation of Boolean functions. They are frequently used in logic synt...
Rüdiger Ebendt, Rolf Drechsler
ISLPED
1997
ACM
96views Hardware» more  ISLPED 1997»
15 years 1 months ago
Re-mapping for low power under tight timing constraints
In this paper1 we propose a novel approach to synthesis for low power under tight timing constraints. Starting from a mapped netlist, we apply a powerful generalized matching algo...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
LCTRTS
2010
Springer
15 years 4 months ago
Contracts for modular discrete controller synthesis
We describe the extension of a reactive programming language with a behavioral contract construct. It is dedicated to the programming of reactive control of applications in embedd...
Gwenaël Delaval, Hervé Marchand, &Eacu...
96
Voted
PG
2007
IEEE
15 years 3 months ago
Statistical Hypothesis Testing for Assessing Monte Carlo Estimators: Applications to Image Synthesis
Image synthesis algorithms are commonly compared on the basis of running times and/or perceived quality of the generated images. In the case of Monte Carlo techniques, assessment ...
Kartic Subr, James Arvo
FPGA
2009
ACM
180views FPGA» more  FPGA 2009»
15 years 4 months ago
Scalable don't-care-based logic optimization and resynthesis
We describe an optimization method for combinational and sequential logic networks, with emphasis on scalability and the scope of optimization. The proposed resynthesis (a) is cap...
Alan Mishchenko, Robert K. Brayton, Jie-Hong Rolan...