<?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-679</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></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-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-alternatives><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>2006</year></pub-date><pub-date pub-type="epub"><day>07</day><month>12</month><year>2018</year></pub-date><volume>0</volume><issue>1(9)</issue><fpage>104</fpage><lpage>113</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Ярмолик С.В., Ярмолик В.Н., 2018</copyright-statement><copyright-year>2018</copyright-year><copyright-holder xml:lang="ru">Ярмолик С.В., Ярмолик В.Н.</copyright-holder><copyright-holder xml:lang="en">Ярмолик С.В., Ярмолик В.Н.</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/679">https://inf.grid.by/jour/article/view/679</self-uri><abstract><p>Рассматривается эффективность применения маршевых тестов для обнаружения кодочувствительных неисправностей запоминающих устройств (ЗУ) и дается оценка их покрывающей способности. Исследуется вопрос о многократном применении маршевых тестов и анализируется влияние изменения начальных адресов ЗУ при повторном применении маршевых тестов для достижения их максимальной эффективности. В заключение приводятся экспериментальные данные, показывающие эффективность многократного применения маршевых тестов.</p></abstract></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Goor A.J. van de. Testing Semiconductor Memories, Theory and Practice. – Chichester, UK: John Wiley &amp; Sons, 1991.</mixed-citation><mixed-citation xml:lang="en">Goor A.J. van de. Testing Semiconductor Memories, Theory and Practice. – Chichester, UK: John Wiley &amp; Sons, 1991.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Karpovsky M.G., Yarmolik V.N. Transparent Memory Testing for Pattern Sensitive Faults // IEEE International Test Conference. – Washington, 1994. – P. 860–869.</mixed-citation><mixed-citation xml:lang="en">Karpovsky M.G., Yarmolik V.N. Transparent Memory Testing for Pattern Sensitive Faults // IEEE International Test Conference. – Washington, 1994. – P. 860–869.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Karpovsky M.G., Yarmolik V.N., Goor A.J. van de. Pseudo-Exhaustive Word-Oriented DRAM Testing // European Test Conference. – Munich, 1995. – P. 126–132.</mixed-citation><mixed-citation xml:lang="en">Karpovsky M.G., Yarmolik V.N., Goor A.J. van de. Pseudo-Exhaustive Word-Oriented DRAM Testing // European Test Conference. – Munich, 1995. – P. 126–132.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик С.В., Ярмолик В.Н. Эффективность многократного применения маршевых тестов для выявления кодочувствительных неисправностей // Известия Белорусской инженерной академии. – 2005. – № 1(91)/1. – С. 79–83.</mixed-citation><mixed-citation xml:lang="en">Ярмолик С.В., Ярмолик В.Н. Эффективность многократного применения маршевых тестов для выявления кодочувствительных неисправностей // Известия Белорусской инженерной академии. – 2005. – № 1(91)/1. – С. 79–83.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Nicolaidis M. Theory of Transparent BIST for RAMs // IEEE Transaction of Computers. – Vol. 45. – № 10. – 1996.</mixed-citation><mixed-citation xml:lang="en">Nicolaidis M. Theory of Transparent BIST for RAMs // IEEE Transaction of Computers. – Vol. 45. – № 10. – 1996.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Yarmolik V.N., Sokol B., Yarmolik S.V. Counter sequences for memory test address generation // Proc. 12th International Conference on Mixed Design of Integrated Circuits and Systems (MIXDES 2005). – Krakow, 2005. – P. 413–418.</mixed-citation><mixed-citation xml:lang="en">Yarmolik V.N., Sokol B., Yarmolik S.V. Counter sequences for memory test address generation // Proc. 12th International Conference on Mixed Design of Integrated Circuits and Systems (MIXDES 2005). – Krakow, 2005. – P. 413–418.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Mrozek I., Yarmolik V.N. Detection of Pattern Sensitive Faults by Multiple Transparent March Tests // Proc. 10th International Conference on Mixed Design of Integrated Circuits and Systems (MIXDES’03). – Lodz, 2003 – P. 542–545.</mixed-citation><mixed-citation xml:lang="en">Mrozek I., Yarmolik V.N. Detection of Pattern Sensitive Faults by Multiple Transparent March Tests // Proc. 10th International Conference on Mixed Design of Integrated Circuits and Systems (MIXDES’03). – Lodz, 2003 – P. 542–545.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Niggemeyer D., Otterstedt J., Redeker M. Detection of Non-classical Memory Faults using Degrees of Freedom in March Testing // Rec. 11th Workshop «Testmethods and Reliability of Circuits and Systems». – Potsdam, 1999.</mixed-citation><mixed-citation xml:lang="en">Niggemeyer D., Otterstedt J., Redeker M. Detection of Non-classical Memory Faults using Degrees of Freedom in March Testing // Rec. 11th Workshop «Testmethods and Reliability of Circuits and Systems». – Potsdam, 1999.</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>
