Multiple Cell Upsets Correction for OLS Codes

ABSTRACT: An Error Correction code with Parity check matrix is implemented which is other type of the One Step Majority Logic Decodable (OS-MLD) called as Orthogonal Latin Squares (OLS) codes. It is a concurrent error detection technique for OLS codes encoders and syndrome computation because of the fact that when ECCs are used, the encoder and decoder circuits can also suffer errors.These OLS codes are used to correct the memories and caches. This can be achieved due to their modularity such that the error correction capabilities can be easily adapted to the error rate or to the mode of the operation.OLS codes typically require more parity bits than other codes to correct the same number of errors. However, due to their modularity and the simple low delay decoding implementation these are widely used in Error Correction. All the errors that affect a single circuit node are detected by the parity prediction scheme. The area and latency values are monitored

Generating Burst-error Correcting Codes from Orthogonal Latin Square Codes -- a Graph Theoretic Approach

The paper proposes a scheme by which an Orthogonal Latin Square code (OLS) can be modified to correct burst-errors of specific length. The method discussed in this paper models it as a graph coloring problem where the goal is to resolve conflicts in the existing OLS code in order for it to correct burst-errors. Conflicts are resolved by reordering and/or reorganizing existing parity relations by inclusion of extra check bits. The graph coloring approach tries to minimize the number of additional check bits required. The final OLS code after reordering and/or reorganizing would be capable of correcting burst-errors of specific length in addition to its original error correction capabilities