Error correction codes (ECCs) are commonly used to protect memories against errors. Among ECCs, orthogonal latin squares (OLS) codes have gained renewed interest for memory protection due to their modularity and the simplicity of the decoding algorithm that enables low delay implementations. An important issue is that when ECCs are used, the encoder and decoder circuits can also suffer errors. In this brief, a concurrent error detection technique for OLS codes encoders and syndrome computation is proposed and evaluated. The proposed method uses the properties of OLS codes to efficiently implement a parity prediction scheme that detects all errors that affect a single circuit node. © 1993-2012 IEEE.
Concurrent Error Detection for Orthogonal Latin Squares Encoders and Syndrome Computation / Reviriego, P; Pontarelli, S; Maestro, Ja. - In: IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS. - ISSN 1063-8210. - (2012). [10.1109/TVLSI.2012.2230655]
Concurrent Error Detection for Orthogonal Latin Squares Encoders and Syndrome Computation
Pontarelli S;
2012
Abstract
Error correction codes (ECCs) are commonly used to protect memories against errors. Among ECCs, orthogonal latin squares (OLS) codes have gained renewed interest for memory protection due to their modularity and the simplicity of the decoding algorithm that enables low delay implementations. An important issue is that when ECCs are used, the encoder and decoder circuits can also suffer errors. In this brief, a concurrent error detection technique for OLS codes encoders and syndrome computation is proposed and evaluated. The proposed method uses the properties of OLS codes to efficiently implement a parity prediction scheme that detects all errors that affect a single circuit node. © 1993-2012 IEEE.File | Dimensione | Formato | |
---|---|---|---|
Concurrent Error Detection for Orthogonal Latin Square.pdf
solo gestori archivio
Dimensione
316.78 kB
Formato
Adobe PDF
|
316.78 kB | Adobe PDF | Contatta l'autore |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.