Low power realization of finite state machines—a decomposition approach

  • Authors:
  • Sue-Hong Chow;Yi-Cheng Ho;TingTing Hwang;C. L. Liu

  • Affiliations:
  • Tsing Hua Univ., Taiwan;Tsing Hua Univ., Taiwan;Tsing Hua Univ., Taiwan;Univ. of Illinois at Urbana-Champaign, Urbana

  • Venue:
  • ACM Transactions on Design Automation of Electronic Systems (TODAES)
  • Year:
  • 1996

Quantified Score

Hi-index 0.00

Visualization

Abstract

We present in this article a new approach to the synthesis problem for finite state machines with the reduction of power dissipation as a design objective. A finite state machine is decomposed into a number of coupled submachines. Most of the time, only one of the submachines will be activated which, consequently, could lead to substantial savings in power consumption. The key steps in our approach are: (1) decomposition of a finite state machine into submachines so that there is a high probability that state transitions will be confined to the smaller of the submachines most of the time, and (2) synthesis of the coupled submachines to optimize the logic circuits. Experimental results confirmed that our approach produced very good results (in particular, for finite state machines with a large number of states.)