This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Decision Diagram Method for Calculation of Pruned Walsh Transform
February 2001 (vol. 50 no. 2)
pp. 147-157

Abstract—Discrete Walsh transform is an orthogonal transform often used in spectral methods for different applications in signal processing and logic design. FFT-like algorithms make it possible to efficiently calculate the discrete Walsh spectrum. However, for their exponential complexity, these algorithms are practically unsuitable for large functions. For this reason, a Binary Decision Diagram (BDD) based recursive method for Walsh spectrum calculation has been introduced in [4]. A disadvantage of this algorithm is that the resulting Multi-Terminal Binary Decision Diagram (MTBDD) representing the Walsh spectrum for $f$ can be large for some functions. Another disadvantage turns out if particular Walsh coefficients are to be computed separately. The algorithm always calculates the entire spectrum and, therefore, it is rather inefficient for applications where a subset of Walsh spectral coefficients, i.e., the pruned Walsh spectrum, is required. In this paper, we propose another BDD-based method for Walsh spectrum calculation adapted for application where the pruned Walsh spectrum is needed. The method takes advantage of the property that, for most switching functions, the size of a BDD for $f$ is usually quite a bit smaller than the size of the MTBDD for the Walsh spectrum. In our method, a MTBDD representing the Walsh spectrum is not constructed. Instead, two additional fields are assigned to each node in the BDD for the processed function $f$. These fields are used to store the results of intermediate calculations. Pairs of spectral coefficients are calculated and stored in the fields assigned to the root node. Therefore, the calculation complexity of the proposed algorithm is proportional to the size of the BDD for $f$ whose spectrum is calculated. Experimental results demonstrate the efficiency of the approach.

