The autocorrelation transform and its application to the classification of Boolean functions
Author:
- 1 August 2009
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15555798,p. 94-99
Abstract
Classification of Boolean functions is a known problem in digital logic. There are far too many possible Boolean functions to examine each one, and so we attempt to classify similar functions together into groups, or classes. This paper continues work that uses the autocorrelation transform to determine a classification technique. Some new considerations are raised and additional analysis of the autocorrelation classes is presented.Keywords
This publication has 5 references indexed in Scilit:
- Properties of Autocorrelation Coefficients for Single-Output Switching FunctionsInternational Journal of Computer Theory and Engineering, 2009
- ESOP-based Toffoli Gate Cascade Generation2007
- Use of the autocorrelation function in the classification of switching functions2003
- Reduction of sizes of decision diagrams by autocorrelation functionsIEEE Transactions on Computers, 2003
- The Application of the Rademacher–Walsh Transform to Boolean Function Classification and Threshold Logic SynthesisIEEE Transactions on Computers, 1975