Name
Abstract | ||
|---|---|---|
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 subdiagrarns 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. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1587/transfun.E97.A.1140 | IEICE TRANSACTIONS ON FUNDAMENTALS OF ELECTRONICS COMMUNICATIONS AND COMPUTER SCIENCES |
Keywords | Field | DocType |
switching theory, computation of transforms, binary decision diagram, BDD-package | Discrete mathematics,Computer science,Binary decision diagram,Theoretical computer science,Autocorrelation,Computation | Journal |
Volume | Issue | ISSN |
E97A | 5 | 1745-1337 |
Citations | PageRank | References |
0 | 0.34 | 3 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Milos Radmanovic | 1 | 2 | 2.14 |
| Radomir S. Stankovic | 2 | 188 | 47.07 |
| Claudio Moraga | 3 | 612 | 100.27 |