Satisfiability models for maximum transition power

被引:7
|
作者
Roy, Suchismita [1 ]
Chakrabarti, P. P. [2 ]
Dasgupta, Pallab [2 ]
机构
[1] Natl Inst Technol, Dept Comp Sci & Engn, Durgapur 713209, W Bengal, India
[2] Indian Inst Technol, Dept Comp Sci & Engn, Kharagpur 721302, W Bengal, India
关键词
event modeling; peak transition power; SAT;
D O I
10.1109/TVLSI.2008.2000322
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A satisfiability-based technique for symbolic modeling of event propagation in a circuit is presented in this paper which captures the events in the internal nodes of the circuit with a high level of detail. The model is used to accurately measure the peak single cycle transition power consumption in combinational and sequential circuits, which is closely affected by the switching activity in the circuit. Our technique is scalable, and adapts easily to ever increasing sizes of the custom cells (building blocks) in today's industry, without compromising on accuracy and correctness.
引用
收藏
页码:941 / 951
页数:11
相关论文
共 50 条
  • [21] Query-Guided Maximum Satisfiability
    Zhang, Xin
    Mangal, Ravi
    Nori, Aditya V.
    Naik, Mayur
    ACM SIGPLAN NOTICES, 2016, 51 (01) : 109 - 122
  • [22] Efficient zonal diagnosis with maximum satisfiability
    Meng LIU
    Dantong OUYANG
    Shaowei CAI
    Liming ZHANG
    Science China(Information Sciences), 2018, 61 (11) : 17 - 30
  • [23] Branch Location Problems with Maximum Satisfiability
    Zaikin, Oleg
    Ignatiev, Alexey
    Marques-Silva, Joao
    ECAI 2020: 24TH EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2020, 325 : 379 - 386
  • [24] Automated Design Debugging With Maximum Satisfiability
    Chen, Yibin
    Safarpour, Sean
    Marques-Silva, Joao
    Veneris, Andreas
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2010, 29 (11) : 1804 - 1817
  • [25] Efficient strategies for (weighted) maximum satisfiability
    Xing, Z
    Zhang, WX
    PRINCIPLES AND PRACTICE OF CONSTRAINT PROGRAMMING - CP 2004, PROCEEDINGS, 2004, 3258 : 690 - 705
  • [26] Subsumed Label Elimination for Maximum Satisfiability
    Berg, Jeremias
    Saikko, Paul
    Jarvisalo, Matti
    ECAI 2016: 22ND EUROPEAN CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, 285 : 630 - 638
  • [27] Survey on algorithms for the maximum satisfiability problem
    He, Kun
    Zheng, Jiongzhi
    Huazhong Keji Daxue Xuebao (Ziran Kexue Ban)/Journal of Huazhong University of Science and Technology (Natural Science Edition), 2022, 50 (02): : 82 - 95
  • [28] Reduced Cost Fixing for Maximum Satisfiability
    Bacchus, Fahiem
    Hyttinen, Antti
    Jarvisalo, Matti
    Saikko, Paul
    PROCEEDINGS OF THE TWENTY-SEVENTH INTERNATIONAL JOINT CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2018, : 5209 - 5213
  • [29] New upper bounds for maximum satisfiability
    Niedermeier, R
    Rossmanith, P
    JOURNAL OF ALGORITHMS-COGNITION INFORMATICS AND LOGIC, 2000, 36 (01): : 63 - 88
  • [30] Clause Redundancy and Preprocessing in Maximum Satisfiability
    Ihalainen, Hannes
    Berg, Jeremias
    Jarvisalo, Matti
    AUTOMATED REASONING, IJCAR 2022, 2022, 13385 : 75 - 94