
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Anna Bernasconi, Bruno Codenotti, "Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem," IEEE Transactions on Computers, vol. 48, no. 3, pp. 345351, March, 1999.  
BibTex  x  
@article{ 10.1109/12.755000, author = {Anna Bernasconi and Bruno Codenotti}, title = {Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem}, journal ={IEEE Transactions on Computers}, volume = {48}, number = {3}, issn = {00189340}, year = {1999}, pages = {345351}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.755000}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Spectral Analysis of Boolean Functions as a Graph Eigenvalue Problem IS  3 SN  00189340 SP345 EP351 EPD  345351 A1  Anna Bernasconi, A1  Bruno Codenotti, PY  1999 KW  Boolean function KW  graph eigenvalue KW  Cayley graph KW  Walsh spectrum KW  spectral coefficient. VL  48 JA  IEEE Transactions on Computers ER   
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.
[1] N. Alon, O. Goldreich, J. Håstad, and R. Peralta, “Simple Constructions of Almost$k$wise Independent Random Variables,” Random Structures&Algorithms, vol. 3, pp. 289304, 1992.
[2] B. Arazi, “Some Properties of Hadamard Matrices Generated Recursively by Kronecker Products,” Linear Algebra and Its Applications, vol. 25, pp. 2739, 1979.
[3] R. Beigel, “The Polynomial Method in Circuit Complexity,” Proc. Eighth Structure, pp. 8295, 1993.
[4] N. Biggs,Algebraic Graph Theory. Cambridge Univ. Press, 1968.
[5] Y. Brandman, A. Orlitsky, and J. Hennessy, “A Spectral Lower Bound Technique for the Size of Decision Trees and TwoLevel AND/OR Circuits,” IEEE Trans. Computers, vol. 39, no. 2, pp. 282287, Feb. 1990.
[6] J. Bruck and M. Blaum, “Neural Networks, ErrorCorrecting Codes, and Polynomials Over the Binary nCube,” IEEE Trans. Information Theory, vol. 35, pp. 976987, 1989.
[7] J. Bruck, “Harmonic Analysis of Polynomial Threshold Functions,” SIAM J. Discrete Mathematics, vol. 3, pp. 168177, 1990.
[8] D.M. Cvetkovic, M. Doob, and H. Sachs,Spectra of Graphs. Academic Press, 1979.
[9] T. Damarla,“Generalized transforms for multiple valued circuits and their fault detection,” IEEE Trans. Computers, vol. 41, no. 9, pp. 1,1011,109, Sept. 1992.
[10] C.R. Edwards, “The Application of the RademacherWalsh Transform to Boolean Function Classification and Threshold Logic Synthesis,” IEEE Trans. Computers, pp. 4862, 1975.
[11] T.C. Hsiao and S.C. Seth, “An Analysis of the Use of RademacherWalsh Spectrum in Compact Testing,” IEEE Trans. Computers, vol. 33, no. 10, pp. 934937, Oct. 1984.
[12] J.S.L. Hurst, D.M. Miller,, and J.C. Muzio,Spectral Techniques in Digital Logic. Orlando, Fla.: Academic Press, 1985.
[13] J. Jackson, “The Harmonic Sieve: A Novel Application of Fourier Analysis to Machine Learning Theory and Practice,” PhD Thesis, Carnegie Mellon Univ., 1995.
[14] R.J. Lechner, “Harmonic Analysis of Switching Functions,” Recent Development in Switching Theory, pp. 122229. Academic Press, 1971.
[15] N. Linial, Y. Mansour, and N. Nisan, “Constant Depth Circuits, Fourier Transform, and Learnability,” J. ACM, vol. 40, pp. 607620, 1993.
[16] A. Lubotzky, R. Phillips, and P. Sarnak, “Ramanujan Graphs,” Combinatorica, vol. 8, pp. 261277, 1988.
[17] J. Naor and M. Naor, “SmallBias Probability Spaces: Efficient Constructions and Applications,” SIAM J. Computing, vol. 22, pp. 838856, 1993.
[18] O.S. Rothaus, “On 'Bent' Functions,” J. Combinatorial Theory (A), vol. 20, pp. 300305, 1976.
[19] R.S. Stankovic, T. Sasao, and C. Moraga, “Spectral Transform Decision Diagrams,” Representations of Discrete Functions, T. Sasao and M. Fujita, eds. Kluwer Academic, 1996.
[20] A.K. Susskind, “Testing By Verifying Walsh Coefficients,” IEEE Trans. Computers, vol. 32, no. 2, pp. 198201, Feb. 1983.
[21] M.A. Thornton and V.S.S. Nair, “An Iterative Combinational Logic Synthesis Technique Using Spectral Information,” Proc. European Design Automation Conf., pp. 358363, 1993.
[22] U. Vazirani, “Randomness, Adversaries and Computation,” PhD thesis, Univ. of California, Berkeley, 1986.