EFFICIENT CALCULATION OF THE AUTOCORRELATION OF BOOLEAN FUNCTIONS WITH THE LARGE NUMBER OF VARIABLES

The autocorrelation of a Boolean function is animportant mathematical concept with various applications. It is a kernel ofmany algorithms with essential applications whose efficiency is directlylimited by the time and space complexity of methods for computing theautocorrelation. These limitations, in this paper, can be overcome by computingthe autocorrelation through Shared Multi-Terminal Binary Decision Diagram(SMTBDD) that are a data structure allowing compact representations of largeBoolean functions. The computation is performed in the spectral domain byexploiting the Wiener-Khinchin theorem and the fast calculation algorithm throughSMTBDDs. It is necessary to develop a specialized decision diagram package withall the standard BDD operations that support fast calculation algorithm throughdecision diagrams and dynamically resizable terminal nodes allows to deal withlarge integers that appear in computing the autocorrelation coefficients. Anexperimental evaluation over benchmarks, confirmed favorably the efficiency ofthe proposed data structure and related algorithms