Name
Abstract | ||
|---|---|---|
With increasing storage capacities, spare memory columns aimed at replacing defective regular columns remain generally available to repair malfunctioning storage cells. The existing repair methods are based on column replacement. Consequently, the number of single-bit hard errors induced by malfunctioning storage cells is linear with respect to the number of redundant columns. We propose restricted single-error correction (RSEC) codes to enable the correction of an exponential number of single-bit errors. The RSEC codes are characterized by programmable parity-check matrices which allow the correction of different sets of errors. Depending on the accessed memory bank or segment, these matrices can be generated out of the (built-in) test result bits which indicate the columns with defective storage cells. The resulting RSEC-based method improves the memory repair capacity with limited performance overhead. Memory protection schemes are proposed in which each redundant column is used either to store RSEC check-bits or to replace completely defective regular columns. |
Year | DOI | Venue |
|---|---|---|
2010 | 10.1109/IOLTS.2010.5560216 | On-Line Testing Symposium |
Keywords | Field | DocType |
mask permanent fault,storage capacity,accessed memory bank,redundant column,memory protection scheme,semiconductor memory,rsec check-bits,defective regular column,defective storage cell,malfunctioning storage cell,sec code,memory repair capacity,spare memory column,multiplexing,compaction,memory management,maintenance engineering,difference set,error correction,testing | Memory protection,Memory bank,Semiconductor memory,Matrix (mathematics),Computer science,Parallel computing,Error detection and correction,Memory management,Computer hardware,Multiplexing,Built-in self-test | Conference |
ISBN | Citations | PageRank |
978-1-4244-7724-1 | 1 | 0.37 |
References | Authors | |
9 | 3 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Samuel Evain | 1 | 73 | 6.98 |
| Y. Bonhomme | 2 | 186 | 12.16 |
| Valentin Gherman | 3 | 36 | 3.35 |