Universal abstraction and de-abstraction of a digital data stream
First Claim
Patent Images
1. A computing device implemented method comprises:
- receiving by a computing device that includes an abstraction engine, an input bit string having a finite bit length L;
producing by the computing device from the input string, the one'"'"'s complement of the input string;
iteratively calculating by the abstraction engine in the computing device from the input string a first set of pairs function codes corresponding to the bits in the input string, and from the one'"'"'s complement of the input string, a second set of pairs of function codes corresponding to the bits in the one'"'"'s complement of the input string; and
returning by the computing device, the first and second pairs of function codes from the first set and the second set of function codes which were calculated at the bit length L, as a set of abstraction codes that correspond to a representation of the input string, with the representation having fewer number of bits than the input bit string.
3 Assignments
0 Petitions
Accused Products
Abstract
Techniques for abstracting a set of abstraction codes from an input bit string and for de-abstracting the codes to recover an original input bit string from a set of abstraction codes are described. The techniques disclosed include an initialization of an abstraction engine and abstraction/deabstraction from an original and one'"'"'s compliment of input strings. Applications of these techniques to compressing, storage, networking, and encryption are also described as is a parallel configuration for abstraction and de-abstraction.
235 Citations
57 Claims
-
1. A computing device implemented method comprises:
-
receiving by a computing device that includes an abstraction engine, an input bit string having a finite bit length L; producing by the computing device from the input string, the one'"'"'s complement of the input string; iteratively calculating by the abstraction engine in the computing device from the input string a first set of pairs function codes corresponding to the bits in the input string, and from the one'"'"'s complement of the input string, a second set of pairs of function codes corresponding to the bits in the one'"'"'s complement of the input string; and returning by the computing device, the first and second pairs of function codes from the first set and the second set of function codes which were calculated at the bit length L, as a set of abstraction codes that correspond to a representation of the input string, with the representation having fewer number of bits than the input bit string. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15)
-
-
16. A device comprises:
one or more processor devices coupled to memory, the processor devices with the memory executing an abstraction engine that is configured to; receive an input bit string of bits, the input bit string having a finite bit length; produce from the input bit string the one'"'"'s complement of the input bit string; iteratively calculate from the input bit string a first set of pairs of function codes corresponding to the bits in the input string, and from the one'"'"'s complement of the input bit string, a second set of pairs of function codes corresponding to the bits in the one'"'"'s complement of the input string; and return by the device the pairs of function codes from the first set and the second set of function codes calculated at a last bit in the input string and the ones complement as a set of abstraction codes that is a representation of the input string, which representation has fewer bits than the bit length of the input string.
-
17. A device implemented method for recovering an original input string from a set of abstraction codes, the method comprising:
-
iteratively, retrieving from a memory in the device, two pairs of abstraction codes; determining a bit of the original input string, by; applying a first one of the two pairs of abstraction codes to a first abstraction engine and a second one of the two second pairs of the abstraction codes to a second abstraction engine; and in each of the first abstraction engine and second abstraction engine; retrieve a previous element that includes a value of a data bit of the previous element, states, and function codes corresponding to the previous element; calculating by the abstraction engines in the device from the values of the previous element, two subsequent function codes; obtaining douplet products using the two subsequent function codes; determining the number of occurrences of 00 and non 00 elements from the douplet products; applying a rule according to the number of occurrences of 00 and non 00 elements to provide a candidate location of a the correct bit value for the bit of the input string; and selecting a bit value from either the first or the second abstraction engines as the correct candidate value according to which abstraction engine produces a result that satisfies the applied rule executed in each of the first and second abstraction engines. - View Dependent Claims (18, 19)
-
-
20. A device implemented method to provide a representation of an input string having a size corresponding to a number of bits, with the representation being reduced in size in comparison to the size of the string, the method comprises:
-
providing to a computing device that includes an abstraction engine an input string having a finite bit length L; initializing the abstraction engine by applying a set of system values to the abstraction engine to provide an initial state, where the set of system values represent known system values to provide beginning conditions; and calculating by the abstraction engine from the input string, a set of function codes using the initial state as the beginning state, with the set of function codes at the bit length L corresponding to the representation of the input string. - View Dependent Claims (21, 22, 23, 24, 25, 26, 27)
-
-
28. A device implemented method of processing a set of two pairs of abstraction codes that is an equivalent representation of an original input bit string of length L to recover the original input bit string of length L, the method comprises:
-
iteratively repeating by one or more processing devices over a predefined number of iterations, for each of a first one of the two pairs of abstraction codes and a second one of the two pairs of abstraction codes; obtaining by the one or more processing devices for a bit position, present states values for FF'"'"' and GG'"'"' and a present value of an AD bit from a table; testing by the one or more processing devices values of DA=0 and DA=1 by performing a look up into a set of matrixes for F0 and G0; forming by the one or more processing devices true end functions #F end and #G end; determining by the one or more processing devices whether the two elements #F and #G are both even numbers or both odd numbers; applying by the one or more processing devices one or more of selection and decision rules from a set of selection and decision rules according to the determination; determine by the one or more processing devices the correct bit value for the bit position for recovery of the original input string according to results of applying the one or more decision rules. - View Dependent Claims (29, 30, 31)
-
-
32. A computing device implemented method comprises:
-
providing to a computing device that includes an abstraction engine, an input string having a finite length L; initializing by the computing device, the abstraction engine by applying a set of system values to the abstraction engine, where the system values represent known system values to provide beginning conditions for abstracting the input string; producing by the computing device from the input string, the one'"'"'s complement of the input string; decomposing the input string into plural modules a first module comprising plural blocks of bits of the input string and a second module comprising plural blocks of bits of the one'"'"'s complement of the input string, for each of the first and the second modules, calculating by the abstraction engine in the computing device, a set of function codes for each block of bits; calculating from the set of function codes a subsequent set of function codes, and from the subsequent set of function codes and next subsequent set of function codes until a final subsequent set of function codes is reached; and returning by the computing device, the calculated final subsequent set of function codes from the first and the second modules, as a set of abstraction codes that are a representation of the input string. - View Dependent Claims (33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 51, 52, 53)
-
-
46. A device comprises:
-
one or more processor devices; memory coupled to the processor devices, with the processor devices configured to; receive an input string having a finite length L; produce by the device from the input string, the one'"'"'s complement of the input string; decompose the input string and the one'"'"'s complement into a first set of plural modules of blocks of bits of the input string and a second set of modules of blocks of bits of the one'"'"'s complement of the input string; for each of the first set of plural modules of blocks of bits of the input string and the second set of plural modules of blocks of bits of the input string, iteratively calculate by the abstraction engine in the computing device, a set of function codes for each of the blocks of bits with a subsequent set of function codes determined in part from a previous set of function codes until a final subsequent set of function codes is reached; and return the final subsequent set of function codes, as a set of abstraction codes that are a representation of the input string. - View Dependent Claims (47, 48, 49, 50, 54, 55, 56, 57)
-
Specification