Analysis of disjoint decomposition of balanced Boolean functions through the Walsh spectrum

IEE Proceedings: Computers and Digital Techniques

Volumn 148, Issue 2, 2001, Pages 71-78

  Falkowski, B J ^a   Kannurao, S ^a  

^a NANYANG TECHNOLOGICAL UNIVERSITY   (Singapore)

Author keywords

[No Author keywords available]

Indexed keywords

ADDERS; COMPUTER AIDED DESIGN; LOGIC DESIGN; SPECTRUM ANALYSIS; VLSI CIRCUITS; WALSH TRANSFORMS;

DISJOINT DECOMPOSITIONS; PARITY CHECKERS;

BOOLEAN FUNCTIONS;

EID: 0035268659     PISSN: 13502387     EISSN: None     Source Type: Journal    
DOI: 10.1049/ip-cdt:20010205     Document Type: Article

References (17)

1. Synthesis by spectral translation using Boolean decision diagrams
2. Design of multiplexer universal logic module networks using spectral techniques
3. Synthesis of multilevel multiplexer circuits for incompletely specified multi-output Boolean functions with mapping to multiplexer based FPGAs
4. Efficient calculation of spectral coefficients and their applications
5. Decoding of cyclic codes on curves
6. Spectral transforms for large Boolean functions with applications to technology mapping
7. Effective computer methods for the calculation of Rademacher-Walsh spectrum for completely and incompletely specified Boolean functions
8. Forward and inverse transformations between haar spectra and ordered binary decision diagrams of Boolean functions
9. Linear sif̀ting of decision diagrams and its applications in synthesis
10. Balanced Boolean functions
11. A comparison of logical efficiency of reversible and conventional gates
12. Spectral theory of disjunctive decomposition for balanced Boolean functions