Computing walsh, arithmetic, and reed-muller spectral decision diagrams using graph transformations

Spectral techniques have found many applications in computeraided design, including synthesis, verification, and testing. Decision diagram representations permit spectral coefficients to be calculated via graph-based algorithms. In this paper, algorithms are described for transforming multi-output functions to produce Walsh, arithmetic, and Reed-Muller spectral decision diagrams and the experimental results of those implementations are presented. Categories and Subject Descriptors B.6.3 [Logic Design]: Design Aids – automatic synthesis, optimization, switching theory, verification. J.6. [Computer-Aided Engineering]: Computer -aided design. General Terms Algorithm, Design, Verification. Keywords Data Structures, Decision Diagrams, Discrete Functions, Spectral Methods.

• Type: Conference
• Year: 2002
• Where: GLVLSI
• Authors: Whitney J. Townsend, Mitchell A. Thornton, Rolf Drechsler, D. Michael Miller
• Keywords: Decision Diagram Representations, Decision Diagrams, GLVLSI 2002, Spectral Decision Diagrams, VLSI