English
Related papers

Related papers: Endurance-Limited Memories: Capacity and Codes

200 papers

Large language models (LLMs) are central to modern natural language processing, delivering exceptional performance in various tasks. However, their substantial computational and memory requirements present challenges, especially for devices…

This paper presents and analyzes a novel concatenated coding scheme for enabling error resilience in two distributed storage settings: one being storage using existing regenerating codes and the second being storage using locally repairable…

Information Theory · Computer Science 2013-12-12 Natalia Silberstein , Ankit Singh Rawat , Sriram Vishwanath

Memory-augmented neural networks consisting of a neural controller and an external memory have shown potentials in long-term sequential learning. Current RAM-like memory models maintain memory accessing every timesteps, thus they do not…

Machine Learning · Computer Science 2019-03-21 Hung Le , Truyen Tran , Svetha Venkatesh

Regenerating codes are a class of codes proposed for providing reliability of data and efficient repair of failed nodes in distributed storage systems. In this paper, we address the fundamental problem of handling errors and erasures during…

Information Theory · Computer Science 2015-03-20 K. V. Rashmi , Nihar B. Shah , Kannan Ramchandran , P. Vijay Kumar

In this work we continue the study of a new class of codes, called \emph{codes over graphs}. Here we consider storage systems where the information is stored on the edges of a complete directed graph with $n$ nodes. The failure model we…

Information Theory · Computer Science 2017-09-15 Lev Yohananov , Eitan Yaakobi

This paper presents flexible storage codes, a class of error-correcting codes that can recover information from a flexible number of storage nodes. As a result, one can make a better use of the available storage nodes in the presence of…

Information Theory · Computer Science 2021-06-23 Weiqi Li , Zhiying Wang , Taiting Lu , Hamid Jafarkhani

We introduce a new approach to proving that a sequence of deterministic linear codes achieves capacity on an erasure channel under maximum a posteriori decoding. Rather than relying on the precise structure of the codes our method exploits…

Information Theory · Computer Science 2016-01-19 Shrinivas Kudekar , Santhosh Kumar , Marco Mondelli , Henry D. Pfister , Eren Şaşoğlu , Rüdiger Urbanke

In this paper, we study a class of spatially coupled turbo codes, namely partially information- and partially parity-coupled turbo codes. This class of codes enjoy several advantages such as flexible code rate adjustment by varying the…

Information Theory · Computer Science 2020-12-25 Min Qiu , Xiaowei Wu , Alexandre Graell i Amat , Jinhong Yuan

State-of-the-art models are now trained with billions of parameters, reaching hardware limits in terms of memory consumption. This has created a recent demand for memory-efficient optimizers. To this end, we investigate the limits and…

Machine Learning · Computer Science 2019-02-14 Xinyi Chen , Naman Agarwal , Elad Hazan , Cyril Zhang , Yi Zhang

Inefficient data transfer between computation and memory inspired emerging processing-in-memory (PIM) technologies. Many PIM solutions enable storage and processing using memristors in a crossbar-array structure, with techniques such as…

Hardware Architecture · Computer Science 2021-05-11 Orian Leitersdorf , Ben Perach , Ronny Ronen , Shahar Kvatinsky

This work deals with error correction for non-volatile memories that are partially defective at some levels. Such memory cells can only store incomplete information since some of their levels cannot be utilized entirely due to, e.g.,…

Information Theory · Computer Science 2022-08-23 Haider Al Kim , Kai Jie Chan

Physical Unclonable Functions (PUFs) based on Non-Volatile Memory (NVM) technology have emerged as a promising solution for secure authentication and cryptographic applications. By leveraging the multi-level cell (MLC) characteristic of…

Cryptography and Security · Computer Science 2025-01-14 Hassan Nassar , Ming-Liang Wei , Chia-Lin Yang , Jörg Henkel , Kuan-Hsun Chen

Data shaping is a coding technique that has been proposed to increase the lifetime of flash memory devices. Several data shaping codes have been described in recent work, including endurance codes and direct shaping codes for structured…

Information Theory · Computer Science 2017-04-20 Yi Liu , Pengfei Huang , Paul H. Siegel

The error correcting performance of multi-level-cell (MLC) NAND flash memory is closely related to the block length of error correcting codes (ECCs) and log-likelihood-ratios (LLRs) of the read-voltage thresholds. Driven by this issue, this…

Information Theory · Computer Science 2020-04-14 Cheng Wang , Kang Wei , Lingjun Kong , Long Shi , Zhen Mei , Jun Li , Kui Cai

Continual learning, the ability of a model to learn over time without forgetting previous knowledge and, therefore, be adaptive to new data, is paramount in dynamic fields such as disease outbreak prediction. Deep neural networks, i.e.,…

Machine Learning · Computer Science 2024-01-18 Saba Aslam , Abdur Rasool , Hongyan Wu , Xiaoli Li

Large Language Models (LLMs) have shown strong potential in accelerating digital hardware design through automated code generation. Yet, ensuring their reliability remains a critical challenge, as existing LLMs trained on massive…

Machine Learning · Computer Science 2025-12-08 Yiwen Liang , Qiufeng Li , Shikai Wang , Weidong Cao

Many recent models in software engineering introduced deep neural models based on the Transformer architecture or use transformer-based Pre-trained Language Models (PLM) trained on code. Although these models achieve the state of the arts…

Software Engineering · Computer Science 2022-04-22 Rishab Sharma , Fuxiang Chen , Fatemeh Fard , David Lo

Theoretical analysis has long indicated that feedback improves the error exponent but not the capacity of single-user memoryless channels. Recently Polyanskiy et al. studied the benefit of variable-length feedback with termination (VLFT)…

Information Theory · Computer Science 2013-02-26 Tsung-Yi Chen , Adam R. Williamson , Richard D. Wesel

In interactive coding, Alice and Bob wish to compute some function $f$ of their individual private inputs $x$ and $y$. They do this by engaging in an interactive protocol to jointly compute $f(x,y)$. The goal is to do this in an…

Data Structures and Algorithms · Computer Science 2023-09-12 Meghal Gupta , Rachel Yun Zhang

The increasing use of Non-Volatile Memory (NVM) in computer architecture has brought about new challenges, one of which is the write endurance problem. Frequent writes to a particular cache cell in NVM can lead to degradation of the memory…

Hardware Architecture · Computer Science 2024-10-22 Keshav Krishna , Ayush Verma