Sciweavers

309 search results - page 1 / 62
» A New Synthesis of Symmetric Functions
Sort
View
VLSID
2002
IEEE
81views VLSI» more  VLSID 2002»
13 years 9 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»
13 years 9 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
IPL
2010
82views more  IPL 2010»
13 years 2 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...
ISCAS
1999
IEEE
82views Hardware» more  ISCAS 1999»
13 years 8 months ago
Regular symmetric arrays for non-symmetric functions
A new class of non-totally symmetric functions which can be represented as simple regular symmetric arrays without redundancy is identified. Regular circuits are becoming crucialy...
Malgorzata Chrzanowska-Jeske
CF
2008
ACM
13 years 6 months ago
Exact combinational logic synthesis and non-standard circuit design
Using a new exact synthesizer that automatically induces minimal universal boolean function libraries, we introduce two indicators for comparing their expressiveness: the first ba...
Paul Tarau, Brenda Luderman