Managing Device Lifecycle: Reconfigurable Constrained Codes for M/T/Q/P-LC Flash Memories

2021-01-01
Hareedy, Ahmed
Dabak, Beyza
Calderbank, Robert
© 1963-2012 IEEE.Flash memory devices are winning the competition for storage density against magnetic recording devices. This outcome results from advances in physics that allow storage of more than one bit per cell, coupled with advances in signal processing that reduce the effect of physical instabilities. Constrained codes are used in storage to avoid problematic patterns, and thus prevent errors from happening. Recently, we introduced binary symmetric lexicographically-ordered constrained codes (LOCO codes) for data storage and data transmission. LOCO codes are capacity-achieving, simple, and can be easily reconfigured. This paper introduces simple constrained codes that support non-binary physical gates in multi, triple, quad, and the currently-in-development penta-level cell (M/T/Q/P-LC) Flash memories. The new codes can be easily modified if problematic patterns change with time. These codes are designed to mitigate inter-cell interference, which is a critical source of error in Flash devices. The occurrence of errors is a consequence of parasitic capacitances in and across floating-gate transistors, resulting in charge propagation from cells being programmed to the highest charge level to neighboring cells being programmed to lower levels or unprogrammed/erased. This asymmetric nature of error-prone patterns distinguishes Flash memories. The new codes are called $q$ -ary asymmetric LOCO codes (QA-LOCO codes), and the construction subsumes codes previously designed for single-level cell (SLC) Flash devices (A-LOCO codes). QA-LOCO codes work for a Flash device with any number, $q$ , of levels per cell. For $q \geq 4$ , we show that QA-LOCO codes can achieve rates greater than $0.95 \log _{2} \!q$ input bits per coded symbol. The complexity of encoding and decoding is modest, and reconfiguring a code is as easy as reprogramming an adder. Capacity-achieving rates, affordable encoding-decoding complexity, and ease of reconfigurability support the growing improvement of M/T/Q/P-LC Flash memory devices, as well as lifecycle management as the characteristics of these devices change with time, which increases their lifetime.
IEEE Transactions on Information Theory

Suggestions

Q-ary Asymmetric LOCO Codes: Constrained Codes Supporting Flash Evolution
Hareedy, Ahmed; Dabak, Beyza; Calderbank, Robert (2020-06-01)
© 2020 IEEE.Flash memory devices are winning the competition for storage density against magnetic recording devices. This outcome results from advances in physics that allow storage of more than one bit per cell, coupled with advances in signal processing that reduce the effect of physical instabilities. Constrained codes are used in storage to avoid problematic patterns. Recently, we introduced binary symmetric lexicographically-ordered constrained codes (LOCO codes) for data storage and transmission. This...
Non-Binary Constrained Codes for Two-Dimensional Magnetic Recording
Dabak, Beyza; Hareedy, Ahmed; Calderbank, Robert (2020-11-01)
© 1965-2012 IEEE.The two-dimensional magnetic recording (TDMR) technology promises storage densities of 10 Tbits/in2. However, when tracks are squeezed together, a bit stored in the two-dimensional (TD) grid suffers inter-symbol interference (ISI) from adjacent bits in the same track and inter-track interference (ITI) from nearby bits in the adjacent tracks. A bit is highly likely to be read incorrectly if it is isolated in the middle of a $3 \times 3$ square, surrounded by its complements, horizontally and...
Breaking the Computational Bottleneck: Probabilistic Optimization of High-Memory Spatially-Coupled Codes
Yang, Siyi; Hareedy, Ahmed; Calderbank, Robert; Dolecek, Lara (2022-01-01)
IEEESpatially-coupled (SC) codes, known for their threshold saturation phenomenon and low-latency windowed decoding algorithms, are ideal for streaming applications and data storage systems. SC codes are constructed by partitioning an underlying block code, followed by rearranging and concatenating the partitioned components in a convolutional manner. The number of partitioned components determines the memory of SC codes. In this paper, we investigate the relation between the performance of SC codes and the...
Increasing the Lifetime of Flash Memories Using Multi-Dimensional Graph-Based Codes
Hareedy, Ahmed; Kuditipudi, Rohith; Calderbank, Robert (2019-08-01)
© 2019 IEEE.In order to meet the demands of data-hungry applications, data storage devices are required to be increasingly denser. Various sources of error appear with this increase in density. Multi-dimensional (MD) graph-based codes are capable of mitigating error sources like interference and channel non-uniformity in dense storage devices. Recently, a technique was proposed to enhance the performance of MD spatially-coupled codes that are based on circulants. The technique carefully relocates circulants...
A General Non-Binary LDPC Code Optimization Framework Suitable for Dense Flash Memory and Magnetic Storage
Hareedy, Ahmed; Lanka, Chinmayi; Dolecek, Lara (2016-09-01)
© 2017 IEEE.Transmission channels underlying modern dense storage systems, e.g., Flash memory and magnetic recording (MR) systems, significantly differ from canonical channels, like additive white Gaussian noise (AWGN) channels. While existing low-density parity-check (LDPC) codes optimized for symmetric, AWGN-like channels are being actively considered for Flash applications, we demonstrate that, due to channel asymmetry, such approaches are inadequate. We introduce a refined definition of absorbing sets, ...
Citation Formats
A. Hareedy, B. Dabak, and R. Calderbank, “Managing Device Lifecycle: Reconfigurable Constrained Codes for M/T/Q/P-LC Flash Memories,” IEEE Transactions on Information Theory, vol. 67, no. 1, pp. 282–295, 2021, Accessed: 00, 2022. [Online]. Available: https://www.scopus.com/inward/record.uri?partnerID=HzOxMe3b&scp=85098545681&origin=inward.