CaltechAUTHORS
  A Caltech Library Service

Buffer Coding for Asymmetric Multi-Level Memory

Bohossian, Vasken and Jiang, Anxiao (Andrew) and Bruck, Jehoshua (2007) Buffer Coding for Asymmetric Multi-Level Memory. In: 2007 IEEE International Symposium on Information Theory. IEEE , Piscataway, NJ, pp. 1186-1190. ISBN 978-1-4244-1397-3. https://resolver.caltech.edu/CaltechAUTHORS:20170426-152709376

[img] PDF - Published Version
See Usage Policy.

406kB

Use this Persistent URL to link to this item: https://resolver.caltech.edu/CaltechAUTHORS:20170426-152709376

Abstract

Certain storage media such as flash memories use write-asymmetric, multi-level storage elements. In such media, data is stored in a multi-level memory cell the contents of which can only be increased, or reset. The reset operation is expensive and should be delayed as much as possible. Mathematically, we consider the problem of writing a binary sequence into write-asymmetric q-ary cells, while recording the last r bits written. We want to maximize t, the number of possible writes, before a reset is needed. We introduce the term Buffer Code, to describe the solution to this problem. A buffer code is a code that remembers the r most recent values of a variable. We present the construction of a single-cell (n = 1) buffer code that can store a binary (l = 2) variable with t = [q/2^(r - 1)] + r - 2 and a universal upper bound to the number of rewrites that a single-cell buffer code can have: ..... We also show a binary buffer code with arbitrary n, q, r, namely, the code uses n q-ary cells to remember the r most recent values of one binary variable. The code can rewrite the variable times, which is asymptotically optimal in q and n. . We then extend the code construction for the case r = 2, and obtain a code that can rewrite the variable t = (q - 1)(n - 2) + 1 times. When q = 2, the code is strictly optimal.


Item Type:Book Section
Related URLs:
URLURL TypeDescription
https://doi.org/10.1109/ISIT.2007.4557384DOIArticle
http://ieeexplore.ieee.org/document/4557384/?reload=truePublisherArticle
http://resolver.caltech.edu/CaltechPARADISE:2007.ETR083Related ItemTechnical Report
ORCID:
AuthorORCID
Bruck, Jehoshua0000-0001-8474-0812
Additional Information:© 2007 IEEE. This work was supported in part by the Lee Center for Advanced Networking at the California Institute of Technology.
Funders:
Funding AgencyGrant Number
Caltech Lee Center for Advanced NetworkingUNSPECIFIED
DOI:10.1109/ISIT.2007.4557384
Record Number:CaltechAUTHORS:20170426-152709376
Persistent URL:https://resolver.caltech.edu/CaltechAUTHORS:20170426-152709376
Official Citation:V. Bohossian, A. Jiang and J. Bruck, "Buffer Coding for Asymmetric Multi-Level Memory," 2007 IEEE International Symposium on Information Theory, Nice, 2007, pp. 1186-1190. doi: 10.1109/ISIT.2007.4557384
Usage Policy:No commercial reproduction, distribution, display or performance rights in this work are provided.
ID Code:76962
Collection:CaltechAUTHORS
Deposited By: Kristin Buxton
Deposited On:26 Apr 2017 23:00
Last Modified:15 Nov 2021 17:04

Repository Staff Only: item control page