A relaxed bit-write-reducing and error-correcting code for non-volatile memories

    Research output: Contribution to journalArticle

    Abstract

    Non-volatile memories are a promising alternative to memory design but data stored in them still may be destructed due to crosstalk and radiation. The data stored in them can be restored by using error-correcting codes but they require extra bits to correct bit errors. One of the largest problems in non-volatile memories is that they consume ten to hundred times more energy than normal memories in bit-writing. It is quite necessary to reduce writing bits. Recently, a REC code (bit-write-reducing and error-correcting code) is proposed for non-volatile memories which can reduce writing bits and has a capability of error correction. The REC code is generated from a linear systematic error-correcting code but it must include the codeword of all 1's, i.e., 11 ··· 1. The codeword bit length must be longer in order to satisfy this condition. In this letter, we propose a method to generate a relaxed REC code which is generated from a relaxed error-correcting code, which does not necessarily include the codeword of all 1's and thus its codeword bit length can be shorter. We prove that the maximum flipping bits of the relaxed REC code is still limited theoretically. Experimental results show that the relaxed REC code efficiently reduce the number of writing bits.

    Original languageEnglish
    Pages (from-to)1045-1052
    Number of pages8
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE101A
    Issue number7
    DOIs
    Publication statusPublished - 2018 Jul 1

    Keywords

    • Bit-write-reducing
    • Cluster graph
    • Clustering conditions
    • Error-correcting codes
    • Non-volatile memory
    • Relaxed REC code
    • S-bit flip conditions
    • S-bound graph

    ASJC Scopus subject areas

    • Signal Processing
    • Computer Graphics and Computer-Aided Design
    • Electrical and Electronic Engineering
    • Applied Mathematics

    Fingerprint Dive into the research topics of 'A relaxed bit-write-reducing and error-correcting code for non-volatile memories'. Together they form a unique fingerprint.

  • Cite this