Control Systems and Computers, N2, 2018, Article 5
DOI: https://doi.org/10.15407/usim.2018.02.042
Upr. sist. maš., 2018, Issue 2 (274), pp. 42-50.
UDK 004.2
R.M. Babakov, PhD in Techn.Sciences, Associate Professor, Vasyl’ Stus Donetsk National University, 600-richa str., 21, Vinnitsya, 21021, Ukraine, (+380 50) 295-0650, r.babakov@donnu.edu.ua
A.A. Barkalov, Doctor in Techn. Sciences, Professor, University of Zielona Gora, Podgorna str., 50, Zielona Gora, 65246, Poland, (+48 68) 326-2693, a.barkalov@imei.uz.zgora.pl
REDUCTION OF THE MAXIMUM MUMBER OF SIGNIFICANT INPUT VARIABLES IN THE MICROPROGRAM FINITE STATE MACHINE WITH DATAPATH OF TRANSITIONS
Introduction. The object of research is the microprogram finite state machine with datapath of transitions with the input variables replacement. In digital devices, microprogram finite state machine performs the functions of control unit and coordinates the functionality of other system blocks. One of the current scientific and practical problems is the reduction of hardware expenses in the logic circuit of the microprogram finite state machine. One way to solve this problem is the development of new microprogram structures and methods for their synthesis. One of such structures is a microprogram finite state machine with datapath of transitions. In this structure, the transition formation circuit is implemented in the form of datapath consisting of a separate operational blocks. Each operational block implements the individual law of converting state codes and input signals, realizing a disjoint subset of microprogram transitions. Herewith, the hardware expenses in the operational block do not depend or depend insignificantly on the number of microprogram transitions it implements. This allows to achieve the reducing of hardware expenses in comparison with the implementation of transition function of the finite state machine by the canonical method using the system of Boolean equations. The approach, consisting of the circuit representation forming the transitions of the microprogram finite sate machine in the form of datapath, is called the operational realization of the transition function of the finite state machine. The use of the input variables replacement method makes it possible to further reduce the the hardware expenses in some blocks of the finite state machine.
Purpose. The purpose of this article is to research a new way for optimization of the hardware expenses in logical circuit of finite state machine with datapath of the input variables transitions and replacement.
Methods. It is proposed to use the known method of decreasing the maximum number of significant input variables. The method consists of adding new states, which leads to a decrease in the number of input signals analyzed in one state machine transition.
Results. The proposed approach does not lead to a change in the structure of the microprogram finite state machine with datapath of the input variables transitions and replacement. It can be achieved by reducing the number of transition operations used. It is also possible to cut hardware expenses simultaneously in other structure blocks by reducing the number of intermediate signals replacing the finite state machine input signals.
Conclusion. The reduction of the maximum number of significant input variables allows, under certain conditions, to cut the amount of hardware expenses in the logic circuit of the microprogram finite state machine with datapath of transitions and the input variables replacement. The disadvantage of this approach is the increase in the execution time of the algorithm, interpreted by the finite state machine.
Download full text! (In Russian).
Keywords: microprogram finite state machine, datapath of transitions, replacement of input variables, hardware expenses.
REFERENCES
1. Glushkov, V.M., 1962. Sintez tsifrovih avtomatov, Moscow, 476 p. (In Russian).
2. Baranov, S.I., 1979. Sintez mikroprogrammnih avtomatov, Leningrad, 232 p.
3. Barkalov, A., Titarenko, L., Kolopienczyk, M. et al., 2016. Logic Synthesis for FPGA-Based Finite State Machines. Springer, 280 p.
https://doi.org/10.1007/978-3-319-24202-6
4. Demicheli, G., 1994. Synthesis and Optimization of Digital Circuits, New York, 576 p.
5. BARKALOV, A.A., BABAKOV, R.M., 2015. “Realization of Function of Microprogram Final State Machine Transitions on the Base of Operational Final-State Machine”. Upr. sist. maš., 5, pp. 22–29. (In Russian).
6. Barkalov, A.A., Babakov, R.M., 2016. “Algebraic Interpretation of a Microprogram Finite-State Machine with Datapath of Transitions”. Cybernetics and Systems Analysis, 52 (2), pp. 191–198. https://doi.org/10.1007/s10559-016-9814-5
7. Babakov, R.M., Yarosh, I.V., 2015. “Formation of transition operation codes in a microprocessor automaton with an operating automaton of transitions”. Sbornik nauchnih trudov DonNTU. Seriya: Informatika, kibernetika i vichislitelnaya tehnika, pp. 11–16. (In Russian).
8. BARKALOV, A.A., BABAKOV, R.M., 2016. “Microprogram Finite State Machine Modification with the Datapath of Transitions and Replacement of the Input Variables”. Upr. sist. maš., 6, pp. 35–40. (In Russian).
9. Sklyarov, V.A. Sintez avtomatov na matrichnih BIS, Minsk, 1984, 256 p. (In Russian).
10. Barkalov, A.A. Sintez ustroystv upravleniya na programmiruemih logicheskih ustroystvah, Donetsk, 2002, 262 p. (In Russian).
11. BABAKOV, R.M., 2016. “An intermediate algebra of transitions in a firmware automaton”. Radiotehnika, informatika, upravlenie. 1, pp. 64–73. (In Russian).
12. BABAKOV, R.M., 2016. “The mathematical model of a microprogram automatic machine with an operating automaton of transitions”. Sbornik nauchnih trudov DonNTU. Seriya: Informatika, kibernetika i vichislitelnaya tehnika, 1, pp. 54–57. (In Russian).
13. BABAKOV, R.M., YAROSH, I.V., 2015. “Operating automatic machine transitions”. Sbornik nauchnih trudov DonNTU. Seriya: Vichislitelnaya tehnika i avtomatizatsiya, 1, pp. 33–40. (In Russian).
14. Grushvitskiy, R.I., Mursaev, A.X., Ugrumov, E.P., 2002. Proektirovanie sistem na mikroshemah programmiruemoj logiki, St. Peterburg, 608 p. (In Russian).
Received 03.04.2018
