## Efficient Approximation of Spectral and Autocorrelation Coefficients (1996)

Venue: | Department of Computer Science at James Cook University, Townsville Australia |

Citations: | 2 - 1 self |

### BibTeX

@INPROCEEDINGS{David96efficientapproximation,

author = {Dr. David and David M. Wessels},

title = {Efficient Approximation of Spectral and Autocorrelation Coefficients},

booktitle = {Department of Computer Science at James Cook University, Townsville Australia},

year = {1996}

}

### OpenURL

### Abstract

In this paper we provide polynomial time approximation techniques which allow us to calculate, to arbitrary levels of accuracy and with high probability of success, the spectral coefficients and autocorrelation coefficients of Boolean functions, given that those functions are expressed in either Sum-of-Products or Product-of-Sums form. 1 Introduction The focus of this paper is on the generation of spectral coefficients and autocorrelation coefficients for Boolean functions. Efficient calculation of those coefficients would allow digital logic analysts to draw on the large body of research already effectively employed in the area of signal processing. Utilisation of coefficient-based techniques in areas such as logic testing and synthesis has traditionally been hampered by the computational requirements for coefficient calculation. To reduce the computational demands, we use an approximation technique to estimate the coefficient values. As arbitrary levels of accuracy can still be obta...

### Citations

32 |
Monte Carlo approximation algorithms for enumeration problems
- Karp, Luby, et al.
- 1989
(Show Context)
Citation Context ...the vector. 2 Counting satisfying assignments The problem of counting the number of satisfying assignments to a Boolean function expressed in sum-of-products (SOP) form was addressed by Karp et al in =-=[7]-=-. Their proposed solution approximated the number of satisfying assignments to any degree of accuracy in polynomialtime with a high probability of success. In section 2.1 we summarise their technique,... |

21 | Efficient Calculation of Spectral Coefficients and Their Applications
- Thornton, Nair
- 1995
(Show Context)
Citation Context ...s in SOP expressions of the function [3], ffl the use of integer valued binary decision diagrams [1], [4], ffl the use of circuit output probabilities [6], ffl combinations of the last two approaches =-=[8]-=-. Detailed discussion of the spectral coefficients can be found in [5], here we provide a summary. Given a function, f , of m input variables, the set of 2 m Rademacher-Walsh coefficients can be descr... |

18 |
M.: Spectral transforms for extremely large Boolean functions
- Clarke, M, et al.
(Show Context)
Citation Context ...mpts to reduce that complexity have included: ffl calculation techniques based on sets of disjoint cubes in SOP expressions of the function [3], ffl the use of integer valued binary decision diagrams =-=[1]-=-, [4], ffl the use of circuit output probabilities [6], ffl combinations of the last two approaches [8]. Detailed discussion of the spectral coefficients can be found in [5], here we provide a summary... |

15 |
Fast Spectrum Computation for Logic Functions using Binary Decision Diagrams
- Fujita, Yang
- 1995
(Show Context)
Citation Context ...to reduce that complexity have included: ffl calculation techniques based on sets of disjoint cubes in SOP expressions of the function [3], ffl the use of integer valued binary decision diagrams [1], =-=[4]-=-, ffl the use of circuit output probabilities [6], ffl combinations of the last two approaches [8]. Detailed discussion of the spectral coefficients can be found in [5], here we provide a summary. Giv... |

15 |
Probabilistic Design Verification
- Jain, Bitner, et al.
- 1991
(Show Context)
Citation Context ...ulation techniques based on sets of disjoint cubes in SOP expressions of the function [3], ffl the use of integer valued binary decision diagrams [1], [4], ffl the use of circuit output probabilities =-=[6]-=-, ffl combinations of the last two approaches [8]. Detailed discussion of the spectral coefficients can be found in [5], here we provide a summary. Given a function, f , of m input variables, the set ... |

9 |
Spectral techniques in digital logic
- Hurst, Miller, et al.
- 1985
(Show Context)
Citation Context ...d binary decision diagrams [1], [4], ffl the use of circuit output probabilities [6], ffl combinations of the last two approaches [8]. Detailed discussion of the spectral coefficients can be found in =-=[5]-=-, here we provide a summary. Given a function, f , of m input variables, the set of 2 m Rademacher-Walsh coefficients can be described as follows: R 0 (f) is the sum of the minterms 1 of f . R x1;x2 ;... |

8 |
Calculation of the Rademacher-Walsh spectrum from a reduced representation of boolean functions
- Falkowski, Schafer, et al.
- 1992
(Show Context)
Citation Context ... due to the associated computational complexity. Recent attempts to reduce that complexity have included: ffl calculation techniques based on sets of disjoint cubes in SOP expressions of the function =-=[3]-=-, ffl the use of integer valued binary decision diagrams [1], [4], ffl the use of circuit output probabilities [6], ffl combinations of the last two approaches [8]. Detailed discussion of the spectral... |

4 |
Variable ordering for robdd-based fpga logic synthesis
- Crow
- 1995
(Show Context)
Citation Context ... coefficient associated with the function for each possible m-bit shift vector u. Given that u; v are m-bit Boolean vectors, the autocorrelation coefficient of f associated with u can be expressed as =-=[2]-=-: B(u) = 2 m \Gamma1 X v=0 f(v) \Delta f(v \Phi u) Simply put, the autocorrelation function computes a measure of similarity between the function in question and the same function shifted or permuted ... |