DocumentCode :
85174
Title :
Trajectory Codes for Flash Memory
Author :
Anxiao Jiang ; Langberg, Michael ; Schwartz, M. ; Bruck, Jehoshua
Author_Institution :
Dept. of Comput. Sci. & Eng., Texas A&M Univ., College Station, TX, USA
Volume :
59
Issue :
7
fYear :
2013
fDate :
Jul-13
Firstpage :
4530
Lastpage :
4541
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.
Keywords :
buffer storage; codes; directed graphs; flash memories; probability; buffer code; directed graph; flash memory; floating code; generalized rewriting model; probability; randomized rewriting scheme; rewrite operation; rewrite sequence; rewriting code; trajectory code; write-once memory code; Ash; Data models; Decoding; Encoding; Hardware; Registers; Trajectory; Codes; flash memory; nonvolatile memory;
fLanguage :
English
Journal_Title :
Information Theory, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9448
Type :
jour
DOI :
10.1109/TIT.2013.2251755
Filename :
6476065
Link To Document :
بازگشت