Method and apparatus for dense hyper IO digital retention

• US 10,346,047 B2
• Filed: 07/19/2018
• Issued: 07/09/2019
• Est. Priority Date: 04/15/2015
• Status: Expired due to Fees

• Current Assignee: Formulus Black Corporation
• Original Assignee: Formulus Black Corporation
• Inventors: Ignomirello, Brian M.
• Primary Examiner(s): Pierre, Peguy Jean
• Application Number:
  US16/039,650
• Publication Number:
  US 20190114087A1
• Time in Patent Office: 355 Days
• Field of Search: 341 50, 341 51, 341 65, 341 67, 341106
• CPC Class Codes: G06F 1/00 Details not covered by groups G06F3/00 - G06F13/00 and G06F21/00 architectures of general purpose stored program computers G06F15/76
• CPC Class Codes: G06F 11/073 in a memory management context, e.g. virtual memory or cache management memory management G06F12/00; testing of static memory units G11C29/00
• CPC Class Codes: G06F 11/0751 Error or fault detection not based on redundancy power supply failures G06F1/30; network fault management H04L41/06
• CPC Class Codes: G06F 11/0793 Remedial or corrective actions recovery from an exception in an instruction pipeline G06F9/3861; by retry G06F11/1402; for recovering from a failure of a protocol instance or entity H04L69/40
• CPC Class Codes: G06F 11/10 Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
• CPC Class Codes: G06F 3/0608 Saving storage space on storage systems
• CPC Class Codes: G06F 3/061 Improving I/O performance
• CPC Class Codes: G06F 3/0619 in relation to data integrity, e.g. data losses, bit errors
• CPC Class Codes: G06F 3/064 Management of blocks
• CPC Class Codes: G06F 3/065 Replication mechanisms
• CPC Class Codes: G06F 3/0661 Format or protocol conversion arrangements
• CPC Class Codes: G06F 3/0674 Disk device

Abstract

System and method to encode and decode raw data. The method to encode includes receiving a block of uncoded data, decomposing the block of uncoded data into a plurality of data vectors, mapping each of the plurality of data vectors to a bit marker; and storing the bit marker in a memory to produce an encoded representation of the uncoded data. Encoding may further include decomposing the block of encoded data into default data and non-default data, and mapping only the non-default data. In some embodiments, bit markers may include a seed value and replication rule, or a fractalized pattern.

Claims

1. A computer-implemented method for storing and processing data without the need for a conventional hard drive, the method comprising:

accessing a block of uncoded data;

decomposing the block of uncoded data into a plurality of data vectors;

deriving a plurality of bit markers from a characteristic of the uncoded data;

mapping each data vector of the plurality of data vectors to one of the plurality of bit markers;

generating, based on the mapping of each data vector of the plurality of data vectors to one of the plurality of bit markers, a bit-marker-based encoding of the uncoded data; and

storing the bit-marker-based encoding of the uncoded data, based on the plurality of bit markers, in at least one random access memory to generate an encoded representation of the uncoded data, wherein the encoded representation of the uncoded data comprises a first data size that is smaller than a second data size of the uncoded data.

2. The computer-implemented method of claim 1, further comprising connecting an energy source to the at least one random access memory to provide sufficient backup power to maintain integrity of data stored in the at least one random access memory in case of power failure.

3. The computer-implemented method of claim 2, wherein the energy source comprises a large-capacitance capacitor of at least 600 Farads.

4. The computer-implemented method of claim 2, wherein the energy source comprises a battery.

5. The computer-implemented method of claim 1, further comprising connecting the random access memory to a dual in-line memory module socket in electronic communication with a communication bus to enable communication with a processor.

6. The computer-implemented method of claim 1, further comprising providing a memory interface in communication with the random access memory that includes a processor configured to detect a power failure.

7. The computer-implemented method of claim 1, wherein the at least one random access memory stores an amount of encoded data that, if stored in its uncoded form, would exceed the storage capacity of the at least one random access memory.

8. The computer-implemented method of claim 1, wherein the at least one random access memory supports operation of a processor for conventional functions.

9. The method of claim 1, wherein at least some of the plurality of data vectors overlap one another during the encoding of the uncoded data.

10. The computer-implemented method of claim 1, wherein the block of uncoded data represents a compound object.

11. The computer-implemented method of claim 1, wherein the block of uncoded data represents a multi-dimensional data object.

12. The computer-implemented method of claim 1, further comprising:

retrieving at least a portion of the bit-marker-based encoding from the at least one random access memory;

mapping bit markers in the at least a portion of the bit-marker-based encoding to respective data vectors;

combining the respective data vectors with the block of uncoded data to produce a composite uncoded data block; and

producing the uncoded composite data block as decoded data.

13. A computer readable medium storing instructions, that when executed by a processor, cause the processor to:

access a block of uncoded data;

decompose the block of uncoded data into a plurality of data vectors;

derive a plurality of bit markers from a characteristic of the uncoded data;

map each data vector of the plurality of data vectors to one of the plurality of bit markers;

generate, based on the mapping of each of the data vectors of the plurality of data vectors to one of the plurality of bit markers, a bit-marker-based encoding of the uncoded data; and

store the bit-marker-based encoding of the uncoded data, based on the plurality of bit markers, in at least one random access memory to generate an encoded representation of the uncoded data, wherein the encoded representation of the uncoded data comprises a first data size that is smaller than a second data size of the uncoded data.

14. The computer readable medium of claim 13, wherein the instructions further configure the processor to:

retrieve at least a portion of the bit-marker-based encoding from the at least one random access memory;

map bit markers in the at least a portion of the encoding to respective data vectors;

combine the respective data vectors with a block of uncoded data to produce a composite uncoded data block; and

producing the uncoded composite data block as decoded data.

15. The computer readable medium of claim 13, wherein the instructions configure the processor to process data without a conventional hard drive.

16. The computer readable medium of claim 13, wherein at least some of the plurality of data vectors overlap one another during encoding of the uncoded data.

17. The computer readable medium of claim 13, wherein the block of uncoded data represents a compound object.

18. The computer readable medium of claim 13, wherein the block of uncoded data represents a multi-dimensional data object.