Shaping Codes for Structured Data
作者： Yi Liu , Paul H. Siegel
DOI: 10.1109/GLOCOM.2016.7842266
关键词: Random walk 、 Decoding methods 、 Fraction (mathematics) 、 Encoding (memory) 、 Flash memory 、 Computer hardware 、 Code (cryptography) 、 Computer science 、 Algorithm
摘要: In this work, we study data shaping codes for flash memory. We first review a recently proposed direct code SLC (one bit per cell) memory that reduces wear by minimizing the average fraction of programmed cells. Then describe an adaptation algorithm provides MLC (two bits It makes use page- dependent cost model and is designed to be compatible with standard procedure row-by- row, page-based, wordline programming. also give simulation results demonstrating performance these when applied English language text. Finally, random walk analyze potential error propagation properties used in noisy
sci-hub.se 参考文章(4)
Kai Zhao, Jun Ma, Jiangpeng Li, Tong Zhang, Xuebin Zhang, Ming Zhao, How much can data compressibility help to improve NAND flash memory lifetime file and storage technologies. pp. 227- 240 ,(2015) , 10.5555/2750482.2750500
T. Cover, Enumerative source encoding IEEE Transactions on Information Theory. ,vol. 19, pp. 73- 77 ,(1973) , 10.1109/TIT.1973.1054929
Ashish Jagmohan, Michele Franceschini, Luis A. Lastras-Montano, John Karidis, Adaptive endurance coding for NAND Flash 2010 IEEE Globecom Workshops. pp. 1841- 1845 ,(2010) , 10.1109/GLOCOMW.2010.5700260
J. Laurie Snell, Peter G. Doyle, Random Walks and Electric Networks arXiv: Probability. ,(2000)