IPL
2010
13 years 11 months ago
2010
In this note, we present improved upper bounds on the circuit complexity of symmetric Boolean functions. In particular, we describe circuits of size 4.5n + o(n) for any symmetric ...
TNN
1998
14 years 2 days ago
1998
Abstract—This paper investigates threshold based neural networks for periodic symmetric Boolean functions and some related operations. It is shown that any n-input variable perio...
VLSID
2002
IEEE
14 years 5 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...
ATS
2003
IEEE
14 years 5 months ago
2003
IEEE
A new technique for synthesizing totally symmetric Boolean functions is presented that achieves complete robust path delay fault testability. We apply BDDs for the synthesis of sy...
FSE
2004
Springer
14 years 5 months ago
2004
Springer
Recent research shows that the class of Rotation Symmetric Boolean Functions (RSBFs), i.e., the class of Boolean functions that are invariant under circular translation of indices,...
VLSI
2007
Springer
14 years 6 months ago
2007
Springer
— This paper discusses reduction of the number of product terms in representation of totally symmetric Boolean functions by Sum of Products (SOP) and Fixed Polarity ReedMuller (F...
DCC
2006
IEEE
15 years 19 hour ago
2006
IEEE
So far there is no systematic attempt to construct Boolean functions with maximum annihilator immunity. In this paper we present a construction keeping in mind the basic theory of...
DCC
2008
IEEE
15 years 19 hour ago
2008
IEEE
In this paper we study the neighbourhood of 15-variable Patterson-Wiedemann (PW) functions, i.e., the functions that differ by a small Hamming distance from the PW functions in te...