Experiments on minimization method of incompletely specified finite state machines for low power design

0Citations
Citations of this article
8Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

This paper presents a heuristic method for minimization of incompletely specified finite state machine with unspecified values of output variables. The proposed method is based on two states merging. In this method, such optimization criteria as the power consumption and possibility of merging other states are taken into account already at the stage of minimizing internal states. In addition to reduction of the finite state machine (FSM) states, the method also allows reducing the number of FSM transitions and FSM input variables. Experimental results for various styles of state assignment are presented. The results show that this approach to minimization of FSM in most of cases is more effective than classical methods in respect of power consumption.

Cite

CITATION STYLE

APA

Klimowicz, A., & Solov’Ev, V. (2015). Experiments on minimization method of incompletely specified finite state machines for low power design. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 9339, 375–385. https://doi.org/10.1007/978-3-319-24369-6_31

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free