TITLE: Learning Monte Carlo Data for Circuit Path Length
AUTHORS: Azam Beg, P.W.C. Prasad, and S.M.N.A. Senenayake
PUBLICATION/VENUE: WASET or 5th International Conference on Robotics and Automation (ICRA 2008), Apr 2008. (www.waset.org/pwaset/v29/v29-9.pdf).
ABSTRACT:
This paper analyzes the patterns of the Monte Carlo data for a large number of variables and minterms, in order to characterize the circuit path length behavior. We propose models that are determined by training process of shortest path length derived from a wide range of binary decision diagram (BDD) simulations. The creation of the model was done use of feed forward neural network (NN) modeling methodology. Experimental results for ISCAS benchmark circuits show an RMS error of 0.102 for the shortest path length complexity estimation predicted by the NN model (NNM). Use of such a model can help reduce the time complexity of very large scale integrated (VLSI) circuitries and related computer-aided design (CAD) tools that use BDDs.
DOWNLOAD: PDF