The autocorrelation transform and its application to the classification of Boolean functions

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.