6th International Conference on Computer Information Systems and Industrial Management Applications (CISIM'07) 2007
DOI: 10.1109/cisim.2007.32
|View full text |Cite
|
Sign up to set email alerts
|

FSM State Assignment Methods for Low-Power Design

Abstract: In this paper we deal with the problem of the finite states machine's (FSM) state assignment. CMOSbased digital circuits dissipate a power only during a transition at the output. Therefore one of the methods of the power minimization is to reassign the FSM states. We discuss the methods such as column-based and annealing-based as well as propose the new method called sequential method. Experimental results showed that the proposed method is approximately 10% better than the other discussed algorithms.

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
5

Citation Types

0
6
0

Year Published

2010
2010
2020
2020

Publication Types

Select...
8
2

Relationship

0
10

Authors

Journals

citations
Cited by 19 publications
(6 citation statements)
references
References 5 publications
0
6
0
Order By: Relevance
“…11 On the other hand, it can decrease the power consumption. 15,16 As it is shown in Ref. 15, the decreasing of the circuit area leads to decrease of its power consumption.…”
Section: Introductionmentioning
confidence: 92%
“…11 On the other hand, it can decrease the power consumption. 15,16 As it is shown in Ref. 15, the decreasing of the circuit area leads to decrease of its power consumption.…”
Section: Introductionmentioning
confidence: 92%
“…Issues concerning the minimization of power consumption have recently become particularly important. Initially, methods were proposed that were based on the minimization of transitions of the state variables; this was achieved by grouping the states between which frequent transitions occur, by assigning to them codes with a minimum code distance (the minimum weighted Hamming distance method) [10]- [12]. The problem of state assignment can be considered in terms of integer linear programming [10], but heuristic methods are generally used [13], [14].…”
Section: Introductionmentioning
confidence: 99%
“…Examples of deterministic techniques for power optimisation include the work in [8, 9]. The work in [8] is based on sequentially assigning states with highest transition probability state codes with Hamming distance (HD) of 1. The work in [9] attempts to optimise power by modelling the minimisation of flip‐flops (FFs) switching activity using integer linear programming.…”
Section: Introductionmentioning
confidence: 99%