Advertisement

Russian Microelectronics

, Volume 47, Issue 7, pp 516–521 | Cite as

Solving the Problems of Routing Interconnects with a Resynthesis for Reconfigurable Systems on a Chip

  • S. V. GavrilovEmail author
  • D. A. Zheleznikov
  • V. M. Khvatov
Article
  • 3 Downloads

Abstract

The existing means of design automation are focused mainly on the technology of foreign manufacturers, which makes it necessary to adapt the existing methods and means for designing reconfigurable systems-on-a-chip and to develop domestic specialized CAD tools to solve urgent problems in this field. Methods are proposed for solving interconnection routing problems in conjunction with logical resynthesis, applied to the architecture of a reconfigurable system-on-a-chip based on the domestic field-programmable gate array (FPGA) of the Almaz-14 family. Developers from JSC “NIIME” and PJSC “Micron” laid broad configurational solutions, which do not have foreign analogues, into this crystal. A wide range of additional elements for the configuration, as well as the potentialities for the logical resynthesis of the FPGA Almaz-14 chip, have led to the need to develop new methods for routing interconnections that would allow us to take into account and use these architectural features. An efficient algorithm for the automatic routing of interconnections for a reconfigurable system on a chip based on FPGAs belonging to the Almaz-14 family based on algorithm A* is developed. This algorithm represents a modification of the classical algorithm searching for the shortest path on a graph, the Dijkstra algorithm, including a mixed switching graph model. To describe the variety of additional switching elements, a special generalized mathematical model, as well as a special interface in the command language Tcl are developed, the latter includes a list of elements for configuration, as well as their description and functional purpose. This work has increased the efficiency of computer-aided design using programmed mechanisms developed and implemented in the C programming language for the optimal use of the configuration and routing elements of FPGAs, as well as mechanisms for the complete and entire routing of interconnections.

Keywords:

interconnection routing computer-aided design field-programmable gate array (FPGA) logical resynthesis 

Notes

REFERENCES

  1. 1.
    Gavrilov, S.V., Gudkova, O.N., and Stempkovskii, A.L., Performance analysis of nanometer IP-blocks based interval modeling, Izv. Vyssh. Uchebn. Zaved., Elektron., 2012, no. 4, pp. 40–49.Google Scholar
  2. 2.
    Gavrilov, S.V. and Ivanova, G.A., Performance analysis of complex digital circuits with uncertainty of technological and circuit parameters, Vestn. Ryazan. Radiotekh. Univ., 2015, no. 53, pp. 29–35.Google Scholar
  3. 3.
    Garbulina, T.V., Lyalinskaya, O.V., and Khvatov, V.M., Efficiency increase of design of integrated circuits on FPGA with limited trace resources, in Tr. VII Vseross. nauch.-tekhn. konf. Problemy razrabotki perspektivnykh mikro- i nanoelektronnykh sistem – 2016 (Proceedings of the 7th All-Russia Conference on Problems of Perspective Micro- and Nanoelectronic Systems Design, 2016), Stempkovskii, A.L., Ed., Moscow: IPPM RAN, 2016, part 1, pp. 165–171.Google Scholar
  4. 4.
    Zheleznikov, D.A. and Lyalinskii, A.A., A method for optimizing the performance of FPGAs at a microarchitectural level using a pipelining mechanism, in Tr. VII Vseross. nauch.-tekhn. konf. “Problemy razrabotki perspektivnykh mikro- i nanoelektronnykh sistem – 2016” (Proceedings of the 7th All-Russia Conference on Problems of Perspective Micro- and Nanoelectronic Systems Design, 2016), Stempkovskii, A.L., Ed., Moscow: IPPM RAN, 2016, part 3, pp. 206–211.Google Scholar
  5. 5.
    Welsh, B. and Jones, K., Practical Programming in Tcl and Tk, 4th ed., Englewood Cliffs, NJ: Prentice Hall, 2003.Google Scholar
  6. 6.
    Hauck, S. and DeHon, A., Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation, San Francisco, CA: Morgan Kaufmann, 2007, p. 944.zbMATHGoogle Scholar
  7. 7.
    Kuon, I. and Rose, J., Measuring the gap between FPGAs and ASICs, IEEE Trans. Comput.-Aided Des., 2007, vol. 26, no. 2, pp. 203–215.Google Scholar
  8. 8.
    Gomez-Prado, D. and Ciesielski, M., A Tutorial on FPGA Routing, Amherst, MA: Univ. Massachusetts, 2005.Google Scholar
  9. 9.
    Dijkstra, E.W., A note on two problems in connexion with graphs, Numer. Math., 1959, vol. 2, pp. 269–271.MathSciNetCrossRefzbMATHGoogle Scholar
  10. 10.
    Hart, P.E., Nilsson, N.J., and Raphael, B.A., Formal basis for the heuristic determination of minimum cost paths, IEEE Trans. Syst. Sci. Cybern., 1968, vol. 4, no. 2, pp. 100–107.CrossRefGoogle Scholar
  11. 11.
    Sharma, A. and Hauck, S., Accelerating FPGA routing using architecture-adaptive A* techniques, in Proceedings of the IEEE International Conference on Field-Programmable Technology, 2005, pp. 225–232.Google Scholar

Copyright information

© Pleiades Publishing, Ltd. 2018

Authors and Affiliations

  • S. V. Gavrilov
    • 1
    Email author
  • D. A. Zheleznikov
    • 1
    • 2
  • V. M. Khvatov
    • 1
    • 2
  1. 1.Institute of Design Problems in Microelectronics, Russian Academy of SciencesMoscowRussia
  2. 2.National Research University MIETMoscowRussia

Personalised recommendations