Coding for Memory with Stuck-at Defects

TL;DR

This paper introduces an encoding scheme for partitioned linear block codes that effectively masks memory defects, providing theoretical bounds and numerical evidence of its efficiency and tightness.

Contribution

The paper proposes a novel encoding scheme for PLBC to mask stuck-at memory defects and derives bounds on masking failure probability.

Findings

PLBC can efficiently mask memory defects with the proposed scheme

The derived upper bound on masking failure probability is very tight

Numerical results confirm the effectiveness of the encoding scheme

Abstract

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.