Method for extending lifetime of resistive change memory and data storage system using the same

A data storage system comprising:

• a controller configured to generate data and hash candidates by shuffling bit positions of write data to be written in a resistive change memory with hash candidates, each of the data and hash candidates being a set of shuffled write data and a corresponding one of the hash candidates, calculating Hamming distances of the generated data and hash candidates from stored data and a stored hash that are pre-stored in the resistive change memory, matching stuck data at a predetermined bit in the resistive change memory with the generated data and hash candidates when there is the stuck data at the predetermined bit of the stored data, excluding mismatched data and hash candidates that are mismatched with the stuck data among the generated data and hash candidates, choosing a data and hash candidate with the shortest Hamming distance among matched data and hash candidates as an encoded data and hash, and storing the encoded data and hash in the resistive change memory,
• wherein the matched data and hash candidates are matched with the stuck data among the generated data and hash candidates, and each of the matched data and hash candidates contains data coinciding with the stuck data at the predetermined bit.

A data storage system comprising:

• a controller configured to generate data and hash candidates by shuffling bit positions of write data to be written in a resistive change memory with hash candidates when the resistive change memory receives a write request, calculating Hamming distances of the generated data and hash candidates from stored data and a stored hash that are pre-stored in the resistive change memory, choosing a data and hash candidate with the shortest Hamming distance among the generated data and hash candidates as an encoded data and hash, and storing the encoded data and hash in the resistive change memory,
• wherein each of the data and hash candidates is a set of shuffled write data and a corresponding one of the hash candidates.