IP Library Granted Patent US 12,632,378
Granted Patent B2
US 12,632,378 · App. 18/800,681 · Granted May 19, 2026

Data storage device and method for combining prediction models for read threshold calibration

Inventors: Eran Sharon (Rishon Lezion, IL); Ariel Navon (Revava, IL); David Avraham (San Jose, CA); Alexander Bazarsky (Holon, IL)
Assignee: Sandisk Technologies, Inc.
G06F12/0246
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,632,378
App. No.
18/800,681
Granted
May 19, 2026
Kind
B2
Abstract

A data storage device generates a recommended read threshold value by combining outputs of a binary tree model and a linear regression model. This provide a best-of-both-worlds result, as a binary tree model can describe complex output functions but can be limited to a finite set of output values, whereas the linear regression model has continuous value outputs. Other embodiments are provided.

Claims (55)

1 . A data storage device comprising:

a memory; and

means for:

(a) training a binary tree model by:

inputting previously-generated read threshold values, but not other input features of the memory, into a linear regression model, which outputs a predicted correction to a default read threshold value; and

inputting the predicted correction to the default read threshold value into the binary tree model to train the binary tree model;

(b) after the binary tree model has been trained, obtaining a recommended read threshold value to read the memory by:

inputting the plurality of previously-generated read threshold values, but not the other input features of the memory, into the linear regression model wherein the linear regression model is a linear model that outputs continuous output values;

inputting the plurality of previously-generated read threshold values, as well as the other input features of the memory, into the binary tree model, wherein the binary tree model is a non-linear model implemented in hardware and outputs a finite set of output values; and

combining the continuous output values of the linear regression model and the finite set of output values of the binary tree model to generate a recommended read threshold; and

(c) using the recommended read threshold value to read the memory;

wherein to train the binary tree model, the predicted correction to the default read threshold value is provided as an input to the binary tree model, and wherein after the binary tree model has been trained, the predicted correction to the default read threshold value is combined with an output of the binary tree model.

2 . A data storage device comprising:

a memory; and

one or more processors, individually or in combination, configured to:

(a) train a binary tree model by:

inputting previously-generated read threshold values, but not other input features of the memory, into a linear regression model, which outputs a predicted correction to a default read threshold value; and

inputting the predicted correction to the default read threshold value into the binary tree model to train the binary tree model;

(b) after the binary tree model has been trained, obtain a recommended read threshold value to read the memory by:

inputting the plurality of previously-generated read threshold values, but not the other input features of the memory, into the linear regression model, wherein the linear regression model is a linear model that outputs continuous output values;

inputting the plurality of previously-generated read threshold values, as well as the other input features of the memory, into the binary tree model, wherein the binary tree model is a non-linear model implemented in hardware and outputs a finite set of output values; and

combining the continuous output values of the linear regression model and the finite set of output values of the binary tree model to generate a recommended read threshold; and

(c) use the recommended read threshold value to read the memory;

wherein to train the binary tree model, the predicted correction to the default read threshold value is provided as an input to the binary tree model, and wherein after the binary tree model has been trained, the predicted correction to the default read threshold value is combined with an output of the binary tree model.

3 . The data storage device of claim 2 , wherein the binary tree model comprises a random forest with symmetric trees model.

4 . The data storage device of claim 2 , wherein the linear regression model comprises a weighted sum of the other input features of the memory calculated over each of the previously-generated read threshold values.

5 . The data storage device of claim 2 , wherein the other input features of the memory comprise a program temperature.

6 . The data storage device of claim 2 , wherein the other input features of the memory comprise a read temperature.

7 . The data storage device of claim 2 , wherein the other input features of the memory comprise a difference between a program temperature of a representative wordline and a current program temperature.

8 . The data storage device of claim 2 , wherein the other input features of the memory comprise a cycling level of the memory.

9 . The data storage device of claim 2 , wherein the other input features of the memory comprise a data-retention level.

10 . The data storage device of claim 2 , wherein the other input features of the memory comprise a time tag.

