Welcome to the new version of CaltechAUTHORS. Login is currently restricted to library staff. If you notice any issues, please email coda@library.caltech.edu
Published August 2015 | Submitted
Journal Article Open

Rank-Modulation Rewrite Coding for Flash Memories

Abstract

The current flash memory technology focuses on the cost minimization of its static storage capacity. However, the resulting approach supports a relatively small number of program-erase cycles. This technology is effective for consumer devices (e.g., smartphones and cameras) where the number of program-erase cycles is small. However, it is not economical for enterprise storage systems that require a large number of lifetime writes. The proposed approach in this paper for alleviating this problem consists of the efficient integration of two key ideas: 1) improving reliability and endurance by representing the information using relative values via the rank modulation scheme and 2) increasing the overall (lifetime) capacity of the flash device via rewriting codes, namely, performing multiple writes per cell before erasure. This paper presents a new coding scheme that combines rank-modulation with rewriting. The key benefits of the new scheme include: 1) the ability to store close to 2 bit per cell on each write with minimal impact on the lifetime of the memory and 2) efficient encoding and decoding algorithms that make use of capacity-achieving write-once-memory codes that were proposed recently.

Additional Information

© 2015 IEEE. Manuscript received December 3, 2013; revised December 17, 2014; accepted April 9, 2015. Date of publication June 8, 2015; date of current version July 10, 2015. This work was supported in part by NSF under Grant ECCS-0801795, Grant CCF-1217944, and Grant CCF-1218005, in part by NSF CAREER under Award CCF-0747415, in part by an U.S.-Israel Bi-National Science Foundation under Grant 2010075, and in part by a Grant from Intellectual Ventures. This paper was presented at the 2011 IEEE International Symposium on Information Theory [8], at the 2012 IEEE International Symposium on Information Theory [9], and at the 2013 IEEE International Symposium on Information Theory [7]. Communicated by A. Ashikhmin, Associate Editor for Coding Techniques.

Attached Files

Submitted - 1312.0972.pdf

Files

1312.0972.pdf
Files (347.9 kB)
Name Size Download all
md5:2d4e9abfe6fbd5fe2672cb57aa45bb39
347.9 kB Preview Download

Additional details

Created:
August 20, 2023
Modified:
October 23, 2023