Switching activity estimation using limited depth reconvergent path analysis
暂无分享,去创建一个
[1] Farid N. Najm,et al. Transition density, a stochastic measure of activity in digital circuits , 1991, 28th ACM/IEEE Design Automation Conference.
[2] Massoud Pedram,et al. Efficient estimation of dynamic power consumption under a real delay model , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).
[3] Ibrahim N. Hajj,et al. Probabilistic simulation for reliability analysis of CMOS VLSI circuits , 1990, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[4] Bhanu Kapoor. Improving the Accuracy of Circuit Activity Measurement , 1994, 31st Design Automation Conference.
[5] Radu Marculescu,et al. Switching activity analysis considering spatiotemporal correlations , 1994, ICCAD.
[6] Randal E. Bryant,et al. Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.
[7] Edward J. McCluskey,et al. Probabilistic Treatment of General Combinational Networks , 1975, IEEE Transactions on Computers.
[8] R. Marculescu,et al. Switching Activity Analysis Considering Spatioternporal Correlations , 1994, IEEE/ACM International Conference on Computer-Aided Design.
[9] D. Ross. Computer-aided design , 1961, CACM.
[10] Kurt Keutzer,et al. Estimation of average switching activity in combinational logic circuits using symbolic simulation , 1997, IEEE Trans. Comput. Aided Des. Integr. Circuits Syst..
[11] Nobuyuki Goto,et al. Switching activity analysis using Boolean approximation method , 1995, ICCAD.
[12] Robert E. Tarjan,et al. A fast algorithm for finding dominators in a flowgraph , 1979, TOPL.