Improved Hard-Decision Iterative Decoding Method for 2D SEC-DED Codes.

Saved in:

Bibliographic Details
Title:	Improved Hard-Decision Iterative Decoding Method for 2D SEC-DED Codes.
Authors:	Xunhuan Ren¹ rxh1549417024@gmail.com, Jun Ma¹ majun1313@hotmail.com, Tsviatkou, Viktar Yurevich² vtsvet@bsuir.by, Kanapelka, Valery Kanstantinavich² volos@bsuir.by
Source:	Engineering Letters. Mar2023, Vol. 31 Issue 1, p364-372. 9p.
Subjects:	Iterative decoding, Product coding, Computational complexity
Abstract:	Two-dimensional single-error correcting and double-error detecting (2D SEC-DED) codes are types of product codes. Product codes are well known to have very promising correction potential and the ability to deal with burst errors, i.e., multiple errors that consecutively appear, and they can also correct some error patterns in which the number of errors is above half the minimum distance. Product codes can be decoded with a hard-decision iterative method, which is easy to implement and has low computational complexity. However, the error correcting capability of the existing hard-decision iterative decoding methods for 2D SEC-DED is much less than half the minimum distance of the code. In this paper, we propose an improved hard-decision iterative decoding method for 2D SEC-DED codes to overcome this defect. Experiments prove that this decoding method outperforms other decoding methods in terms of its correction capability; it can correct nearly all errors up to half the minimum distance of the 2D SEC-DED code and can correct more error patterns in which the number of errors is beyond half the minimum distance of the code. [ABSTRACT FROM AUTHOR]
	Copyright of Engineering Letters is the property of International Association of Engineers (IAENG) and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	Two-dimensional single-error correcting and double-error detecting (2D SEC-DED) codes are types of product codes. Product codes are well known to have very promising correction potential and the ability to deal with burst errors, i.e., multiple errors that consecutively appear, and they can also correct some error patterns in which the number of errors is above half the minimum distance. Product codes can be decoded with a hard-decision iterative method, which is easy to implement and has low computational complexity. However, the error correcting capability of the existing hard-decision iterative decoding methods for 2D SEC-DED is much less than half the minimum distance of the code. In this paper, we propose an improved hard-decision iterative decoding method for 2D SEC-DED codes to overcome this defect. Experiments prove that this decoding method outperforms other decoding methods in terms of its correction capability; it can correct nearly all errors up to half the minimum distance of the 2D SEC-DED code and can correct more error patterns in which the number of errors is beyond half the minimum distance of the code. [ABSTRACT FROM AUTHOR]
ISSN:	1816093X