Fast algorithm for computing spectral transforms of boolean and multiple-valued functions on circuit representation
2003 (English)In: 33RD INTERNATIONAL SYMPOSIUM ON MULTIPLE-VALUED LOGIC, PROCEEDINGS, 2003, 334-339 p.Conference paper (Other academic)
In this paper we present a fast algorithm for computing the value of a spectral transform of Boolean or multiple-valued functions for a given assignment of input variables. Our current implementation is for arithmetic transform, because our work is primarily aimed at optimizing the performance of probabilistic verification methods. However, the presented technique is equally applicable for other discrete transforms, e.g. Walsh or Reed-Muller transforms. Previous methods for computing spectral transforms used truth tables, sum-of-product expressions, or various derivatives of decision diagrams. They were fundamentally limited by the excessive memory requirements of these data structures. We present a new algorithm that partitions the computation of the spectral transform based on the dominator relations of the circuit graph representing the function to be transformed As a result, the presented algorithm can handle larger functions than previously possible.
Place, publisher, year, edition, pages
2003. 334-339 p.
, International symp on multiple-valued logic - proceedings, ISSN 0195-623X
IdentifiersURN: urn:nbn:se:kth:diva-6854DOI: 10.1109/ISMVL.2003.1201426ISI: 000183282100050OAI: oai:DiVA.org:kth-6854DiVA: diva2:11678
33rd International Symposium on Multiple-Valued Logic (ISMVL 2003) MEIJI UNIV, TOKYO, JAPAN, MAY 16-19, 2003
QC 201102152007-03-012007-03-012012-08-22Bibliographically approved