SYNTHESIS OF THE MICROPROGRAM FINITE STATE MACHINE WITH DATAPATH OF TRANSITIONS WITH THE METHOD OF EXHAUSTIVE SEARCH

Abstract

The article studies the approach to the synthesis of a microprogram finite state machine with datapath of transitions by the method of exhaustive search. An example of a formal solution of the problem of algebraic synthesis of a given class of finite state machine is considered. An estimate of the time spent on synthesis by the method of exhaustive search for finite state machines of various complexity is given. The influence of the state codes on the number of formal solutions of the algebraic synthesis problem is investigated. A method of artificially increasing the bit depth of state codes in a microprogram finite state machine with datapath of transitions is proposed.

Authors and Affiliations

Р. М. Бабаков

Keywords

Related Articles

RESEARCH OF THE TRIBOTECHNICAL PROPERTIES OF THE GRANULAR POLYMERIC MATERIALS

The existing designs of devices for researching the tribotechnical properties of various types of the friction granular polymeric materials are considered. The two improved designs of devices, which had developed by the...

DETERMINING THE STABILITY OF MAYONNAISE EMULSIONS BASED ON LIQUID EGG WHITE

The aim of the work was the development of a special method for determining the stability of mayonnaise emulsions based on liquid egg white. We propose mayonnaise sauce recipes of type “Provansal” using oils with differe...

PERSPECTIVES OF USE OF UNBEILED FLYING MACHINES FOR CONDUCTING THE ELIMINATION OF THE CONSEQUENCES OF EMERGENCY SITUATIONS

The review of domestic and foreign literature presents brief data on the history of the emergence and effectiveness of unmanned aerial aircraft, as well as some fea-tures of their use in the most developed countries of t...

FUNCTIONAL MODELING OF THE PROGRAM COMPLEX FOR AUTOMATION OF MANAGEMENT BY GAS TRANSMISSION SYSTEMS

With application of the IDEF0 methodology and the reference model PERA analysis of functions for management by gas transmission system (GTS) has been performed. On this basis the main functions of program system for auto...

ANALYSIS AND RESEARCHES OF THREATS FOR A PROTECTED INTERNET ACCESS NODE

Analysis and researches of threats for a protected internet access node is given in the work. Threats to information circulating in the protected internet access node are presented. It is shown that even threats that, at...

Download PDF file
  • EP ID EP576082
  • DOI -
  • Views 82
  • Downloads 0

How To Cite

Р. М. Бабаков (2018). SYNTHESIS OF THE MICROPROGRAM FINITE STATE MACHINE WITH DATAPATH OF TRANSITIONS WITH THE METHOD OF EXHAUSTIVE SEARCH. Вчені записки Таврійського національного університету імені В. І. Вернадського. Серія: Технічні науки, 29(1), 70-74. https://europub.co.uk/articles/-A-576082