Sciweavers

Share
IPL
2010
82views more  IPL 2010»
8 years 4 months ago
New upper bounds on the Boolean circuit complexity of symmetric functions
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 ...
E. Demenkov, Arist Kojevnikov, Alexander S. Kuliko...
TNN
1998
254views more  TNN 1998»
8 years 5 months ago
Periodic symmetric functions, serial addition, and multiplication with neural networks
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...
Sorin Cotofana, Stamatis Vassiliadis
VLSID
2002
IEEE
81views VLSI» more  VLSID 2002»
8 years 11 months ago
A New Synthesis of Symmetric Functions
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...
Hafizur Rahaman, Debesh K. Das, Bhargab B. Bhattac...
ATS
2003
IEEE
151views Hardware» more  ATS 2003»
8 years 11 months ago
BDD Based Synthesis of Symmetric Functions with Full Path-Delay Fault Testability
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...
Junhao Shi, Görschwin Fey, Rolf Drechsler
FSE
2004
Springer
92views Cryptology» more  FSE 2004»
8 years 11 months ago
Results on Rotation Symmetric Bent and Correlation Immune Boolean Functions
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,...
Pantelimon Stanica, Subhamoy Maitra, John A. Clark
VLSI
2007
Springer
9 years 8 days ago
Use of gray decoding for implementation of symmetric functions
— 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...
Osnat Keren, Ilya Levin, Radomir S. Stankovic
DCC
2006
IEEE
9 years 5 months ago
Basic Theory in Construction of Boolean Functions with Maximum Possible Annihilator Immunity
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...
Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarka...
DCC
2008
IEEE
9 years 5 months ago
Idempotents in the neighbourhood of Patterson-Wiedemann functions having Walsh spectra zeros
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...
Sumanta Sarkar, Subhamoy Maitra
books