IP Library › Granted Patent US 12,493,427
Granted Patent B1
US 12,493,427 · App. 18/777,942 · Granted Dec 9, 2025

Data storage device and method for using multiple models for predicting a read threshold

Inventors: David Avraham (San Jose, CA); Eran Sharon (Rishon Lezion, IL); Alexander Bazarsky (Holon, IL); Ariel Navon (Revava, IL)
Assignee: Sandisk Technologies, Inc.
G06F3/0655G06F3/0604G06F3/0679
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 12,493,427
App. No.
18/777,942
Filed
Jul 19, 2024
Granted
Dec 9, 2025
Kind
B1
Art Unit
2139
USPC
711/154
Abstract

A data storage device can generate a recommended read threshold value using a model that was trained under a plurality of conditions. However, such a model may result in an undesirable bit error rate or programming latency. If that should occur, the data storage device can use a different model trained under a condition similar to a current condition of the data storage device. In addition to avoiding an undesirable bit error rate or programming latency, this can result in improved throughput, improved quality of service, and reduced power consumption.

Claims (40)

1 . A data storage device comprising:

a memory; and

one or more processors configured to:

use a model trained under a plurality of conditions to generate a read threshold value;

track a parameter resulting from using the read threshold value to read the memory; and

in response to a value of the parameter exceeding a threshold:

use a different model that was trained under a condition similar to a current condition of the data storage device to generate a new read threshold value, wherein the different model is selected from a plurality of different models for having a similarity score that is highest among the plurality of different models, each of the plurality of different models being trained under a different condition; and

use the new read threshold value to read the memory;

wherein the one or more processors comprises (i) a plurality of processors configured individually or in combination or (ii) a single processor.

2 . The data storage device of claim 1 , wherein the parameter comprises bit error rate.

3 . The data storage device of claim 1 , wherein the parameter comprises program latency, power consumption, failed bit count, a syndrome weight value, and/or an activation of a high decoding mode.

4 . The data storage device of claim 1 , wherein the plurality of different models is stored in the memory of the data storage device.

5 . The data storage device of claim 1 , wherein the plurality of different models is stored in a host memory buffer in a host.

6 . The data storage device of claim 1 , wherein the similarity score is based on read temperature.

7 . The data storage device of claim 1 , wherein the similarity score is based on a number of program/erase cycles.

8 . The data storage device of claim 1 , wherein the similarity score is based on data retention quantization.

9 . The data storage device of claim 1 , wherein the plurality of conditions comprises at least two of: a beginning-of-life condition, a middle-of-life condition, an end-of-life condition.

10 . The data storage device of claim 1 , wherein the one or more processors are further configured to use different sizes of models for different values of the parameter and/or increasing sizes of models according to a previous indication of a high bit error rate, a high failed bit count, and/or a program-erase cycle value.

11 . The data storage device of claim 1 , wherein the one or more processors are further configured to use another one of the plurality of different models until the value of the parameter does not exceed the threshold.

12 . The data storage device of claim 1 , wherein the one or more processors are further configured to use another one of the plurality of different models after an elapsed period of time.

13 . The data storage device of claim 1 , wherein the memory comprises a three-dimensional memory.

14 . In a data storage device comprising a memory, a method comprising:

using a model trained under a plurality of conditions to generate a read threshold value;

tracking a parameter resulting from using the read threshold value to read the memory, and

in response to a value of the parameter exceeding a threshold:

using a different model that was trained under a condition similar to a current condition of the data storage device to generate a new read threshold value, wherein the different model is selected from a plurality of different models for having a similarity score that is highest among the plurality of different models, each of the plurality of different models being trained under a different condition; and

using the new read threshold value to read the memory.

15 . The method of claim 14 , wherein the different models comprise a model trained under a middle-of-life condition.

16 . The method of claim 14 , wherein the different models comprise a model trained under an end-of-life condition.

17 . The method of claim 14 , wherein the different model is selected in a predefined order.

18 . The method of claim 14 , wherein the different models comprise a model trained under a beginning-of-life condition.

19 . The method of claim 17 , wherein the memory comprises a three-dimensional memory.

20 . A data storage device comprising:

a memory; and

means for:

using a model trained under a plurality of conditions to generate a read threshold value;

tracking a parameter resulting from using the read threshold value to read the memory, and

in response to a value of the parameter exceeding a threshold:

using a different model that was trained under a condition similar to a current condition of the data storage device to generate a new read threshold value, wherein the different model is selected from a plurality of different models for having a similarity score that is highest among the plurality of different models, each of the plurality of different models being trained under a different condition; and

using the new read threshold value to read the memory.

