Enhanced chip-kill schemes by using ECC syndrome pattern
Memory systems may include a memory storage, and a controller suitable for receiving a plurality of codewords, determining whether each codeword is decodable, estimating a location of an error in a codeword determined to be undecodable by calculating a syndrome of the undecodable codeword when at least two codewords of the plurality of codewords are determined to be undecodable, performing error recovery on the undecodable codewords, and hard decoding the plurality of codewords including the error recovered codewords.
1. A memory system, comprising:
a memory device;
a processor; and
a non-transitory computer readable storage medium coupled to the processor, embedding computer program products executed by the processor, including computer instructions configured to:
control the memory device including
a memory storage; and
a controller coupled with the memory storage and configured to:
receive a plurality of codewords;
determine whether each of the plurality of codewords is decodable;
when at least two codewords of the plurality of codewords are determined to be undecodable, calculate syndromes of the at least two undecodable codewords, and estimate error location using the calculated syndromes of the at least two undecodable codewords, wherein the at least two undecodable codewords have sets of indices of non-zero entries in the syndromes, respectively, the error location is an intersection of the sets of indices of non-zero entries in the syndromes, and the intersection denotes a subset of syndromes of the at least two undecodable codewords;
perform error recovery on the at least two undecodable codewords using at least the error location, wherein the error recovery recovers more than one undecodable codewords by using only one set of indices of non-zero entries in the syndromes without extra read from the memory storage, and the only one set of indices of non-zero entries in the syndromes is the intersection or the subset of syndromes; and
hard decode the plurality of codewords including the error recovered codewords.
2. The memory system of claim 1 , wherein the error recovery is performed as a check-sum error recovery.
3. The memory system of claim 1 , wherein the controller is further suitable for repeating the estimating, performing, and hard decoding when the hard decoding of the plurality of codewords fails.
4. The memory system of claim 3 , wherein the controller is further suitable for declaring an error recovery failure when a number of times hard decoding is performed reaches a maximum number of iterations.
5. A method of operating a memory system including a memory device and a processor, comprising:
receiving, with a controller, a plurality of codewords;
determining, with the controller, whether each of the plurality of codewords is decodable;
when at least two codewords of the plurality of codewords are determined to be undecodable, with the controller, calculating syndromes of the at least two undecodable codewords, and estimating error location using the calculated syndromes of the at least two undecodable codewords, wherein the at least two undecodable codewords have sets of indices of non-zero entries in the syndromes, respectively, the error location is an intersection of the sets of indices of non-zero entries in the syndromes, and the intersection denotes a subset of syndromes of the at least two undecodable codewords;
performing, with the controller, error recovery on the at least two undecodable codewords using at least the error location, wherein the error recovery recovers more than one undecodable codewords by using only one set of indices of non-zero entries in the syndromes without extra read from the memory storage, and the only one set of indices of non-zero entries in the syndromes is the intersection or the subset of syndromes; and
hard decoding the plurality of codewords including the error recovered codewords.
6. The method of claim 5 , wherein the error recovery is performed as a check-sum error recovery.
7. The method of claim 5 , further comprising repeating the estimating, performing, and hard decoding when the hard decoding of the plurality of codewords fails.
8. The method of claim 7 , further comprising declaring an error recovery failure when a number of times hard decoding is performed reaches a maximum number of iterations.
9. A memory device, comprising:
a memory storage; and
a controller coupled with the memory storage and configured to:
receive a plurality of codewords;
determine whether each of the plurality of codewords is decodable;
when at least two codewords of the plurality of codewords are determined to be undecodable, calculate syndromes of the at least two undecodable codewords, and estimate error location using the calculated syndromes of the at least two undecodable codewords, wherein the at least two undecodable codewords have sets of indices of non-zero entries in the syndromes, respectively, the error location is an intersection of the sets of indices of non-zero entries in the syndromes, and the intersection denotes a subset of syndromes of the at least two undecodable codewords;
perform error recovery on the at least two undecodable codewords using at least the error location, wherein the error recovery recovers more than one undecodable codewords by using only one set of indices of non-zero entries in the syndromes without extra read from the memory storage, and the only one set of indices of non-zero entries in the syndromes is the intersection or the subset of syndromes; and
hard decode the plurality of codewords including the error recovered codewords.
10. The memory device of claim 9 , wherein the error recovery is performed as a check-sum error recovery.
11. The memory device of claim 9 , wherein the controller is further configured to repeat the estimating, performing, and hard decoding when the hard decoding of the plurality of codewords fails.
12. The memory device of claim 11 , wherein the controller is further configured to declare an error recovery failure when a number of times hard decoding is performed reaches a maximum number of iterations.