<?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-722</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>27</day><month>12</month><year>2018</year></pub-date><volume>0</volume><issue>4(12)</issue><fpage>88</fpage><lpage>96</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/722">https://inf.grid.by/jour/article/view/722</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">Price, B. Semiconductor Memories. A Handbook of Design, Manufacturing, and Application / B. Price. – Chichester, UK: John Wiley &amp; Sons, 1996.</mixed-citation><mixed-citation xml:lang="en">Price, B. Semiconductor Memories. A Handbook of Design, Manufacturing, and Application / B. Price. – Chichester, UK: John Wiley &amp; Sons, 1996.</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Chakraborty, K. Fault-Tolerance and Reliability Techniques for High-Density Random-Access Memory / K. Chakraborty, P. Mazumder. – USA: Prentice Hall, 2002.</mixed-citation><mixed-citation xml:lang="en">Chakraborty, K. Fault-Tolerance and Reliability Techniques for High-Density Random-Access Memory / K. Chakraborty, P. Mazumder. – USA: Prentice Hall, 2002.</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Неразрушающее тестирование запоминающих устройств / В.Н. Ярмолик [и др.]. – Минск: Бестпринт, 2005. – 230 с.</mixed-citation><mixed-citation xml:lang="en">Неразрушающее тестирование запоминающих устройств / В.Н. Ярмолик [и др.]. – Минск: Бестпринт, 2005. – 230 с.</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Goor, A.J. van de. Testing Semiconductor Memories, Theory and Practice / A. J. van de Goor. – 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 / A. J. van de Goor. – Chichester, UK: John Wiley &amp; Sons, 1991.</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">Cockburn, B. Tutorial on Semiconductor Memory Testing / B. Cockburn // JETTA. – Vol. 5, № 4. – 1994. – P. 321–336.</mixed-citation><mixed-citation xml:lang="en">Cockburn, B. Tutorial on Semiconductor Memory Testing / B. Cockburn // JETTA. – Vol. 5, № 4. – 1994. – P. 321–336.</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Ярмолик, C.В. Обнаружение кодочувствительных неисправностей запоминающих</mixed-citation><mixed-citation xml:lang="en">Ярмолик, C.В. Обнаружение кодочувствительных неисправностей запоминающих</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">устройств с многократным использованием маршевых тестов / С.В. Ярмолик, В.Н. Ярмолик // Информатика. – 2006. – № 1. – С. 104–129.</mixed-citation><mixed-citation xml:lang="en">устройств с многократным использованием маршевых тестов / С.В. Ярмолик, В.Н. Ярмолик // Информатика. – 2006. – № 1. – С. 104–129.</mixed-citation></citation-alternatives></ref><ref id="cit8"><label>8</label><citation-alternatives><mixed-citation xml:lang="ru">Nicolaidis, M. Theory of Transparent BIST for RAMs / M. Nicolaidis // IEEE Transaction of Computers. – Vol. 45, № 10. – 1996.</mixed-citation><mixed-citation xml:lang="en">Nicolaidis, M. Theory of Transparent BIST for RAMs / M. Nicolaidis // IEEE Transaction of Computers. – Vol. 45, № 10. – 1996.</mixed-citation></citation-alternatives></ref><ref id="cit9"><label>9</label><citation-alternatives><mixed-citation xml:lang="ru">Karpovsky, M.G. Transparent Memory Testing for Pattern Sensitive Faults / M.G. Karpovsky, V.N. Yarmolik // IEEE International Test Conference. – US, 1994. – P. 860–869.</mixed-citation><mixed-citation xml:lang="en">Karpovsky, M.G. Transparent Memory Testing for Pattern Sensitive Faults / M.G. Karpovsky, V.N. Yarmolik // IEEE International Test Conference. – US, 1994. – P. 860–869.</mixed-citation></citation-alternatives></ref><ref id="cit10"><label>10</label><citation-alternatives><mixed-citation xml:lang="ru">Занкович, А.П. Неразрушающее тестирование ОЗУ на основе анализа симметрии выходных данных / А.П. Занкович, В.Н. Ярмолик // Автоматика и телемеханика. – 2003. – № 9. – С. 141–154.</mixed-citation><mixed-citation xml:lang="en">Занкович, А.П. Неразрушающее тестирование ОЗУ на основе анализа симметрии выходных данных / А.П. Занкович, В.Н. Ярмолик // Автоматика и телемеханика. – 2003. – № 9. – С. 141–154.</mixed-citation></citation-alternatives></ref><ref id="cit11"><label>11</label><citation-alternatives><mixed-citation xml:lang="ru">Yarmolik, V.N. Counter sequences for memory test address generation / V.N. Yarmolik, B. Sokol, S.V. Yarmolik // Mixed Design of Integrated Circuits and Systems: proc. 12th International Conference MIXDES 2005. − Krakow, Poland, 2005. − P. 413–418.</mixed-citation><mixed-citation xml:lang="en">Yarmolik, V.N. Counter sequences for memory test address generation / V.N. Yarmolik, B. Sokol, S.V. Yarmolik // Mixed Design of Integrated Circuits and Systems: proc. 12th International Conference MIXDES 2005. − Krakow, Poland, 2005. − P. 413–418.</mixed-citation></citation-alternatives></ref><ref id="cit12"><label>12</label><citation-alternatives><mixed-citation xml:lang="ru">Yarmolik, V.N. Detection of Pattern Sensitive Faults by Multiple Transparent March Tests / V.N. Yarmolik, I. Mrozek // Mixed Design of Integrated Circuits and Systems: proc. 10th International Conference MIXDES 2003. − Lodz, Poland, 2003. − P. 542–545.</mixed-citation><mixed-citation xml:lang="en">Yarmolik, V.N. Detection of Pattern Sensitive Faults by Multiple Transparent March Tests / V.N. Yarmolik, I. Mrozek // Mixed Design of Integrated Circuits and Systems: proc. 10th International Conference MIXDES 2003. − Lodz, Poland, 2003. − P. 542–545.</mixed-citation></citation-alternatives></ref><ref id="cit13"><label>13</label><citation-alternatives><mixed-citation xml:lang="ru">Savage, C. A survey of combinatorial Gray codes / C. Savage // SIAM Rev. − № 39. − 1997. − P. 605–629.</mixed-citation><mixed-citation xml:lang="en">Savage, C. A survey of combinatorial Gray codes / C. Savage // SIAM Rev. − № 39. − 1997. − P. 605–629.</mixed-citation></citation-alternatives></ref><ref id="cit14"><label>14</label><citation-alternatives><mixed-citation xml:lang="ru">Gilbert, E.N. Gray codes and paths on the n-cube / E.N. Gilbert // Bell System Tech. − № 37. − 1958. − P. 815–826.</mixed-citation><mixed-citation xml:lang="en">Gilbert, E.N. Gray codes and paths on the n-cube / E.N. Gilbert // Bell System Tech. − № 37. − 1958. − P. 815–826.</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>
