DocumentCode :
1492598
Title :
Spectral analysis of Boolean functions as a graph eigenvalue problem
Author :
Bernasconi, Anna ; Codenotti, Bruno
Author_Institution :
Inst. fur Inf., Tech. Univ. Munchen, Germany
Volume :
48
Issue :
3
fYear :
1999
fDate :
3/1/1999 12:00:00 AM
Firstpage :
345
Lastpage :
351
Abstract :
Several problems in digital logic can be conveniently approached in the spectral domain. In this paper we show that the Walsh spectrum of Boolean functions can be analyzed by looking at algebraic properties of a class of Cayley graphs associated with Boolean functions. We use this idea to investigate the Walsh spectrum of certain special functions
Keywords :
Boolean functions; Walsh functions; eigenvalues and eigenfunctions; spectral analysis; Boolean functions; Cayley graphs; Walsh spectrum; algebraic properties; digital logic; graph eigenvalue problem; spectral analysis; Boolean functions; Circuit synthesis; Circuit testing; Eigenvalues and eigenfunctions; Graph theory; Input variables; Logic circuits; Logic testing; Polynomials; Spectral analysis;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/12.755000
Filename :
755000
Link To Document :
بازگشت