Abstraction and de-abstraction of a digital data stream
First Claim
Patent Images
1. A device implemented method comprises:
- receiving by a computing device that includes a processor and memory, an input bit string of bits, with the input bit string having a finite number of bits, the input bit string having a bit length L;
iteratively transforming by the computing device, the bits of the input string into sets of interim function codes, with for each bit of the input bit string each of the sets of the interim function codes transformed in part from functions that are reverse sequence isomoric pairs and previous determined ones of the interim function codes; and
providing by the computing device, the set of the interim function codes that is determined for the bit at the bit position L of the input bit string, as a set of abstraction codes that correspond to a lossless representation of the input bit string having fewer bits than the bit length L.
4 Assignments
0 Petitions
Accused Products
Abstract
Techniques for abstracting a set of abstraction codes from an input bit string and for de-abstracting to recover an original input bit string from a set of abstraction codes and a string length are described. Applications of these techniques to compressing, storage, networking, encryption are also described as is a parallel configuration for abstraction and de-abstraction.
230 Citations
100 Claims
-
1. A device implemented method comprises:
-
receiving by a computing device that includes a processor and memory, an input bit string of bits, with the input bit string having a finite number of bits, the input bit string having a bit length L; iteratively transforming by the computing device, the bits of the input string into sets of interim function codes, with for each bit of the input bit string each of the sets of the interim function codes transformed in part from functions that are reverse sequence isomoric pairs and previous determined ones of the interim function codes; and providing by the computing device, the set of the interim function codes that is determined for the bit at the bit position L of the input bit string, as a set of abstraction codes that correspond to a lossless representation of the input bit string having fewer bits than the bit length L. - View Dependent Claims (2, 3, 4, 5, 6, 7, 8, 9, 10, 27, 28, 29, 30, 31, 32, 33, 34, 35, 41, 91)
-
-
11. A device implemented method of producing a representation of an input bit string of a finite number of digital bits of a length L, the representation having fewer bits than the finite number of bits L, the method comprises:
-
receiving by the device that includes a processor and memory, the input bit string of the length L; iteratively, determining by the device a set of interim function codes for each bit of the input bit string, up to the length L of the input bit string by iterative accesses to a table that stores function codes according to beginning conditions, final states and permissibility conditions; and when the length L of the input bit string has been reached by the iterative determining, producing a final set of interim function codes. - View Dependent Claims (12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 92)
-
-
36. A device comprises:
-
a processor; memory in communication with the processor, and logic to configure the processor to; receive an input bit string having a finite number of bits of a bit length L; iteratively determine plural sets of first and second function codes from the input bit string over the length L of the input bit string for each input bit at each corresponding bit position by calculating each of the plural sets of the first and second function codes from corresponding beginning conditions, permissibility conditions, corresponding next state conditions, and values of the input bit; and provide the first and second function codes determined for bit position L of the input string, as a representation of the input bit string, where the number of bits in the representation are less than the number of bits in the input bit string. - View Dependent Claims (93)
-
-
37. A computer program product tangibly stored in a non-transitory readable medium hardware storage device that is readable by a computer, the computer program product for producing a representation of an input bit string of bits of a finite length L, the representation having fewer bits than the finite number of bits L, the computer program product comprising instructions for causing a processor to:
-
receive an input bit string having a finite number of data bits of a bit length L; iteratively determine plural sets of interim function codes from the input bit string over the length L of the input bit string by calculating each of the sets of interim function codes from corresponding beginning conditions for a corresponding bit position of the input bit stream, permissibility conditions, next state conditions, and data bits of the input string or substituted data bits from a limit string; and provide the set of interim function codes determined for bit position L of the input string as a representation of the input bit string. - View Dependent Claims (94)
-
-
38. A electronic device implemented method comprises:
-
receiving by the electronic device, an input bit string of bits of a finite length of a length L; producing by the electronic device a set of abstraction codes by an abstraction engine in communication with the electronic storage device, by iteratively transforming the bits of the input string into sets of interim function codes, with for each bit of the input bit string each of the sets of the interim function codes transformed in part from functions that are reverse sequence isomoric pairs, and previous determined ones of the interim function codes with the set of abstraction codes being the set of interim function codes that were transformed a bit position corresponding to the length L of the input string; and storing by the electronic device, the set of abstraction codes into a data storage medium of the electronic storage device, with the set of codes corresponding to an abstracted representation of the input bit string. - View Dependent Claims (39, 40, 42, 43, 44, 45, 46, 47, 87, 88, 95)
-
-
48. A storage device comprises:
-
an interface configured to receive an input bit string of data bits of a finite length L; a storage medium; and an abstraction engine configured to; receive the input bit string; and produce from the input bit string a set of abstraction codes, where the set of abstraction codes comprise a first code having a first length of a number of bits, and a second code having the same first length of the number of bits; circuitry to send the set of abstraction codes to the storage medium to store the set of codes in a location in the storage medium, with the first and second codes corresponding to an abstracted lossless representation of the input bit string. - View Dependent Claims (96)
-
-
49. A device implemented method of transmitting data over a network, the method comprises:
-
receiving by a device an input bit string of data bits of a finite length defined as a length L; producing from the input bit string by an abstraction engine in the device a set of abstraction codes that represent the input bit string; forming a formatted unit of data comprising connection information and a payload with the payload comprising the set of abstraction codes that represent the input bit string. - View Dependent Claims (50, 51, 52, 53, 54, 55, 56, 57, 58, 89, 90, 97, 98)
-
-
59. A network device comprises:
-
an interface configured to receive an input bit string of data bits of a finite length L; an abstraction engine configured to; produce from the input bit string a set of abstraction codes; and a forming engine that produces a formatted unit of data comprising connection information and a payload, with the payload comprising the set of abstraction codes. - View Dependent Claims (60, 61, 62, 63, 99)
-
-
64. A device implemented method of encrypting an input bit string of data bits of a finite length into a compressed, encrypted representation of the input bit string, the method comprises:
-
receiving by a device the input bit string of data bits of finite length defined as length L; abstracting the input bit string by an abstraction engine into a set of abstraction codes that correspond to a lossless representation of the input bit string, with the abstraction codes formed using a secured abstraction encryption key; and sending by the device the set of abstraction codes to a recipient application, the set of abstraction codes. - View Dependent Claims (65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 100)
-
-
77. A device implemented method of producing a hash, the method comprises:
-
receiving a key that corresponds to a stored input bit string of data bits of a finite length L; producing by an abstraction engine in the device a set of end words by abstracting a set of code words from the input bit string corresponding to the key; applying by the device the set of end words to point to a location in memory associated with the key. - View Dependent Claims (78, 79, 80, 81, 82, 83, 84)
-
-
85. A device implemented method of producing a cryptographic hash, the method comprises:
-
providing to a device an input bit string of data bits having a finite length; calculating by the device from the input bit string a set of abstraction codes; and returning by the device the set of abstraction codes as the cryptographic hash.
-
-
86. A device configuration for abstraction comprises:
-
a storage device having storage for one or more entries where the one or more entries are data units comprising plural bits in a like plurality of bit positions; and a like plurality of abstraction units fed by the storage device with each bit position of the storage device coupled to a corresponding one of abstraction engines, with the abstraction engines configured to produce plural abstraction codes according to the corresponding bit position of the storage device coupled to the corresponding abstraction engine.
-
Specification