TY - GEN
T1 - A methodology for evaluation time approximation
AU - Prasad, P. W.C.
AU - Beg, Azam
PY - 2007
Y1 - 2007
N2 - This paper describes a feed-forward neural network model (FFNNM) for complexity prediction of path related objective functions, mainly average path length (APL) of an arbitrary Boolean function (BF). The proposed model is determined by neural training process of evaluation time derived from the Monte Carlo data of randomly generated BFs. Experimental results show a good correlation between the ISCAS benchmark circuits and those predicted by the FFNNM. This model is capable of providing an estimation of the performance of a circuit prior to its final implementation.
AB - This paper describes a feed-forward neural network model (FFNNM) for complexity prediction of path related objective functions, mainly average path length (APL) of an arbitrary Boolean function (BF). The proposed model is determined by neural training process of evaluation time derived from the Monte Carlo data of randomly generated BFs. Experimental results show a good correlation between the ISCAS benchmark circuits and those predicted by the FFNNM. This model is capable of providing an estimation of the performance of a circuit prior to its final implementation.
UR - http://www.scopus.com/inward/record.url?scp=51449093315&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=51449093315&partnerID=8YFLogxK
U2 - 10.1109/MWSCAS.2007.4488692
DO - 10.1109/MWSCAS.2007.4488692
M3 - Conference contribution
AN - SCOPUS:51449093315
SN - 1424411769
SN - 9781424411764
T3 - Midwest Symposium on Circuits and Systems
SP - 776
EP - 778
BT - 2007 50th Midwest Symposium on Circuits and Systems, MWSCAS - Conference Proceedings
T2 - 2007 50th Midwest Symposium on Circuits and Systems, MWSCAS - Conference
Y2 - 5 August 2007 through 8 August 2007
ER -