Computer Science – Information Theory
Scientific paper
2010-12-24
Computer Science
Information Theory
Submitted to IEEE Trans. on Inform. Theory
Scientific paper
Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the stored data changes its value with certain patterns. The patterns of data updates are determined by the data structure and the application, and are independent of the constraints imposed by the storage medium. Thus, an appropriate coding scheme is needed so that the data changes can be updated and stored efficiently under the storage-medium's constraints. In this paper, we define the general rewriting problem using a graph model. It extends many known rewriting models such as floating codes, WOM codes, buffer codes, etc. We present a new rewriting scheme for flash memories, called the trajectory code, for rewriting the stored data as many times as possible without block erasures. We prove that the trajectory code is asymptotically optimal in a wide range of scenarios. We also present randomized rewriting codes optimized for expected performance (given arbitrary rewriting sequences). Our rewriting codes are shown to be asymptotically optimal.
Anxiao
Bruck Jehoshua
Jiang
Langberg Michael
Schwartz Moshe
No associations
LandOfFree
Trajectory Codes for Flash Memory does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Trajectory Codes for Flash Memory, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Trajectory Codes for Flash Memory will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-93750