11 . The data storage device of claim 2 , wherein the one or more processors are configured purely in hardware.

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

13 . The data storage device of claim 2 , wherein the other input features of the memory comprise a read audit input read threshold value.

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

(a) training a binary tree model by:

inputting previously-generated read threshold values, but not other input features of the memory, into a linear regression model, which outputs a predicted correction to a default read threshold value;

inputting the predicted correction to the default read threshold value into the binary tree model to train the binary tree model;

(b) after the binary tree model has been trained, obtaining a recommended read threshold value to read the memory by:

inputting the plurality of previously-generated read threshold values, but not the other input features of the memory, into the linear regression model, wherein the linear regression model is a linear model that outputs continuous output values;

inputting the plurality of previously-generated read threshold values, as well as the other input features of the memory, into the binary tree model, wherein the binary tree model is a non-linear model implemented in hardware and outputs a finite set of output values; and

combining the continuous output values of the linear regression model and the finite set of output values of the binary tree model to generate a recommended read threshold; and

(c) reading the memory using the recommend read threshold values;

wherein to train the binary tree model, the predicted correction to the default read threshold value is provided as an input to the binary tree model, and wherein after the binary tree model has been trained, the predicted correction to the default read threshold value is combined with an output of the binary tree model.

15 . The method of claim 14 , wherein the linear regression model comprises a weighted sum of the other input features of the memory calculated over each of the previously-generated read threshold values.

16 . The method of claim 14 , wherein the binary tree model comprises a random forest with symmetric trees model.

17 . The method of claim 14 , wherein the other input features of the memory comprise a physical address.

18 . The method of claim 14 , wherein the method is performed in a dedicated hardware module in the data storage device.

19 . The method of claim 14 , wherein the other input features of the memory comprise a program temperature.

20 . The method of claim 14 , wherein the other input features of the memory comprise a read temperature.

21 . The method of claim 14 , wherein the other input features of the memory comprise a difference between a program temperature of a representative wordline and a current program temperature.

22 . The method of claim 14 , wherein the other input features of the memory comprise a cycling level of the memory.

23 . The method of claim 14 , wherein the other input features of the memory comprise a data-retention level.

