<?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-244</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>LOGICAL DESIGN</subject></subj-group></article-categories><title-group><article-title>ПОСТРОЕНИЕ ТЕСТОВ ПОЛНОГО ПЕРЕБОРА ДЛЯ ОЦЕНКИ ЭНЕРГОПОТРЕБЛЕНИЯ ПОСЛЕДОВАТЕЛЬНОСТНЫХ СХЕМ</article-title><trans-title-group xml:lang="en"><trans-title>TESTS GENERATION FOR POWER CONSUMPTION ESTIMATION OF SEQUENTIAL CIRCUITS</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>Cheremisinova</surname><given-names>L. D.</given-names></name></name-alternatives><bio xml:lang="ru"/><email xlink:type="simple">kir@newman.bas-net.by</email><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, National Academy of Sciences of Belarus</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2017</year></pub-date><pub-date pub-type="epub"><day>12</day><month>12</month><year>2017</year></pub-date><volume>0</volume><issue>4(56)</issue><fpage>104</fpage><lpage>110</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Черемисинова Л.Д., 2017</copyright-statement><copyright-year>2017</copyright-year><copyright-holder xml:lang="ru">Черемисинова Л.Д.</copyright-holder><copyright-holder xml:lang="en">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://inf.grid.by/jour/article/view/244">https://inf.grid.by/jour/article/view/244</self-uri><abstract><p>Рассматривается задача оценки мощности, потребляемой КМОП-схемой, путем ее моделирования на тестовой последовательности входных воздействий. Предлагается метод построения тестовых последовательностей полного перебора на основе автоматного описания последовательностных схем. Метод основан на обходе дуг реберного орграфа, соответствующего графу переходов конечного автомата, задающего последовательностную схему.</p></abstract><trans-abstract xml:lang="en"><p>The article reflects the problem of the average power estimation which is consumed by a CMOS circuit by means of its simulation on the test sequence of input actions. The method of forming test sequences of complete enumeration for sequential circuits is offered. The method is based on arcs traversal of the line digraph corresponding to the state transition graph of finite state machine representing the sequential circuit.</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">Kuroda, T. Low-power high-speed CMOS VLSI design / T. Kuroda // Proc. of IEEE Intern. Conf. on Computer Design. – Los Alamitos, California, 2002. – Р. 310–315.</mixed-citation><mixed-citation xml:lang="en">Kuroda, T. Low-power high-speed CMOS VLSI design / T. Kuroda // Proc. of IEEE Intern. Conf. on Computer Design. – Los Alamitos, California, 2002. – Р. 310–315.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Zimmermann, R. Low-power logic styles: CMOS versus pass-transistor logic / R. Zimmermann, W. Fichtner // IEEE J. of Solid-State Circuits. – 1997. – Vol. 32(7), no. 7. – Р. 1079–1090.</mixed-citation><mixed-citation xml:lang="en">Zimmermann, R. Low-power logic styles: CMOS versus pass-transistor logic / R. Zimmermann, W. Fichtner // IEEE J. of Solid-State Circuits. – 1997. – Vol. 32(7), no. 7. – Р. 1079–1090.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Chandrakasan, A.P. Low-power CMOS digital design / A.P. Chandrakasan, S. Sheng, R.W. Broderson // IEEE J. of Solid-State Circuits. – 1992. – Vol. 27(4), no. 4. – Р. 473–484.</mixed-citation><mixed-citation xml:lang="en">Chandrakasan, A.P. Low-power CMOS digital design / A.P. Chandrakasan, S. Sheng, R.W. Broderson // IEEE J. of Solid-State Circuits. – 1992. – Vol. 27(4), no. 4. – Р. 473–484.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Estimation of average switching activity in combinational and sequential circuits / A. Ghosh [et al.] // 29th ACM/IEEE Design Automation Conference. – Aneheim, CA, 1992. – P. 253–259.</mixed-citation><mixed-citation xml:lang="en">Estimation of average switching activity in combinational and sequential circuits / A. Ghosh [et al.] // 29th ACM/IEEE Design Automation Conference. – Aneheim, CA, 1992. – P. 253–259.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Benini, L. Logic Synthesis for Low Power / L. Benini, G. De Micheli // Logic Synthesis and Verification; eds. S. Hassoun, T. Sasao, R.K. Brayton. – Boston, Dardrecht, London : Kluwer Academic Publishers, 2002. – P. 197–223.</mixed-citation><mixed-citation xml:lang="en">Benini, L. Logic Synthesis for Low Power / L. Benini, G. De Micheli // Logic Synthesis and Verification; eds. S. Hassoun, T. Sasao, R.K. Brayton. – Boston, Dardrecht, London : Kluwer Academic Publishers, 2002. – P. 197–223.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">BPNN Based Power Estimation of Sequential Circuits / S.A.K. Arasu [et al.] // Intern. J. of Advanced Research in Computer Science and Software Engineering. – 2013. – Vol. 3, no. 11. – P. 256–260.</mixed-citation><mixed-citation xml:lang="en">BPNN Based Power Estimation of Sequential Circuits / S.A.K. Arasu [et al.] // Intern. J. of Advanced Research in Computer Science and Software Engineering. – 2013. – Vol. 3, no. 11. – P. 256–260.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Bushnell, M.L. Essentials of electronic testing for digital, memory and mixed-signal VLSI circuits / M.L. Bushnell, V.D. Agrawal. – Kluwer Academic Publishers, 2002. – 128 р.</mixed-citation><mixed-citation xml:lang="en">Bushnell, M.L. Essentials of electronic testing for digital, memory and mixed-signal VLSI circuits / M.L. Bushnell, V.D. Agrawal. – Kluwer Academic Publishers, 2002. – 128 р.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Бибило, П.Н. Оценка энергопотребления логических КМОП-схем по их переключательной активности / П.Н. Бибило, Н.А. Кириенко // Микроэлектроника. – 2011. – Т. 40, № 6. – С. 1–14.</mixed-citation><mixed-citation xml:lang="en">Бибило, П.Н. Оценка энергопотребления логических КМОП-схем по их переключательной активности / П.Н. Бибило, Н.А. Кириенко // Микроэлектроника. – 2011. – Т. 40, № 6. – С. 1–14.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Закревский, А.Д. Минимизация перебора ориентированных пар / А.Д. Закревский // Танаевские чтения : докл. Четвертой Междунар. науч. конф., Минск, 29–30 марта 2010 г. – Минск : ОИПИ НАН Беларуси, 2010. – С. 58–62.</mixed-citation><mixed-citation xml:lang="en">Закревский, А.Д. Минимизация перебора ориентированных пар / А.Д. Закревский // Танаевские чтения : докл. Четвертой Междунар. науч. конф., Минск, 29–30 марта 2010 г. – Минск : ОИПИ НАН Беларуси, 2010. – С. 58–62.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Кристофидес, Н. Теория графов. Алгоритмический подход / Н. Кристофидес. – М. : Мир, 1978.</mixed-citation><mixed-citation xml:lang="en">Кристофидес, Н. Теория графов. Алгоритмический подход / Н. Кристофидес. – М. : Мир, 1978.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Харари, Ф. Теория графов / Ф. Харари ; пер. с англ. – М. : Едиториал УРСС, 2003. – 296 с.</mixed-citation><mixed-citation xml:lang="en">Харари, Ф. Теория графов / Ф. Харари ; пер. с англ. – М. : Едиториал УРСС, 2003. – 296 с.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Bodin, L. A Model for Municipal Street Sweeping Operations / L. Bodin // Discrete and System Models (Modules in Applied Mathematics). – 1983. – Vol. 3. – P. 76–111.</mixed-citation><mixed-citation xml:lang="en">Bodin, L. A Model for Municipal Street Sweeping Operations / L. Bodin // Discrete and System Models (Modules in Applied Mathematics). – 1983. – Vol. 3. – P. 76–111.</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>
