ACM Home Page
Please provide us with feedback. Feedback
A stimulus-free graphical probabilistic switching model for sequential circuits using dynamic bayesian networks
Full text PdfPdf (332 KB)
Source ACM Transactions on Design Automation of Electronic Systems (TODAES) archive
Volume 11 ,  Issue 3  (July 2006) table of contents
SECTION: Online Only: ACM Transactions on Design Automation of Electronic Systems, vol. 11, issue 3 (Novel Paradigms in System-Level Design) table of contents
Pages: 773 - 796  
Year of Publication: 2006
ISSN:1084-4309
Also published in ...
Authors
Sanjukta Bhanja  University of South Florida, Tampa, FL
Karthikeyan Lingasubramanian  University of South Florida, Tampa, FL
N. Ranganathan  University of South Florida, Tampa, FL
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 41,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1142980.1142990
What is a DOI?

ABSTRACT

We propose a novel, nonsimulative probabilistic model for switching activity in sequential circuits, capturing both spatio-temporal correlations at internal nodes and higher order temporal correlations due to feedback. This model, which we refer to as the temporal dependency model (TDM), can be constructed from the logic structure and is shown to be a dynamic Bayesian network. Dynamic Bayesian networks are extremely powerful in modeling high order temporal, as well as spatial, correlations; TDM is an exact model for the underlying conditional independencies. The attractive feature of this graphical representation of the joint probability function is not only that it makes the dependency relationships amongst nodes explicit, but it also serves as a computational mechanism for probabilistic inference. We report average errors in switching probability of 0.006, with errors tightly distributed around mean error values, on ISCAS'89 benchmark circuits involving up to 10000 signals.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
 
2
 
3
Bhanja, S. and Ranganathan, N. 2004. Cascaded Bayesian inferencing for switching activity estimation with correlated inputs. IEEE Trans. VLSI Syst. 12, 12 (Dec.), 1387--1397.
4
 
5
Chen, Z. and Roy, K. 1997. An efficient statistical method to estimate average power in sequential circuits considering input sensitivities. In Proceedings of the ASIC Conference and Exhibit, 189--193.
 
6
 
7
Ding, C. S., Tsui, C. Y., and Pedram, M. 1998. Gate-Level power estimation using tagged probabilistic simulation. IEEE Trans. Comput. Aided Des. Integrated Circuits Syst. 17, 11 (Nov.), 1099--1107.
 
8
Ercolani, S., Favalli, M., Damiani, M., Olivo, P., and Ricco, B. 1992. Testability measures in pseudorandom testing. IEEE Trans. CAD 11, 794--800.
 
9
Genie 2006. Graphical network interface. url: http://www.sis.pitt.edu/genie/genie2.
10
 
11
Henrion, M. 1988. Propagation of uncertainty in Bayes' networks by probabilistic logic sampling. In Uncertainty in Artificial Intelligence. Elsevier Science, New York, 149--163.
 
12
Hugin. 2006. Hugin. url: http://www.hugin.com/.
 
13
Kjaerulff, U. 1995. Dhugin: A computational system for dynamic time-sliced Bayesian networks. Int. J. Forecasting 11, 89--111.
 
14
 
15
 
16
 
17
Marculescu, R., Marculescu, D., and Pedram, M. 1998. Probabilistic modeling of dependencies during switching activity analysis. IEEE Trans. Comput. Aided Des. Integrated Circuits Syst. 17, 2 (Feb.), 73--83.
 
18
Marculescu, R., Marculescu, D., and Pedram, M. 1999. Sequence compaction for power estimation: Theory and practice. IEEE Trans. Comput. Aided Des. Integrated Circuits Syst. 18, 7, 973--993.
 
19
Murphy, K. P., Weiss, Y., and Jordan, M. I. 1999. Loopy belief propagation for approximate inference: An empirical study. In Proceedings of the Conference on Uncertainty in AI, 467--475.
20
 
21
Najm, F. N. 1993. Transition density: A new measure of activity in digital circuits. IEEE Trans. Comput. Aided Des. Integrated Circuits Syst. 12, 2 (Feb.), 310--323.
22
 
23
24
 
25
Rejimon, T. and Bhanja, S. 2006. A timing-aware probabilistic model for single-event-upset analysis. IEEE Trans. VLSI Syst.
26
27
 
28
Stamoulis, G. I. 1996. A Monte-Carlo approach for the accurate and efficient estimation of average transition probabilities in sequential logic circuits. In Proceedings of the IEEE Custom Integrated Circuits Conference, 221--224.
 
29
 
30
Yuan, C. and Druzdzel, M. J. 2003. An importance sampling algorithm based on evidence pre-propagation. In Proceedings of the 19th Annual Conference on Uncertainty on Artificial Intelligence, 624--631.
31

Collaborative Colleagues:
Sanjukta Bhanja: colleagues
Karthikeyan Lingasubramanian: colleagues
N. Ranganathan: colleagues