This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Spectral Lower Bound Technique for the Size of Decision Trees and Two-Level AND/OR Circuits
February 1990 (vol. 39 no. 2)
pp. 282-287

A universal lower-bound technique for the size and other implementation characteristics of an arbitrary Boolean function as a decision tree and as a two-level AND/OR circuit is derived. The technique is based on the power spectrum coefficients of the n dimensional Fourier transform of the function. The bounds vary from constant to exponential and are tight in many cases. Several examples are presented.

[1] R. J. Lechner, "Harmonic analysis of switching functions," inRecent Developments in Switching Theory, A. Mukhopdhyay, Ed. New York: Academic, 1971.
[2] M. G. Karpovsky,Finite Orthogonal Series in the Design of Digital Devices. New York: Wiley, 1976.
[3] S. L. Hurst, D. M. Miller, and J. C. Muzio, "Spectral method of Boolean function complexity,"IEE Electron. Lett., vol. 18, pp. 572-574, 1982.
[4] M. G. Karpovsky and L. B. Levitin, "Universal testing of computer hard-ware," inSpectral Techniques and Fault Detection, M. G. Karpovsky, ed. Orlando, FL: Academic, 1985.
[5] S. L. Hurst, D. M. Miller, and J. C. Muzio,Spectral Techniques in Digital Logic. New York: Academic, 1985.
[6] Y. Brandman, "Spectral lower-bounds techniques for logic circuits," Ph.D. dissertation, Stanford Univ., Stanford, CA, 1987.
[7] R. E. Bryant, "Graph-based algorithms for Boolean function manipulation,"IEEE Trans. Comput., vol. C-35, no. 8, pp. 677-691, Aug. 1986.
[8] R. N. Bracewell,The Fourier Transform and Its Application. New York: McGraw-Hill, 1978.
[9] F. J. MacWilliams and N. J. A. Sloane,The Theory of Error Correcting Codes. New York: North Holland, 1977.

Index Terms:
spectral lower bound technique; decision trees; two-level AND/OR circuits; arbitrary Boolean function; power spectrum coefficients; n dimensional Fourier transform; Boolean functions; Fourier transforms; logic circuits; trees (mathematics).
Citation:
Y. Brandman, A. Orlitsky, J. Hennessy, "A Spectral Lower Bound Technique for the Size of Decision Trees and Two-Level AND/OR Circuits," IEEE Transactions on Computers, vol. 39, no. 2, pp. 282-287, Feb. 1990, doi:10.1109/12.45216
Usage of this product signifies your acceptance of the Terms of Use.