Code generation limiting maximum and minimum hamming distances for non-volatile memories

    研究成果: Article

    2 引用 (Scopus)

    抜粋

    Data stored in non-volatile memories may be destructed due to crosstalk and radiation but we can restore their data by using errorcorrecting codes. However, non-volatile memories consume a large amount of energy in writing. How to reduce maximum writing bits even using error-correcting codes is one of the challenges in non-volatile memory design. In this paper, we first propose Doughnut code which is based on state encoding limiting maximum and minimum Hamming distances. After that, we propose a code expansion method, which improves maximum and minimum Hamming distances. When we apply our code expansion method to Doughnut code, we can obtain a code which reduces maximum-flipped bits and has error-correcting ability equal to Hamming code. Experimental results show that the proposed code efficiently reduces the number of maximum-writing bits.

    元の言語English
    ページ(範囲)2484-2493
    ページ数10
    ジャーナルIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    E98A
    発行部数12
    DOI
    出版物ステータスPublished - 2015 12 1

    ASJC Scopus subject areas

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

    フィンガープリント Code generation limiting maximum and minimum hamming distances for non-volatile memories' の研究トピックを掘り下げます。これらはともに一意のフィンガープリントを構成します。

  • これを引用