Sciweavers

707 search results - page 54 / 142
» The Nonhomomorphicity of Boolean Functions
Sort
View
QEST
2006
IEEE
14 years 2 months ago
Compositional Quantitative Reasoning
Abstract. We present a compositional theory of system verification, where specifications assign real-numbered costs to systems. These costs can express a wide variety of quantita...
Krishnendu Chatterjee, Luca de Alfaro, Marco Faell...
ACSD
2010
IEEE
239views Hardware» more  ACSD 2010»
13 years 6 months ago
A Complete Synthesis Method for Block-Level Relaxation in Self-Timed Datapaths
Self-timed circuits present an attractive solution to the problem of process variation. However, implementing selftimed combinational logic can be complex and expensive. This pape...
W. B. Toms, David A. Edwards
VLSID
1998
IEEE
105views VLSI» more  VLSID 1998»
14 years 7 days ago
Optimizing Logic Design Using Boolean Transforms
When a Boolean function is transformed by exclusiveOR with a suitably selected transform function, the new functzon is often synthesized wzth significantly reduced hardware. `I�...
Pramit Chavda, James Jacob, Vishwani D. Agrawal
DM
2006
72views more  DM 2006»
13 years 8 months ago
Patterson-Wiedemann construction revisited
In 1983, Patterson and Wiedemann constructed Boolean functions on n = 15 input variables having nonlinearity strictly greater than 2n-1 -2 n-1 2 . Construction of Boolean function...
Sugata Gangopadhyay, Pradipkumar H. Keskar, Subham...
DAC
2009
ACM
14 years 9 months ago
Nanoscale digital computation through percolation
In this study, we apply a novel synthesis technique for implementing robust digital computation in nanoscale lattices with random interconnects: percolation theory on random graph...
Mustafa Altun, Marc D. Riedel, Claudia Neuhauser