GENERALIZING OF THE MATHEMATICAL MODEL OF MICROPROGRAM FINITE STATE MACHINE ON COUNTER

Authors

  • R. M. Babakov Donetsk national university, Vinnitsya, Ukraine, Ukraine

DOI:

https://doi.org/10.15588/1607-3274-2018-1-12

Keywords:

microprogram finite state machine on counter, mathematical model, intermediate algebra of transitions, hardware expenses

Abstract

Context. The problem of developing of structural modifications of the microprogram finite state machine on the counter has been solved,
which can help reduce hardware expenses in the logical circuit of the microprogram finite state machine in comparison with the known
structures.
Objective. The goal of the work is to generalize the structural features of the microprogram finite state machine on the counter using a
mathematical model based on the intermediate algebra of transitions.
Method. The known mathematical model of a microprogram finite state machine on a counter, based on the representation of the
transition function in the form of two partial functions, is analyzed. The use of an incremental counter in the structure of the finite state machine is expressed in this model by an intermediate algebra of transitions whose signature is formed by a single incremental function. In this case, the argument of the function is the code of the current state of the finite state machine, interpreted as an unsigned integer. For the considered mathematical model, a number of generalizations are made regarding the number of intermediate algebras of transitions, their signatures and carriers. Changes in the mathematical model and the structure of the finite-state machine on the counter, which are a
consequence of the generalizations made, are analyzed.
Results. On the basis of the generalizations made, a generalized structural scheme and a mathematical model of a microprogram finitestate machine with a noncanonical way of realizing the transition function are obtained. Experimental research of the effectiveness of the
developed generalized structure of MPA on the criterion of hardware costs has been carried out.
Conclusions. The results obtained in this paper can be used in the development of new structures and formal methods for the synthesis
of microprogram finite state machines with noncanonical realization of the transition function, oriented to optimizing the hardware expenses
in the logical circuit of the automaton.

References

Glushkov V. M. Sintez tsifrovih avtomatov. Moscow, Fizmatgiz,

, 476 p.

Baranov S.I. Sintez mikroprogramnih avtomatov. Leningrad,

Energiya, 1979, 232 p.

Barkalov A. A., Palagin A. V. Sintez mikroprogrammnih ustroistv

upravleniya. Kiev, Institut kibernetiki NAN Ukraini, 1997, 135 p.

Barkalov A.A. Sintez ustroistv upravleniya na programmiruemih

logicheskih ustroystvah. Donetsk, DonNTU, 2002, 262 p.

Babakov R. M. Promezhutochnaya algebra perehodov v

mikroprogrammnom avtomate, Radio Electronics, Computer

Science, Control, 2016, No. 1, pp. 64–73.

Maltsev A.I. Algebraicheskie sistemi. Moscow, Nauka, 1970,

p.

Plotkin B. I., Gringlaz L. Ya., Gvaramiya A. A. Elementi

algebraicheskoy teorii avtomatov: Ucheb. posobie dlya vuzov.

Moscow, Vish. Shk., 1994, 191 p.

Pospelov D. A. Arifmeticheskie osnovi vichislitelnih mashin

diskretnogo deistviya. Uchebnoe posobie dlya vtuzov. Moscow,

Vish. shkola, 1970, 308 p.

Majorov S. A., Novikov G. I. Struktura elektronnih vichislitelnih

mashin. Leningrad, Mashinostroenie, 1979, 384 p.

Babakov R., Barkalov Al., Titarenko L. Research of Efficiency

of Microprogram Final-State Machine with Datapath of

Transitions, Proceedings of 14th International Conference “The

Experience of Designing and Application of CAD Systems in

Microelectronics (CADSM), February 21–25, 2017. Polyana,

Ukraine, pp. 203–206.

Downloads

How to Cite

Babakov, R. M. (2018). GENERALIZING OF THE MATHEMATICAL MODEL OF MICROPROGRAM FINITE STATE MACHINE ON COUNTER. Radio Electronics, Computer Science, Control, (1), 100–109. https://doi.org/10.15588/1607-3274-2018-1-12

Issue

No. 1 (2018): Radio Electronics, Computer Science, Control

Section

Progressive information technologies

License

Copyright (c) 2018 R. M. Babakov

Creative Commons License

This work is licensed under a Creative Commons Attribution-ShareAlike 4.0 International License.

Creative Commons Licensing Notifications in the Copyright Notices

The journal allows the authors to hold the copyright without restrictions and to retain publishing rights without restrictions.

The journal allows readers to read, download, copy, distribute, print, search, or link to the full texts of its articles.

The journal allows to reuse and remixing of its content, in accordance with a Creative Commons license СС BY -SA.

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication with the work simultaneously licensed under a Creative Commons Attribution License CC BY-SA that allows others to share the work with an acknowledgement of the work's authorship and initial publication in this journal.

  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgement of its initial publication in this journal.

  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work.