| CPC H03M 7/3084 (2013.01) [H04L 9/0631 (2013.01)] | 25 Claims |
|
1. A method to uniquely and reversibly compress any arbitrary binary input data string, (IFDS) without any data loss, comprising:
developing a set of root identifiers (RI), comprising:
each of said RI is assigned a unique original representation comprising a probability and a number of bits of unique configuration;
said set does not change as a function of sequence of bits of said IFDS, and said IFDS, of a first size in term of number of bits greater than a minimum size, is fully described using said set of RI, with said RI that occur in said described IFDS, creating a content of RI for said described IFDS;
tabulating said content of said described IFDS in term of said RI, wherein said tabulation comprising the number of times each of said RI occurs, and such creating a distribution for said set of RI, with an occurring RI being a member of said IFDS;
singling out one or more of said RI, called seeds, based on mathematical and relational operations between characteristics of said RI that belong or not to said content of said described IFDS, wherein said mathematical and relational operations comprising comparisons, additions, subtractions, combinations, distributions, permutations, and said characteristics comprising said number of bits, said probability, said unique sequence, said distribution;
compressing said described IFDS is by employing a combination comprising said tabulated content and said seeds, in one or more of:
altering said original representation of one or more of said RI by assigning a smaller of said number of bits or by changing said unique sequence to a unique sequence which is derived from a said seed, wherein said RI that have said original representation altered are selected based on said characteristics;
replacing a first said member by a said seed or by a second said member every time said first member occurs in said described IFDS, wherein said first member has a larger said number of bits than the number of bits of said seed or of said second member
generating an output file of a second size in term of number of bits for said compressed IFDS, with said compression gain being generated when said second size is smaller than said first size;
uniquely reversing said compression by generating said IFDS from said output file, i.e. decompressing said output file;
wherein said compression and decompression are both implemented either in hardware or in software using hardware blocks or respectively software modules of specific functionality for every step of said method.
|