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 July 2013 | Submitted
Journal Article Open

Trajectory Codes for Flash Memory

Abstract

A generalized rewriting model is defined for flash memory that represents stored data and permitted rewrite operations by a directed graph. This model is a generalization of previously introduced rewriting models of codes, including floating codes, write-once memory codes, and buffer codes. This model is used to design a new rewriting code for flash memories. The new code, referred to as trajectory code, allows stored data to be rewritten as many times as possible without block erasures. It is proved that the trajectory codes are asymptotically optimal for a wide range of scenarios. In addition, rewriting codes that use a randomized rewriting scheme are presented that obtain good performance with high probability for all possible rewrite sequences.

Additional Information

© 2013 IEEE. Manuscript received December 24, 2010; revised August 01, 2012; accepted November 29, 2012. Date of publication March 07, 2013; date of current version June 12, 2013. This work was supported in part by the National Science Foundation (NSF) CAREER Award CCF-0747415, in part by the NSF under Grant ECCS-0802107, in part by the Israel Science Foundation under Grant 480/08, in part by the Open University of Israel Research Fund under Grant 46109 and Grant 101163, in part by the Binational Science Foundation under Grant 2010075, and in part by the Caltech Lee Center for Advanced Networking. This paper was presented in part at the 2009 IEEE International Symposium on Information Theory.

Attached Files

Submitted - 1012.5430.pdf

Files

1012.5430.pdf
Files (209.0 kB)
Name Size Download all
md5:8380df50609f92ad6fe3656c8e7aea6e
209.0 kB Preview Download

Additional details

Created:
August 19, 2023
Modified:
October 24, 2023