19 search results - page 1 / 4 » Antisymmetries in the realization of Boolean functions |
ISCAS
2002
IEEE
13 years 9 months ago
2002
IEEE
New symmetries of degree two are introduced, along with spectral techniques for identifying these symmetries. Some applications of these symmetries are discussed, in particular th...
CCCG
2010
13 years 6 months ago
2010
We show how to construct interlocked collections of simple polygons in the plane that fall apart upon removing certain combinations of pieces. Precisely, interiordisjoint simple p...
ASPDAC
2007
ACM
13 years 8 months ago
2007
ACM
Factoring is a logic minimization technique to represent a Boolean function in an equivalent function with minimum literals. When realizing the circuit, a function represented in ...
VLSID
2002
IEEE
13 years 9 months ago
2002
IEEE
A new approach to synthesizing totally symmetric Boolean functions is presented. First, a novel cellular array is introduced for synthesizing unate symmetric functions. Using this...
DATE
2006
IEEE
13 years 10 months ago
2006
IEEE
State machine based simulation of Boolean functions is substantially faster if the function being simulated is symmetric. Unfortunately function symmetries are comparatively rare....