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

Authors:
Whitney J. Townsend;Mitchell A. Thornton;Rolf Drechsler;D. Michael Miller
Affiliations:
Mississippi State University, Mississippi State, MS;Mississippi State University, Mississippi State, MS;University of Bremen, Bremen, Germany;University of Victoria, Victoria, BC, Canada
Venue:
Proceedings of the 12th ACM Great Lakes symposium on VLSI
Year:
2002

Citing 10
Cited 1

Graph-Based Algorithms for Boolean Function Manipulation

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
Efficient representation and manipulation of switching functions based on ordered Kronecker functional decision diagrams

DAC '94 Proceedings of the 31st annual Design Automation Conference
Verification of arithmetic circuits with binary moment diagrams

DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Synthesis by spectral translation using Boolean decision diagrams

DAC '96 Proceedings of the 33rd annual Design Automation Conference
Forward and Inverse Transformations Between Haar Spectra and Ordered Binary Decision Diagrams of Boolean Functions

IEEE Transactions on Computers
Spectral decision diagrams using graph transformations

Proceedings of the conference on Design, automation and test in Europe
Spectral Techniques in VLSI CAD

Spectral Techniques in VLSI CAD
Spectral Techniques in Digital Logic

Spectral Techniques in Digital Logic
A Method for Approximate Equivalence Checking

ISMVL '00 Proceedings of the 30th IEEE International Symposium on Multiple-Valued Logic

Improved Boolean function hashing based on multiple-vertex dominators

Proceedings of the 2005 Asia and South Pacific Design Automation Conference

Quantified Score

Hi-index	0.00

Visualization

Abstract

Spectral techniques have found many applications in computer-aided 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.