|Computation of the total autocorrelation over shared binary decision diagrams
|IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
This paper describes a method for the efficient computation of the total autocorrelation for large multiple-output Boolean functions over a Shared Binary Decision Diagram (SBDD). The existing methods for computing the total autocorrelation over decision diagrams are restricted to single output functions and in the case of multiple-output functions require repeating the procedure k times where k is the number of outputs. The proposed method permits to perform the computation in a single traversal of SBDD. In that order, compared to standard BDD packages, we modified the way of traversing sub-diagrams in SBDD and introduced an additional memory function kept in the hash table for storing results of the computation of the autocorrelation between two subdiagrams in the SBDD. Due to that, the total amount of computations is reduced which makes the method feasible in practical applications. Experimental results over standard benchmarks confirm the efficiency of the method.Copyright
|BDD-package | Binary decision diagram | Computation of transforms | Switching theory
Show full item record
checked on Feb 21, 2024
checked on Feb 22, 2024
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.