The Application of the Rademacher-Walsh Transform to Boolean Function Classification and Threshold Logic Synthesis

Authors:
C. R. Edwards
Affiliations:
School of Electrical Engineering, University of Bath
Venue:
IEEE Transactions on Computers
Year:
1975

Citing 2
Cited 3

Computation of the Fast Walsh-Fourier Transform

IEEE Transactions on Computers
On the characterization of threshold functions

FOCS '61 Proceedings of the 2nd Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1961)

Composite Spectra and the Analysis of Switching Circuits

IEEE Transactions on Computers
A Digital Synthesis Procedure Under Function Symmetries and Mapping Methods

IEEE Transactions on Computers
New considerations for spectral classification of boolean switching functions

VLSI Design

Quantified Score

Hi-index	15.00

Visualization

Abstract

Five operations are defined in the Rademacher-Walsh transform domain. It is shown that these operations allow Boolean functions to be classified in a very concise way. The result of applying this classification to Boolean functions of up to fourth order indicates that threshold functions play an important part in the composition of Boolean functions. A synthesis method is developed for the synthesis of any Boolean function using, as a basic element, an "optimized universal threshold logic gate." This gate overcomes the analog threshold tolerancing problems encountered in other threshold gate designs and is readily fabricated in an integrated circuit form. The use of this gate in logic design is expected to provide a considerable cost-saving over conventional methods.