Control Systems and Computers

DOI: https://doi.org/10.15407/usim.2017.04.043

Upr. sist. maš., 2017, Issue 4 (270), pp. 43-50.

UDC 004.274

Barkalov A.A., Doctor (Eng.),Institute of Computer Engineering and Electronics, Institute of Informatics and Electronics Zielenogorski University, ul. Podgorna, 50, Zielona Gora, 65-246, POLAND, a.barkalv@imei.uz.zgora.pl,

Titarenko L.A., Doctor (Eng.), Professor, Institute of Computer Engineering and Electronics, Institute of Informatics and Electronics Zielenogorski University, ul. Podgorna, 50, Zielona Gora, 65-246, POLAND,

Vizor Y.E., PhD (Eng.), +38 (044) 526-25-04, V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine, Kyiv, 03187, Glushkov ave., 40, Ukraine, E-mail: yaviz@ukr.net,

Matvienko A.V., Researcher Associate, V.M. Glushkov Institute of Cybernetics of National Academy of Sciences of Ukraine, Kyiv, 03187, Glushkov ave., 40, Ukraine, +38 (044) 526-30-69, E-mail: matv@online.ua.

Reducing the Hardware Amount for the Combined Automata 

Introduction. The proposed method allows to reduce the number of LUT elements in the scheme of a combined microprogram automatic machine in comparison with the known methods.

Purpose. This is achieved by transforming the codes of the states of the microprogram automaton into the class codes of the pseudoequivalent states. This approach reduces the number of input addresses in the block of the input variables replacement.

Purpose. It is advisable to use this method if the replacement of input variables allows the use of only one EMB block for the implementation of the memory excitation function systems and input variables of the Mili machine. The analysis shows that this class includes 18% of standard machines. In addition, the number of address inputs of LUTs must be sufficient to implement as one element of any function from the set.  

Conclusion. As our studies have shown, the replacement of the states by pseudoequivalent state classes makes it possible to compensate the presence of the LUTer2 block due to the decrease in the number of LUT elements in the block for the input variables replacement.
The direction for our further research is connected with the adaptation of these approaches to the combined automatic machine features.

Download full text! (In Russian).

Keywords: combined FSM, FPGA, LUT, EMB, synthesis, structural reduction.

1. Baranov, S., Logic Synthesis for Control Automata, Dordrecht: Kluwer Academic Publishers, 1994, 312 p.
2. DeMicheli, G., 1994. Synthesis and Optimization of Digital Circuits, New York: McGraw-Hill, 636 p.
3. Sklyarov, V., Skliarova, I., Barkalov, A., Titarenko, L., 2014. Synthesis and Optimization of FPGA-based Systems, Berlin: Springer, 432 p.
4. Tiwari, A., Tomko, K., 2004. “Saving power by mapping finite state machines into embedded memory blocks in FPGAs”, Proceedings of Design Automation and Test in Europe, 2, pp. 916–921.
5. Barkalov, A.A., Titarenko, L.A., Vizor, Ja.E., Matvienko, A.V., 2015. “Sintez sovmeshhennogo mikroprogrammnogo avtomata v bazise FPGA”, Komp’juterni zasobi, merezhi ta sistemi, Zbіrnik naukovih prac’, Іn-t kіbernetiki іm. V.M. Glushkova NAN Ukraїni, Kiїv, 14, pp. 32–39. (In Russian).
6. Barkalov, A.A., Titarenko, L.A., Vizor, Ja.E., Matvienko, A.V., 2015. “Realizacija shemy sovmeshhennogo mikroprogrammnogo avtomata v bazise FPGA”. Problemi іnformatizacії ta upravlіnnja, Zbіrnik naukovih prac’. Nacіonal’nij avіacіjnij unіversitet, Kiїv, 3(51), pp. 5–13. (In Russian).
7. Barkalov, A.A., Titarenko, L.A., Vizor, Ja.E., Matvienko, A.V., Gorina, V.V., 2016. “Umen’shenie chisla LUT jelementov v sheme sovmeshhennogo avtomata”, Upravlâûŝie sistemy i mašiny, 3, pp. 16–22. (In Russian).
8. FPGA, [online] Available at: <http://www.altera.com> [Accessed 15 Apr. 2016].
9. Xilinx, [online] Available at: <http://www.xilinx.com> [Accessed 25 Apr. 2016].
10. Barkalov, A., Titarenko, L., 2009. Logic Synthesis for FSM-based Control Units, Berlin: Springer, 233 p.
11. Barkalov, A., Titarenko, L., Kolopenczyk, M., Mielcarek, K., Bazydlo, G., 2016. Logic Synthesis for FPGA-based Finite State Mashines, Berlin: Springer, 2016, 280 p.
12. Solov’ev, V.V., 2001. Proektirovanie cifrovyh shem na osnove programmiruemyh logicheskih integral’nyh shem, M.: Gorjachaja linija – TELEKOM, 636 p. (In Russian).
13. Barkalov, A.A., 1998. “Principy optimizacii logicheskoj shemy mikroprogrammnogo avtomata Mura”, Kibernetika i sistemnyjanaliz, 1, pp. 65–72. (In Russian).
14. Yang, S., 1991. Logic synthesis and optimization benchmarks user guide. Microelectronics Center of North Carolina, 43 p.

Received 29.06.2017