Low-power state assignment for asynchronous finite state machines

Ming-Der Shieh, Wann Shyang Ju, Ming Hwa Sheu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

2 Citations (Scopus)

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 and the derived weighted adjacency diagram, an efficient unicode race-free state assignment technique is proposed to minimize the average switching activity of state variables, thus to potentially reduce the average power dissipation in AFSMs. Experimental results show that the proposed algorithm can achieve less switching activity of state variables in comparison with existing unicode state assignment techniques for AFSMs.

Original languageEnglish
Title of host publicationMidwest Symposium on Circuits and Systems
EditorsG. Cameron, M. Hassoun, A. Jerdee, C. Melvin
PublisherIEEE
Pages1325-1328
Number of pages4
Volume3
Publication statusPublished - 1996
EventProceedings of the 1996 IEEE 39th Midwest Symposium on Circuits & Systems. Part 3 (of 3) - Ames, IA, USA
Duration: 1996 Aug 181996 Aug 21

Other

OtherProceedings of the 1996 IEEE 39th Midwest Symposium on Circuits & Systems. Part 3 (of 3)
CityAmes, IA, USA
Period96-08-1896-08-21

All Science Journal Classification (ASJC) codes

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

Fingerprint Dive into the research topics of 'Low-power state assignment for asynchronous finite state machines'. Together they form a unique fingerprint.

Cite this