Complexities of Graph-Based Representations for Elementary Functions

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.

[1]  Zhihong Zeng,et al.  Taylor expansion diagrams: a compact, canonical representation with applications to symbolic verification , 2002, Proceedings 2002 Design, Automation and Test in Europe Conference and Exhibition.

[2]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[3]  Claudio Moraga,et al.  Spectral Transform Decision Diagrams , 1996 .

[4]  Rolf Drechsler,et al.  Binary Decision Diagrams - Theory and Implementation , 1998 .

[5]  Samuel D. Johnson.  Branching programs and binary decision diagrams: theory and applications by Ingo Wegener society for industrial and applied mathematics, 2000 408 pages , 2010, SIGA.

[6]  Shinobu Nagayama,et al.  Compact representations of logic functions using heterogeneous MDDs , 2003, 33rd International Symposium on Multiple-Valued Logic, 2003. Proceedings..

[7]  Randal E. Bryant,et al.  On the Complexity of VLSI Implementations and Graph Representations of Boolean Functions with Application to Integer Multiplication , 1991, IEEE Trans. Computers.

[8]  Jack E. Volder.  The CORDIC Trigonometric Computing Technique , 1959, IRE Trans. Electron. Comput..

[9]  Ray Andraka,et al.  A survey of CORDIC algorithms for FPGA based computers , 1998, FPGA '98.

[10]  Sarma Sastry,et al.  Edge-valued binary decision for multi-level hierarchical verification , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[11]  Tsutomu Sasao,et al.  Switching Theory for Logic Synthesis , 1999, Springer US.

[12]  Radomir S. Stanković,et al.  Spectral Interpretation of Decision Diagrams , 2003, Springer New York.

[13]  Yung-Te Lai,et al.  Edge-valued binary decision diagrams for multi-level hierarchical verification , 1992, DAC '92.

[14]  Christoph Meinel,et al.  Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications , 2012 .

[15]  R. Drechsler,et al.  Formal verification of word-level specifications , 1999, Design, Automation and Test in Europe Conference and Exhibition, 1999. Proceedings (Cat. No. PR00078).

[16]  Michael T. Goodrich,et al.  Education forum: Web Enhanced Textbooks , 1998, SIGA.

[17]  Rolf Drechsler,et al.  Spectral Techniques in VLSI CAD , 2001, Springer US.

[18]  Tiziano Villa,et al.  Multi-valued decision diagrams: theory and applications , 1998 .

[19]  Shinobu Nagayama,et al.  Representations of Two-Variable Elementary Functions Using EVMDDs and their Applications to Function Generators , 2008, 38th International Symposium on Multiple Valued Logic (ismvl 2008).

[20]  Sarma Vrudhula,et al.  EVBDD-based algorithms for integer linear programming, spectral transformation, and function decomposition , 1994, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..

[21]  亀山 充隆.  Decision Diagram Techniques for Micro- and Nanoelectronic Design HANDBOOK, S.N. Yanushkevich, D.M. Milller, V.P. Shmerko, and R.S. Stankovic (著), "Decision Diagram Techniques for Micro- and Nanoelectronic Design HANDBOOK", CRC Press, (2006), B5判, 定価($99.95) , 2006 .

[22]  Shinobu Nagayama,et al.  On the optimization of heterogeneous MDDs , 2005, IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems.

[23]  Arthur Tatnall.  History of Computing: Learning from the Past IFIP WG 9.7 International Conference, HC 2010, Held as Part of WCC 2010, Brisbane, Australia, September ... in Information and Communication Technology) , 2010 .

[24]  Masahiro Fujita,et al.  Spectral Transforms for Large Boolean Functions with Applications to Technology Mapping , 1997, Formal Methods Syst. Des..

[25]  Rolf Drechsler,et al.  K*BMDs: a new data structure for verification , 1996, Proceedings ED&TC European Design and Test Conference.

[26]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[27]  Aaas News,et al.  Book Reviews , 1893, Buffalo Medical and Surgical Journal.

[28]  Shinobu Nagayama,et al.  Representations of Elementary Functions Using Edge-Valued MDDs , 2007, 37th International Symposium on Multiple-Valued Logic (ISMVL'07).

[29]  Jean-Michel Muller,et al.  Elementary functions - algorithms and implementation (2. ed.) , 2006 .

[30]  Shinobu Nagayama,et al.  Representations of Elementary Functions Using Binary Moment Diagrams , 2006, 36th International Symposium on Multiple-Valued Logic (ISMVL'06).

[31]  Randal E. Bryant,et al.  Verification of Arithmetic Circuits with Binary Moment Diagrams , 1995, 32nd Design Automation Conference.