Authors: Radmanović, Miloš
Stanković, Radomir 
Moraga, Claudio
Title: Computation of the total autocorrelation over shared binary decision diagrams
Journal: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Volume: E97-A
Issue: 5
First page: 1140
Last page: 1143
Issue Date: 1-Jan-2014
ISSN: 0916-8508
DOI: 10.1587/transfun.E97.A.1140
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
Keywords: BDD-package | Binary decision diagram | Computation of transforms | Switching theory
Publisher: IEICE

Show full item record


checked on May 27, 2024

Page view(s)

checked on May 9, 2024

Google ScholarTM




Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.