IP Library Granted Patent US 10,725,860
Granted Patent B2
US 10,725,860 · App. 15/968,468 · Granted Jul 28, 2020

Storage system and method for handling a burst of errors

Inventors: David Avraham (San Jose, CA); Ran Zamir (Ramat Gan, IL); Eran Sharon (Rishon Lezion, IL)
Assignee: SanDisk Technologies LLC
G06F11/1068G06F11/1012G06F16/9024G11C29/52H03M13/1102H03M13/1108H03M13/1111H03M13/17H03M13/27H03M13/2909H03M13/618
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,725,860
App. No.
15/968,468
Granted
Jul 28, 2020
Kind
B2
Abstract

A storage system and method for handling a burst of errors is provided. In one embodiment, the method comprises generating a protograph using an error code generation method; generating a first partially-lifted protograph based on the generated protograph that avoids a first burst of errors; generating a fully-lifted protograph based on the generated protograph and the generated first partially-lifted protograph; and providing the fully-lifted protograph to a storage system comprising a memory.

Claims (31)

1. A method for handling a burst of errors, the method comprising:

generating a protograph using an error code generation method;

generating a first partially-lifted protograph based on the generated protograph that avoids a first burst of errors;

generating a fully-lifted protograph based on the generated protograph and the generated first partially-lifted protograph; and

providing the fully-lifted protograph to a storage system comprising a memory.

2. The method of claim 1 , wherein the burst of errors is caused by a grown bad column.

3. The method of claim 1 , wherein the first partially-lifted protograph comprises a number K of edges, wherein K is an integer greater than or equal to two, and wherein every K number of bits in a codeword contains an error.

4. The method of claim 1 further comprising generating at least one other partially-lifted protograph that avoids a respective at least one other burst of errors.

5. The method of claim 4 , wherein the first partially-lifted protograph comprises a number K of edges, wherein K is an integer greater than or equal to two, wherein every K number of bits in a codeword contains an error, and wherein one of the at least one other partially-lifted protograph comprises a number N of edges, wherein N is an integer greater than or equal to two, wherein every N number of bits in the codeword contains an error.

6. The method of claim 1 , wherein the memory comprises a three-dimensional memory.

7. The method of claim 1 , wherein the storage system is embedded in a host.

8. The method of claim 1 , wherein the storage system is removably connectable to a host.

9. A system comprising:

a memory; and

a controller configured to:

generate a protograph; and

generate a partially-lifted protograph by lifting the generated protograph by a number K of levels, wherein K is an integer greater than or equal to two, and wherein every K number of bits in a codeword contains an error.

10. The system of claim 9 , wherein the controller is further configured to generate additional partially-lifted protographs until a fully-lifted protograph is created.

11. The system of claim 10 , wherein the controller is further configured to provide the fully-lifted protograph to a storage system.

12. The system of claim 11 , wherein the storage system is embedded in a host.

13. The system of claim 11 , wherein the storage system comprises a three-dimensional memory.

14. The system of claim 9 , wherein the error is caused by a grown bad column.

15. A system comprising:

means for generating a bipartite graph using an error code generation method;

means for generating a first partially-lifted bipartite graph based on the generated bipartite graph that avoids a first error; and

means for generating a fully-lifted bipartite graph based on the generated bipartite graph and the generated first partially-lifted bipartite graph.

16. The system of claim 15 , wherein the error is caused by a grown bad column.

17. The system of claim 15 , wherein the first partially-lifted bipartite graph comprises a number K of edges, wherein K is an integer greater than or equal to two, and wherein every K number of bits in a codeword contains an error.

18. The system of claim 15 further comprising means for generating at least one other partially-lifted bipartite graph that avoids a respective at least one other error.

19. The system of claim 15 further comprising means for providing the fully-lifted bipartite graph to a storage system.

20. The system of claim 19 , wherein the storage system comprises a three-dimensional memory.

Assignments (4)
SECURITY AGREEMENT Recorded Apr 25, 2025
From: SANDISK TECHNOLOGIES, INC.
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 071050/0001 →
PARTIAL RELEASE OF SECURITY INTERESTS Recorded Apr 25, 2025
From: JPMORGAN CHASE BANK, N.A., AS AGENT
To: SANDISK TECHNOLOGIES, INC.
Reel/Frame 071382/0001 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 31, 2024
From: SANDISK TECHNOLOGIES LLC
To: SANDISK TECHNOLOGIES, INC.
Reel/Frame 069796/0423 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 1, 2018
From: AVRAHAM, DAVID; ZAMIR, RAN; SHARON, ERAN
To: SANDISK TECHNOLOGIES LLC
Reel/Frame 045686/0348 →
Continuity (3)
Continuation In Part 15252753 · Aug 31, 2016
Provisional Application 62303899 · Mar 4, 2016
Related Publication 20180246783A1 · Aug 30, 2018
Cited By (4)
US 12,373,283 US 12,512,177 US 12,602,283 US 12,609,716