Search academic texts

Information × Registration Number 0217U007465, 0117U004098 , R & D reports Title Methodological aspects of synthesis of a microprogram finite-state machine with datapath of transitions popup.stage_title Head Babakov Roman Markovich, Registration Date 15-01-2018 Organization Donetsk State University popup.description2 The report on SRW: 97 p., 25 fig., 6 tables, 48 sources. The object of research: the methodology of the synthesis of a microprogram finite state machine (FSM) with datapath of transitions (FSM with DT). The purpose of research: definition of the concept of the methodology of synthesis of the FSM with DT; definition of the main stages of structural synthesis; formulation of the problem of algebraic synthesis of the FSM with DT; structural representation of the process of algebraic synthesis; development of approaches that can be used in the process of algebraic synthesis of the FSM with DT; development of the method of algebraic synthesis of the FSM with DT. The received results: it is proposed to divide the process of structural synthesis of the FSM with DT into two stages: algebraic synthesis and synthesis of the logic circuit of the FSM in accordance with algebraic synthesis results. The problem of algebraic synthesis of FSM with DT is formulated, which consists in solving the isomorphism system of abstract, structural and intermediate FSM algebras. It is noted that in the general case for a given FSM the formation of a set of different isomorphism systems is possible, each of which is a formal solution of the problem of algebraic synthesis. The concept of a set of effective solutions of the problem of algebraic synthesis is introduced, which is a subset of the set of formal solutions and contains only those solutions that allow to obtain a logical circuit of the FSM with DT more efficient in terms of hardware expenses than circuit of the equivalent FSM with canonical structure. The concept of the method of algebraic synthesis of the FSM with DT is introduced, which means a certain sequence of steps that allows to obtain a formal solution of the problem of algebraic synthesis. It is proposed to represent the process of algebraic synthesis of the FSM with DT in the form of a structure that reflects the cause-effect relationships between the elements of the isomorphism system of FSM algebras. In accordance with this, a number of structures have been developed that characterize this process from the point of view of input data and results. It is noted that in the general case, one structure can characterize a variety of synthesis methods that have common features inherent in this structure. Under the methodology of algebraic synthesis of the FSM with DT, it is proposed to understand a separate scientific field that contains a set of theoretical and practical issues related to the algebraic synthesis of the FSM with DT. Within this methodology, a number of approaches have been developed that can be used as part of the methods of algebraic synthesis of the FSM with DT: a shortened enumeration of variants of encoding of states and transition operations; use of transit states; forced increase in the length of the FSM state code; accounting for the frequency of FSM transitions. The method of algebraic synthesis of the FSM with DT, based on the proposed approaches, is developed and illustrated with an example. Key words: MICROPROGRAM FINITE-STATE MACHINE WITH DATAPATH OF TRANSITIONS, METHOD OF STRUCTURAL SYNTHESIS, ALGEBRAIC SYNTHESIS PROBLEM, FORMAL SOLUTION, METHODOLOGY OF ALGEBRAIC SYNTHESIS, STRUCTURAL REPRESENTATION OF SYNTHESIS PROCESS, TRANSIT STATES, STATES CODING, TRANSITION OPERATIONS Product Description popup.authors Вєтров Олег Станіславович popup.nrat_date 2020-04-02 Close