Flash Memories
A nearly optimal construction of flash codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
IEEE Transactions on Information Theory
A nearly optimal construction of flash codes
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 2
Data movement in flash memories
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Modulation codes for flash memory based on load-balancing theory
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Rewriting codes for joint information storage in flash memories
IEEE Transactions on Information Theory
Designing floating codes for expected performance
IEEE Transactions on Information Theory
Coding-based energy minimization for phase change memory
Proceedings of the 49th Annual Design Automation Conference
Geometric WOM codes and coding strategies for multilevel flash memories
Designs, Codes and Cryptography
Hi-index | 0.12 |
A constrained memory is a storage device whose elements change their states under some constraints. A typical example is flash memories, in which cell levels are easy to increase but hard to decrease. In a general rewriting model, the stored data changes with some pattern determined by the application. In a constrained memory, an appropriate representation is needed for the stored data to enable efficient rewriting. In this paper, we define the general rewriting problem using a graph model. This model generalizes many known rewriting models such as floating codes, WOM codes, buffer codes, etc. We present a novel rewriting scheme for the flash-memory model and prove it is asymptotically optimal in a wide range of scenarios. We further study randomization and probability distributions to data rewriting and study the expected performance. We present a randomized code for all rewriting sequences and a deterministic code for rewriting following any i.i.d, distribution. Both codes are shown to be optimal asymptotically.