Memory Page Partitioning Retaining Bad-Block Markers
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for partitioning pages in non-volatile memory often result in the bad-block marker being overwritten, making it tedious and time-consuming to rebuild the bad-block table, as the marker needs to be re-positioned within a page.
Innovation Solution
The method involves interleaving user data sections with spare area sections in electronic memory, ensuring the bad-block marker remains at a specified address, allowing for immediate and efficient maintenance of the bad-block table by creating sub-pages that retain the marker's original location.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Speed
If pages in non-volatile memory are partitioned into sub-pages or ECC code words using existing methods, then low-latency decoding and minimum intermediate buffering are achieved, but the bad-block marker gets overwritten and re-positioned within a page, making re-building of the bad-block table tedious and time-consuming
Solution Approach 1:
The patent extracts the bad-block marker from the general spare area and places it in a specifically reserved location that is excluded from the interleaving process. This extraction ensures the marker remains stationary while other data is interleaved for optimized decoding, resolving the contradiction between fast decoding and marker preservation.
Solution Approach 2:
The patent segments the spare area into two parts: a reserved location for the bad-block marker and another section for interleaving with user data. This segmentation allows the marker to remain fixed while enabling interleaved partitioning for low-latency decoding, thus resolving the time loss contradiction.
2Productivity
If the bad-block marker is re-positioned within a page during partitioning, then interleaving can be performed for low-latency decoding, but the re-building of the bad-block table becomes tedious and time-consuming
Solution Approach 1:
The bad-block marker is extracted from the interleavable section and placed in a reserved location that remains unchanged during partitioning. This maintains decoding efficiency through interleaving while keeping the marker position stable, making bad-block table maintenance straightforward.
Solution Approach 2:
The patent performs preliminary action by reserving a specific location for the bad-block marker before the interleaving process. This pre-arranged position prevents the need for re-positioning during partitioning, easing the maintenance of the bad-block table while still enabling efficient decoding.
3Quantity of substance
If existing partitioning methods are used to achieve minimum intermediate buffering, then the bad-block marker location changes, but this requires additional software processing to distinguish between used and unused blocks
Solution Approach 1:
The bad-block marker is extracted from the interleaved section and placed in a reserved location. This maintains minimum intermediate buffering through interleaving while keeping the marker position predictable, reducing software complexity for block management.
Solution Approach 2:
The reserved location for the bad-block marker serves itself by remaining stationary during interleaving, providing a stable reference point that simplifies software block management without requiring additional processing to track marker positions.
Data Source
AI summary
A method of partitioning a page of an electronic memory includes creating a first sub-page by interleaving a first user data section of the page with another section of a spare area of the page excluding a specified address in a section of the spare area that stores a bad block marker. The method also includes creating the sub-pages by interleaving the user data sections with sections of the spare area excluding the specified address until a last sub-page is to be created. Further, the method includes creating the last sub-page by interleaving a last user data section with the section of the spare area that includes the specified address in an interleaving sequence that retains the bad-block marker at the specified address.