SYNTHESIS OF A CONTROL DEVICE BASED ON R-AUTOMATON FOR ASSOCIATIVE PROCESSOR
DOI:
https://doi.org/10.31649/1999-9941-2022-54-2-79-85Keywords:
control device, microprogram automaton, R- automaton, associative processor, sortingAbstract
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.
References
Ju. A. Buzunov, I. G. Burenkov i N. N. Shipilov, “Mikroprogrammnye avtomaty na parallel'no-posledovatel'nyh mashinah”, Upravljajushhie sistemy i mashiny, № 2, s. 26-29. 1982 [in Russian].
V. I. Zhabin, I. A. Zhukov, I. A. Klimenko ta V. V. Tkachenko, Prykladna teoriia tsyfrovykh avtoma-tiv. K.: Knyzhkove vydannia NAU, 2007 [in Ukrainian].
A. A. Barkalov i R. M. Babakov, “Operacionnoe formirovanie kodov sostojanij v mikroprogrammn-yh avtomatah”, Kibernetika i sistemnyj analiz, № 2, s. 21-26. 2011 [in Russian].
R. M. Babakov, “Alhebraycheskyi syntez mykroprohrammnoho avtomata s operatsyonnym avto-matom perekhodov”, Informatsiini tekhnolohii ta kompʼiuterna inzheneriia, № 2, s. 35-41. 2017 [in Russian].
A. A. Barkalov i R. M. Babakov, “Organizacija ustrojstv upravlenija s operacionnoj adresaciej”, Up-ravljajushhie sistemy i mashiny, № 6, s. 34-39. 2008 [in Russian].
V. P. Kozhemiako, T. B. Martyniuk, N. V. Fofanova ta V. V. Dmytruk, “Porivnialnyi analiz variantiv syntezu mikroprohramnykh avtomativ”, Optyko-elektronni informatsiino-enerhetychni tekhnolohii, № 1(9), s. 225-233. 2005 [in Ukrainian].
V. P. Kozhemiako, T. B. Martyniuk i K. V. Kozhemiako, “Sintez ustrojstva upravlenija na R-avtomate”, Upravljajushhie sistemy i mashiny, № 1/2, s. 22-25. 1995 [in Russian].
T. B. Martyniuk, “Osobennosti sinteza mikroprogrammnyh R-avtomatov”, Upravljajushhie sistemy i mashiny, № 3, s. 22-26. 1998 [in Russian].
A. V. Palagin i V. N. Opanasenko, Rekonfiguriruemye vychislitel'nye sistemy. K.: Prosvіta, 2006. [in Russian].
V. Solov'ev i A. Klimovich, “Ispol'zovanie vhodnyh buferov PLIS v kachestve jelementov pamjati konechnyh avtomatov”, Chip News, № 2(22), s. 24-28. 2003 [in Russian].
A. A. Barkalov i A. A. Barkalov, “Optimizacija logicheskoj shemy avtomata Mura na program-miruemyh BIS”, Upravljajushhie sistemy i mashiny, № 6, s. 38-41. 2001 [in Russian].
T. B. Martyniuk, L. V. Krupelnytskyi ta B. I. Krukivskyi, “Rehuliarna obchysliuvalna struktura dlia ranzhuvannia danykh”, Informatsiini tekhnolohii ta kompiuterna inzheneriia, № 3(52), s. 70-76. 2021 [in Ukrainian].
V. P. Kozhemiako, T. B. Martyniuk, V. V. Dmytruk ta V. V. Vlasiichuk, “Klasyfikatsiia odynychnykh kodiv”, Optyko-elektronni informatsiino-enerhetychni tekhnolohii, № 1(11), s. 36-42. 2006 [in Ukrainian].
T. B. Martyniuk ta O. V. Voitsekhovska, “Efektyvnist odynychnoho koduvannia danykh”, Infor-matsiini tekhnolohii ta kompʼiuterna inzheneriia, № 2, s. 30-36. 2021 [in Ukrainian].
V. I. Zubchuk, V. P. Sigorskij i A. N. Shkuro, Spravochnik po cifrovoj shemotehnike. K.: Tehnika, 1990 [in Russian].
A. M. Sergienko, VHDL dlja proektirovanija vychislitel'nyh ustrojstv. K.: TID «DS», 2003 [in Russian].
V. Steshenko, “Shkola razrabotki apparatury cifrovoj obrabotki signalov na PLIS”, Chip News, № 8, s. 2-6. 1999 [in Russian].
S. M. Achasova, Algoritmy sinteza avtomatov na programmiruemyh matricah. M.: Radio i svjaz', 1987 [in Russian].
Downloads
-
PDF (Українська)
Downloads: 78