Any-time probabilistic switching model using bayesian networks

Authors:
Shiva Shankar Ramani;Sanjukta Bhanja
Affiliations:
University of South Florida, Tampa, Florida;University of South Florida, Tampa, Florida
Venue:
Proceedings of the 2004 international symposium on Low power electronics and design
Year:
2004

Citing 11
Cited 2

Symbolic Boolean manipulation with ordered binary-decision diagrams

ACM Computing Surveys (CSUR)
Estimation of average switching activity in combinational and sequential circuits

DAC '92 Proceedings of the 29th ACM/IEEE Design Automation Conference
Improving the accuracy of circuit activity measurement

DAC '94 Proceedings of the 31st annual Design Automation Conference
A new power estimation technique with application to decomposition of Boolean functions for low power

EURO-DAC '94 Proceedings of the conference on European design automation
Dependency preserving probabilistic modeling of switching activity using bayesian networks

Proceedings of the 38th annual Design Automation Conference
Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference

Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference
Efficient stochastic sampling algorithms for bayesian networks

Efficient stochastic sampling algorithms for bayesian networks
Switching activity estimation of VLSI circuits using Bayesian networks

IEEE Transactions on Very Large Scale Integration (VLSI) Systems
Loopy belief propagation for approximate inference: an empirical study

UAI'99 Proceedings of the Fifteenth conference on Uncertainty in artificial intelligence
An importance sampling algorithm based on evidence pre-propagation

UAI'03 Proceedings of the Nineteenth conference on Uncertainty in Artificial Intelligence
Probabilistic modeling of dependencies during switching activity analysis

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

A stimulus-free graphical probabilistic switching model for sequential circuits using dynamic bayesian networks

Proceedings of the 41st annual Design Automation Conference
Sequential algorithm for low-power encoding internal states of finite state machines

Journal of Computer and Systems Sciences International

Quantified Score

Hi-index	0.00

Visualization

Abstract

Modeling and estimation of switching activities remain to be important problems in low-power design and fault analysis. A probabilistic Bayesian Network based switching model can explicitly model all spatio-temporal dependency relationships in a combinational circuit, resulting in zero-error estimates. However, the space-time requirements of exact estimation schemes, based on this model, increase with circuit complexity [1, 2]. This paper explores a non-simulative, Importance Sampling based, probabilistic estimation strategy that scales well with circuit complexity. It has the any-time aspect of simulation and the input pattern independence of probabilistic models.