Capacity-Achieving Codes That Mitigate Intercell Interference and Charge Leakage in Flash Memories
Capacity-Achieving Codes That Mitigate Intercell Interference and Charge Leakage in Flash Memories
复制标题
DOI：
10.1109/tit.2018.2884210
复制
发表时间：
2019-06
影响因子：
2.5
通讯作者：
Yeow Meng Chee;Johan Chrisnata;Han Mao Kiah;S. Ling;T. T. Nguyen-T.;Van Khu Vu
中科院分区：
文献类型：
--
作者：
Yeow Meng Chee;Johan Chrisnata;Han Mao Kiah;S. Ling;T. T. Nguyen-T.;Van Khu Vu
我们研究了恒定组成约束代码，以通过动态阈值方案减轻多级单元闪存的单元间干扰。给出了具有给定组合和某些子串族 ${\mathcal F}$ 的 $q$ -ary ${\mathcal F}$ 最大大小的第一个显式公式。此外，我们提供了确定具有任意组合比例的${\mathcal F}$ -避免码的渐近率的方法，并找到使渐近率最大化的最佳组合比例。我们还为这些 $q$ 常量组合代码给出了第一个有效的编码器/解码器，对于所有 $q$ 值实现了信道容量。
We investigate constant-composition constrained codes for the mitigation of intercell interference for multilevel cell flash memories with a dynamic threshold scheme. The first explicit formula for the maximum size of a $q$ -ary ${\mathcal F}$ -avoiding code with a given composition and certain families of substrings ${\mathcal F}$ is presented. In addition, we provide methods to determine the asymptotic rate for ${\mathcal F}$ -avoiding codes with any composition ratio and to find the optimal composition ratio that maximizes the asymptotic rate. We also give the first efficient encoder/decoder for these $q$ -ary constant-composition codes achieving the channel capacity, for all $q$ values.