IP Library Patent Application 18282825
Patent Application
App. No. 18/282,825

FIXED POINT NUMBER REPRESENTATION AND COMPUTATION CIRCUITS

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 None
App. No.
18/282,825
Abstract

The present disclosure provides systems and methods for storing digital information into nucleic acid molecules in various ways. Digital information may be received as a sting of symbols, wherein each symbol in the string of symbols has a symbol value and a symbol position within the string of symbols. A first identifier nucleic acid molecule may be formed by depositing M selected component nucleic acid molecules into a compartment, the M selected component nucleic acid molecules being selected from a set of distinct component nucleic acid molecules that are separated into M different layers, and physically assembling the M selected component nucleic acid molecules. A plurality of identifier nucleic acid molecules may be formed, each corresponding to a respective symbol position. The identifier nucleic acid molecules may be formed in a pool having powder, liquid, or solid form.

Claims (52)

1 . A method for writing information into nucleic acid sequences, the method comprising:

obtaining a first fixed point number;

obtaining a library of component nucleic acid sequences defining a combinatorial space of identifier nucleic acid sequences each comprising an ordered subset of the component nucleic acid sequences;

identifying a first subset of identifier nucleic acid sequences in the combinatorial space as a first codeword having a codeword size corresponding to the number of identifier nucleic acid sequences in the first subset;

forming a first set of one or more identifier nucleic acid molecules having distinct identifier nucleic acid sequences of the first subset, wherein a ratio of the number of distinct identifier nucleic acid sequences represented in the first set to the codeword size approximates the first fixed point number.

2 . The method of claim 1 , wherein the library of component nucleic acid sequences comprises a plurality of layers, each layer comprising a subset of the component nucleic acid sequences, and wherein each identifier nucleic acid sequences comprises one component nucleic acid sequence from each layer.

3 . The method of claim 1 , wherein the first fixed point number has a value x, wherein the codeword size is w, and k identifier nucleic acid molecules are formed in the first set, such that the ratio is k/w and approximately equals x.

4 . The method of claim 3 , wherein k/w is within plus or minus 20% of x.

5 . The method of claim 1 , wherein the codeword size is at least 8.

6 . The method of claim 5 , wherein the codeword size is at least 256.

7 . The method of claim 6 , wherein the codeword size is at least 512.

8 . The method of claim 7 , wherein the codeword size is at least 1024.

9 . The method of claim 1 , the method further comprising:

obtaining a second fixed point number;

identifying a second subset of identifier nucleic acid sequences in the combinatorial space as a second codeword having the codeword size of the first codeword and corresponding to the number of identifier nucleic acid sequences in the second subset; and

forming a second set of one or more identifier nucleic acid molecules having distinct identifier nucleic acid sequences of the second subset, wherein a ratio of the number of distinct identifier nucleic acid sequences in the second set to the codeword size approximates the second fixed point number.

10 . The method of claim 9 , further comprising adding the first fixed point number and the second fixed point number by:

pooling the first set and the second set to obtain a sum pool; and

diluting the pooled sets to obtain a scaled sum pool.

11 . The method of claim 9 , further comprising multiplying the first fixed point number and the second fixed point number by:

pooling the first set and the second set to obtain a factor pool; and

applying a chemical AND operation to the first and second sets of identifier nucleic acid molecules to obtain a product pool.

12 . The method of claim 11 , wherein the chemical AND operation comprises:

converting the identifier nucleic acid molecules to single-stranded identifier nucleic acid molecules;

hybridizing complementary identifier nucleic acid molecules; and

selecting fully hybridized double-stranded nucleic acid molecules to obtain the product pool.

13 . The method of claim 12 , wherein selecting comprises using at least one of an enzyme that selectively degrades single-stranded nucleic acid molecules or an enzyme that selectively degrades double-stranded nucleic acid molecules having sequence mismatches.

14 . The method of claim 9 , further comprising:

pooling the first set and the second set to obtain a factor pool; and

applying a chemical OR operation to the first and second sets of identifier nucleic acid molecules to obtain a product pool.

15 . The method of claim 14 , comprising mixing the first set and the second set.

16 . The method of claim 9 , further comprising:

pooling the first set and the second set to obtain a factor pool; and

applying a chemical NIMPLY operation to the first and second sets of identifier nucleic acid molecules to obtain a product pool.

17 . The method of claim 16 , wherein the chemical NIMPLY operation comprises

converting the identifier nucleic acid molecules to single-stranded identifier nucleic acid molecules, the single-stranded identifier nucleic acid molecules of the second set comprising an affinity tag;

providing a molar excess of single-stranded identifier nucleic acid molecules of the second set;

hybridizing complementary identifier nucleic acid molecules; and

selecting fully hybridized double-stranded nucleic acid molecules to obtain the product pool using a specific capture mechanism against the affinity tag.

18 . The method of claim 9 , further comprising:

pooling the first set and the second set to obtain a factor pool; and

applying a chemical NOT operation to the first and second sets of identifier nucleic acid molecules to obtain a product pool.

19 . The method of claim 18 , wherein the chemical NOT operation comprises:

converting the identifier nucleic acid molecules to single-stranded identifier nucleic acid molecules, the single-stranded identifier nucleic acid molecules of the first set comprising an affinity tag;

providing a molar excess of single-stranded identifier nucleic acid molecules of the first set;

hybridizing complementary identifier nucleic acid molecules; and

selecting fully hybridized double-stranded nucleic acid molecules to obtain the product pool using a specific capture mechanism against the affinity tag.

20 . The method of claim 9 , further comprising:

pooling the first set and the second set to obtain a factor pool; and

applying a chemical XOR operation to the first and second sets of identifier nucleic acid molecules to obtain a product pool.

21 . The method of claim 21 , wherein the chemical XOR operation comprises:

performing two NIMPLY operations followed by an OR operation.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Mar 25, 2026
From: CATALOG TECHNOLOGIES, INC.
To: BIOMEMORY AMERICA, LLC
Reel/Frame 075235/0936 →
SECURITY INTEREST Recorded Oct 3, 2025
From: CATALOG TECHNOLOGIES, INC.
To: HANWHA IMPACT NEW TECH LLC
Reel/Frame 072998/0067 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 8, 2024
From: BHATIA, SWAPNIL P.; NORSWORTHY, MICHAEL; KAMBARA, TRACY
To: CATALOG TECHNOLOGIES, INC.
Reel/Frame 067926/0224 →