Wspólny model automatu skończonego w minimalizacji poboru mocy

W artykule przedstawiono wyniki badań algorytmu minimalizacji poboru mocy wykorzystującego wspólny model automatu klas ADE. Nowe modele strukturalne stanowią rozwinięcie klasycznych automatów Mealy'ego i Moore'a. Pozwalają na wykorzystanie szczególnych cech układów programowalnych przy syntezie układów sekwencyjnych. Jedną z możliwości jest zastosowanie przerzutników w buforach wejściowych i wyjściowych w charakterze elementów pamięci. Wyniki badań wykazały bardzo wysoką skuteczność nowego algorytmu.

The paper presents a new algorithm of the power consumption minimisation based on a common model of the finite state machine (FSM) of class ADE. The classic algorithms of the state assignment for power minimisation such as column-based [1], annealing [4], sequential [8] or genetic [2] are based on the general model of FSM (Mealy or Moore). They do not take into account specific features of contemporary programmable logic devices (PLD). The new structural models of FSMs are an extension of Mealy and Moore automata. The proposed algorithm is based on the common model of the finite state machine of class ADE. This paper consists of four paragraphs. The first one is an introduction to the power minimisation problem and shows why the new structural models of FSM can be used as a solution. In the second paragraph there is a detailed description of the common model of FSM of classes ADE (Fig. 1) and discussion on the power dissipation in the common model. The third paragraph describes the algorithm of state assignment that uses the features of the common model of FSM of class ADE. The fourth chapter presents the results of investigations on the new algorithm. These results show very high effectiveness of the new algorithm. In addition, power dissipation depends significantly on the algorithm used for encoding variables ei from the set E as well as increasing number of additional variables ei.