ACM Home Page
Please provide us with feedback. Feedback
Causal probabilistic input dependency learning for switching model in VLSI circuits
Full text PdfPdf (59 KB)
Source Great Lakes Symposium on VLSI archive
Proceedings of the 15th ACM Great Lakes symposium on VLSI table of contents
Chicago, Illinois, USA
POSTER SESSION: Poster session 1 table of contents
Pages: 112 - 115  
Year of Publication: 2005
ISBN:1-59593-057-4
Authors
Nirmal Ramalingam  University of South Florida, Tampa, Florida
Sanjukta Bhanja  University of South Florida, Tampa, Florida
Sponsors
SIGDA: ACM Special Interest Group on Design Automation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 0,   Downloads (12 Months): 10,   Citation Count: 5
Additional Information:

abstract   references   cited by   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/1057661.1057689
What is a DOI?

ABSTRACT

Switching model captures the data-driven uncertainty in logic circuits in a comprehensive probabilistic framework. Switching is a critical factor that influences dynamic, active leakage power, coupling noises in CMOS implementations. In this work, we model the input-space by a causal graphical probabilistic model that encapsulates the dependencies in inputs in a compact, minimal fashion and also allows for instantiations of the vector-space that closely match the underlying dependencies, with the constraint that the reduced vector-space captures the dependencies in the larger dataset accu-rately. Results on ISCAS benchmark show that average error is limited to 1.8% while we achieve a compaction ratio of 300.


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
R. E. Neapolitan, "Learning Bayesian Networks", Prentice Hall Series in Artificial Intelligence, 2004.
 
4
J. Cheng, D. Belland W. Liu, " Learning Bayesian Networks from Data: An Efficient Approach Based on Information Theory", Technical Report, Department of Computer Science, University of Alberta, 1998.
 
5
6
 
7
P. Spirtes, C. Glymour, R. Scheines, "Causation, Prediction and Search", MIT Press, 2nd Edition, 2000.
 
8
9
 
10
R. Marculescu, D. Marculescu, M. Pedram, "Sequence Compaction for Power Estimation: Theory and Practice", IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems, vol.18, No.7, pp. 973--993, July 1999.
 
11
R. Marculescu, D. Marculescu, M. Pedram, "Vector Compaction Using Dynamic Markov Models", IEICE Trans. on Fundamentals, vol. E80A, No.10 pp. 1924--1933, 1997.
12
 
13
R. Marculescu, D. Marculescu, and M. Pedram, "Probabilistic Modeling of Dependencies During Switching Activity Anal-ysis", IEEE Transaction on Computer-Aided Design of Integrated Circuits and Systems, vol. 17-2, pp. 73--83, February 1998.
 
14
URL http://www.hugin.com/


Collaborative Colleagues:
Nirmal Ramalingam: colleagues
Sanjukta Bhanja: colleagues