Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Autocorrelation and decomposition methods in combinational logic design
Autocorrelation and decomposition methods in combinational logic design
Spectral Techniques and Fault Detection
Spectral Techniques and Fault Detection
Binary Polynomial and Nonlinear Digital Filters
Binary Polynomial and Nonlinear Digital Filters
Representations of Discrete Functions
Representations of Discrete Functions
Use of the Autocorrelation Function in the Classification of Switching Functions
DSD '02 Proceedings of the Euromicro Symposium on Digital Systems Design
Spectral Interpretation of Decision Diagrams
Spectral Interpretation of Decision Diagrams
Autocorrelation coefficients in the representation and classification of switching functions
Autocorrelation coefficients in the representation and classification of switching functions
Linear sifting of decision diagrams and its application in synthesis
IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems
Low complexity linear decomposition at the disjoint cubes domain
EHAC'06 Proceedings of the 5th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Linearization of logical functions defined by a set of orthogonal terms. I. Theoretical aspects
Automation and Remote Control
| Hi-index | 0.00 |
The paper considers calculation of autocorrelation functions on finite dyadic groups over decision diagrams. The methods exploit recursive structure of both autocorrelation matrices and decision diagrams. First, it is discussed calculation of the autocorrelation through the Wiener-Khinchin theorem implemented over decision diagrams. Then, it is proposed a method for calculation of separate autocorrelation coefficients over decision diagrams with permuted labels at the edges. For the case of restricted memory resources, a procedure with in-place calculations over the decision diagram for the function processed has been defined.