informИнформатикаInformatics1816-03012617-6963UIIP NASBinform-270Research ArticleСТАТЬИ ПО МАТЕРИАЛАМ КОНФЕРЕНЦИЙARTICLES ON THE MATERIALS CONFERENCEСВЕРТКА РЕГУЛЯРНЫХ МАТРИЧНЫХ СТРУКТУР ЗАКАЗНЫХ СБИС МЕТОДОМ МОДЕЛИРОВАНИЯ ОТЖИГАЧеремисиноваЛ. Д.ЛогиноваИ. П.Объединенный институт проблем информатики НАН БеларусиBelarus20122302201804(36)108119Copyright © Черемисинова Л.Д., Логинова И.П., 20182018Черемисинова Л.Д., Логинова И.П.Черемисинова Л.Д., Логинова И.П.Данная работа распространяется под лицензией Creative Commons Attribution 4.0.This work is licensed under a Creative Commons Attribution 4.0 License.https://inf.grid.by/jour/article/view/270

Рассматривается задача топологической оптимизации программируемых логических матрицметодом свертки. Предлагаются алгоритмы многократной и простой сверток регулярных струк-тур СБИС на основе моделирования отжига, позволяющие находить оптимальное или близкое к нему решение задачи свертки. Приводятся результаты исследования предложенных алгоритмов свертки.

