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

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    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.

    Original languageEnglish
    Pages (from-to)2484-2493
    Number of pages10
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE98A
    Issue number12
    DOIs
    Publication statusPublished - 2015 Dec 1

    Keywords

    • Code expansion
    • Doughnut code
    • Error-correcting codes
    • Maximum-writing bits
    • Non-volatile memory

    ASJC Scopus subject areas

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

    Fingerprint Dive into the research topics of 'Code generation limiting maximum and minimum hamming distances for non-volatile memories'. Together they form a unique fingerprint.

  • Cite this