Compression Circuit With Long Substrings for Low-Throughput Matching
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing dictionary-type compression techniques experience reduced compression performance when throughput is low, as the maximum match length shortens, limiting the effectiveness of data compression.
Innovation Solution
A compression circuit generates substrings longer than the throughput, allowing for parallel dictionary searches and longer match lengths, thereby enhancing compression performance even at lower throughputs by generating substrings of twice the throughput length, which improves compression efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If multiple substrings are generated from input data for parallel dictionary search, then throughput is improved, but maximum match length shortens and compression performance deteriorates
Solution Approach 1:
The patent divides the input data into multiple substrings (first substring, second substring, etc.) and performs parallel dictionary searches on each substring independently. This segmentation enables throughput improvement while the patent compensates for reduced match length by processing multiple substrings simultaneously, thereby maintaining compression performance.
Solution Approach 2:
The patent transitions from sequential processing to parallel processing by adding a dimensional aspect of concurrent substring handling. Multiple dictionary searches are executed in parallel across different substrings, effectively utilizing time-space tradeoff to maintain compression performance while improving throughput.
2Manufacturing precision
If substring length is increased to maintain match length, then compression performance is improved, but circuit complexity increases
Solution Approach 1:
Instead of using a single long substring that would require complex circuitry, the patent segments the data into multiple shorter substrings and processes them in parallel. This segmentation reduces the complexity of individual substring processing circuits while maintaining effective match lengths through parallel operation.
Solution Approach 2:
The patent merges multiple parallel dictionary search operations into a unified compression process. By combining the results of parallel searches on multiple substrings, the system achieves compression performance equivalent to longer substrings without requiring proportionally complex circuitry for each individual substring.
Data Source
AI summary
According to one embodiment, a compression circuit generates substrings from input data for (3+M) cycles, the input data being N bytes per cycle, a byte length of each substring being greater than or equal to (N×(1+M)+1); obtains a set of matches, each of the matches including at least one past input data which input past and corresponds to at least a part of each of the substrings; selects a subset of matches from the set of matches including the input data of one cycle; and outputs the subset of matches. M is zero or a natural number. N is a positive integer which is two or more.