The existing means for designing automation are oriented, mainly, at technologies of western manufactures. As a result, a need in adaptation of available methods and means of designing the reconfigurable systems on chip and development of domestic specialized CAD devices for solving the actual tasks in this field appears. The methods for solving the interconnect routing problems combined with the logical resynthesis, considering the architecture of the reconfigurable system-on-chip (RSoC) based on FPGA of Almaz-14, have been proposed. In the chip the developers from JSC «NIIME» and PJSC «Micron» have created an extensive configuration options having no foreign analogs. The availability of a wide range of additional elements for configuring as well as the capabilities of logical resynthesis of the FPGA Almaz-14 microcircuit leads to the necessity of developing the new methods for routing the interconnects, which could take into account and use these architectural features. The efficient algorithm of automatic routing of interconnects for RSoC based on FPGA of Almaz-14 series based on the algorithm A*, of the modification of a classical algorithm of searching for the shortest path on graph, the Dijkstra’s algorithm, including the model of the mixed commutation graph, has been developed. For description of the variety of additional switching elements a special generalized mathematical model as well as a special command interface in Tcl language, which includes a list of configuration elements, their description and functionality, has been developed. The of result of the work is an improvement of the automated design efficiency using the developed and implemented in C language for optimal use of the configurations and route elements of FPGA, as well as of the mechanisms for the full and correct routing of interconnects.
1. Гаврилов С.В., Гудкова О.Н., Стемпковский А.Л. Анализ быстродействия нано-метровых сложнофункциональных блоков на основе интервального моделирования // Изв. вузов. Электроника. – 2012. – № 4. – C. 40–49.
2. Гаврилов С.В., Иванова Г.А. Анализ быстродействия сложных цифровых схем с учетом неопределенности технологических и схемных параметров // Вестник Рязанского государственного радиотехнического университета. – 2015. – Вып. 53. – С. 29–35.
3. Гарбулина Т.В., Лялинская О.В., Хватов В.М. Повышение эффективности проек-тирования интегральных схем на ПЛИС с ограниченными трассировочными ресурсами // VII Всеросс. науч.-техн. конф. «Проблемы разработки перспективных микро- и наноэлек-тронных систем – 2016»: сб. научн. тр. / Под общ. ред. А.Л. Стемпковского. – М.: ИППМ РАН, 2016. – Ч. I. – С. 165–171.
4. Железников Д.А., Лялинский А.А. Метод оптимизации быстродействия ПЛИС на микроархитектурном уровне с помощью механизма конвейеризации // VII Всеросс. науч.-техн. конф. «Проблемы разработки перспективных микро- и наноэлектронных систем – 2016»: сб. научн. тр. / Под общ. ред. А.Л. Стемпковского. – М.: ИППМ РАН, 2016. – Ч. III. – С. 206–211.
5. Уэлш Б., Джонс К. Практическое программирование на Tcl и Tk. – 4-е изд.: пер. с англ. – М.: Вильямс, 2004. – 1125 с.
6. Hauck S., DeHon A. Reconfigurable computing: the theory and practice of FPGA-based computation. San Francisco, CA: Morgan Kaufmann Publishers Inc., 2007. – P. 944.
7. Kuon I., Rose J. Measuring the gap between FPGAs and ASICs // IEEE Trans. on Com-puter-Aided Design. – 2007. – Vol. 26. – No. 2. – P. 203–215.
8. Gomez-Prado D., Ciesielski M. A tutorial on FPGA routing // Department of Electrical and Computer Engineering, University of Massachusetts, Amherst, USA. – 2005.
9. Dijkstra E.W. A note on two problems in connexion with graphs // Numerische Mathemat-ik. – 1959. – Vol. 2. – P. 269–271.
10. Hart P. E., Nilsson N. J., Raphael B. A. Formal basis for the heuristic determination of minimum cost paths // IEEE Trans. on Systems Science and Cybernetics SSC4. – 1968. – No. 2. – P. 100–107.
11. Sharma A., Hauck S. Accelerating FPGA routing using architecture-adaptive A* tech-niques // Proc. Field-Programmable Technology. – 2005. – P. 225–232.