24 . The method of claim 14 , wherein the other input features of the memory comprise a time tag or a read audit input read threshold value.

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 →
SECURITY AGREEMENT (SUPPLEMENTAL) Recorded Nov 14, 2024
From: SANDISK TECHNOLOGIES, INC.
To: JPMORGAN CHASE BANK, N.A., AS COLLATERAL AGENT
Reel/Frame 069411/0486 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 12, 2024
From: SHARON, ERAN; NAVON, ARIEL; AVRAHAM, DAVID; BAZARSKY, ALEXANDER
To: SANDISK TECHNOLOGIES, INC.
Reel/Frame 068252/0026 →
Continuity (1)
Related Publication 20260044444A1 · Feb 12, 2026
References Cited (104)
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 10861562B1 · Xiong · 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 11721409B2 · Rayaprolu et al. · 2023 [cited by applicant]
US 11875831B2 · Pletka et al. · 2024 [cited by applicant]
US 11960989B2 · Zhang · 2024 [cited by applicant]
US 12437814B2 · Avraham · 2025 [cited by applicant]
US 12451187B2 · Avraham · 2025 [cited by applicant]
US 12493427B1 · Avraham · 2025 [cited by examiner]
US 20030142727A1 · Monogioudis · 2003 [cited by applicant]
US 20100162084A1 · Coulson · 2010 [cited by applicant]
US 20120063227A1 · Weingarten et al. · 2012 [cited by applicant]
US 20120163074A1 · Franca-Neto · 2012 [cited by applicant]
US 20130015519A1 · Fujii · 2013 [cited by applicant]
US 20130130652A1 · Wood · 2013 [cited by applicant]
US 20140056066A1 · Baum et al. · 2014 [cited by applicant]
US 20140136927A1 · Li · 2014 [cited by applicant]
US 20140173172A1 · Yang et al. · 2014 [cited by applicant]
US 20140355340A1 · Sharon et al. · 2014 [cited by applicant]
US 20150082121A1 · Wu · 2015 [cited by applicant]
US 20150193303A1 · Katagiri · 2015 [cited by applicant]
US 20150262694A1 · Seo et al. · 2015 [cited by applicant]
US 20150301888A1 · Yang · 2015 [cited by applicant]
US 20170139590A1 · Hsu et al. · 2017 [cited by applicant]
US 20170162268A1 · Chen · 2017 [cited by examiner]
US 20180260007A1 · Ping · 2018 [cited by applicant]
US 20180293029A1 · Achtenberg · 2018 [cited by applicant]
US 20180293174A1 · Song · 2018 [cited by applicant]
US 20190127798A1 · Hagstrom · 2019 [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 20200105353A1 · Sharon et al. · 2020 [cited by applicant]
US 20200159464A1 · Park · 2020 [cited by applicant]
US 20200183783A1 · Xie et al. · 2020 [cited by applicant]
US 20200192791A1 · Yang · 2020 [cited by applicant]
US 20200364108A1 · Froelich et al. · 2020 [cited by applicant]
US 20200364118A1 · Sun · 2020 [cited by applicant]
US 20210050067A1 · Oh et al. · 2021 [cited by applicant]
US 20210241845A1 · Li · 2021 [cited by examiner]
US 20210326058A1 · Lee · 2021 [cited by applicant]
US 20210334035A1 · Sheperek et al. · 2021 [cited by applicant]
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 20220188366A1 · Song · 2022 [cited by applicant]
US 20220215052A1 · Chalana · 2022 [cited by applicant]
US 20220254419A1 · Kim et al. · 2022 [cited by applicant]
US 20220391308A1 · Brown · 2022 [cited by applicant]
US 20230027191A1 · Zhang · 2023 [cited by applicant]
US 20230035983A1 · Wang · 2023 [cited by applicant]
US 20230061920A1 · Bhardwaj · 2023 [cited by applicant]
US 20230176765A1 · Wang · 2023 [cited by examiner]
US 20230402112A1 · Sharon · 2023 [cited by applicant]
US 20230420059A1 · Avraham et al. · 2023 [cited by applicant]
US 20240086101A1 · Wang · 2024 [cited by applicant]
US 20240265327A1 · Pasha · 2024 [cited by applicant]
US 20240330717A1 · Lien · 2024 [cited by examiner]
US 20250118376A1 · Shenoy · 2025 [cited by applicant]
US 20250165148A1 · Shukla · 2025 [cited by applicant]
CN 119537274A · 2025 [cited by applicant]
JP 2021047963A · 2021 [cited by applicant]
JP 2021149995A · 2021 [cited by applicant]
JP 2020045317A · 2022 [cited by applicant]
JP 2024102806A · 2024 [cited by applicant]
JP 2025069735A · 2025 [cited by applicant]
WO WO2023196317A1 · 2023 [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/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/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/777,942, filed Jul. 19, 2024, entitled “Data Storage DeVice and Method for Using Multiple Models for Predicting a Read Threshold.” [cited by applicant]
U.S. Appl. No. 18/664,514, filed May 15, 2024, entitled “Data Storage DeVice and Method for Generatin 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 Usin Modular Models for lnferrin a Read Threshold.” [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]
Non-final Office Action dated Oct. 8, 2025 for U.S. Appl. No. 18/664,514. [cited by applicant]
Aytekin, C.; “Neural Networks are Decision Trees”; AAC Technologies; Oct. 15, 2022; 8 pages. [cited by applicant]
Non-final Office Action dated Nov. 18, 2025 for U.S. Appl. No. 18/658,074. [cited by applicant]
Non-final Office Action mailed Feb. 10, 2026 in U.S. Appl. No. 18/664,514. [cited by applicant]
International Search Report mailed Feb. 10, 2026 in International Application No. PCT/US2025/044975. [cited by applicant]
Written Opinion mailed Feb. 10, 2026 in International Application No. PCT/US2025/044975. [cited by applicant]