Layered Index-less Indexed Flash Codes for improving average performance

In this paper, a modified Index-Less Indexed Flash Codes (ILIFC) for flash memory storage system is presented. Although, the ILIFC proposed by Mahdavifar et al. has excellent worst case performance, the ILIFC can be further improved in terms of average case performance. The proposed scheme, called layered-ILIFC, is based on the original ILIFC but our main focus is on the average case performance. It includes an idea of layer-coding for representing indices of information bits. The layer coding promotes uniform use of cells, which leads to better average case performance. In addition, it is shown that the average number of rewritings can be derived by using a Markov chain model. From some experiments, it is observed that the proposed scheme achieves larger average number of rewritings than that of the ILIFC without deterioration of the worst case performance.

[1]  Paul H. Siegel,et al.  Multidimensional flash codes , 2008, 2008 46th Annual Allerton Conference on Communication, Control, and Computing.

[2]  Michael Mitzenmacher,et al.  Worst-Case and Average-Case Floating Codes for Flash Memory , 2009 .

[3]  Zhenming Liu,et al.  Designing Floating Codes for Expected Performance , 2010, IEEE Transactions on Information Theory.

[4]  Anxiao Jiang,et al.  Floating Codes for Joint Information Storage in Write Asymmetric Memories , 2007, 2007 IEEE International Symposium on Information Theory.

[5]  Adi Shamir,et al.  How to Reuse a "Write-Once" Memory , 1982, Inf. Control..

[6]  Paul H. Siegel,et al.  A nearly optimal construction of flash codes , 2009, 2009 IEEE International Symposium on Information Theory.

[7]  Anxiao Jiang,et al.  Joint coding for flash memory storage , 2008, 2008 IEEE International Symposium on Information Theory.

[8]  Hiroshi Kamabe Floating codes with good average performance , 2010, 2010 International Symposium On Information Theory & Its Applications.