Switching activity estimation of finite state machines for low power synthesis

被引:0
|
作者
Kerttu, M [1 ]
Lindgren, P [1 ]
Thornton, M [1 ]
Drechsler, R [1 ]
机构
[1] Lulea Univ Technol, S-95187 Lulea, Sweden
关键词
D O I
暂无
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A technique for computing the switching activity of synchronous Finite State Machine (FSM) implementations including the influence of temporal correlation among the next state signals is described The approach is based upon the computation that a FSM is in a given state which, in turn, is used to compute the conditional probability that a next state bit changes given its present state value. All computations are performed using Decision Diagram (DD) data structures. As an application of this method, the next state activity information is utilized for low power optimization in the synthesis of Binary Decision Diagram (BDD) mapped circuits. Experimental results are presented based on a set of the ISCAS89 sequential benchmarks showing an average power reduction of 40 percent and up to 90 percent reduction for individual benchmarks on the estimated power dissipation.
引用
收藏
页码:65 / 68
页数:4
相关论文
共 50 条
  • [1] Synthesis of finite state machines for low power and testability
    Chaudhury, Saurabh
    Chattopadhyay, Santanu
    Rao, J. Srinivasa
    2006 IEEE ASIA PACIFIC CONFERENCE ON CIRCUITS AND SYSTEMS, 2006, : 1434 - +
  • [2] Synthesis of finite state machines for low static and dynamic power
    Chaudhury, Saurabh
    Chattopadhyay, Santanu
    Krishna, Teja S.
    2007 INTERNATIONAL SYMPOSIUM ON INTEGRATED CIRCUITS, VOLS 1 AND 2, 2007, : 437 - +
  • [3] Low Power Synthesis of Finite State Machines - State Assignment Decomposition Algorithm
    Kajstura, Krzysztof
    Kania, Dariusz
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2018, 27 (03)
  • [4] Divide & conquer: A strategy for synthesis of low power finite state machines
    Dasgupta, A
    Ganguly, S
    INTERNATIONAL CONFERENCE ON COMPUTER DESIGN - VLSI IN COMPUTERS AND PROCESSORS, PROCEEDINGS, 1997, : 740 - 745
  • [5] Synthesis Method of Finite State Machines Based on State Minimization for Low Power Design
    Klimowicz, Adam
    COMPUTER INFORMATION SYSTEMS AND INDUSTRIAL MANAGEMENT (CISIM 2017), 2017, 10244 : 526 - 535
  • [6] State assignment of finite state machines for low power applications
    Natl Chung-Hsing Univ, Taichung, Taiwan
    Electron Lett, 25 (2323-2324):
  • [7] State assignment of finite state machines for low power applications
    Wang, SJ
    Horng, MD
    ELECTRONICS LETTERS, 1996, 32 (25) : 2323 - 2324
  • [8] State encoding of finite state machines for low power design
    Chen, DS
    Sarrafzadeh, M
    Yeap, GKH
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 1996, 6 (06) : 649 - 661
  • [9] Theoretical bounds for switching activity analysis in finite-state machines
    Marculescu, D
    Marculescu, R
    Pedram, M
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2000, 8 (03) : 335 - 339
  • [10] Theoretical bounds for switching activity analysis in Finite-State Machines
    Marculescu, D
    Marculescu, R
    Pedram, M
    1998 INTERNATIONAL SYMPOSIUM ON LOW POWER ELECTRONICS AND DESIGN - PROCEEDINGS, 1998, : 36 - 41