Data Compression Circuit With Staged Match Length Calculation
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Memory systems with nonvolatile memory require large storage capacity for storing large amounts of data, leading to high costs, and existing data compression circuits have inefficiencies that increase circuit area and reduce throughput.
Innovation Solution
A data compression circuit utilizing dictionary-based encoding and entropy encoding, combined with intermediate match candidate generation, reduces the bit width of match length calculations to enhance throughput while maintaining efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Measurement precision
If the bit width of match length calculation is increased to improve compression accuracy, then measurement precision is improved, but device complexity and circuit area increase
Solution Approach 1:
The patent segments the match length calculation into two stages: first calculating a preliminary match length with limited bit width, then extending it only when necessary. This segmentation allows the circuit to operate with reduced bit width most of the time while achieving full precision when needed, thereby resolving the contradiction between measurement precision and device complexity
Solution Approach 2:
The patent performs preliminary match length calculation with reduced bit width before finalizing the complete match length. This preliminary action with lower precision reduces the circuit area requirements, and only subsequent extensions require full precision, thus resolving the contradiction between measurement precision and device complexity
2Measurement precision
If the bit width of match length calculation is increased to improve compression accuracy, then measurement precision is improved, but productivity decreases due to longer calculation time
Solution Approach 1:
The patent segments the match length calculation into iterative steps with increasing bit width. By processing match length calculation in segments rather than all at once with full precision, the circuit achieves both high measurement precision and maintained productivity through staged computation
Solution Approach 2:
The patent performs preliminary match length calculation with reduced bit width that can be completed quickly, then extends the precision only for cases that require it. This preliminary low-precision calculation maintains high throughput while the selective extension provides necessary precision, resolving the contradiction between measurement precision and productivity
3Loss of information
If a large dictionary buffer is used to improve compression ratio, then loss of information is reduced, but device complexity and storage requirements increase
Solution Approach 1:
The patent performs preliminary compression analysis to identify common patterns and frequently occurring data before final compression. This preliminary action allows the system to optimize the dictionary buffer size by pre-loading only the most useful entries, thereby improving compression ratio while minimizing buffer size and device complexity
Data Source
AI summary
According to one embodiment, a data compression circuit includes a plurality of intermediate match candidate generation circuits. Each of the plurality of intermediate match candidate generation circuits generates an intermediate match candidate by incrementing, based on a match length received from a corresponding intermediate match candidate selection circuit, a match length corresponding to an intermediate match candidate generated in a previous cycle when a distance corresponding to the received match length matches a distance corresponding to the intermediate match candidate generated in the previous cycle and the received match length is greater than a threshold value.