Spectral Interpretation and Applications of Decision Diagrams

Abstract

Different Decision Diagrams (DDs) for representation of discrete functions are discussed. DDs can be derived by applying some reduction rules to Decision Trees (DTs) which in turn are graphical representations of some function expressions for discrete functions. Various DTs and their generalizations based on lesser known AND-EXOR rather than AND-OR expressions are surveyed. Finally, the concept of spectral interpretation of DDs and some of their applications and ways of calculation are also presented.

Spectral Testing of Digital Circuits

“…Recursive algorithms, data flow-graph methods and parallel calculations similar to Fast Fourier Transform have been also used to calculate Walsh and other related transforms [5,6,41,81]. A number of efficient methods to calculate various spectra of Boolean functions based on standard and spectral decision diagrams have also been reported [12,13,28,68].…”