Abstract
This paper describes a neural network approach that gives an estimation method for the space complexity of Binary Decision Diagrams (BDDs). A model has been developed to predict the complexity of digital circuits. The formal core of the developed neural network model (NNM) is a unique matrix for the complexity estimation over a set of BDDs derived from Boolean logic expressions with a given number of variables and Sum of Products (SOP) terms. Experimental results show good correlation between the theoretical results and those predicted by the NNM, which will give insights to the complexity of Very Large Scale Integration (VLSI)/Computer Aided Design (CAD) designs. The proposed model is capable of predicting the maximum BDD complexity (MaxBC) and the number of product terms (NPT) in the Boolean function that corresponds to the minimum BDD complexity (MinBC). This model provides an alternative way to predict the complexity of digital VLSI circuits.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Alexander M (1986) Digital logic testing and simulation. In: Combinational logic test, chap 2. Harper and Row, New York
Thornton M, Nair VSS (1992) Iterative combinational logic synthesis techniques using spectral data. Technical report, Southern Methodist University
Moore GE (1975) Progress in digital integrated electronics. In: IEEE IEDM, 1975, pp 11–13
Wegener I, The complexity of Boolean functions. Wiley
Meinel C, Slobodova A (1994) On the complexity of constructing optimal ordered binary decision diagrams. In: Proc of 19th int symposium on mathematical foundation of computer science, 1994, pp 515–524
Tani S, Hamaguchi K, Yajima S (1996) The complexity of the optimal variable ordering problems of a shared binary decision diagram. IEICE Trans Inf Syst 4:271–281
Nemani M, Najm FN (1996) High-level power estimation and the area complexity of Boolean functions. In: Proc of IEEE intl symposium on low power electronics and design, 1996, pp 329–334
Akers SB (1978) Binary decision diagram. IEEE Trans Comput 27:509–516
Bryant RE (1986) Graph-based algorithm for Boolean function manipulation. IEEE Trans Comput 35:677–691
Harlow JE, Brglez F (2001) Design of experiments and evaluation on of BDD ordering heuristics. Intl J Softw Tools Tech Transf 3:193–206
Minato S (1995) Binary Decision Diagrams and applications for VLSICAD. Kluwer Academic, Dordrecht
Priyank K (1997) VLSI logic test, validation and verification, properties & applications of Binary Decision Diagrams. Lecture Notes, Department of Electrical and Computer Engineering University of Utah, Salt Lake City
Dunne PE, van der Hoeke W (2004) Complexity in Boolean games. In: Proc. 9th european conference on logics in artificial intelligence, LNCS 3229, Springer, 2004, pp 347–35
Ramalingam N, Bhanja S (2005) Causal probabilistic input dependency learning for switching model in VLSI circuits. In: Proceedings of ACM great lakes symposium on VLSI, 2005, pp 112–115
Bhanja S, Lingasubramanian K, Ranganathan N (2005) Estimation of switching activity in sequential circuits using dynamic bayesian networks. In: Proceedings of VLSI design, 2005, pp 586–591
Raseen M, Prasad PWC, Assi A (2004) Mathematical Model to Predict the Number of Nodes in an ROBDD. In: The 47th IEEE int midwest symposium on circuit and systems (MWSCAS), vol III, pp 431–434
Raseen M, Prasad PWC, Assi A (2005) An efficient estimation of the ROBDD’s complexity. accepted for publication in integration. The VLSI J. Elsevier Publication, May 2005
Prasad PWC, Raseen M, Senanayake SMNA (2005) XOR/XNOR functional behavior on ROBDD representation. In: Proc. of The 14th IASTED inter. conf. on applied simulation and modeling, 2005, pp 115–119
Prasad PWC, Raseen M, Assi A, Mills BI, Senanayake SMNA (2006) Evaluation time estimation for Pass Transistor Logic Circuits. In: Proc in 3rd IEEE inter workshop on electronic design, test and applications (DELTA’06), January 2006, pp 422–428
Assi A, Prasad PWC, Mills B, and El-chouemi A (2005) Empirical Analysis and mathematical representation of the path length complexity in Binary Decision Diagrams. J Comput Sci Publ 2(3):236–244
Parberry I (1994) Circuit complexity and neural networks. MIT Press
Siu KY, Roychowdhury VP, Kailath T (1995) Discrete neural computation—A theoretical foundation. Prentice Hall
Wegener I (1987) The complwexity of Boolean functions. Wiley
Caudill M (1990) AI Expert: Neural network primer. Miller Freeman Publications
Uhrig RE (1995) Introduction to artificial neural networks. In: Proceedings of the 1995 IEEE IECON 21st international conference on industrial electronics, control and instrumentation, vol 1, Nov 1995
Yale K (1997) Preparing the right data for training neural networks. IEEE Spectr 34(3):64–66
Stegmayer G, Chiotti O (2004) The Volterra representation of an electronic device using the neural network parameters. In: Latin American conference on informatics (CLEI’2004), Sep 2004
http://www.eco.utexas.edu/faculty/Kendrick/frontpg/NeuralNets.htm
Somenzi F (2003) CUDD: CU decision diagram package. ftp://vlsi.colorado.edu/pub/
Lawrence J (1994) Introduction to neural networks—design, theory and applications. California Scientific Software, California
Masters T (1994) Signal and image processing with neural networks. Wiley
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Prasad, P.W.C., Assi, A. & Beg, A. Binary Decision Diagrams and neural networks. J Supercomput 39, 301–320 (2007). https://doi.org/10.1007/s11227-006-0010-7
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11227-006-0010-7