Coding for memory with stuck-at defects

In this paper, we propose an encoding scheme for partitioned linear block codes (PLBC) which mask the stuck-at defects in memories. In addition, we derive an upper bound and the estimate of the probability that masking fails. Numerical results show that PLBC can efficiently mask the defects with the proposed encoding scheme. Also, we show that our upper bound is very tight by using numerical results.

[1]  A. Jagmohan,et al.  An area and latency assessment for coding for memories with stuck cells , 2010, 2010 IEEE Globecom Workshops.

[2]  Euiseok Hwang,et al.  Scrubbing with partial side information for radiation-tolerant memory , 2010, 2010 IEEE Globecom Workshops.

[3]  Ashish Jagmohan,et al.  Algorithms for memories with stuck cells , 2010, 2010 IEEE International Symposium on Information Theory.

[4]  Abbas El Gamal,et al.  On the capacity of computer memory with defects , 1983, IEEE Trans. Inf. Theory.

[5]  B. V. K. Vijaya Kumar,et al.  Iterative Cross-Entropy Encoding for Memory Systems with Stuck-At Errors , 2011, 2011 IEEE Global Telecommunications Conference - GLOBECOM 2011.

[6]  Kellyann Geurts,et al.  A theory of error , 2005, C&C '05.

[7]  O. Antoine,et al.  Theory of Error-correcting Codes , 2022 .

[8]  Tadao Kasami,et al.  An error correcting scheme for defective memory , 1978, IEEE Trans. Inf. Theory.

[9]  Chris Heegard.  Partitioned linear block codes for computer memory with 'stuck-at' defects , 1983, IEEE Trans. Inf. Theory.