Answers are grounded in this paper and cite their sources.
A heuristic iteration algorithm of coding internal states of finite-state machines for reducing the power consumption is considered. The proposed algorithm is universal and can be applied to any results of coding the internal states (including random) to minimize the power consumption of the finite-state machine. In addition, the user can select a trade-off between the problem-solving quality and algorithm-execution time by specifying the maximum number of iterations. The experimental studies showed that the proposed approach is intended to decrease the power consumption of the finite-state machines on average by a factor of 1.73, as compared with the NOVA algorithm (in separate cases, by a factor of 3.29), and by a factor of 1.40, compared to the JEDI algorithm (in separate cases, by a factor of 2.31).
No takes yet. Share an insight, caveat, or question.
Соловьев et al. (2013) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: