On the Capacity of the Beta-Binomial Channel Model for Multi-Level Cell Flash Memories

The beta-binomial (BBM) channel model was recently proposed to model the overdispersed statistics of empirically observed bit errors in multi-level cell (MLC) flash memories. In this paper, we study the capacity of the BBM channel model for MLC flash memories. Using the compound channel approach, we first show that the BBM channel model capacity is zero. However, through empirical observation, this appears to be a very pessimistic estimate of the flash memory channel capacity. We propose a refined channel model called the truncated-support BBM (TS-BBM) channel model and derive its capacity. Using empirical error statistics from 1X-nm and 2Y-nm MLC flash memories, we numerically estimate the TS-BBM channel model capacity as a function of the program/erase cycling stress. The capacity of the 2-TS-BBM channel model provides an upper bound on the coding rates for the flash memory chip assuming a single binary error correction code is used.

[1]  Paul H. Siegel,et al.  Channel Models for Multi-Level Cell Flash Memories Based on Empirical Error Analysis , 2016, IEEE Transactions on Communications.

[2]  David Tse,et al.  Fundamentals of Wireless Communication , 2005 .

[3]  Thomas M. Cover,et al.  Elements of information theory (2. ed.) , 2006 .

[4]  Alexander Vardy,et al.  List decoding of polar codes , 2011, 2011 IEEE International Symposium on Information Theory Proceedings.

[5]  J. G. Skellam.  A Probability Distribution Derived from the Binomial Distribution by Regarding the Probability of Success as Variable between the Sets of Trials , 1948 .

[6]  Tong Zhang,et al.  Estimating Information-Theoretical nand Flash Memory Storage Capacity and its Implication to Memory System Design Space Exploration , 2012, IEEE Transactions on Very Large Scale Integration (VLSI) Systems.

[7]  H. Rumsey,et al.  Two Results On Binary-input Discrete Memoryless Channels , 1991, Proceedings. 1991 IEEE International Symposium on Information Theory.

[8]  Thomas M. Cover,et al.  Elements of Information Theory , 2005 .

[9]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[10]  D. Blackwell,et al.  The Capacity of a Class of Channels , 1959 .

[11]  Alexander Vardy,et al.  How to Construct Polar Codes , 2011, IEEE Transactions on Information Theory.

[12]  Rüdiger L. Urbanke,et al.  How to achieve the capacity of asymmetric channels , 2014, 2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton).

[13]  Paul H. Siegel,et al.  Error analysis and inter-cell interference mitigation in multi-level cell flash memories , 2015, 2015 IEEE International Conference on Communications (ICC).

[14]  Erdal Arikan,et al.  Channel Polarization: A Method for Constructing Capacity-Achieving Codes for Symmetric Binary-Input Memoryless Channels , 2008, IEEE Transactions on Information Theory.

[15]  Guangyue Han,et al.  On the capacity of multilevel NAND flash memory channels , 2016, 2016 IEEE International Symposium on Information Theory (ISIT).

[16]  Eric Jones,et al.  SciPy: Open Source Scientific Tools for Python , 2001 .

[17]  J. Wolfowitz.  Simultaneous channels , 1959 .

[18]  Richard J. Cleary.  Handbook of Beta Distribution and Its Applications , 2006 .

[19]  Joseph M. Renes,et al.  Achieving the capacity of any DMC using only polar codes , 2012, 2012 IEEE Information Theory Workshop.

[20]  Junya Honda,et al.  Polar Coding Without Alphabet Extension for Asymmetric Models , 2013, IEEE Transactions on Information Theory.