Dichotomy-based constrained encoding for low switching activity in asynchronous finite state machines

Ming-Der Shieh, Ming Hwa Sheu, Hong Ren Wang, Hsueh Cherng Cheng

Research output: Contribution to conferencePaperpeer-review

Abstract

In this paper, a precise model for calculating the steady state probabilities and state transition probabilities of asynchronous finite state machines (AFSMs) is presented. Based on this model, a weighted adjacency diagram is derived and an efficient, dichotomy-based constrained encoding algorithm is proposed to minimize the average switching activity of state variables in AFSMs. Experimental results show that significant improvement on reducing the average switching activity of state variables can be achieved when the weights are considered during state assignment in comparison with the conventional disjoint clique covering technique. Thus, the average power dissipation in AFSMs can be potentially reduced.

Original languageEnglish
Pages509-512
Number of pages4
Publication statusPublished - 1997 Dec 1
Event7th International Symposium on IC Technology, Systems and Applications ISIC 97 - Singapore, Singapore
Duration: 1997 Sep 101997 Sep 12

Other

Other7th International Symposium on IC Technology, Systems and Applications ISIC 97
CountrySingapore
CitySingapore
Period97-09-1097-09-12

All Science Journal Classification (ASJC) codes

  • Electronic, Optical and Magnetic Materials
  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Dichotomy-based constrained encoding for low switching activity in asynchronous finite state machines'. Together they form a unique fingerprint.

Cite this