TY - GEN
T1 - Using recurrent neural networks for circuit complexity modeling
AU - Beg, Azam
AU - Prasad, P. W.Chandana
AU - Arshad, Mirza M.
AU - Hasnain, Khursheed
PY - 2006
Y1 - 2006
N2 - Being able to model the complexity of Boolean functions in terms of number of nodes in a Binary Decision Diagram can be quite useful in VLSI/CAD applications. Our investigation showed that it is possible to use the recurrent neural network (RNN) models for the prediction of circuit complexity. The modeling results matched closely with simulations with an average error of less than 1%. The correlation coefficient between RNN's predictions and actual results for ISCAS benchmark circuits was 0.629.
AB - Being able to model the complexity of Boolean functions in terms of number of nodes in a Binary Decision Diagram can be quite useful in VLSI/CAD applications. Our investigation showed that it is possible to use the recurrent neural network (RNN) models for the prediction of circuit complexity. The modeling results matched closely with simulations with an average error of less than 1%. The correlation coefficient between RNN's predictions and actual results for ISCAS benchmark circuits was 0.629.
UR - http://www.scopus.com/inward/record.url?scp=46449085032&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=46449085032&partnerID=8YFLogxK
U2 - 10.1109/INMIC.2006.358161
DO - 10.1109/INMIC.2006.358161
M3 - Conference contribution
AN - SCOPUS:46449085032
SN - 142440794X
SN - 9781424407941
T3 - 10th IEEE International Multitopic Conference 2006, INMIC
SP - 194
EP - 197
BT - 10th IEEE International Multitopic Conference 2006, INMIC
T2 - 10th IEEE International Multitopic Conference 2006, INMIC
Y2 - 23 December 2006 through 24 December 2006
ER -