Rank-Modulation Rewriting Codes for Flash Memories
Abstract
Current flash memory technology is focused on cost minimization of the stored capacity. However, the resulting approach supports a relatively small number of write-erase cycles. This technology is effective for consumer devices (smartphones and cameras) where the number of write-erase cycles is small, however, it is not economical for enterprise storage systems that require a large number of lifetime writes. Our proposed approach for alleviating this problem consists of the efficient integration of two key ideas: (i) improving reliability and endurance by representing the information using relative values via the rank modulation scheme and (ii) increasing the overall (lifetime) capacity of the flash device via rewriting codes, namely, performing multiple writes per cell before erasure. We propose a new scheme that combines rank-modulation with rewriting. The key benefits of the new scheme include: (i) the ability to store close to 2 bits per cell on each write, and rewrite the memory close to q times, where q is the number of levels in each cell, and (ii) efficient encoding and decoding algorithms that use the recently proposed polar WOM codes.
Additional Information
This work was partially supported by the NSF grants ECCS- 0801795 and CCF-1217944, NSF CAREER Award CCF- 0747415, BSF grant 2010075 and a grant from Intellectual Ventures.Files
Name | Size | Download all |
---|---|---|
md5:037f33b8137aab7cd05094dbd3b71938
|
93.9 kB | Preview Download |
Additional details
- Eprint ID
- 36632
- Resolver ID
- CaltechAUTHORS:20130128-144020108
- NSF
- ECCS-0801795
- NSF
- CCF-1217944
- NSF
- CCF-0747415
- BSF
- 2010075
- Intellectual Venttures
- Created
-
2013-01-30Created from EPrint's datestamp field
- Updated
-
2020-03-09Created from EPrint's last_modified field
- Caltech groups
- Parallel and Distributed Systems Group
- Other Numbering System Name
- Paradise
- Other Numbering System Identifier
- ETR117