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

    研究成果: Article

    抄録

    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.

    元の言語English
    ページ(範囲)1045-1052
    ページ数8
    ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    E101A
    発行部数7
    DOI
    出版物ステータスPublished - 2018 7 1

    Fingerprint

    Error-correcting Codes
    Data storage equipment
    Systematic Error
    Crosstalk
    Error Correction
    Radiation
    Necessary
    Alternatives
    Systematic errors
    Experimental Results
    Error correction
    Energy

    Keywords

      ASJC Scopus subject areas

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

      これを引用

      @article{1820c4316f394f31aba91470f6378d74,
      title = "A relaxed bit-write-reducing and error-correcting code for non-volatile memories",
      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.",
      keywords = "Bit-write-reducing, Cluster graph, Clustering conditions, Error-correcting codes, Non-volatile memory, Relaxed REC code, S-bit flip conditions, S-bound graph",
      author = "Tatsuro Kojo and Masashi Tawada and Masao Yanagisawa and Nozomu Togawa",
      year = "2018",
      month = "7",
      day = "1",
      doi = "10.1587/transfun.E101.A.1045",
      language = "English",
      volume = "E101A",
      pages = "1045--1052",
      journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
      issn = "0916-8508",
      publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
      number = "7",

      }

      TY - JOUR

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

      AU - Kojo, Tatsuro

      AU - Tawada, Masashi

      AU - Yanagisawa, Masao

      AU - Togawa, Nozomu

      PY - 2018/7/1

      Y1 - 2018/7/1

      N2 - 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.

      AB - 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.

      KW - Bit-write-reducing

      KW - Cluster graph

      KW - Clustering conditions

      KW - Error-correcting codes

      KW - Non-volatile memory

      KW - Relaxed REC code

      KW - S-bit flip conditions

      KW - S-bound graph

      UR - http://www.scopus.com/inward/record.url?scp=85049387373&partnerID=8YFLogxK

      UR - http://www.scopus.com/inward/citedby.url?scp=85049387373&partnerID=8YFLogxK

      U2 - 10.1587/transfun.E101.A.1045

      DO - 10.1587/transfun.E101.A.1045

      M3 - Article

      VL - E101A

      SP - 1045

      EP - 1052

      JO - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      JF - IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

      SN - 0916-8508

      IS - 7

      ER -