IP Library Granted Patent US 10,346,047
Granted Patent B2
US 10,346,047 · App. 16/039,650 · Granted Jul 9, 2019

Method and apparatus for dense hyper IO digital retention

Inventor: Brian M. Ignomirello (Colts Neck, NJ)
Assignee: Formulus Black Corporation
G06F3/0608G06F3/061G06F3/064G06F3/065G06F3/0619G06F3/0661G06F3/0674G06F11/073G06F11/0751G06F11/0793
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 10,346,047
App. No.
16/039,650
Granted
Jul 9, 2019
Kind
B2
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 (38)

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.

Assignments (3)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jul 15, 2026
From: FORMULUS BLACK CORPORATION
To: MICROMOD AUTOMATION & CONTROLS, LLC
Reel/Frame 075279/0862 →
CHANGE OF NAME Recorded Jun 28, 2019
From: SYMBOLIC IO CORPORATION
To: FORMULUS BLACK CORPORATION
Reel/Frame 049632/0871 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded May 17, 2019
From: IGNOMIRELLO, BRIAN M.
To: SYMBOLIC IO CORPORATION
Reel/Frame 049216/0385 →
Continuity (5)
Continuation 15783838 · Oct 13, 2017
Continuation PCTUS2016025988 · Apr 5, 2016
Continuation 14804175 · Jul 20, 2015
Provisional Application 62148160 · Apr 15, 2015
Related Publication 20190114087A1 · Apr 18, 2019
Cited By (1)
US 12,204,988