Skip to main navigation Skip to search Skip to main content

Binary tree-based low power state assignment algorithm

  • University of Bielsko-Biala

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

8 Citations (Scopus)

Abstract

A new low power state assignment algorithm is proposed in this paper. The essence of new coding is dividing all the states into subsets, which are sequentially assigned to the individual bits of code. This type of decomposition encoding, in which the coding is done bit by bit, retains the flexibility of assigning code words from the beginning to the end of the encoding process. The results of the experiments confirm efficiency of the proposed algorithm in comparison with the state assignment algorithms that have already been developed.

Original languageEnglish
Title of host publicationInternational Conference of Computational Methods in Sciences and Engineering 2016, ICCMSE 2016
EditorsZacharoula Kalogiratou, Theodore E. Simos, Theodore Monovasilis, Theodore E. Simos, Theodore E. Simos
PublisherAmerican Institute of Physics Inc.
ISBN (Electronic)9780735414549
DOIs
Publication statusPublished - 6 Dec 2016
EventInternational Conference of Computational Methods in Sciences and Engineering 2016, ICCMSE 2016 - Athens, Greece
Duration: 17 Mar 2016 → 20 Mar 2016

Publication series

NameAIP Conference Proceedings
Volume1790
ISSN (Print)0094-243X
ISSN (Electronic)1551-7616

Conference

ConferenceInternational Conference of Computational Methods in Sciences and Engineering 2016, ICCMSE 2016
Country/TerritoryGreece
CityAthens
Period17/03/16 → 20/03/16

Keywords

  • FSM
  • low power design
  • sequential circuits.
  • state assignment

ASJC Scopus subject areas

  • General Physics and Astronomy

Fingerprint

Dive into the research topics of 'Binary tree-based low power state assignment algorithm'. Together they form a unique fingerprint.

Cite this