RESEARCH OF HARDWARE EXPENSES IN MICROPROGRAM FINAL-STATE MACHINE WITH DATAPATH OF TRANSITIONS
DOI:
https://doi.org/10.15588/1607-3274-2017-4-12Keywords:
Microprogram final-state machine, datapath of transition, hardware expenses, VHD-modeling, analytical approximation.Abstract
Contex. The problem of determining the hardware expenses in the logical circuit of a microprogram final-state machine with a canonical structure and a microprogram final-state machine with datapath of transition and various ways of generating of codes of transition operations was solved.
Objective. The goal of the work is the obtaining of analytical expressions for determining the hardware expenses in the investigated structures of microprogram final-state machine depending on parameters of the automaton when using the elemental basis of programmable logical integrated circuits.
Method. Based on results of HDL simulation, the experimental values of hardware expenses in typical functional blocks of digital devices are obtained. As a unit of measurement of hardware expenses, LUT elements, which are regular structural elements of the FPGA, are used. Among the typical functional blocks, a combinational logical circuit, a multiplexer, an arithmetic-logical operation circuit, and a register are investigated. By approximating the experimental data, analytical expressions for determining the hardware expenses in typical functional blocks, depending on the parameters of the blocks, are obtained. By replacing the parameters of typical functional blocks with parameters of the structural blocks of the microprogram final-state machines being researched, the analytical expressions to determine the hardware expenses in typical functional nodes are transformed in analogous expressions for separate structural blocks of automata.
Results. For each of the researched structures of microprogram final-state machines, analytical expressions for determining the total hardware expenses in the logical circuit of the automaton are obtained.
Conclusions. Received analytical expressions take into account the structural features of the Mealy and Moore automata and can be used to solve the problem of determining the field of effective application of the microprogram final-state machine structures with datapath of transitions.References
Glushkov V. M. Sintez tsifrovih avtomatov. Moscow, Fizmatgiz, 1962, 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., Barkalov A. A. Operatsionnoe formirovanie kodov sostoyaniy v mikroprogrammnih avtomatah, Kibernetika i sistemniy analiz, 2011, No. 2, pp. 21–26.
Babakov R. M., Yarosh I. V. Operatsonniy avtomat perehodov Sbornik nauchnih trudov Donetskogo natsionalnogo tehnicheskogo universiteta. Seriya: «Vichislitalnaya tehnika i avtomatizatsiya». Vipusk 1 (28). Krasnoarmeysk, DonNTU, 2015, pp. 33–40.
Babakov R. M., Yarosh I. V. Formirovanie kodov operatsiy perehodov v mikroprogrammnom avtomate s operatsionnim avtomatom perehodov, Sbornik nauchnih trudov Donetskogo natsionalnogo tehnicheskogo universiteta. Seriya «Informatika, kibernetika i vichislitelnaya tehnika», Vipusk 1 (20). Krasnoarmeysk, DonNTU, 2015, pp. 11–16.
Tarasov I. E. Razrabotka tsifrovih ustroystv na osnove PLIS Xilinx s primeneniem yazika VHDL. Moscow, Goryachaya liniya, Telekom, 2005, 252 p.
Zotov V. U. Proektirovanie vstraivaemih mikroprotsessornih sistem na osnove PLIS firmi Xilinx. Moscow, Goryachaya linia, Telekom, 2006, 520 p.
Maksfild K. Proektirovanie na PLIS. Kurs molodogo boytsa. Moscow, Izdatelskiy dom «Dodeka-XXI», 2007, 408 p.
Downloads
How to Cite
Issue
Section
License
Copyright (c) 2017 R. M. Babakov
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.
