Determining the Area of Efficient Application of a Microprogrammed Finite-State Machine with Datapath of Transitions
- PDF / 123,130 Bytes
- 10 Pages / 594 x 792 pts Page_size
- 25 Downloads / 179 Views
DETERMINING THE AREA OF EFFICIENT APPLICATION OF A MICROPROGRAMMED FINITE-STATE MACHINE WITH DATAPATH OF TRANSITIONS R. M. Babakov1 and A. A. Barkalov2
UDC 004.2
Abstract. Investigations have been carried out as to the efficiency of a microprogrammed finite-state machine with datapath of transitions in comparison with the canonical finite-state machine by the criterion of hardware expenses for their logical circuits. For the structures studied, the area of their efficient application is determined that is expressed by a set of value ranges of finite-state machine parameters. Keywords: microprogrammed finite-state machine, datapath of transitions, optimization of hardware expenses, area of efficient application. INTRODUCTION In a modern computing system, its control unit (CU) coordinating the operation of all units of the system is one of its central devices. One of structural implementations of a CU is a microprogrammed finite-state machine (FSM) whose circuits is characterized by a relatively high operation speed and considerable hardware expenses [1, 2]. The increase in the complexity of algorithms of the microprogrammed FSMs (MFSMs) being implemented, which is observed at the present time, actualizes the problem of minimization of hardware expenses for the logic circuit of an MFSM. A way to solve this problem is the development of new MFSM structures and methods for synthesizing them [3, 4]. In [5–7], an MFSM structure with datapath of transitions (MFSM with DT) is proposed in which the scheme of formation of transitions is organized in the form of datapath of transitions. In an MFSM with DT, the minimization of hardware expenses is achieved owing to a special coding of states when the same functional unit in DT implements a set of MFSM transitions, and hardware expenses for such a unit do not depend on the number of transitions implemented by this unit. To practically use structures of MFSMs with DTs, it is necessary to numerically substantiate their efficiency in terms of hardware expenses in comparison with well-known MFSM structures. This work solves the problem of determining the area of efficient application of MFSMs with DTs in comparison with the canonical MFSM represented in the form of a collection of value ranges of some basic MFSM parameters. MFSM STRUCTURES BEING INVESTIGATED Figure 1 represents the block diagram of the canonical MFSM denoted by the symbol U K in this paper and including the following blocks [2]: 1
Vasyl’ Stus Donetsk National University, Vinnytsia, Ukraine, [email protected]. 2Institute of Computer Engineering and Electronics, University of Zielona GËra, Zielona GËra, Poland, [email protected]. Translated from Kibernetika i Sistemnyi Analiz, No. 3, May–June, 2018, pp. 27–37. Original article submitted May 19, 2017. 366
1060-0396/18/5403-0366 ©2018 Springer Science+Business Media, LLC
X
X T
TFC
F Ô
MR
T
MOFC
Y
Y
Fig. 1. Canonical MFSM structure (the U K structure).
Z
Z
DT
T
MOFC
Y
Fig. 2. Basic structure of MFSM with DT (the U1 structure).
X T
Data Loading...
