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

Patent metadata

Field	Value
Publication number	US-12437812-B2
Application number	US-202318523202-A
Country	US
Kind code	B2
Filing date	Nov 29, 2023
Priority date	Nov 29, 2023
Publication date	Oct 7, 2025
Grant date	Oct 7, 2025

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.

First claim

What is claimed is:

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.

Assignees

• Western Digital Tech Inc

Inventors

• Zamir Ran
• Avraham David
• Bazarsky Alexander

Classifications

• G16B50/30

  Data warehousing; Computing architectures · CPC title

• H03M13/37 Primary

  Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35 · CPC title

• G11C13/02 Primary

  using elements whose operation depends upon chemical change {(G11C13/0009 takes precedence)} · CPC title