Elsevier

Digital Signal Processing

Volume 4, Issue 4, October 1994, Pages 245-254
Digital Signal Processing

Regular Article
Efficient Spectral Coefficient Calculation Using Circuit Output Probabilities

https://doi.org/10.1006/dspr.1994.1024Get rights and content

Abstract

Many problems in the field of digital logic may he solved more efficiently in the spectral domain than in the Boolean domain. However, the primary drawback of spectral techniques is the large complexity associated with the calculation of the spectrum of a Boolean function. We present a new method for the computation of a spectral coefficient that has a complexity equal to O(|E|) where |E| is the number of edges in a binary decision diagram characterizing the circuit. This result is especially significant for techniques that require the calculation of only a few spectral coefficients since it allows the computations to be accomplished very efficiently and does not require storage resources for a large number of values. Furthermore, this method holds for any general spectral transform and does not require the transformation matrix to be recursively defined or sparse.

References (0)

Cited by (6)

  • Solving hybrid Boolean constraints in continuous space via multilinear Fourier expansions

    2021, Artificial Intelligence
    Citation Excerpt :

    However, we believe that the current order of presentation is more natural and informative. The idea of evaluating Fourier Expansions and the result of Theorem 6 can find connections with circuit-output probability and spectral coefficients [81,82]. Related research showed that local search SAT solvers, such as GSAT, spend most of the time on the so-called “sideway” moves [14].

  • On Continuous Local BDD-Based Search for Hybrid SAT Solving

    2021, 35th AAAI Conference on Artificial Intelligence, AAAI 2021
  • BDD-based spectral approach for Reed-Muller circuit realisation

    1996, IEE Proceedings: Computers and Digital Techniques
View full text