<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3.dtd">
<article article-type="research-article" dtd-version="1.3" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xml:lang="ru"><front><journal-meta><journal-id journal-id-type="publisher-id">vestifm</journal-id><journal-title-group><journal-title xml:lang="ru">Известия Национальной академии наук Беларуси. Серия физико-математических наук</journal-title><trans-title-group xml:lang="en"><trans-title>Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics Series</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1561-2430</issn><issn pub-type="epub">2524-2415</issn><publisher><publisher-name>The Republican Unitary Enterprise Publishing House "Belaruskaya Navuka"</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">vestifm-89</article-id><article-categories><subj-group subj-group-type="heading"><subject>Research Article</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="ru"><subject>ИНФОРМАТИКА</subject></subj-group><subj-group subj-group-type="section-heading" xml:lang="en"><subject>INFORMATICS</subject></subj-group></article-categories><title-group><article-title>ОПТИМИЗАЦИЯ МНОГОУРОВНЕВЫХ ПРЕДСТАВЛЕНИЙ ЛОГИЧЕСКИХ СХЕМ ДЛЯ СОКРАЩЕНИЯ ПЛОЩАДИ КРИСТАЛЛА СБИС И ЭНЕРГОПОТРЕБЛЕНИЯ</article-title><trans-title-group xml:lang="en"><trans-title>OPTIMIZATION OF MULTI-LEVEL REPRESENTATIONS OF LOGIC CIRCUITS TO REDUCE A VLSI CHIPAREA AND POWER CONSUMPTION</trans-title></trans-title-group></title-group><contrib-group><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Кириенко</surname><given-names>Н. А.</given-names></name><name name-style="western" xml:lang="en"><surname>Kirienko</surname><given-names>N. A.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Черемисинов</surname><given-names>Д. И.</given-names></name><name name-style="western" xml:lang="en"><surname>Cheremisinov</surname><given-names>D. I.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib><contrib contrib-type="author" corresp="yes"><name-alternatives><name name-style="eastern" xml:lang="ru"><surname>Черемисинова</surname><given-names>Л. Д.</given-names></name><name name-style="western" xml:lang="en"><surname>Cheremisinova</surname><given-names>L. D.</given-names></name></name-alternatives><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff-alternatives id="aff-1"><aff xml:lang="ru"><institution>Объединенный институт проблем информатики НАН Беларуси, Минск</institution></aff><aff xml:lang="en"><institution>United Institute of Informatics Problems of the NAS of Belarus, Minsk</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2015</year></pub-date><pub-date pub-type="epub"><day>18</day><month>05</month><year>2016</year></pub-date><volume>0</volume><issue>2</issue><fpage>103</fpage><lpage>111</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Кириенко Н.А., Черемисинов Д.И., Черемисинова Л.Д., 2016</copyright-statement><copyright-year>2016</copyright-year><copyright-holder xml:lang="ru">Кириенко Н.А., Черемисинов Д.И., Черемисинова Л.Д.</copyright-holder><copyright-holder xml:lang="en">Kirienko N.A., Cheremisinov D.I., Cheremisinova L.D.</copyright-holder><license xml:lang="ru" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>Данная работа распространяется под лицензией Creative Commons Attribution 4.0.</license-p></license><license xml:lang="en" license-type="creative-commons-attribution" xlink:href="https://creativecommons.org/licenses/by/4.0/" xlink:type="simple"><license-p>This work is licensed under a Creative Commons Attribution 4.0 License.</license-p></license></permissions><self-uri xlink:href="https://vestifm.belnauka.by/jour/article/view/89">https://vestifm.belnauka.by/jour/article/view/89</self-uri><abstract><p>Рассматривается задача оптимизации многоуровневых представлений логических схем с учетом двух основных характеристик КМОП-микросхем при реализации на кристалле СБИС: площади и среднего значения рассеиваемой мощности. Приводятся результаты сравнительного исследования двух подходов к построению многоуровневой логической схемы из вентилей, предназначенной для покрытия элементами КМОП библиотеки. </p></abstract><trans-abstract xml:lang="en"><p>The problem of optimization of multi-level representations of logic circuits taking into account two main characteristics of CMOS circuits (area and average dissipated power value) is developed. The results of a comparative study of two approaches to the construction of multi-level logic circuits design on the base of gates are presented. Such multi-level logic circuits are intended to cover a CMOS library with elements.</p></trans-abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Benini L., De Micheli G. // Logic Synthesis and Verification. 2002. P. 197–223.</mixed-citation><mixed-citation xml:lang="en">Benini L., De Micheli G. // Logic Synthesis and Verification. 2002. P. 197–223.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Brayton B. R., Hachtel G. D., Sangiovanni-Vincentelli A. L. // Proc. of the IEEE. 1990. Vol. 78, N 2. P. 264–300.</mixed-citation><mixed-citation xml:lang="en">Brayton B. R., Hachtel G. D., Sangiovanni-Vincentelli A. L. // Proc. of the IEEE. 1990. Vol. 78, N 2. P. 264–300.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Рабаи Ж. М., Чандракасан А., Николич Б. Цифровые интегральные схемы. Методология проектирования. М., 2007.</mixed-citation><mixed-citation xml:lang="en">Рабаи Ж. М., Чандракасан А., Николич Б. Цифровые интегральные схемы. Методология проектирования. М., 2007.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Roy K., Prasad S. C. Low Power CMOS VLSI Circuit Design. New York, 2000.</mixed-citation><mixed-citation xml:lang="en">Roy K., Prasad S. C. Low Power CMOS VLSI Circuit Design. New York, 2000.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Power Compiler. Automatic Power Management within Galaxy™ Implementation Platform: http://pdf.aminer.org/000/285/870/power_compiler_a_gate_level_power_optimization_and_synthesis_system.pdf [Electronic resource]. Date of access: 01.02.2014.</mixed-citation><mixed-citation xml:lang="en">Power Compiler. Automatic Power Management within Galaxy™ Implementation Platform: http://pdf.aminer.org/000/285/870/power_compiler_a_gate_level_power_optimization_and_synthesis_system.pdf [Electronic resource]. Date of access: 01.02.2014.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Черемисинова Л. Д. // Информац. технологии. 2010. № 8. С. 27–35.</mixed-citation><mixed-citation xml:lang="en">Черемисинова Л. Д. // Информац. технологии. 2010. № 8. С. 27–35.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Najm F. N. A. // IEEE Trans. on VLSI. 1994. N 12. P. 446–455.</mixed-citation><mixed-citation xml:lang="en">Najm F. N. A. // IEEE Trans. on VLSI. 1994. N 12. P. 446–455.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Pedram M. Power // ACM Trans. Design Automation Electronic Systems. 1996. Vol. 1. P. 3–56.</mixed-citation><mixed-citation xml:lang="en">Pedram M. Power // ACM Trans. Design Automation Electronic Systems. 1996. Vol. 1. P. 3–56.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Лукошко Г., Коннов Е. // Радиолюбитель. 1997. № 9. С. 39–40.</mixed-citation><mixed-citation xml:lang="en">Лукошко Г., Коннов Е. // Радиолюбитель. 1997. № 9. С. 39–40.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Rudell R. Logic Synthesis for VLSI Design // MemorandumNo. UCB/ERL M89/49, Electronics Research Laboratory, College of Engeneering, University of California, Berceley, CA 94720. 1989.</mixed-citation><mixed-citation xml:lang="en">Rudell R. Logic Synthesis for VLSI Design // MemorandumNo. UCB/ERL M89/49, Electronics Research Laboratory, College of Engeneering, University of California, Berceley, CA 94720. 1989.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Detjens E. et al. // Proc. IEEE Int. Conf. on CAD (ICCAD). 1987. P. 116–119.</mixed-citation><mixed-citation xml:lang="en">Detjens E. et al. // Proc. IEEE Int. Conf. on CAD (ICCAD). 1987. P. 116–119.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Sentovich E. M. et al. SIS: A System for Sequential Circuit Synthesis // University of California, Berkeley, Technical Report No. UCB/ERL M92/41 [Electronic resource]. 1992. Mode of access: http://www.eecs.berkeley.edu/Pubs/TechRpts/1992/ ERL-92-41.pdf. Date of access: 25.02.2015.</mixed-citation><mixed-citation xml:lang="en">Sentovich E. M. et al. SIS: A System for Sequential Circuit Synthesis // University of California, Berkeley, Technical Report No. UCB/ERL M92/41 [Electronic resource]. 1992. Mode of access: http://www.eecs.berkeley.edu/Pubs/TechRpts/1992/ ERL-92-41.pdf. Date of access: 25.02.2015.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Черемисинов Д. И., Черемисинова Л. Д. // Информац. технологии. 2011. № 5. С. 17–23.</mixed-citation><mixed-citation xml:lang="en">Черемисинов Д. И., Черемисинова Л. Д. // Информац. технологии. 2011. № 5. С. 17–23.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Brayton R. K., Hachtel G. D., McMullen C., Sangiovanni-Vincentelli A. L. Logic minimization algorithms for VLSI synthesis. Boston, 1984.</mixed-citation><mixed-citation xml:lang="en">Brayton R. K., Hachtel G. D., McMullen C., Sangiovanni-Vincentelli A. L. Logic minimization algorithms for VLSI synthesis. Boston, 1984.</mixed-citation></citation-alternatives></ref><ref id="cit15"><label>15</label><citation-alternatives><mixed-citation xml:lang="ru">Brayton R. K., Rudell R., Sangiovanni-Vincentelli A. L. et al. // IEEE Trans. on Computer-Aided Design. 1989. Vol. CAD-6, N 6. P. 1062–1081.</mixed-citation><mixed-citation xml:lang="en">Brayton R. K., Rudell R., Sangiovanni-Vincentelli A. L. et al. // IEEE Trans. on Computer-Aided Design. 1989. Vol. CAD-6, N 6. P. 1062–1081.</mixed-citation></citation-alternatives></ref><ref id="cit16"><label>16</label><citation-alternatives><mixed-citation xml:lang="ru">Keutzer K. // Proc. 24th ACM/IEEE Design Automation Conf. 1987. P. 341–347.</mixed-citation><mixed-citation xml:lang="en">Keutzer K. // Proc. 24th ACM/IEEE Design Automation Conf. 1987. P. 341–347.</mixed-citation></citation-alternatives></ref><ref id="cit17"><label>17</label><citation-alternatives><mixed-citation xml:lang="ru">Бибило П. Н., Лицкевич В. Г. // Микроэлектроника. 2002. № 1. С. 66–77.</mixed-citation><mixed-citation xml:lang="en">Бибило П. Н., Лицкевич В. Г. // Микроэлектроника. 2002. № 1. С. 66–77.</mixed-citation></citation-alternatives></ref><ref id="cit18"><label>18</label><citation-alternatives><mixed-citation xml:lang="ru">Mailhot F., De Mitcheli G. // IEEE Trans. on Computer-Aided Design of Integr. Circ. and Systems. 1993. Vol. 12, N 5. P. 599–620.</mixed-citation><mixed-citation xml:lang="en">Mailhot F., De Mitcheli G. // IEEE Trans. on Computer-Aided Design of Integr. Circ. and Systems. 1993. Vol. 12, N 5. P. 599–620.</mixed-citation></citation-alternatives></ref><ref id="cit19"><label>19</label><citation-alternatives><mixed-citation xml:lang="ru">Stok. L., Tiwari V. // Logic Synthesis and Verification. Boston; Dardrecht; London, 2002. P. 115–140.</mixed-citation><mixed-citation xml:lang="en">Stok. L., Tiwari V. // Logic Synthesis and Verification. Boston; Dardrecht; London, 2002. P. 115–140.</mixed-citation></citation-alternatives></ref><ref id="cit20"><label>20</label><citation-alternatives><mixed-citation xml:lang="ru">Черемисинова Л. Д. Синтез и оптимизация комбинационных структур СБИС. Минск, 2007.</mixed-citation><mixed-citation xml:lang="en">Черемисинова Л. Д. Синтез и оптимизация комбинационных структур СБИС. Минск, 2007.</mixed-citation></citation-alternatives></ref><ref id="cit21"><label>21</label><citation-alternatives><mixed-citation xml:lang="ru">Черемисинова Л. Д. // Информатика. 2010. № 4. С. 112–122.</mixed-citation><mixed-citation xml:lang="en">Черемисинова Л. Д. // Информатика. 2010. № 4. С. 112–122.</mixed-citation></citation-alternatives></ref><ref id="cit22"><label>22</label><citation-alternatives><mixed-citation xml:lang="ru">Черемисинова Л. Д., Кириенко Н. А. // Информац. технологии. 2013. № 3. C. 8–14.</mixed-citation><mixed-citation xml:lang="en">Черемисинова Л. Д., Кириенко Н. А. // Информац. технологии. 2013. № 3. C. 8–14.</mixed-citation></citation-alternatives></ref><ref id="cit23"><label>23</label><citation-alternatives><mixed-citation xml:lang="ru">Berkeley PLA test set [Electronic resource]. Mode of access: http://www1.cs.columbia.edu/~cs6861/sis/espressoexamples. Date of access: 25.02.2015.</mixed-citation><mixed-citation xml:lang="en">Berkeley PLA test set [Electronic resource]. Mode of access: http://www1.cs.columbia.edu/~cs6861/sis/espressoexamples. Date of access: 25.02.2015.</mixed-citation></citation-alternatives></ref><ref id="cit24"><label>24</label><citation-alternatives><mixed-citation xml:lang="ru">Бибило П. Н., Черемисинова Л. Д., Кардаш С. Н. и др. // Программная инженерия. 2013. № 8. С. 35–41.</mixed-citation><mixed-citation xml:lang="en">Бибило П. Н., Черемисинова Л. Д., Кардаш С. Н. и др. // Программная инженерия. 2013. № 8. С. 35–41.</mixed-citation></citation-alternatives></ref></ref-list><fn-group><fn fn-type="conflict"><p>The authors declare that there are no conflicts of interest present.</p></fn></fn-group></back></article>
