GENERALIZING OF THE MATHEMATICAL MODEL OF MICROPROGRAM FINITE STATE MACHINE ON COUNTER
Науковий журнал «Радіоелектроніка, інформатика, управління»
Переглянути архів Інформація| Поле | Співвідношення | |
| ##plugins.schemas.marc.fields.042.name## |
dc |
|
| ##plugins.schemas.marc.fields.245.name## |
GENERALIZING OF THE MATHEMATICAL MODEL OF MICROPROGRAM FINITE STATE MACHINE ON COUNTER |
|
| ##plugins.schemas.marc.fields.720.name## |
Babakov, R. M.; Donetsk national university, Vinnitsya, Ukraine |
|
| ##plugins.schemas.marc.fields.653.name## |
microprogram finite state machine on counter; mathematical model; intermediate algebra of transitions; hardware expenses |
|
| ##plugins.schemas.marc.fields.520.name## |
Context. The problem of developing of structural modifications of the microprogram finite state machine on the counter has been solved,<br />which can help reduce hardware expenses in the logical circuit of the microprogram finite state machine in comparison with the known<br />structures.<br />Objective. The goal of the work is to generalize the structural features of the microprogram finite state machine on the counter using a<br />mathematical model based on the intermediate algebra of transitions.<br />Method. The known mathematical model of a microprogram finite state machine on a counter, based on the representation of the<br />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<br />consequence of the generalizations made, are analyzed.<br />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<br />developed generalized structure of MPA on the criterion of hardware costs has been carried out.<br />Conclusions. The results obtained in this paper can be used in the development of new structures and formal methods for the synthesis<br />of microprogram finite state machines with noncanonical realization of the transition function, oriented to optimizing the hardware expenses<br />in the logical circuit of the automaton. |
|
| ##plugins.schemas.marc.fields.260.name## |
Zaporizhzhya National Technical University 2018-05-29 13:24:17 |
|
| ##plugins.schemas.marc.fields.856.name## |
application/pdf http://ric.zntu.edu.ua/article/view/131572 |
|
| ##plugins.schemas.marc.fields.786.name## |
Radio Electronics, Computer Science, Control; No 1 (2018): Radio Electronics, Computer Science, Control |
|
| ##plugins.schemas.marc.fields.546.name## |
ru |
|
| ##plugins.schemas.marc.fields.540.name## |
Copyright (c) 2018 R. M. Babakov |
|