Rank-Modulation Rewrite Coding for Flash Memories
Eyal En Gad, Eitan Yaakobi, Anxiao (Andrew) Jiang, Jehoshua Bruck

TL;DR
This paper introduces a new coding scheme combining rank modulation and rewriting codes to enhance flash memory capacity and endurance, enabling near 2 bits per cell per write with minimal lifetime impact.
Contribution
It presents a novel integration of rank modulation with rewriting codes, improving flash memory capacity and reliability for enterprise storage.
Findings
Stores close to 2 bits per cell per write
Uses efficient encoding and decoding algorithms
Achieves high capacity with minimal lifetime reduction
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: (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. This paper presents a new coding scheme that combines rank…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAdvanced Data Storage Technologies · Cellular Automata and Applications · Error Correcting Code Techniques