Assignments (4)
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 →
SECURITY AGREEMENT Recorded Apr 25, 2025
From: SANDISK TECHNOLOGIES, INC.
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 071050/0001 →
PATENT COLLATERAL AGREEMENT Recorded Aug 23, 2024
From: SANDISK TECHNOLOGIES, INC.
To: JPMORGAN CHASE BANK, N.A., AS THE AGENT
Reel/Frame 068762/0494 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 19, 2024
From: AVRAHAM, DAVID; SHARON, ERAN; BAZARSKY, ALEXANDER; NAVON, ARIEL
To: SANDISK TECHNOLOGIES, INC.
Reel/Frame 068032/0166 →
References Cited (60)
US 6154157A · Wong · 2000 [cited by applicant]
US 7876671B2 · Pimlott · 2011 [cited by applicant]
US 7995387B2 · Sharon et al. · 2011 [cited by applicant]
US 8374026B2 · Sharon et al. · 2013 [cited by applicant]
US 8782495B2 · Alrod et al. · 2014 [cited by applicant]
US 9070479B2 · Sharon et al. · 2015 [cited by applicant]
US 9141475B2 · Alrod et al. · 2015 [cited by applicant]
US 9431120B1 · Tuers · 2016 [cited by applicant]
US 9697905B2 · Sharon et al. · 2017 [cited by applicant]
US 9728263B2 · Sharon · 2017 [cited by applicant]
US 9996281B2 · Sharon et al. · 2018 [cited by applicant]
US 10379739B1 · Bazarsky · 2019 [cited by examiner]
US 10418097B2 · Avraham et al. · 2019 [cited by applicant]
US 10475523B2 · Sharon et al. · 2019 [cited by applicant]
US 10811091B2 · Bazarsky et al. · 2020 [cited by applicant]
US 10991444B1 · Bazarsky et al. · 2021 [cited by applicant]
US 11081474B1 · Hoang et al. · 2021 [cited by applicant]
US 11150825B2 · Kashyap et al. · 2021 [cited by applicant]
US 11244732B2 · Sharon et al. · 2022 [cited by applicant]
US 20120063227A1 · Weingarten et al. · 2012 [cited by applicant]
US 20140056066A1 · Baum et al. · 2014 [cited by applicant]
US 20140136927A1 · Li · 2014 [cited by applicant]
US 20160170871A1 · Hyun · 2016 [cited by examiner]
US 20170139590A1 · Hsu et al. · 2017 [cited by applicant]
US 20170162268A1 · Chen et al. · 2017 [cited by applicant]
US 20180011753A1 · Alhussien · 2018 [cited by examiner]
US 20180293029A1 · Achtenberg · 2018 [cited by applicant]
US 20180293174A1 · Song · 2018 [cited by applicant]
US 20190189236A1 · Poliakov et al. · 2019 [cited by applicant]
US 20190267054A1 · Thalaimalaivanaraj · 2019 [cited by applicant]
US 20190371402A1 · Lin · 2019 [cited by applicant]
US 20200042240A1 · Therene · 2020 [cited by examiner]
US 20200192791A1 · Yang · 2020 [cited by applicant]
US 20200364108A1 · Froelich et al. · 2020 [cited by applicant]
US 20200364118A1 · Sun · 2020 [cited by applicant]
US 20210241845A1 · Li et al. · 2021 [cited by applicant]
US 20210334035A1 · Sheperek et al. · 2021 [cited by applicant]
US 20220027083A1 · Zuolo · 2022 [cited by examiner]
US 20220027721A1 · Zhang et al. · 2022 [cited by applicant]
US 20220075561A1 · Peltz et al. · 2022 [cited by applicant]
US 20220076738A1 · Bazarsky · 2022 [cited by applicant]
US 20220121387A1 · Ha et al. · 2022 [cited by applicant]
US 20220121985A1 · Lloyd et al. · 2022 [cited by applicant]
US 20220254419A1 · Kim et al. · 2022 [cited by applicant]
US 20230410869A1 · Sharon · 2023 [cited by examiner]
US 20250118376A1 · Shenoy · 2025 [cited by applicant]
CN 119537274A · 2025 [cited by applicant]
Non-final Office Action mailed Jun. 16, 2025 for U.S. Appl. No. 18/220,363. [cited by applicant]
Non-final Office Action mailed Jun. 16, 2025 for U.S. Appl. No. 18/664,514. [cited by applicant]
Non-final Office Action mailed Jun. 16, 2025 for U.S. Appl. No. 18/242,061. [cited by applicant]
U.S. Appl. No. 17/838,481, filed Jun. 13, 2022, entitled “Storage System and Method for Inference of Read Thresholds Based on Memory Parameters and Conditions.” [cited by applicant]
U.S. Appl. No. 17/899,073, filed Aug. 30, 2022, entitled “Storage System and Method for Implementation of Symmetric Tree Models for Read Threshold Calibration.” [cited by applicant]
U.S. Appl. No. 18/220,363, filed Jul. 11, 2023, entitled “Storage System and Method for Circuit-Bounded-Array-Based Time and Temperature Tag Management and Inference of Read Thresholds.” [cited by applicant]
U.S. Appl. No. 18/239,302, filed Aug. 29, 2023, entitled “Data Storage Device and Method for Inferring a Read Threshold Using a Time Tag Determination.” [cited by applicant]
U.S. Appl. No. 18/242,061, filed Sep. 5, 2023, entitled “Data Storage Device and Method for Predicting Future Read Thresholds.” [cited by applicant]
U.S. Appl. No. 18/800,681, filed Aug. 12, 2024, entitled “Data Storage Device and Method for Combining Prediction Models for Read Threshold Calibration.” [cited by applicant]
U.S. Appl. No. 18/664,514, filed May 15, 2024, entitled “Data Storage Device and Method for Generating Read Threshold Voltages.” [cited by applicant]
U.S. Appl. No. 18/658,074, filed May 8, 2024, entitled “Data Storage Device and Method for Predictive Read Threshold Calibration.” [cited by applicant]
U.S. Appl. No. 18/772,563, filed Jul. 15, 2024, entitled “Data Storage Device and Method for Using Modular Models for Inferring a Read Threshold.” [cited by applicant]
Non-final Office Action dated Oct. 8, 2025 for U.S. Appl. No. 18/664,514. [cited by applicant]
Cited By (2)
US 12,632,378 US 12,693,932