[1] R.I. Bahar, E.A. Frohm, C.M. Gaona, G.P. Hatchel, E. Macii, A. Pardo, and F. Somenzi, “Algebraic Decision Diagrams and Their Applications,” Proc. Int'l Conf. Computer-Aided Design, pp. 180-191, Nov. 1993.
[2] K.G. Beauchamp, Applications of Walsh and Related Functions. New York: Academic Press, 1984.
[3] R.E. Bryant, "Graph-Based Algorithms for Boolean Function Manipulation," IEEE Trans. Computers, Vol. C-35, No. 8, Aug. 1986, pp. 667-690.
[4] E.M. Clarke, X. Zhao, M. Fujita, Y. Matsunaga, and P. McGeer, “Fast Walsh Transform Computation with Binary Decision Diagram,” Proc. IFIP WG 10.5 Workshop Applications of the Reed-Muller Expansion in Circuit Design, pp. 82-85, 1993.
[5] E.M. Clarke, M. Fujita, and X. Zhao, “Multi-Terminal Decision Diagrams and Hybrid Decision Diagrams,” Representation of Discrete Functions, T. Sasao and M. Fujita, eds., pp. 93-108, Kluwer Academic, 1996.
[6] E.M. Clarke, K.L. McMillan, X. Zhao, M. Fujita, and J. Yang, "Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping," Proc. 30th Design Automation Conf., pp. 54-60, 1993.
[7] T. Damarla and M.G. Karpovsky, “Reed-Muller Spectral Techniques for Fault Detection,” IEEE Trans. Computers, vol. 38, pp. 788-797, 1989.
[8] D.F. Elliot and K.R. Rao, Fast Transforms: Algorithms, Analysis, Applications. London: Academic Press, 1982.
[9] B.J. Falkowski, “Recursive Relationships, Fast Transforms, Generalizations and VLSI Iterative Architecture for Gray Code Ordered Walsh Functions,” IEE Proc. Computerized Digital Technology, vol. 142, no. 5, pp. 325-331, 1995.
[10] B.J. Falkowski, I. Schäfer, and M.A. Perkowski, “Effective Computer Methods for the Calculation of Rademacher-Walsh Spectrum for Completely and Incompletely Specified Boolean Functions,” IEEE Trans. Computer-Aided Design, vol. 11, no. 10, pp. 1207-1226, 1992.
[11] B.J. Falkowski and C.H. Chang, “Efficient Algorithms for the Calculation of Arithmetic Spectrum from OBDD and Synthesis of OBDD from Arithmetic Spectrum for Incompletely Specified Boolean Functions,” Proc. IEEE Int'l Symp. Circuits and Systems, vol. 1, pp. 197-200, London, May 1994.
[12] B.J. Falkowski and C.H. Chang, “Hadamard-Walsh Spectral Characterization of Reed-Muller Expressions,” Computers and Electrical Eng., vol. 25, no. 2, pp. 111-134, 1999.
[13] M. Fujita, J.C.-Y. Yang, M. Clarke, X. Zhao, and P. McGeer, “Fast Spectrum Computation for Logic Functions Using Binary Decision Diagrams,” Proc. Int'l Symp. Computer-Aided Surgery (ISCAS '94), pp. 275-278, 1994.
[14] D.H. Green and I.S. Taylor, “Modular Representation of Multiple-Valued-Logic Systems,” Proc. IEE, vol. 121, pp. 409-418, 1974.
[15] J.P. Hansen and M. Sekine, “Synthesis by Spectral Translation Using Boolean Decision Diagrams,” Proc. 33rd Design Automation Conf., pp. 248-253, 1996.
[16] T. Hsiao and S.C. Seth, “An Analysis of the Use of Rademacher-Walsh Spectrum in Compact Testing,” IEEE Trans. Computers, vol. 33, pp. 934-938, 1984.
[17] S.L. Hurst, The Logical Processing of Digital Signals. Crane Russak, and Edward Ar nold, 1978.
[18] J.S.L. Hurst, D.M. Miller,, and J.C. Muzio,Spectral Techniques in Digital Logic. Orlando, Fla.: Academic Press, 1985.
[19] S.L. Hurst, “Use of Linearization and Spectral Techniques in Input and Output Compaction Testing of Digital Networks,” IEE Proc. Computerized Digital Technology, vol. 136, pp. 48-56, 1989.
[20] M.G. Karpovsky, Finite Orthogonal Series in the Design of Digital Devices. New York and Jerusalem: Wiley and JUP, 1976.
[21] Y.T. Lai, M. Pedram, and S.B.K. Vrudhula, “EVBDD-Based Algorithms for Integer Linear Programming, Spectral Transformation, and Functional Decomposition,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 13, no. 8, pp. 959-975, Aug. 1994.
[22] D.M. Miller, “A Spectral Method for Boolean Function Matching,” Proc. European Design and Test Conf., pp. p. 602, 1996.
[23] D.M. Miller, “Spectral Transform of Multiple-Valued Decision Diagrams,” Proc. 24th Int'l Symp. Multiple-Valued Logic, pp. 89-96, 1994.
[24] C. Moraga and R. Heider, “Tutorial Review on Applications of the Walsh Transform in Switching Theory,” Proc. First Int'l Workshop Transforms and Filter Banks, pp. 494-512, June 1998.
[25] J.C. Muzio and S.L. Hurst, “The Computation of Complete and Reduced Sets of Orthogonal Spectral Coefficients for Logic Design and Pattern Recognition Purposes,” Computers&Electrical Eng., vol. 5, pp. 231-249, 1978.
[26] R.S. Stankovic and B.J. Falkowski, “FFT and Decision Diagrams Based Methods for Calculation of Spectral Transforms,” Proc. IEEE Int'l Conf. Information, Comm., and Signal Processing, vol. 1, pp. 241-245, 1997.
[27] M. Stankovic, D. Jankovic, and R.S. Stankovic, “Efficient Algorithm for Haar Spectrum Calculation,” Scientific Review, nos. 21-22, pp. 171-182, 1996.
[28] R.S. Stankovic and C. Moraga, “Reed-Muller-Fourier Representations of Multiple-Valued Functions over Galois Fields of Prime Cardinality,” Proc. IFIP WG 10.5 Workshop Applications of the Reed-Muller Expansion in Circuit Design, pp. 115-124, 1993.
[29] R.S. Stankovic, T. Sasao, and C. Moraga, “Spectral Transform Decision Diagrams” Representations of Discrete Functions, T. Sasao and M. Fujita, eds., pp. 55-92, Kluwer Academic, 1996.
[30] R.S. Stankovic, M. Stankovic, C. Moraga, and T. Sasao, “Calculation of Reed-Muller-Fourier Coefficients of Multiple-Valued Functions through Multiple-Place Decision Diagrams,” Proc. 24th Int'l Symp. Multiple-Valued Logic, pp. 82-88, 1994.
[31] M.R. Stojic, M.S. Stankovic, and R.S. Stankovic, Discrete Transforms in Applications, second ed. Belgrade: Nauka, 1993 (in Serbian).
[32] A. Thayse, M. Davio, and J.-P. Deschamps, “Optimization of Multiple-Valued Decision Algorithms,” Proc. Eighth Int'l Symp. Multiple-Valued Logic, pp. 171-177, 1978.
[33] M. Thornton, R. Drechsler, and W. Günther, “Probabilistic Equivalence Checking Using Partial Haar Spectral Diagrams,” Proc. IFIP WG 10.5 Workshop Applications of the Reed-Muller Expansion in Circuit Design, pp. 123-132, 1999.
[34] M. Thornton and V. Nair, “Efficient Calculation of Spectral Coefficients and Their Application,” IEEE Trans. Computer-Aided Design, vol. 14, no. 11, pp. 1328-1341, 1995.
[35] M. Thornton and V. Nair, “BDD Based Spectral Approach for Reed-Muller Circuit Realization,” IEE Proc. Computerized Digital Technology, vol. 193, no. 2, pp. 145-150, 1996.
[36] J. Yang and G. De Micheli, “Spectral Transforms for Technical Mapping,” Technical Report CSL-TR-91-498, Stanford Univ., Dec. 1991.

Index Terms:
Logic synthesis, spectral techniques, Walsh, pruned spectrum, BDD.
Citation:
Dragan Jankovic, Radomir S. Stankovic, Rolf Drechsler, "Decision Diagram Method for Calculation of Pruned Walsh Transform," IEEE Transactions on Computers, vol. 50, no. 2, pp. 147-157, Feb. 2001, doi:10.1109/12.908990
Usage of this product signifies your acceptance of the Terms of Use.