Flash Memory Update Method Reducing Erase Operations
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The time-consuming nature of erasing flash memory, which requires lengthy erase operations performed on sectors of a minimum size, leads to inefficient flash memory update processes.
Innovation Solution
A method where a processor determines whether stored bits in the set state need to be erased by comparing them with corresponding target bits. If a bit needs to be erased, the processor sets all bits in the corresponding sector to the unset state and updates them to match the target bits, thereby reducing unnecessary erase operations.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If flash memory is erased using traditional sector-based erase operations, then the flash memory can be updated, but the update process becomes time-consuming due to lengthy erase operations
Solution Approach 1:
The patent applies local quality by determining the specific bit states within a sector before erase operations. Instead of erasing entire sectors unconditionally, the system identifies which bits are in the set state and need to be unset, allowing for more targeted and efficient update operations that reduce unnecessary erase time.
Solution Approach 2:
The patent implements preliminary action by performing a determination step before the erase operation to identify which bits require erasing. This preliminary analysis of bit states allows the system to optimize the subsequent erase operation, performing it only when necessary and reducing overall update time.
2Productivity
If traditional flash memory update processes are used, then updates can be performed, but unnecessary erase operations consume additional time and resources
Solution Approach 1:
The patent changes the parameter of operation by introducing a determination step that analyzes bit states before initiating erase operations. This parameter change enables the system to distinguish between necessary and unnecessary erase operations, optimizing resource consumption by performing erases only when required.
Solution Approach 2:
The system performs self-service by automatically determining which bits need to be erased based on their current states compared to target states. This self-determination mechanism eliminates the need for manual analysis and optimizes the update process by automatically identifying and performing only the necessary erase operations.
Data Source
Figure 1
Figure 2
Figure 3A~3B
AI summary
An example non-transitory machine-readable storage medium storing machine-readable instructions which when executed cause a processor to obtain stored bits stored on a flash memory, each of the stored bits in a set state or an unset state. The processor further obtains target bits, each of the target bits in the set state or the unset state, wherein each target bit corresponds to a stored bit to update the stored bit. The processor further determines whether, for one stored bit in the set state, the corresponding target bit is in the unset state. When the determination is positive, the processor sets the stored bits to the unset state and, after setting the stored bits to the unset state, updates the stored bits to match the corresponding target bits. When the determination is negative, the processor updates the stored bits to match the corresponding target bits.