Memory Folding with Single Address Update
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current memory systems require two updates to the address data structure when folding data from a single-level cell (SLC) to a multiple-level cell (MLC) memory area, which increases storage capacity needs and is inefficient, as they need to maintain both the SLC and MLC storage locations for an extended period before data is fully moved.
Innovation Solution
Implementing a method where data is programmed into both memory areas with equal storage capacity, allowing for a single update to the address data structure by performing initial and subsequent phases of write operations in a way that data is immediately folded into the high storage density area once it reaches a threshold in the low storage density area, reducing the need for extensive SLC storage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If data is initially stored in SLC memory area and then folded to MLC memory area after a certain period, then data storage flexibility is improved, but the size of SLC storage area must be increased and two updates to the address data structure are required
Solution Approach 1:
The patent combines the SLC and MLC storage operations by programming data into both memory areas simultaneously using a single write operation. The controller programs data into the SLC memory area and the MLC memory area in parallel, then performs a single update to the address data structure that identifies the MLC location, eliminating the need for separate updates and reducing the required SLC storage capacity.
Solution Approach 2:
The patent performs preliminary programming of data into both SLC and MLC memory areas before the folding operation is complete. By pre-programming the MLC area with the same data and updating the address structure to point to MLC, the system prepares the folded state in advance, allowing immediate transition and reducing the buffer capacity needed in SLC.
2Adaptability or versatility
If data is initially stored in SLC memory area and then folded to MLC memory area after a certain period, then data storage flexibility is improved, but the number of address data structure updates increases
Solution Approach 1:
The patent merges the address update operations into a single action. Instead of performing one update when data is written to SLC and a second update when data is folded to MLC, the system performs only one update to the address data structure that directly identifies the MLC memory location, thereby reducing operational complexity.
Solution Approach 2:
The patent extracts the intermediate SLC storage step from the traditional folding process. By directly programming data into both SLC and MLC areas and updating the address structure to point to MLC, the system removes the need for temporary SLC storage and the associated address update, simplifying the overall process.
3Productivity
If equal storage capacity is allocated to both SLC and MLC memory areas, then immediate folding is enabled with single address update, but the total memory capacity required increases
Solution Approach 1:
The patent applies partial action by programming only the necessary portions of data into both SLC and MLC areas simultaneously, rather than duplicating entire datasets. The controller identifies and programs specific data blocks that are candidates for folding, performing the dual programming operation only where needed, thus avoiding excessive memory capacity requirements while enabling immediate folding capability.
Data Source
AI summary
A memory system may be configured to perform immediate folding of data from a low storage density area to a high storage density area. A low storage density target area may be monitored, and when a capacity of the low storage density target area reaches a threshold level, data stored in the low storage density target area may be folded to an associated high storage density target area. The memory system may utilize a pointer system to manage the folding of data. The pointer system may also be utilized for read operations in order to avoid updating address mapping tables for both the low storage density and the high storage density areas.