Graph-Based Algorithms for Boolean Function Manipulation
IEEE Transactions on Computers
Arithmetic Spectrum Applied to Fault Detection for Combinational Networks
IEEE Transactions on Computers
Spectral transforms for large boolean functions with applications to technology mapping
DAC '93 Proceedings of the 30th international Design Automation Conference
Algebraic decision diagrams and their applications
ICCAD '93 Proceedings of the 1993 IEEE/ACM international conference on Computer-aided design
Representations of Discrete Functions
Representations of Discrete Functions
Spectral Techniques in Digital Logic
Spectral Techniques in Digital Logic
Optimization of multivalued decision algorithms
MVL '78 Proceedings of the eighth international symposium on Multiple-valued logic
Verification of Arithmetic Functions with Binary Moment Diagrams
Verification of Arithmetic Functions with Binary Moment Diagrams
Finite Orthogonal Series in Design of Digital Devices
Finite Orthogonal Series in Design of Digital Devices
| Hi-index | 0.00 |
This paper shows that binary decision diagrams (BDDs) and their generalizations are not only representations of switching and integer-valued functions, but also Fourier-like series expansions of them. Furthermore, it shows that edge-valued binary decision diagrams (EVBDDs) are related to arithmetic transform decision diagrams (ACDDs), which are the integer counterparts of the functional decision diagrams (FDDs). Finally, it shows that the complexity of multi-terminal binary decision diagrams (MTBDDs), EVBDDs and ACDDs of a function if depends on the structure of the truth-vector of if, partial arithmetic transform spectra of if and the arithmetic transform spectrum of if, respectively.