Memory Data Compression Using Bitmaps to Cut Flash Accesses
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current memory systems face inefficiencies in storing and managing system data due to hardware overhead constraints and limited RAM capacity, leading to reduced performance and increased internal accesses to flash chips.
Innovation Solution
A compression scheme is implemented in the memory system that searches for patterns in system data, compressing it using first and second information, including bitmaps, to reduce data size and improve performance by minimizing internal accesses.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If system data is stored in full form in memory device, then data access speed is improved, but memory capacity is consumed and internal accesses to flash chips increase
Solution Approach 1:
The patent extracts only the essential pattern information from system data, storing just the first element and a bitmap indicating pattern positions rather than the complete data array. This extraction approach reduces memory capacity consumption while maintaining fast access to the extracted pattern information.
Solution Approach 2:
The patent creates a compressed representation (copy) of the system data using a bitmap and first element, which can be quickly accessed and then used to reconstruct the full data when needed. This copying mechanism enables fast access to pattern information while storing only minimal data.
2Quantity of substance
If system data is compressed to reduce size, then memory capacity usage is reduced, but data access complexity increases
Solution Approach 1:
The patent segments the system data into a first element and a bitmap, where each bit in the bitmap corresponds to a specific position in the original data array. This segmentation creates a simple, structured format that is easy to access and reconstruct, reducing access complexity despite compression.
Solution Approach 2:
The patent changes the representation parameters of system data from storing actual values to storing positional information (bitmap) and a reference value (first element). This parameter transformation enables compact storage while maintaining simple access through bitwise operations and arithmetic progression.
3Quantity of substance
If pattern-based compression is applied to system data, then compression ratio is improved, but processing time for compression increases
Solution Approach 1:
The patent applies partial action by only compressing data that follows a recognizable pattern, leaving non-pattern data uncompressed. The bitmap only marks positions where the pattern repeats, avoiding unnecessary processing of unique data elements. This selective approach improves compression ratio while minimizing processing time.
4Use of energy by moving object
If internal accesses to flash chips are reduced through compression, then energy consumption is reduced, but hardware overhead constraints are challenged
Solution Approach 1:
The patent changes the data representation parameters to a compressed format using bitmap and first element, which reduces the amount of data transferred and accessed in flash memory. This parameter transformation directly reduces energy consumption during read/write operations while the simple bitmap structure avoids introducing significant hardware overhead.
Data Source
AI summary
Methods and systems are provided for compression and reconstruction of system data. A controller of a memory system includes a compression component for searching for a pattern of an array of system data including a plurality of elements and compressing the array of system data based on the pattern. The array of system data includes neighbor elements corresponding to a first pattern, among the plurality of elements. The compressed system data includes: first information including a first bit indicating a first content; and second information including a first bitmap, each bit of the first bitmap indicating whether a corresponding element is a first element among the neighbor elements of the first pattern.