IP Library Granted Patent US 12,437,812
Granted Patent B2
US 12,437,812 · App. 18/523,202 · Granted Oct 7, 2025

Generating and using a state transition matrix for decoding data in a DNA-based storage system

Inventors: Ran Zamir (Ramat Gan, IL); David Avraham (Even Yehuda, IL); Alexander Bazarsky (Holon, IL)
Assignee: WESTERN DIGITAL TECHNOLOGIES, INC.
G11C13/02G16B50/30H03M13/37
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,437,812
App. No.
18/523,202
Granted
Oct 7, 2025
Kind
B2
Abstract

A state transition matrix for a data storage system indicates a reliability of data that was read or decoded from a data storage channel. The state transition matrix includes a probability of reading each state of a nucleotide base in an identified storage material when that nucleotide base was initially programmed in a particular state. The state transition matrix is generated by identifying a storage material with the most copies in the data storage system. During a sequencing process, the identified storage material is decoded, corrected and compared against the storage material that was originally synthesized. This information is used to determine the probability values for the state transition matrix. The state transition matrix is provided to an error correction system of the data storage system, which uses the probability information when determining whether decoded data of other storage materials should be corrected.

Claims (39)

1. A data storage system, comprising:

a control system operable to:

identify a storage material having a greatest number of copies when compared with other storage materials in the data storage system;

decode at least one copy of the storage material having the greatest number of copies; and

generate a state transition matrix based, at least in part, on the decoded at least one copy of the storage material having the greatest number of copies.

2. The data storage system of claim 1 , further comprising an error correction system, wherein the error correction system is operable to utilize the state transition matrix when decoding the other storage materials in the data storage system.

3. The data storage system of claim 1 , wherein the control system is further operable to:

identify a storage material having a second greatest number of copies when compared with the other storage materials in the data storage system;

decode at least one copy of the storage material having the second greatest number of copies; and

update the state transition matrix based, at least in part, on the decoded at least one copy of the storage material having the second greatest number of copies.

4. The data storage system of claim 3 , further comprising an error correction system, wherein the error correction system is operable to utilize the updated state transition matrix when decoding the other storage materials in the data storage system.

5. The data storage system of claim 1 , wherein the state transition matrix includes a probability that a first symbol of the storage material, which was programmed in a first state, will be read in the first state, a second state, a third state, and a fourth state.

6. The data storage system of claim 5 , wherein the state transition matrix further includes a probability that a second symbol of the storage material, which was programmed in a second state, will be read in the first state, the second state, the third state, and the fourth state.

7. The data storage system of claim 1 , wherein the control system is further operable to identify a storage material having a greatest number of copies during a sequencing process.

8. The data storage system of claim 1 , wherein the control system is further operable to identify a storage material having a greatest number of copies during a synthesis process.

9. A method, comprising:

identifying a storage material having a greatest number of copies in a data storage system;

decoding at least one copy of the storage material having the greatest number of copies; and

generating a state transition matrix based, at least in part, on the decoded at least one copy of the storage material having the greatest number of copies.

10. The method of claim 9 , further comprising utilizing the state transition matrix when decoding other storage materials in the data storage system.

11. The method of claim 9 , further comprising:

identifying a storage material having a second greatest number of copies in the data storage system;

decoding at least one copy of the storage material having the second greatest number of copies; and

updating the state transition matrix based, at least in part, on the decoded at least one copy of the storage material having the second greatest number of copies.

12. The method of claim 11 , further comprising utilizing the updated state transition matrix when decoding other storage materials in the data storage system.

13. The method of claim 9 , wherein the state transition matrix includes a probability that a first storage material symbol, which was programmed in a first state, will be read in the first state, a second state, a third state, and a fourth state.

14. The method of claim 13 , wherein the state transition matrix further includes a probability that a second storage material symbol, which was programmed in a second state, will be read in the first state, the second state, the third state, and the fourth state.

15. The method of claim 9 , further comprising identifying a storage material having a greatest number of copies during a sequencing process.

16. The method of claim 9 , further comprising identifying a storage material having a greatest number of copies during a synthesis process.

17. A data storage system, comprising:

means for identifying a storage material having a greatest number of copies;

means for decoding at least one copy of the storage material having the greatest number of copies; and

means for generating a state transition matrix based, at least in part, on the decoded at least one copy of the storage material having the greatest number of copies.

18. The data storage system of claim 17 , further comprising means for utilizing the state transition matrix when decoding other storage materials in the data storage system.

19. The data storage system of claim 17 , further comprising:

means for identifying a storage material having a second greatest number of copies;

means for decoding at least one copy of the storage material having the second greatest number of copies; and

means for updating the state transition matrix based, at least in part, on the decoded at least one copy of the storage material having the second greatest number of copies.

20. The data storage system of claim 19 , further comprising means for utilizing the updated state transition matrix when decoding other storage materials in the data storage system.

Assignments (3)
PATENT COLLATERAL AGREEMENT (DDTL) Recorded Feb 22, 2024
From: WESTERN DIGITAL TECHNOLOGIES, INC.
To: JPMORGAN CHASE BANK, N.A., AS THE AGENT
Reel/Frame 066648/0206 →
PATENT COLLATERAL AGREEMENT (AR) Recorded Feb 22, 2024
From: WESTERN DIGITAL TECHNOLOGIES, INC.
To: JPMORGAN CHASE BANK, N.A., AS THE AGENT
Reel/Frame 066648/0284 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 29, 2023
From: ZAMIR, RAN; AVRAHAM, DAVID; BAZARSKY, ALEXANDER
To: WESTERN DIGITAL TECHNOLOGIES, INC.
Reel/Frame 065704/0725 →
Continuity (1)
Related Publication 20250174272A1 · May 29, 2025
References Cited (18)
US 20030225750A1 · Farahat et al. · 2003 [cited by applicant]
US 20080102453A1 · Ghosh · 2008 [cited by examiner]
US 20080126556A1 · Perng · 2008 [cited by examiner]
US 20140336950A1 · Zhang · 2014 [cited by applicant]
US 20180113625A1 · Sancheti · 2018 [cited by examiner]
US 20180113632A1 · Sancheti · 2018 [cited by examiner]
US 20180189448A1 · Bramlett · 2018 [cited by examiner]
US 20190213301A1 · Hung · 2019 [cited by examiner]
US 20200034458A1 · Mehta · 2020 [cited by examiner]
US 20200097189A1 · Tao · 2020 [cited by examiner]
US 20200293193A1 · Littlefield · 2020 [cited by examiner]
US 20200382143A1 · Avraham et al. · 2020 [cited by applicant]
US 20200394510A1 · Peng · 2020 [cited by examiner]
US 20210238677A1 · Bartha · 2021 [cited by examiner]
US 20220027514A1 · Liu et al. · 2022 [cited by applicant]
US 20220329261A1 · Nakamura · 2022 [cited by examiner]
International Search Report and Written Opinion from International Application No. PCT/US2024/040011, mailed Nov. 13, 2024, 10 pages. [cited by applicant]
Ross, Michael G., et al. “Characterizing and measuring bias in sequence data.” Genome Biology 2013, 14:R51: 1-20. https://doi.org/10.1186/GB-2013-14-5-r51. [cited by applicant]