The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.01 - January (2009 vol.58)
pp: 106-119
Shinobu Nagayama , Hiroshima City University, Hiroshima
Tsutomu Sasao , Kyushu Institute of Technology, Iizuka
ABSTRACT
This paper analyzes complexities of decision diagrams for elementary functions such as polynomial, trigonometric, logarithmic, square root, and reciprocal functions. These real functions are converted into integer-valued functions by using fixed-point representation. This paper presents the numbers of nodes in decision diagrams representing the integer-valued functions. First, complexities of decision diagrams for polynomial functions are analyzed, since elementary functions can be approximated by polynomial functions. A theoretical analysis shows that binary moment diagrams (BMDs) have low complexity for polynomial functions. Second, this paper analyzes complexity of edge-valued binary decision diagrams (EVBDDs) for monotone functions, since many common elementary functions are monotone. It introduces a new class of integer functions, Mp-monotone increasing function, and derives an upper bound on the number of nodes in an EVBDD for the Mp-monotone increasing function. A theoretical analysis shows that EVBDDs have low complexity for Mp-monotone increasing functions. This paper also presents the exact number of nodes in the smallest EVBDD for the n-bit multiplier function, and a variable order for the smallest EVBDD.
INDEX TERMS
Decision Diagrams, General, Trees, Elementary function approximation, Representations
CITATION
Shinobu Nagayama, Tsutomu Sasao, "Complexities of Graph-Based Representations for Elementary Functions", IEEE Transactions on Computers, vol.58, no. 1, pp. 106-119, January 2009, doi:10.1109/TC.2008.134
REFERENCES
[1] S.B. Akers, “Binary Decision Diagrams,” IEEE Trans. Computers, vol. 27, no. 6, pp. 509-516, June 1978.
[2] R. Andraka, “A Survey of CORDIC Algorithms for FPGA Based Computers,” Proc. ACM/SIGDA Sixth Int'l Symp. Field Programmable Gate Array (FPGA '98), pp. 191-200, Feb. 1998.
[3] R.E. Bryant, “Graph-Based Algorithms for Boolean Function Manipulation,” IEEE Trans. Computers, vol. 35, no. 8, pp.677-691, Aug. 1986.
[4] R.E. Bryant, “On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Applications to Integer Multiplication,” IEEE Trans. Computers, vol. 40, no. 2, pp.205-213, Feb. 1991.
[5] R.E. Bryant and Y.-A. Chen, “Verification of Arithmetic Circuits with Binary Moment Diagrams,” Proc. 32nd Design Automation Conf. (DAC '95), pp. 535-541, 1995.
[6] M.J. Ciesielski, P. Kalla, Z. Zheng, and B. Rouzeyre, “Taylor Expansion Diagrams: A Compact Canonical Representation with Applications to Symbolic Verification,” Proc. Design, Automation and Test in Europe (DATE '02), pp. 285-289, 2002.
[7] 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 ACM/IEEE Design Automation Conf. (DAC '93), pp. 54-60, June 1993.
[8] R. Drechsler, B. Becker, and S. Ruppertz, “K*BMDs: A New Data Structure for Verification,” Proc. European Design and Test Conf. (ED&TC '96), pp. 2-8, 1996.
[9] R. Drechsler and B. Becker, Binary Decision Diagrams: Theory and Implementation. Kluwer Academic, 1998.
[10] R. Enders, “Note on the Complexity of Binary Moment Diagram Representations,” Proc. Workshop Applications of the Reed-Muller Expansion in Circuit Design, pp. 191-197, Aug. 1995.
[11] M.T. Goodrich and R. Tamassia, Data Structures and Algorithms in JAVA. John Wiley & Sons, 1998.
[12] S. Höreth and R. Drechsler, “Formal Verification of Word-Level Specifications,” Proc. Design, Automation and Test in Europe (DATE'99), pp. 52-58, 1999.
[13] T. Kam, T. Villa, R.K. Brayton, and A.L. Sangiovanni-Vincentelli, “Multi-Valued Decision Diagrams: Theory and Applications,” Multiple-Valued Logic: An Int'l J., vol. 4, nos. 1-2, pp. 9-62, 1998.
[14] Y-T. Lai and S. Sastry, “Edge-Valued Binary Decision Diagrams for Multi-Level Hierarchical Verification,” Proc. 29th ACM/IEEE Design Automation Conf. (DAC '92), pp. 608-613, 1992.
[15] Y-T. Lai, M. Pedram, and S.B. Vrudhula, “EVBDD-Based Algorithms for Linear Integer 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.
[16] C. Meinel and T. Theobald, Algorithms and Data Structures in VLSI Design: OBDD—Foundations and Applications. Springer, 1998.
[17] J.-M. Muller, Elementary Function: Algorithms and Implementation. Birkhauser, 1997.
[18] S. Nagayama and T. Sasao, “Compact Representations of Logic Functions Using Heterogeneous MDDs,” IEICE Trans. Fundamentals, vol. E86-A, no. 12, pp. 3168-3175, Dec. 2003.
[19] S. Nagayama and T. Sasao, “On the Optimization of Heterogeneous MDDs,” IEEE Trans. Computer-Aided Design of Integrated Circuits and Systems, vol. 24, no. 11, pp. 1645-1659, Nov. 2005.
[20] S. Nagayama and T. Sasao, “Representations of Elementary Functions Using Edge-Valued MDDs,” Proc. 37th Int'l Symp. Multiple-Valued Logic (ISMVL '07), May 2007.
[21] S. Nagayama and T. Sasao, “Representations of Two-Variable Elementary Functions Using Edge-Valued MDDs and Their Applications to Function Generators,” Proc. 38th Int'l Symp. Multiple-Valued Logic (ISMVL '08), May 2008.
[22] Representations of Discrete Functions, T. Sasao and M. Fujita, eds. Kluwer Academic, 1996.
[23] T. Sasao, Switching Theory for Logic Synthesis. Kluwer Academic, 1999.
[24] T. Sasao and S. Nagayama, “Representations of Elementary Functions Using Binary Moment Diagrams,” Proc. 36th Int'l Symp. Multiple-Valued Logic (ISMVL '06), May 2006.
[25] R. Stankovic, T. Sasao, and C. Moraga, Spectral Transform Decision Diagrams, chapter 3 in [22].
[26] R. Stankovic and J. Astola, Spectral Interpretation of Decision Diagrams. Springer Verlag, 2003.
[27] R. Stankovic and J. Astola, “Remarks on the Complexity of Arithmetic Representations of Elementary Functions for Circuit Design,” Proc. Workshop Applications of the Reed-Muller Expansion in Circuit Design and Representations and Methodology of Future Computing Technology, pp. 5-11, May 2007.
[28] M.A. Thornton, R. Drechsler, and D.M. Miller, Spectral Techniques in VLSI CAD. Springer, 2001.
[29] J.E. Volder, “The CORDIC Trigonometric Computing Technique,” IRE Trans. Electronic Computers, vol. 8, no. 3, pp. 330-334, Sept. 1959.
[30] I. Wegener, Branching Programs and Binary Decision Diagrams: Theory and Applications. SIAM, 2000.
[31] M.R. Williams, History of Computing Technology. IEEE CS Press, 1997.
[32] S.N. Yanushkevich, D.M. Miller, V.P. Shmerko, and R.S. Stankovic, Decision Diagram Techniques for Micro- and Nanoelectronic Design. CRC Press, Taylor and Francis Group, 2006.
22 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool