Received 05.04.2022, Revised 28.06.2022, Accepted 25.07.2022

Synthesis of a control device based on r-automaton for associative processor

Tatiana Martyniuk, Bohdan Krukivskyi, Serhii Bohomolov, Aryna Kuzina

This article discusses one of the well-known options for the synthesis of control devices with rigid logic. Such control devices provide a significant response speed compared to control devices with programmable logic, but they have a laborious process at the stages of abstract and structural synthesis of a microprogram automaton (MPA) as the basic structural model of this type of control device. Synthesis of an MPA based on a shift register as an R-automaton provides a compromise solution among the implementations of an MPA based on a parallel register as a T-automaton or a counter as a CT-automaton. This is due to the load on the memory of the MPA by reducing the complexity of the logical part of the MPA, namely its combinational scheme. The use of a specific single positional coding of the MPA states makes it possible to significantly simplify the complex process of the formation of Boolean functions corresponding to the excitation functions in the abstract synthesis of the MPA. And this, in turn, leads to a simplification of the combinational part of the MPA. At the same time, the complication of the memory part of the MPA based on the shift register leads to an increase in its bit rate without reducing the regularity of its structure. The article proposes a non-standard approach to the synthesis of a control device and develops its functional scheme. As a result, synthesis on the basis of the R - automaton of the control device structure for the associative processor confirmed the perspective of this version of MPA synthesis by simplifying the process of the corresponding abstract and structural synthesis. This is due to the simplicity of forming direct and simplified structural tables using single positional coding of MPA states. It is planned to place the developed structure of the control device in a programmable logic IC (FPGA), which will allow the placement of the entire associative processor in the FPGA. This approach will ensure the compactness of the organization and the speed of the associative processor

control device, microprogram automaton, R- automaton, associative processor, sorting
79-85
Martyniuk, T., Krukivskyi, B., Bohomolov, S., & Kuzina, A. (2022). Synthesis of a control device based on r-automaton for associative processor. Information Technologies and Computer Engineering, 19(2), 79-85. https://doi.org/10.31649/1999-9941-2022-54-2-79-85

References

[1] Buzunov, Yu.A., Burenkov, I.G., & Shipilov, N.N. (1982). Microprogrammed automata on parallel-sequential machines. Control Systems and Machines, 2, 26-29.

[2] Zhabin, V.I., Zhukov, I.A., Klimenko, I.A., & Tkachenko, V.V. (2007). Applied theory of digital automat. Kyiv: NAU book publication.

[3] Barkalov, A.A., & Babakov, R.M. (2011). Operational generation of state codes in microprogrammed automata. Cybernetics and Systems Analysis, 2, 21-26.

[4] Babakov, R.M. (2017). Algebraic synthesis of a microprogrammed automaton with an operational transition automaton. Information Technologies and Computer Engineering, 2, 35-41.

[5] Barkalov, A.A., & Babakov, R.M. (2008). Organization of control devices with operational addressing. Control Systems and Machines, 6, 34-39.

[6] Kozhem'yako, V.P., Martyniuk, T.B., Fofanova, N.V., & Dmytruk, V.V. (2005). Comparative analysis of options for the synthesis of microprogram automata. Optical-Electronic Information and Energy Technologies, 1(9), 225-233.

[7] Kozhemyako, V.P., Martynyuk T.B., & Kozhemyako, K.V. (1995). Synthesis of a control device on an R-automaton. Control Systems and Machines, 1/2, 22-25.

[8] Martynyuk, T.B. (1998). Features of the synthesis of microprogrammed R-automata. Control Systems and Machines, 3, 22-26.

[9] Palagin, A.V., & Opanasenko, V.N. (2006). Reconfigurable computing systems. Kyiv: Prosvita.

[10] Solovyov, V., & Klimovich, A. (2003). Using FPGA input buffers as memory elements of finite automata. Chip News, 2(22), 24-28.

[11] Barkalov, A.A., & Barkalov, A.A. (2001). Optimization of the logical circuit of the Moore machine on programmable integrated circuits. Control Systems and Machines, 6, 38-41.

[12] Martyniuk, T.B., Krupelnytskyi, L.V., & Krukivskyi, B.I. (2021). Regular computing structure for data ranking. Information Technologies and Computer Engineering, 3(52), 70-76.

[13] Kozhemiako, V.P., Martynyuk, T.B., Dmytruk, V.V., & Vlasiichuk, V.V. (2006). Classification of unit codes. Optical-Electronic Information and Energy Technologies, 1(11), 36-42.

[14] Martyniuk, T.B., & Voytsekhovska, O.V. (2021). Efficiency of unit data coding. Information Technologies and Computer Engineering, 2, 30-36.

[15] Zubchuk, V.I., Sigorsky, V.P., & Shkuro, A.N. (1990). Handbook of digital circuit engineering. Kyiv: Tekhnika.

[16] Sergienko, A.M. (2003). VHDL for designing computing devices. Kyiv: TID "DS".

[17] Steshenko, V. (1999). School of development of digital signal processing equipment on FPGAs. Chip News, 8, 2-6.

[18] Achasova, S.M. (1987). Algorithms for synthesizing automata on programmable matrices. Moscow: Radio and Communications.