Bit Sequence Compression Using Frequency-Ordered Permutations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data compression and encryption methods face challenges in balancing compression efficiency with the computational resources required for processing, particularly in scenarios where fast decompression is necessary, such as video playback, and they often fail to consistently achieve high compression across different data types.
Innovation Solution
A method involving the division of input sequences of bits into portions and sub-divisions, followed by frequency analysis to determine permutation occurrences, with labels generated based on these analyses to represent frequently occurring patterns, allowing for efficient compression and encryption by replacing bit portions with labels, and including extraction information for reconstruction.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Volume of stationary object
If data is compressed using conventional methods, then storage space is reduced, but computational resources required for processing increase
Solution Approach 1:
The patent divides the input bit sequence into multiple portions and further subdivides each portion into sub-divisions. This segmentation allows the compression algorithm to process smaller, manageable units independently, reducing the overall computational burden while maintaining compression effectiveness through localized pattern recognition.
Solution Approach 2:
The patent performs frequency analysis on sub-divisions to identify and catalog common bit patterns before the main compression process. By pre-processing and storing frequency information, the system avoids redundant computations during compression, thereby reducing computational resources required while achieving consistent compression ratios.
2Volume of stationary object
If compression ratio is increased, then storage efficiency improves, but decompression speed decreases
Solution Approach 1:
By segmenting the data into portions and sub-divisions, the patent enables parallel processing during decompression. Each segment can be independently decoded using pre-computed frequency information, significantly accelerating decompression speed while maintaining high compression ratios through efficient pattern matching.
Solution Approach 2:
The patent pre-computes and stores frequency analysis results during the compression phase. This preliminary action creates a lookup table of common patterns that can be rapidly referenced during decompression, eliminating the need for complex real-time analysis and thereby speeding up the decompression process.
3Device complexity
If conventional compression methods are used, then processing is simpler, but compression consistency across different data types deteriorates
Solution Approach 1:
The patent dynamically adapts the compression strategy by performing frequency analysis on the actual input data to identify dominant patterns. This dynamic approach allows the system to adjust to different data types and characteristics, achieving consistent compression ratios across diverse inputs while maintaining relatively simple processing through automated pattern recognition.
Solution Approach 2:
The patent changes the parameter of bit portion size and subdivision granularity based on the frequency analysis results. By adapting these parameters to match the specific characteristics of the input data, the system achieves consistent compression performance across different data types without requiring complex manual configuration.
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 a processed sequence of bits is generated based on the frequency analysis. The processed sequence of bits includes extraction information for use in reconstructing said input sequence of bits from said processed sequence of bits. The extraction information comprises sub-division order information identifying an ordered sequence comprising each possible sub-division permutation arranged in order of how many times, within said input sequence of bits, a portion comprises a sub-division having bits arranged in that possible sub-division permutation. The sub-division order information includes an index value representing the order of the corresponding ordered sequence, based on a preconfigured mapping between said index value and the order of the corresponding ordered sequence.