
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
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. 147157, February, 2001.  
BibTex  x  
@article{ 10.1109/12.908990, author = {Dragan Jankovic and Radomir S. Stankovic and Rolf Drechsler}, title = {Decision Diagram Method for Calculation of Pruned Walsh Transform}, journal ={IEEE Transactions on Computers}, volume = {50}, number = {2}, issn = {00189340}, year = {2001}, pages = {147157}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.908990}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  Decision Diagram Method for Calculation of Pruned Walsh Transform IS  2 SN  00189340 SP147 EP157 EPD  147157 A1  Dragan Jankovic, A1  Radomir S. Stankovic, A1  Rolf Drechsler, PY  2001 KW  Logic synthesis KW  spectral techniques KW  Walsh KW  pruned spectrum KW  BDD. VL  50 JA  IEEE Transactions on Computers ER   
Abstract—Discrete Walsh transform is an orthogonal transform often used in spectral methods for different applications in signal processing and logic design. FFTlike 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 MultiTerminal Binary Decision Diagram (MTBDD) representing the Walsh spectrum for
[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. ComputerAided Design, pp. 180191, Nov. 1993.
[2] K.G. Beauchamp, Applications of Walsh and Related Functions. New York: Academic Press, 1984.
[3] R.E. Bryant, "GraphBased Algorithms for Boolean Function Manipulation," IEEE Trans. Computers, Vol. C35, No. 8, Aug. 1986, pp. 667690.
[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 ReedMuller Expansion in Circuit Design, pp. 8285, 1993.
[5] E.M. Clarke, M. Fujita, and X. Zhao, “MultiTerminal Decision Diagrams and Hybrid Decision Diagrams,” Representation of Discrete Functions, T. Sasao and M. Fujita, eds., pp. 93108, 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. 5460, 1993.
[7] T. Damarla and M.G. Karpovsky, “ReedMuller Spectral Techniques for Fault Detection,” IEEE Trans. Computers, vol. 38, pp. 788797, 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. 325331, 1995.
[10] B.J. Falkowski, I. Schäfer, and M.A. Perkowski, “Effective Computer Methods for the Calculation of RademacherWalsh Spectrum for Completely and Incompletely Specified Boolean Functions,” IEEE Trans. ComputerAided Design, vol. 11, no. 10, pp. 12071226, 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. 197200, London, May 1994.
[12] B.J. Falkowski and C.H. Chang, “HadamardWalsh Spectral Characterization of ReedMuller Expressions,” Computers and Electrical Eng., vol. 25, no. 2, pp. 111134, 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. ComputerAided Surgery (ISCAS '94), pp. 275278, 1994.
[14] D.H. Green and I.S. Taylor, “Modular Representation of MultipleValuedLogic Systems,” Proc. IEE, vol. 121, pp. 409418, 1974.
[15] J.P. Hansen and M. Sekine, “Synthesis by Spectral Translation Using Boolean Decision Diagrams,” Proc. 33rd Design Automation Conf., pp. 248253, 1996.
[16] T. Hsiao and S.C. Seth, “An Analysis of the Use of RademacherWalsh Spectrum in Compact Testing,” IEEE Trans. Computers, vol. 33, pp. 934938, 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. 4856, 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, “EVBDDBased Algorithms for Integer Linear Programming, Spectral Transformation, and Functional Decomposition,” IEEE Trans. ComputerAided Design of Integrated Circuits and Systems, vol. 13, no. 8, pp. 959975, 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 MultipleValued Decision Diagrams,” Proc. 24th Int'l Symp. MultipleValued Logic, pp. 8996, 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. 494512, 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. 231249, 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. 241245, 1997.
[27] M. Stankovic, D. Jankovic, and R.S. Stankovic, “Efficient Algorithm for Haar Spectrum Calculation,” Scientific Review, nos. 2122, pp. 171182, 1996.
[28] R.S. Stankovic and C. Moraga, “ReedMullerFourier Representations of MultipleValued Functions over Galois Fields of Prime Cardinality,” Proc. IFIP WG 10.5 Workshop Applications of the ReedMuller Expansion in Circuit Design, pp. 115124, 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. 5592, Kluwer Academic, 1996.
[30] R.S. Stankovic, M. Stankovic, C. Moraga, and T. Sasao, “Calculation of ReedMullerFourier Coefficients of MultipleValued Functions through MultiplePlace Decision Diagrams,” Proc. 24th Int'l Symp. MultipleValued Logic, pp. 8288, 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 MultipleValued Decision Algorithms,” Proc. Eighth Int'l Symp. MultipleValued Logic, pp. 171177, 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 ReedMuller Expansion in Circuit Design, pp. 123132, 1999.
[34] M. Thornton and V. Nair, “Efficient Calculation of Spectral Coefficients and Their Application,” IEEE Trans. ComputerAided Design, vol. 14, no. 11, pp. 13281341, 1995.
[35] M. Thornton and V. Nair, “BDD Based Spectral Approach for ReedMuller Circuit Realization,” IEE Proc. Computerized Digital Technology, vol. 193, no. 2, pp. 145150, 1996.
[36] J. Yang and G. De Micheli, “Spectral Transforms for Technical Mapping,” Technical Report CSLTR91498, Stanford Univ., Dec. 1991.