Efficiency of the error correction method by the parity values of binary matrix coordinates
https://doi.org/10.29235/1561-2430-2019-55-3-375-382
Abstract
The results of study of the characteristics of the proposed method [1] 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.
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.
About the Authors
A. S. Poljakov
United Institute of Informatics Problems of the National Academy of Sciences of Belarus
Belarus
Belarus
Alexander S. Poljakov – Ph. D. (Engineering), Assistant Professor, Leading Researcher
6, Surganov Str., 220012, Minsk, Republic of Belarus
I. L. Kuznetsova
United Institute of Informatics Problems of the National Academy of Sciences of Belarus
Belarus
Belarus
Irina L. Kuznetsova – Chief designer of the project
6, Surganov Str., 220012, Minsk, Republic of Belarus
References
1. 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).
2. 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).
3. 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).
4. 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).
5. 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
6. 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.
7. 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
Review
Views:
994
Email this article 