ReferencesУльман, Дж. Вычислительные аспекты СБИС / Дж. Ульман. – М. : Радио и связь,Ульман, Дж. Вычислительные аспекты СБИС / Дж. Ульман. – М. : Радио и связь,– 480 с.– 480 с.Hachtel, G.D. An Algorithm for optimal PLA Folding / G.D. Hachtel, A.R. Newton,Hachtel, G.D. An Algorithm for optimal PLA Folding / G.D. Hachtel, A.R. Newton,A. L. Sangiovanni-Vincentelli // IEEE Trans. Computer-Aided Design of Integrated Circuit Syst. – 1982. – Vol. CAD-1, № 2. – P. 63–77.A. L. Sangiovanni-Vincentelli // IEEE Trans. Computer-Aided Design of Integrated Circuit Syst. – 1982. – Vol. CAD-1, № 2. – P. 63–77.DeMicheli, G.A. Multiple Constrained Folding of Programmable Logic Arrays: Theory andDeMicheli, G.A. Multiple Constrained Folding of Programmable Logic Arrays: Theory andApplications / G.A. DeMicheli, Sangiovanni-Vincentelli // IEEE Trans. Computer-Aided Design. – 1983. – Vol. CAD-2, № 3. – P. 151–167.Applications / G.A. DeMicheli, Sangiovanni-Vincentelli // IEEE Trans. Computer-Aided Design. – 1983. – Vol. CAD-2, № 3. – P. 151–167.Macii, E. Graph models for PLA folding problems / E. Macii , T. Wolf // International Journal of Systems Science. – 1996. – Vol. 26, № 7. – P. 1439–1445.Macii, E. Graph models for PLA folding problems / E. Macii , T. Wolf // International Journal of Systems Science. – 1996. – Vol. 26, № 7. – P. 1439–1445.Wong, D.F. Simulated Annealing for VLSI Design / D.F. Wong, H.W. Leong, C.L. Liu //Wong, D.F. Simulated Annealing for VLSI Design / D.F. Wong, H.W. Leong, C.L. Liu //Boston : Kluwer Academic Publ. – 1988. – 220 p.Boston : Kluwer Academic Publ. – 1988. – 220 p.Hsu, W.-L. Fast and simple algorithms for recognizing chordal comparability graphs and interval graphs / W.-L. Hsu, T.-H. Ma // SIAM J. Comput. – 1999. – Vol. 28, № 3. – P. 1004–1020.Hsu, W.-L. Fast and simple algorithms for recognizing chordal comparability graphs and interval graphs / W.-L. Hsu, T.-H. Ma // SIAM J. Comput. – 1999. – Vol. 28, № 3. – P. 1004–1020.Golumbic, M.C. The complexity of comparability graph recognition and coloring / M.C. Golumbic // Computing. – 1977. – Vol. 18. – P. 199–208.Golumbic, M.C. The complexity of comparability graph recognition and coloring / M.C. Golumbic // Computing. – 1977. – Vol. 18. – P. 199–208.Hashimoto, A. Wire Routing by Optimizing Channel Assignment Within Larger Apertures /Hashimoto, A. Wire Routing by Optimizing Channel Assignment Within Larger Apertures /A. Hashimoto, J. Stevens // Proc. of 8th Design Automation Workshop, DAC '71. – Atlantic City, NJ, USA. – 1971.A. Hashimoto, J. Stevens // Proc. of 8th Design Automation Workshop, DAC '71. – Atlantic City, NJ, USA. – 1971.Equation of State Calculations by Fast Computer Machines / N. Metropolis [et al.] //Equation of State Calculations by Fast Computer Machines / N. Metropolis [et al.] //J. Chemical Physics. – 1953. – Vol. 21, № 6. – P. 1087–1092.J. Chemical Physics. – 1953. – Vol. 21, № 6. – P. 1087–1092.Kirkpatrick, S. Optimization by Simulated Annealing / S. Kirkpatrick, Jr.C.D. Gelatt,Kirkpatrick, S. Optimization by Simulated Annealing / S. Kirkpatrick, Jr.C.D. Gelatt,M.P. Vecchi // Science. – 1983. – Vol. 220(4598). – P. 671–680.M.P. Vecchi // Science. – 1983. – Vol. 220(4598). – P. 671–680.Greening, D.R. Simulated Annealing with Errors / D.R. Greening // Ph.D. dissertation, University OF CA Los Angeles. – 1995 [Electronic resourse]. – Mode of access : http: //Greening, D.R. Simulated Annealing with Errors / D.R. Greening // Ph.D. dissertation, University OF CA Los Angeles. – 1995 [Electronic resourse]. – Mode of access : http: //dan.greening.org/publications/phd.pdf. – Date of access : 28.03.2004.dan.greening.org/publications/phd.pdf. – Date of access : 28.03.2004.Van Laarhoven, P.J.M. Simulated Annealing: Theory and Applications /Van Laarhoven, P.J.M. Simulated Annealing: Theory and Applications /P.J.M. Van Laarhoven, E.H.L. Aarts. – Dordrecht : Reidel, 1987.P.J.M. Van Laarhoven, E.H.L. Aarts. – Dordrecht : Reidel, 1987.Ingber, L. Optimization of Trading Physics Models of Markets / L. Ingber, R.P. Mondescu // IEEE Trans. Neural Networks. – 2001. – № 12(4). – P. 776–790.Ingber, L. Optimization of Trading Physics Models of Markets / L. Ingber, R.P. Mondescu // IEEE Trans. Neural Networks. – 2001. – № 12(4). – P. 776–790.Liu, Chun-Yeh. An Efficient Algorithm for Bipartite PLA Folding / Chun-Yeh Liu, KewalLiu, Chun-Yeh. An Efficient Algorithm for Bipartite PLA Folding / Chun-Yeh Liu, KewalK. Saluja // IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems. – 1993. – Vol. 12, №. 12. – P. 1839–1847.K. Saluja // IEEE Trans. on Computer-Aided Design of Integrated Circuits and Systems. – 1993. – Vol. 12, №. 12. – P. 1839–1847.Лекции по теории графов / В.А. Емеличев [и др.]. – М. : Наука, 1990. – 384 с.Лекции по теории графов / В.А. Емеличев [и др.]. – М. : Наука, 1990. – 384 с.Berkeley PLA test set [Electronic resource]. – Mode of access : http://Berkeley PLA test set [Electronic resource]. – Mode of access : http://www1.cs.columbia.edu/ ~cs4861/sis/ espresso-examples/. – Date of access : 03.05.2006.www1.cs.columbia.edu/ ~cs4861/sis/ espresso-examples/. – Date of access : 03.05.2006.

The authors declare that there are no conflicts of interest present.