<?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">inform</journal-id><journal-title-group><journal-title xml:lang="ru">Информатика</journal-title><trans-title-group xml:lang="en"><trans-title>Informatics</trans-title></trans-title-group></journal-title-group><issn pub-type="ppub">1816-0301</issn><issn pub-type="epub">2617-6963</issn><publisher><publisher-name>UIIP NASB</publisher-name></publisher></journal-meta><article-meta><article-id custom-type="elpub" pub-id-type="custom">inform-64</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>ARTICLES ON THE MATERIALS CONFERENCE</subject></subj-group></article-categories><title-group><article-title>СХЕМНАЯ РЕАЛИЗАЦИЯ VHDL-ОПИСАНИЙ СИСТЕМ НЕ ПОЛНОСТЬЮ ОПРЕДЕЛЕННЫХ БУЛЕВЫХ ФУНКЦИЙ</article-title><trans-title-group xml:lang="en"><trans-title>CIRCUIT IMPLEMENTATION OF VHDL-DESCRIPTIONS OF SYSTEMS OF PARTIAL BOOLEAN FUNCTIONS</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>Bibilo</surname><given-names>P. N.</given-names></name></name-alternatives><email xlink:type="simple">bibilo@newman.bas-net.by</email><xref ref-type="aff" rid="aff-1"/></contrib></contrib-group><aff xml:lang="ru" id="aff-1"><institution>Объединенный институт проблем информатики НАН Беларуси</institution><country>Belarus</country></aff><pub-date pub-type="collection"><year>2016</year></pub-date><pub-date pub-type="epub"><day>30</day><month>09</month><year>2016</year></pub-date><volume>0</volume><issue>3</issue><fpage>49</fpage><lpage>58</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">Bibilo P.N.</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://inf.grid.by/jour/article/view/64">https://inf.grid.by/jour/article/view/64</self-uri><abstract><p>Предлагаются синтезируемые VHDL-модели систем не полностью определенных булевых функций. Приводятся результаты экспериментов по различным способам схемной реализации VHDL-описаний таких систем функций комбинационными схемами в библиотеке проектирования заказных СБИС и FPGA.</p></abstract><trans-abstract xml:lang="en"><p>Method for description of incompletely specified (partial) Boolean functions in VHDL is proposed. Examples of synthesized VHDL models of partial Boolean functions are presented; and the results of experiments on circuit implementation of VHDL descriptions of systems of partial functions. The realizability of original partial functions in logical circuits was verified by formal verification. The results of the experiments show that the preliminary minimization in DNF class and in the class of BDD representations for pseudo-random systems of completely specified functions does not improve practically (and in the case of BDD sometimes worsens) the results of the subsequent synthesis in the basis of FPGA unlike the significant efficiency of these procedures for the synthesis of benchmark circuits taken from the practice of the design.</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">Бибило, П.Н. Cистемы проектирования интегральных схем на основе языка VHDL. StateCAD, ModelSim, LeonardoSpectrum / П.Н. Бибило. – М. : СОЛОН-Пресс, 2005. – 384 с.</mixed-citation><mixed-citation xml:lang="en">Бибило, П.Н. Cистемы проектирования интегральных схем на основе языка VHDL. StateCAD, ModelSim, LeonardoSpectrum / П.Н. Бибило. – М. : СОЛОН-Пресс, 2005. – 384 с.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Закревский, А.Д. Логический синтез каскадных схем / А.Д. Закревский. – М. : Наука, 1981. – 416 c.</mixed-citation><mixed-citation xml:lang="en">Закревский, А.Д. Логический синтез каскадных схем / А.Д. Закревский. – М. : Наука, 1981. – 416 c.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Бибило, П.Н. Применение диаграмм двоичного выбора при синтезе логических схем / П.Н. Бибило. – Минск : Беларус. навука, 2014. – 231 с.</mixed-citation><mixed-citation xml:lang="en">Бибило, П.Н. Применение диаграмм двоичного выбора при синтезе логических схем / П.Н. Бибило. – Минск : Беларус. навука, 2014. – 231 с.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Лохов, А. Функциональная верификация СБИС в свете решений Mentor Graphics / А. Лохов // Электроника: наука, технология, бизнес. – 2004. – № 1. – С. 58–62.</mixed-citation><mixed-citation xml:lang="en">Лохов, А. Функциональная верификация СБИС в свете решений Mentor Graphics / А. Лохов // Электроника: наука, технология, бизнес. – 2004. – № 1. – С. 58–62.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Yang, S. BDS: a BDD-based logic optimization system / S. Yang, M. Ciesielski // IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. – 2002. – Vol. 21. – No. 7. – P. 866–876.</mixed-citation><mixed-citation xml:lang="en">Yang, S. BDS: a BDD-based logic optimization system / S. Yang, M. Ciesielski // IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems. – 2002. – Vol. 21. – No. 7. – P. 866–876.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Stojkovich, S. Determining Assignment of Incompletely Specified Boolean Functions for Compact Representations by Binary Decision Diagrams / S. Stojkovich, M. Stanković, R. Stanković // 10th Intern. Workshop on Boolean Problems, Freiberg (Sachsen), 2012. – Freiberg (Sachsen), 2012. – P. 233–238.</mixed-citation><mixed-citation xml:lang="en">Stojkovich, S. Determining Assignment of Incompletely Specified Boolean Functions for Compact Representations by Binary Decision Diagrams / S. Stojkovich, M. Stanković, R. Stanković // 10th Intern. Workshop on Boolean Problems, Freiberg (Sachsen), 2012. – Freiberg (Sachsen), 2012. – P. 233–238.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Taghavi Afshord, S. An input variable partitioning algorithm for functional decomposition of a system of Boolean functions based on the tabular method / S. Taghavi Afshord, Yu.V. Pottosin, B. Arasteh // Discrete Applied Mathematics. – 2015. – No. 185. – P. 208–219.</mixed-citation><mixed-citation xml:lang="en">Taghavi Afshord, S. An input variable partitioning algorithm for functional decomposition of a system of Boolean functions based on the tabular method / S. Taghavi Afshord, Yu.V. Pottosin, B. Arasteh // Discrete Applied Mathematics. – 2015. – No. 185. – P. 208–219.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Lee , R.-R. Bi-decomposing large Boolean functions via interpolation and satisfiability solving / R.-R. Lee , J.-H. R. Jiang , W.-L. Hung // Proc. of the 45th Annual Design Automation Conference, Anaheim, California, 8–13 Junе 2008. – N. Y., 2008. – P. 636–641.</mixed-citation><mixed-citation xml:lang="en">Lee , R.-R. Bi-decomposing large Boolean functions via interpolation and satisfiability solving / R.-R. Lee , J.-H. R. Jiang , W.-L. Hung // Proc. of the 45th Annual Design Automation Conference, Anaheim, California, 8–13 Junе 2008. – N. Y., 2008. – P. 636–641.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Авдеев, Н.А. Эффективность логической оптимизации при синтезе комбинационных схем из библиотечных элементов / Н.А. Авдеев, П.Н. Бибило // Микроэлектроника. – 2015. – Т. 44, № 5. – С. 383–399.</mixed-citation><mixed-citation xml:lang="en">Авдеев, Н.А. Эффективность логической оптимизации при синтезе комбинационных схем из библиотечных элементов / Н.А. Авдеев, П.Н. Бибило // Микроэлектроника. – 2015. – Т. 44, № 5. – С. 383–399.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Logic minimization algorithm for VLSI synthesis / K.R. Brayton [et al.]. – Boston : Kluwer Academic Publishers, 1984. – 193 p.</mixed-citation><mixed-citation xml:lang="en">Logic minimization algorithm for VLSI synthesis / K.R. Brayton [et al.]. – Boston : Kluwer Academic Publishers, 1984. – 193 p.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Торопов, Н.Р. Минимизация систем булевых функций в классе ДНФ / Н.Р. Торопов // Логическое проектирование. – Минск : Ин-т техн. кибернетики НАН Беларуси, 1999. – Вып. 4. – С. 4–19.</mixed-citation><mixed-citation xml:lang="en">Торопов, Н.Р. Минимизация систем булевых функций в классе ДНФ / Н.Р. Торопов // Логическое проектирование. – Минск : Ин-т техн. кибернетики НАН Беларуси, 1999. – Вып. 4. – С. 4–19.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Авдеев, Н.А. Эффективность проектирования заказных схем в синтезаторе LeonardoSpectrum / Н.А. Авдеев, П.Н. Бибило // Современная электроника. – 2015. – № 1. – С. 58–61.</mixed-citation><mixed-citation xml:lang="en">Авдеев, Н.А. Эффективность проектирования заказных схем в синтезаторе LeonardoSpectrum / Н.А. Авдеев, П.Н. Бибило // Современная электроника. – 2015. – № 1. – С. 58–61.</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>
