Efficient low‐complexity two‐dimensional equalisation technique for multi‐level cell flash memory storage systems. Issue 14 (26th July 2018)

• Record Type: Journal Article
• Authors: Ashrafi, Reza A.; Pusane, Ali E.
• Is Part Of: IET communications. Volume 12:Issue 14(2018)
• Page Start: 1671
• Page End: 1677
• Publication Date: 2018-07-26
• Subjects: NAND circuits -- equalisers -- flash memories; multilevel cell flash memory storage systems -- NAND flash memories -- data storage industry -- multilevel cell memories -- interference‐affected data -- low‐complexity equalisation methods -- beneficial complexity‐performance trade‐offs -- intercell interference -- data reliability -- low‐complexity two‐dimensional equalisation technique -- data storage capacities; Telecommunication systems -- Periodicals; Speech processing systems -- Periodicals; 621.38205
• DOI: 10.1049/iet-com.2017.0440
• Languages: English
• ISSNs: 1751-8628

Abstract

Abstract : NAND flash memories, due to their several advantageous characteristics, have recently dominated the data storage industry and its global market. Currently, multi‐level cell memories, in which each cell can store more than one bit of data resulting in higher data storage capacities, have gained a considerable amount of research interest. However, this comes at the cost of several limitations and increased performance degradation. Various studies have shown that among several error sources in multi‐level cell memories, inter‐cell interference is the most significant one. Therefore, to mitigate the devastating effect of the interference, simple, feasible, and yet efficient equalisation techniques become essential for achieving desired data reliability. In this study, first, a thorough analysis on deriving the distribution of the interference‐free and interference‐affected data is carried out. Then, novel low‐complexity equalisation methods are proposed, and their beneficial complexity‐performance trade‐offs compared with the existing techniques are illustrated. Finally, simulation results are presented to show that the proposed algorithms considerably improve the error performance, while maintaining the low‐complexity constraints.