On the Capacity of Memoryless Rewritable Storage Channels

Copyright © (2014) by IEEE. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distrubuted for profit. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee.

A significant number of modern storage technologies, when written to, exhibit substantial variability in the outcomes of a write action. It is possible to mitigate the effect of the write uncertainty through the use of a feedback loop that rewrites the memory whenever judged necessary, in effect reshaping the write noise. This scheme highlights a trade-off between the storage capacity of the memory and the cost of writing to it, measured for example in the number of rewrites. The authors have developed the model of a rewritable channel to provide an explicit form for this trade-off and study other performance characteristics of such memories.

In this paper, we describe some initial results on the information-theoretic analysis of the rewritable channel. We first consider the problem of determining the capacity of this channel with input cost constraints, and obtain a variety of results from which we extract insights that we believe are of value to memory designers. Our results include an upper bound on capacity of the form log () where is a constant that can be easily calculated from the channel’s statistics and is an average cost parameter. We also provide a lower bound on capacity with a similar form. We analyze the particular case of uniform write noise in detail, obtaining a closed form expression for the capacity-cost trade-off for all possible cost parameters. We explore this formula from the capacity per unit cost perspective and establish that in order to achieve optimal energy and memory-wear per bit, it is sometimes strictly better to take advantage of the rewriting capability as opposed to writing only once; this observation has significant practical implications. We also include a discussion of the relevance of our work to three real emerging memory technologies.

By: Luis A. Lastras-Montaño, Michele M. Franceschini, Thomas Mittelholzer, Mayank Sharma

Published in: IEEE Transactions on Information Theory, volume 60, (no 6), pages 3178-95; 10.1109/TIT.2014.2303480 in 2014


This Research Report is available. This report has been submitted for publication outside of IBM and will probably be copyrighted if accepted for publication. It has been issued as a Research Report for early dissemination of its contents. In view of the transfer of copyright to the outside publisher, its distribution outside of IBM prior to publication should be limited to peer communications and specific requests. After outside publication, requests should be filled only by reprints or legally obtained copies of the article (e.g., payment of royalties). I have read and understand this notice and am a member of the scientific community outside or inside of IBM seeking a single copy only.


Questions about this service can be mailed to reports@us.ibm.com .