English
Related papers

Related papers: Rewritable Codes for Flash Memories Based Upon Lat…

200 papers

A construction using the E8 lattice and Reed-Solomon codes for error-correction in flash memory is given. Since E8 lattice decoding errors are bursty, a Reed-Solomon code over GF($2^8$) is well suited. This is a type of coded modulation,…

Information Theory · Computer Science 2011-02-17 Brian M. Kurkoski

Flash memory is a non-volatile computer memory comprising blocks of cells, wherein each cell can take on q different values or levels. While increasing the cell level is easy, reducing the level of a cell can be accomplished only by erasing…

Information Theory · Computer Science 2012-10-30 Eitan Yaakobi , Hessam Mahdavifar , Paul H. Siegel , Alexander Vardy , Jack K. Wolf

Flash memory is a non-volatile computer memory comprised of blocks of cells, wherein each cell can take on q different levels corresponding to the number of electrons it contains. Increasing the cell level is easy; however, reducing a cell…

Information Theory · Computer Science 2015-03-13 Eitan Yaakobi , Alexander Vardy , Paul H. Siegel , Jack K. Wolf

Flash memory is a non-volatile computer memory comprised of blocks of cells, wherein each cell can take on q different values or levels. While increasing the cell level is easy, reducing the level of a cell can be accomplished only by…

Information Theory · Computer Science 2009-05-12 Hessam Mahdavifar , Paul H. Siegel , Alexander Vardy , Jack K. Wolf , Eitan Yaakobi

This paper constructs WOM codes that combine rewriting and error correction for mitigating the reliability and the endurance problems in flash memory. We consider a rewriting model that is of practical interest to flash applications where…

Information Theory · Computer Science 2015-02-03 Eyal En Gad , Wentao Huang , Yue Li , Jehoshua Bruck

Recently, flash memories have become a competitive solution for mass storage. The flash memories have rather different properties compared with the rotary hard drives. That is, the writing of flash memories is constrained, and flash…

Information Theory · Computer Science 2016-11-17 Xudong Ma

The current flash memory technology focuses on the cost minimization of its static storage capacity. However, the resulting approach supports a relatively small number of program-erase cycles. This technology is effective for consumer…

Information Theory · Computer Science 2015-01-05 Eyal En Gad , Eitan Yaakobi , Anxiao , Jiang , Jehoshua Bruck

Flash memory is a non-volatile computer memory comprised of blocks of cells, wherein each cell is implemented as either NAND or NOR floating gate. NAND flash is currently the most widely used type of flash memory. In a NAND flash memory,…

Information Theory · Computer Science 2009-11-23 Anxiao , Jiang , Robert Mateescu , Eitan Yaakobi , Jehoshua Bruck , Paul H. Siegel , Alexander Vardy , Jack K. Wolf

This paper investigates the design and application of write-once memory (WOM) codes for flash memory storage. Using ideas from Merkx ('84), we present a construction of WOM codes based on finite Euclidean geometries over $\mathbb{F}_2$.…

Information Theory · Computer Science 2012-06-26 Kathryn Haymaker , Christine A. Kelley

Flash memory is well-known for its inherent asymmetry: the flash-cell charge levels are easy to increase but are hard to decrease. In a general rewriting model, the stored data changes its value with certain patterns. The patterns of data…

Information Theory · Computer Science 2016-11-17 Anxiao , Jiang , Michael Langberg , Moshe Schwartz , Jehoshua Bruck

The most important challenge in the scaling down of flash memory is its increased inter-cell interference (ICI). If side information about ICI is known to the encoder, the flash memory channel can be viewed as similar to Costa's "writing on…

Information Theory · Computer Science 2015-02-11 Yongjune Kim , B. V. K. Vijaya Kumar

In this paper, we propose a construction of non-binary WOM (Write-Once-Memory) codes for WOM storages such as flash memories. The WOM codes discussed in this paper are fixed rate WOM codes where messages in a fixed alphabet of size $M$ can…

Information Theory · Computer Science 2018-02-14 Yoju Fujino , Tadashi Wadayama

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…

Information Theory · Computer Science 2020-12-09 Ahmed Hareedy , Beyza Dabak , Robert Calderbank

Flash memory is a write-once medium in which reprogramming cells requires first erasing the block that contains them. The lifetime of the flash is a function of the number of block erasures and can be as small as several thousands. To…

Information Theory · Computer Science 2015-04-23 Eitan Yaakobi , Alexander Yucovich , Gal Maor , Gala Yadgar

Erasure codes play an important role in storage systems to prevent data loss. In this work, we study a class of erasure codes called Multi-Erasure Locally Recoverable Codes (ME-LRCs) for flash memory array. Compared to previous related…

Information Theory · Computer Science 2017-01-24 Pengfei Huang , Eitan Yaakobi , Paul H. Siegel

We propose locally rewritable codes (LWC) for resistive memories inspired by locally repairable codes (LRC) for distributed storage systems. Small values of repair locality of LRC enable fast repair of a single failed node since the lost…

The limits of pushing storage density to the atomic scale are explored with a memory that stores a bit by the presence or absence of one silicon atom. These atoms are positioned at lattice sites along self-assembled tracks with a pitch of 5…

The read channel of a Flash memory cell degrades after repetitive program and erase (P/E) operations. This degradation is often modeled as a function of the number of P/E cycles. In contrast, this paper models the degradation as a function…

Information Theory · Computer Science 2016-10-13 Haobo Wang , Nathan Wong , Tsung-Yi Chen , Richard D. Wesel

A write-once memory (wom) is a storage medium formed by a number of ``write-once'' bit positions (wits), where each wit initially is in a `0' state and can be changed to a `1' state irreversibly. Examples of write-once memories include SLC…

Information Theory · Computer Science 2010-01-05 Yunnan Wu , Anxiao Jiang

Flash-based disk caches, for example Bcache and Flashcache, has gained tremendous popularity in industry in the last decade because of its low energy consumption, non-volatile nature and high I/O speed. But these cache systems have a worse…

Operating Systems · Computer Science 2023-11-16 Chaos Dong , Fang Wang , Jianshun Zhang
‹ Prev 1 2 3 10 Next ›