The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Jun. 04, 2019

Filed:

Jul. 03, 2017
Applicants:

SK Hynix Inc., Icheon, KR;

Korea University Research and Business Foundation, Seoul, KR;

Inventors:

Seon Wook Kim, Namyangju, KR;

Miseon Han, Daegu, KR;

Hokyoon Lee, Icheon, KR;

Il Park, Icheon, KR;

Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G06F 11/10 (2006.01); G06F 3/06 (2006.01); G11C 13/00 (2006.01); G11C 29/52 (2006.01); G11C 7/10 (2006.01); G11C 11/16 (2006.01);
U.S. Cl.
CPC ...
G06F 11/1068 (2013.01); G06F 3/064 (2013.01); G06F 3/0616 (2013.01); G06F 3/0679 (2013.01); G06F 11/108 (2013.01); G06F 11/1012 (2013.01); G11C 7/1006 (2013.01); G11C 11/1675 (2013.01); G11C 13/004 (2013.01); G11C 13/0023 (2013.01); G11C 13/0035 (2013.01); G11C 13/0069 (2013.01); G11C 29/52 (2013.01); G11C 11/1673 (2013.01);
Abstract

A method for extending the lifetime of a resistive change memory includes generating data and hash candidates by shuffling bit positions of write data with the hash candidates in response to a write request for the resistive change memory, calculating Hamming distances of the generated data and hash candidates from stored data and a stored hash, matching stuck data at a predetermined bit in the resistive change memory with the generated data and hash candidates when the stuck data is at the predetermined bit, and excluding mismatched data and hash candidates that are mismatched with the stuck data among the generated data and hash candidates, finding a data and hash candidate with the shortest Hamming distance among the matched data and hash candidates, and choosing the found data and hash candidate as an encoded data and hash, and storing the encoded data and hash in the resistive change memory.


Find Patent Forward Citations

Loading…