2020, issue 2, p. 78-85
Received 15.06.2020; Revised 28.06.2020; Accepted 30.06.2020
Published 24.07.2020; First Online 27.07.2020
https://doi.org/10.34229/2707-451X.20.2.8
Previous | Full text (in Russian) | Next
Synthesis of a combined automaton with ASIC
A.A. Barkalov 1 
, L.A. Titarenko 1,
2 ,
Y.E. Vizor 3, A.V. Matvienko 3 *
1 University of Zielona Gora, Poland
2 Kharkiv National University of Radio Electronics, Kharkiv, Ukraine
3 V.M. Glushkov Institute of Cybernetics of the NAS of Ukraine, Kyiv
* Correspondence: This email address is being protected from spambots. You need JavaScript enabled to view it.
Introduction. The model of a finite state machine is widely used for describing behavior of different sequential blocks, such as control units. It is possible that control units possess output signals having both types of Mealy and Moore automata. A model of the combined automaton can be used to synthesize such devices.
When the automaton circuit is implemented, it is necessary to optimize its characteristics such as hardware amount. The methods of this task solution depend significantly on logic elements used to implement circuits.
In this article, we propose a method of reducing hardware in the circuit of combined automaton implemented with ASIC. In this case, the circuit is implemented using customized matrix circuits. The proposed method allows reducing the chip area occupied by the circuit of the automaton. The method is based on the expansion of the matrix that generates circuit product terms of the systems of input memory functions and output functions of the combined automaton. The additional part of the matrix generates terms for output functions of Moore automaton. It allows reduction of the chip area as compared to the area of the two-level circuit of the combined automaton.
The purpose of the article is to show that the division of circuit matrices allows reducing the resulting matrix area. The hardware amount is estimated for both trivial automaton structure and for the proposed approach. They are determined in conventional units of area.
Results. The method is proposed based on the expansion of the matrix of terms. Using an example, it is shown how to execute the steps of the proposed method. To increase the method efficiency, it is proposed to use a special state assignment that minimizes the number of terms in the systems of Boolean functions of outputs with Moore type. The conducted investigations show that the proposed method allows for reducing the resulting ASIC area from 10% to 26%. The gain increases with the growth of the automaton complexity.
Conclusions. A comparison of the proposed method with some known synthesis methods shows that the expansion of the matrix of terms for systems of input memory functions and output functions allows reducing the chip area occupied by the circuit of the combined automaton.
Keywords: combined automaton, ASIC, synthesis, state encoding, matrix circuit.
Cite as: Barkalov A.A., Titarenko L.A., Vizor Y.E., Matvienko A.V. Synthesis of a combined automaton with ASIC. Cybernetics and Computer Technologies. 2020. 2. P. 78–85. (in Russian) https://doi.org/10.34229/2707-451X.20.2.8
References
1. Baranov S. Logic Synthesis for Control Automata. Dordrecht: Kluwer Academic Publishers, 1994. 312 p. https://doi.org/10.1007/978-1-4615-2692-6
2. DeMicheli G. Synthesis and Optimization of Digital Circuits. New York: McGraw-Hill, 1994. 636 p.
3. Barkalov A.A., Titarenko L.A., Vizor Ya.Ye., Matvienko A.V., Gorina V.V. Synthesis of Combined Finite State Machine with FPGAs. Control Systems and Computers. 2016. 3. P. 16–22. https://doi.org/10.15407/usim.2016.03.016
4. Sklyarov V., Skliarova I., Barkalov A., Titarenko L. Synthesis and Optimization of FPGA-based Systems. Berlin: Springer, 2014. 432 p. https://doi.org/10.1007/978-3-319-04708-9
5. Solov'yev V.V. Designing digital circuits based on programmable logic integrated circuits. M.: Goryachaya liniya TELEKOM, 2001. 636 p. (in Russian).
6. Barkalov A., Titarenko L. Logic Synthesis for FSM–based Control Units. Berlin: Springer, 2009. 233 p. https://doi.org/10.1007/978-3-642-04309-3
7. Barkalov A., Titarenko L., Kolopenczyk M., Mielcarek K., Bazydlo G. Logic Synthesis for FPGA–based Finite State Machines. Berlin: Springer, 2016. 280 p. https://doi.org/10.1007/978-3-319-24202-6
8. Smith M. Application Specific Integrated Circuits. Boston: Addison-Wesley, 1997. 632 p.
9. Nababi Z. Embedded Core Design with FPGAs. New York: McGraw-Hill, 2008. 418 p.
10. Barkalov A.A., Titarenko L.A., Vizor Y.E., Matvienko A.V. Synthesis of combined finite state machine with FPGAs. Kompʺyuterni zasoby, merezhi ta systemy. 2015. 14. P. 32–39. (in Ukrainian).
11. Barkalov A.A., Titarenko L.A., Vizor Y.E., Matvienko A.V. Implementing circuit of combined finite state machine with FPGAs. Problemy informatyzatsiyi ta upravlinnya. 2015. 3 (51). P. 5–13. (in Ukrainian). http://dx.doi.org/10.18372/2073-4751.3.10302
12. Achasova S.M. Algorithms for the synthesis of automata on programmable logic matrices. M.: Sovetskoye radio, 1987. 132 p. (in Russian).
13. Yang S. Logic Synthesis and optimization benchmarks user guide. Microelectronics Center of North Carolina. 1991. 43 p. https://ddd.fit.cvut.cz/prj/Benchmarks/LGSynth91.pdf
14. Barkalov A.A. Principles of optimization of logic circuit of Moore FSM. Cybernetics and Systems Analysis. 1998. 34 (1). P. 65–72. https://doi.org/10.1007/BF02911262
ISSN 2707-451X (Online)
ISSN 2707-4501 (Print)
Previous | Full text (in Russian) | Next