Low Power Synthesis of Finite State Machines - State Assignment Decomposition Algorithm

被引:13
|
作者
Kajstura, Krzysztof [1 ]
Kania, Dariusz [2 ]
机构
[1] Univ Bielsko Biala, Dept Comp Sci & Automat, Willowa 2, PL-43309 Bielsko Biala, Poland
[2] Silesian Tech Univ, Inst Elect, Akad 16, PL-44100 Gliwice, Poland
关键词
Low power design; state assignment; sequential circuits; 2-LEVEL; AREA;
D O I
10.1142/S021812661850041X
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
A new method for reducing power consumption infinite state machines (FSMs) is proposed. Probabilistic description of the FSMs is the theoretical background of power-oriented state assignment. The algorithm of state assignment is based on a decomposition strategy of coding. This idea uses a binary tree in which nodes are created by sharing a finite state machine. The algorithm has been applied to the LGSynth91 benchmark and has also been compared to other approaches. The experiments showed that the proposed method leads to a reduction in power consumption compared to the state encoding algorithms that have already been developed. Reduction of the circuits' area is also observed.
引用
收藏
页数:14
相关论文
共 50 条
  • [41] STATE ASSIGNMENT AND TESTABILITY OF PLA-BASED FINITE STATE MACHINES
    BUONANNO, G
    SERRA, M
    MICROPROCESSING AND MICROPROGRAMMING, 1992, 35 (1-5): : 391 - 398
  • [42] Simulated annealing based parallel state assignment of finite state machines
    Hasteer, G
    Banerjee, P
    TENTH INTERNATIONAL CONFERENCE ON VLSI DESIGN, PROCEEDINGS, 1997, : 69 - 75
  • [43] Minimization Method of Finite State Machines for Low Power Design
    Klimowicz, Adam
    Solov'ev, Valery
    Grzes, Tomasz
    2015 EUROMICRO CONFERENCE ON DIGITAL SYSTEM DESIGN (DSD), 2015, : 259 - 262
  • [44] MULTILEVEL SYNTHESIS OF FINITE STATE MACHINES BASED ON SYMBOLIC FUNCTIONAL DECOMPOSITION
    Rawski, Mariusz
    Selvaraj, Henry
    Luba, Tadeusz
    Szotkowski, Piotr
    INTERNATIONAL JOURNAL OF COMPUTATIONAL INTELLIGENCE AND APPLICATIONS, 2006, 6 (02) : 257 - 271
  • [45] Cycle-based decomposition of Markov chains with applications to low-power synthesis and sequence compaction for finite state machines
    Iranli, Ali
    Pedram, Massoud
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 2006, 25 (12) : 2712 - 2725
  • [46] DECOMPOSITION AND FACTORIZATION OF SEQUENTIAL FINITE STATE MACHINES
    DEVADAS, S
    NEWTON, AR
    IEEE TRANSACTIONS ON COMPUTER-AIDED DESIGN OF INTEGRATED CIRCUITS AND SYSTEMS, 1989, 8 (11) : 1206 - 1217
  • [47] A State Assignment Method for Extended Burst-Mode gC Finite State Machines Based on Genetic Algorithm
    Curtinhas, Tiago
    Oliveira, Duarte L.
    Batista, Gracieth C.
    Torres, Vitor L. V.
    Romano, Leonardo
    2019 IEEE 10TH LATIN AMERICAN SYMPOSIUM ON CIRCUITS & SYSTEMS (LASCAS), 2019, : 153 - 156
  • [48] Synthesis of finite state machines for improved state verification
    Ahmad, InItiaz
    Ali, Faridah M.
    Das, A. Shoba
    COMPUTERS & ELECTRICAL ENGINEERING, 2006, 32 (05) : 349 - 363
  • [49] Decomposition of extended finite state machine for low power design
    Lee, MH
    Hwang, TT
    Huang, SY
    DESIGN, AUTOMATION AND TEST IN EUROPE CONFERENCE AND EXHIBITION, PROCEEDINGS, 2003, : 1152 - 1153
  • [50] Low power synthesis of finite state machines with mixed D and T flip-flops
    Iranli, A
    Rezvani, P
    Pedram, M
    ASP-DAC 2003: PROCEEDINGS OF THE ASIA AND SOUTH PACIFIC DESIGN AUTOMATION CONFERENCE, 2003, : 803 - 808