Binary Compression / Decompression Method
A binary data compression/decompression method is disclosed, where any input binary data string (IFDS) is uniquely and reversibly compressed/decompressed without any data loss, by first transforming the IFDS in well defined variable length binary constructs using well defined criteria and procedure,...
Gespeichert in:
1. Verfasser: | |
---|---|
Format: | Patent |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
Zusammenfassung: | A binary data compression/decompression method is disclosed, where any input binary data string (IFDS) is uniquely and reversibly compressed/decompressed without any data loss, by first transforming the IFDS in well defined variable length binary constructs using well defined criteria and procedure, followed by partitioning the IFDS in IFDS slices of optimal sizes based on well defined criteria, where each IFDS slice is individually compressed according to three independent schemes and several extensions that are all based on mathematical description of well defined relationships noted within the content of such an IFDS slice in term of specific binary constructs, leading to unique identifiable binary entities that are used to generate compression gain by reassignment of specific well defined parts of the data constructs within the subject IFDS slice, where such compressed IFDS slices are assembled in the same original slice order as found in the original uncompressed IFDS, creating the full compressed IFDS, where an unlimited but defined number of such compression cycles are executed until the desired final file size is achieved. |
---|