Bit-Permutation Compression Labels for Faster Decompression
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data compression and encryption methods face challenges in achieving optimal compression levels while minimizing processing resources, especially in scenarios requiring fast decompression and storage efficiency, and they often fail to adapt effectively to varying data types and characteristics.
Innovation Solution
A method involving the identification of a processing bit length, division of data into portions, frequency analysis, and assignment of labels based on permutation occurrences, allowing for adaptive compression and encryption that adjusts bit lengths and configurations to optimize compression across different data segments.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Volume of stationary object
If data is compressed using traditional methods, then storage space is reduced, but processing resources and time increase
Solution Approach 1:
The patent divides the input bit sequence into multiple portions with different bit lengths, processing each portion independently through frequency analysis and permutation identification. This segmentation allows parallel processing of different data segments, reducing overall processing time while maintaining compression effectiveness.
Solution Approach 2:
The patent dynamically adjusts the bit length of each portion based on the frequency analysis results and permutation occurrence patterns. By adaptively changing processing parameters during compression, the system optimizes the balance between compression ratio and processing speed for different data characteristics.
2Volume of stationary object
If compression ratio is increased, then storage efficiency improves, but decompression speed decreases
Solution Approach 1:
The patent performs frequency analysis and identifies common permutations during the compression phase, storing this information for use during decompression. By preparing permutation mappings and frequency data in advance, the decompression process can quickly reconstruct original data without performing complex analysis during decompression, thus maintaining high decompression speed.
3Device complexity
If fixed bit length is used for processing, then processing simplicity is maintained, but adaptability to different data types decreases
Solution Approach 1:
The patent applies different bit lengths and processing strategies to different portions of the input data based on their local characteristics. Each portion is analyzed independently and processed with parameters optimized for its specific data type and frequency distribution, allowing the system to maintain simplicity within each local segment while achieving high adaptability across diverse data types.
Data Source
AI summary
A method of compression is disclosed in which an input sequence of bits is divided into a plurality of portions. Each portion is sub-divided into a plurality of sub-divisions. Frequency analysis is performed to determine the number of occurrences of each sub-division permutation and new values are assigned, based on the frequency analysis, to each of the sub-division permutations. For each portion a label representing the permutation of bits in that portion is assigned. The label comprises a representation of a combined value resulting from combining the new values associated with the sub-division permutations of that portion. A processed sequence of bits is generated by replacing, within the input sequence of bits, bit portions with the respective label representing the permutation of bits in that portion.