<?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 pub-id-type="doi">10.29235/1561-2430-2019-55-3-375-382</article-id><article-id custom-type="elpub" pub-id-type="custom">vestifm-406</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>Efficiency of the error correction method by the parity values of binary matrix coordinates</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>Poljakov</surname><given-names>A. S.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Поляков Александр Сергеевич – кандидат технических наук, доцент, ведущий научный сотрудник</p><p>ул. Сурганова, 6, 220012, г. Минск, Республика Беларусь</p></bio><bio xml:lang="en"><p>Alexander S. Poljakov – Ph. D. (Engineering), Assistant Professor, Leading Researcher</p><p>6, Surganov Str., 220012, Minsk, Republic of Belarus</p></bio><email xlink:type="simple">alexpolja@tut.by</email><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>Kuznetsova</surname><given-names>I. L.</given-names></name></name-alternatives><bio xml:lang="ru"><p>Кузнецова Ирина Леонидовна – главный конструктор проекта</p><p>ул. Сурганова, 6, 220012, г. Минск, Республика Беларусь</p></bio><bio xml:lang="en"><p>Irina L. Kuznetsova – Chief designer of the project</p><p>6, Surganov Str., 220012, Minsk, Republic of Belarus</p></bio><email xlink:type="simple">kiryn@tut.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 of the National Academy of Sciences of Belarus</institution></aff></aff-alternatives><pub-date pub-type="collection"><year>2019</year></pub-date><pub-date pub-type="epub"><day>05</day><month>10</month><year>2019</year></pub-date><volume>55</volume><issue>3</issue><fpage>375</fpage><lpage>382</lpage><permissions><copyright-statement>Copyright &amp;#x00A9; Поляков А.С., Кузнецова И.Л., 2019</copyright-statement><copyright-year>2019</copyright-year><copyright-holder xml:lang="ru">Поляков А.С., Кузнецова И.Л.</copyright-holder><copyright-holder xml:lang="en">Poljakov A.S., Kuznetsova I.L.</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/406">https://vestifm.belnauka.by/jour/article/view/406</self-uri><abstract><p>Приводятся результаты исследования характеристик предложенного в [<xref ref-type="bibr" rid="cit1">1</xref>] способа коррекции ошибок, возникающих при передаче информации по линиям связи. Получены оценки эффективности поиска ошибок и производительности алгоритма, разработанного для реализации предложенного способа, использующего при поиске ошибок значения четности координат бинарной матрицы, к которым относятся строки, столбцы, главные и вспомогательные диагонали. Определена зависимость характеристик алгоритма от интенсивности (плотности) битовых ошибок в сообщении, полученном после передачи по линиям связи, и от размера матриц, на которые производится разбиение передаваемого сообщения.</p><p>Приведены затраты времени на вычисление значений четности координат матрицы и реализацию алгоритма поиска ошибок в переданной информации. Представлены рекомендации по оптимальному выбору размеров бинарных матриц.</p><p>Показано, что при интенсивности битовых ошибок 10–2 и менее алгоритм обнаруживает все имеющиеся ошибки.</p></abstract><trans-abstract xml:lang="en"><p>The results of study of the characteristics of the proposed method [<xref ref-type="bibr" rid="cit1">1</xref>] for correction of errors arising during information transmission via communication lines are presented. The estimates of the efficiency of search for errors and the performance of an algorithm developed to realize the proposed method using the parity values of binary matrix coordinates are obtained; among these errors are rows, columns, main and auxiliary diagonals, are obtained. We have determined the dependence of algorithm characteristics on the intensity (density) of bit errors in the message obtained after transmission via communication lines and on the size of matrices, into which a transmitted message is divided.</p><p>The time spent for calculating the parity values of matrix coordinates and for the algorithm used to find transmitted information errors are given. Recommendations on an optimal choice of sizes of binary matrices are presented. It is shown that, when the bit error rate is 10–2 and less, the algorithm detects all the available errors.</p></trans-abstract><kwd-group xml:lang="ru"><kwd>бинарная матрица</kwd><kwd>ошибки</kwd><kwd>координаты ошибок</kwd><kwd>интенсивность ошибок</kwd><kwd>ложные ошибки</kwd><kwd>четность координат матрицы</kwd><kwd>главные диагонали</kwd><kwd>вспомогательные диагонали</kwd></kwd-group><kwd-group xml:lang="en"><kwd>binary matrix</kwd><kwd>errors</kwd><kwd>error coordinates</kwd><kwd>intensity (density) of bit errors false errors</kwd><kwd>matrix coordinate parity</kwd><kwd>main diagonals</kwd><kwd>auxiliary diagonals</kwd></kwd-group></article-meta></front><back><ref-list><title>References</title><ref id="cit1"><label>1</label><citation-alternatives><mixed-citation xml:lang="ru">Поляков, А. С. Коррекция ошибок при передаче информации по значениям четности координат бинарной матрицы / А. С. Поляков // Вес. Нац. акад. навук Беларусі. Сер. фіз.-мат. навук. – 2017. – № 2. – С. 101–109.</mixed-citation><mixed-citation xml:lang="en">Polyakov A. S. Error correction when transmitting information by a parity check of binary matrix coordinates. Vestsі Natsyianal'nai akademіі navuk Belarusі. Seryia fіzіka-matematychnykh navuk = Proceedings of the National Academy of Sciences of Belarus. Physics and Mathematics series, 2017, no. 2, pp. 101–109 (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit2"><label>2</label><citation-alternatives><mixed-citation xml:lang="ru">Конопелько, В. К. табличные низкоплотные коды, исправляющие модуль и пакет ошибок / В. К. Конопелько // Автоматика и телемеханика. – 1992. – Вып. 4. – С. 155–163.</mixed-citation><mixed-citation xml:lang="en">Konopel'ko V. K. Tablichnye nizkoplotnye kody, ispravlyayushchie modul' i paket oshibok. Avtomatika i Telemekhanika = Automation and Remote Control, 1992, no. 4, pp. 155–163 (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit3"><label>3</label><citation-alternatives><mixed-citation xml:lang="ru">Романенко, Д. М. Мажоритарное декодирование двумерных линейных итеративных кодов с объединенными диагональными проверками / Д. М. Романенко, Д. В. Шиман // тр. БГтУ. Сер. 6, Физ.-мат. науки и информатика. – 2009. – Вып. 17. – С. 119–121.</mixed-citation><mixed-citation xml:lang="en">Romanenko D. M., Shiman D. V. Majority decoding of two-dimensional linear iterative codes with combined diagonal checks. Trudy BGTU. Seriya 3, Fiziko-matematicheskie nauki i informatika = Proceedings of BSTU. Issue 3: Physics and Mathematics. Informatics, 2009, vol. 17, pp. 119–121 (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit4"><label>4</label><citation-alternatives><mixed-citation xml:lang="ru">Шиман, Д. В. Свойства и параметры линейных итеративных кодов с двойными диагональными проверками / Д. В. Шиман, Д. М. Романенко // тр. БГтУ. Сер. 6, Физ.-мат. науки и информатика. – 2007. – Вып. 150. – С. 151–154.</mixed-citation><mixed-citation xml:lang="en">Shiman D. V., Romanenko D. M. Properties and parameters of linear iterative codes with double diagonal checks Trudy BGTU. Seriya 3, Fiziko-matematicheskie nauki i informatika = Proceedings of BSTU. Issue 3: Physics and Mathematics. Informatics, 2007, vol. 15, pp. 151–154 (in Russian).</mixed-citation></citation-alternatives></ref><ref id="cit5"><label>5</label><citation-alternatives><mixed-citation xml:lang="ru">HVD: horizontal-vertical-diagonal error de tecting and correcting code to protect against with soft errors / M. Kishani [et al.] // Design Automation for Embedded Systems. – 2011. – Vol. 15, № 3–4. – p. 289–310. https://doi.org/10.1007/s10617-011-9078-2</mixed-citation><mixed-citation xml:lang="en">Kishani M., Zarandi H. R., Pedram H., Tajary A., Raji M., Ghavami B. HVD: horizontal-vertical-diagonal error detecting and correcting code to protect against with soft errors. Design Automation for Embedded Systems, 2011, vol. 15, no. 3–4, pp. 289–310. https://doi.org/10.1007/s10617-011-9078-2</mixed-citation></citation-alternatives></ref><ref id="cit6"><label>6</label><citation-alternatives><mixed-citation xml:lang="ru">Bilal, Y. A refined four-dimensional parity based EDAC and performance analysis using FPGA / Y. Bilal, S. A. Khan, Z. A. Khan // International Conference on Open Source Systems and Technologies (ICOSST 2013). Lahore, Pakistan, 16–18 December 2013. – P. 81–86.</mixed-citation><mixed-citation xml:lang="en">Bilal Y., Khan S. A., Khan Z. A. A refined four-dimensional parity based EDAC and performance analysis using FPGA. International Conference on Open Source Systems and Technologies (ICOSST 2013). Lahore, Pakistan, 16–18 December 2013, pp. 81–86.</mixed-citation></citation-alternatives></ref><ref id="cit7"><label>7</label><citation-alternatives><mixed-citation xml:lang="ru">Error Detection and Correction over Two-Dimensional and Two-Diagonal Model and Five-Dimensional Model / D. Aflakian [et al.] // Int. J. Advanced Computer Science and Applications. – 2011. – Vol. 2, № 7. – P. 16–19. https://doi.org/10.14569/ijacsa.2011.020703</mixed-citation><mixed-citation xml:lang="en">Aflakian D., Siddiqui D. T., Khan N. A., Aflakian D. Error Detection and Correction over Two-Dimensional and Two-Diagonal Model and Five-Dimensional Model. International Journal of Advanced Computer Science and Applications, 2011, vol. 2, no. 7, pp. 16–19. https://doi.org/10.14569/ijacsa.2011.020703</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>
