Towards longer lifetime of emerging memory technologies using number theory

Emerging non-volatile memory devices show tremendous promise for a wide variety of applications, ranging from consumer electronics to server technologies. The advent of such multi-scale opportunities also carries a unique set of challenges. Increasingly popular Flash memory devices possess an intrinsic asymmetry during the write operation: programming memory cells to values lower than currently stored values is considerably slower and more costly than programming to higher values. It is critical to keep this cost low, as it directly affects memory lifetime and performance. Concurrently, demands for higher densities under reduced technology sizing make the data reliability a formidable objective. To address the compound issue of sustained and low-cost data reliability and high performance, in this work we propose a methodology to provide guaranteed immunity to a prescribed number of asymmetric errors, while having asymptotically negligible redundancy. Our construction uses ideas from additive and combinatorial number theory, and builds upon recently introduced coding schemes. We first show how this construction can be used in the single level cell (SLC) setup, and subsequently extend the construction to the setting with several levels per cell, including multi-level cell (MLC) and triple-level (TLC) setting. We also discuss practical aspects of such schemes, including methods for systematic encoding, correction of limited-magnitude errors, and the additional protection under a certain number of bidirectional errors. This number-theoretic based approach is a promising direction for extending the lifetime of memories at sustained reliability.

[1]  S. Wicker Error Control Systems for Digital Communication and Storage , 1994 .

[2]  Jehoshua Bruck,et al.  Codes for Asymmetric Limited-Magnitude Errors With Application to Multilevel Flash Memories , 2010, IEEE Transactions on Information Theory.

[3]  Torleiv Kløve,et al.  Systematic single limited magnitude asymmetric error correcting codes , 2010, 2010 IEEE Information Theory Workshop on Information Theory (ITW 2010, Cairo).

[4]  Torleiv Kløve,et al.  Systematic, Single Limited Magnitude Error Correcting Codes for Flash Memories , 2011, IEEE Transactions on Information Theory.

[5]  Paul H. Siegel,et al.  Storage Coding for Wear Leveling in Flash Memories , 2009, IEEE Transactions on Information Theory.

[6]  Boaz Eitan,et al.  Binary and Multilevel Flash Cells , 1999 .

[7]  Vladimir I. Levenshtein,et al.  Binary codes capable of correcting deletions, insertions, and reversals , 1965 .

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

[9]  Paul H. Siegel,et al.  Characterizing flash memory: Anomalies, observations, and applications , 2009, 2009 42nd Annual IEEE/ACM International Symposium on Microarchitecture (MICRO).

[10]  Lara Dolecek,et al.  Repetition Error Correcting Sets: Explicit Constructions and Prefixing Methods , 2009, SIAM J. Discret. Math..

[11]  T. Apostol Introduction to analytic number theory , 1976 .

[12]  Melvyn B. Nathanson,et al.  Additive Number Theory The Classical Bases , 1996 .

[13]  Mark N. Wegman,et al.  On the lifetime of multilevel memories , 2009, 2009 IEEE International Symposium on Information Theory.