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

    Fingerprint

    Hamming distance
    Code Generation
    Hamming Distance
    Minimum Distance
    Limiting
    Data storage equipment
    Error-correcting Codes
    Crosstalk
    Hamming Code
    Radiation
    Code generation
    Encoding
    Experimental Results
    Energy

    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

    Cite this

    @article{aad82d60bea34403a0087dc272db025c,
    title = "Code generation limiting maximum and minimum hamming distances for non-volatile memories",
    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.",
    keywords = "Code expansion, Doughnut code, Error-correcting codes, Maximum-writing bits, Non-volatile memory",
    author = "Tatsuro Kojo and Masashi Tawada and Masao Yanagisawa and Nozomu Togawa",
    year = "2015",
    month = "12",
    day = "1",
    doi = "10.1587/transfun.E98.A.2484",
    language = "English",
    volume = "E98A",
    pages = "2484--2493",
    journal = "IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences",
    issn = "0916-8508",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "12",

    }

    TY - JOUR

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

    AU - Kojo, Tatsuro

    AU - Tawada, Masashi

    AU - Yanagisawa, Masao

    AU - Togawa, Nozomu

    PY - 2015/12/1

    Y1 - 2015/12/1

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

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

    KW - Code expansion

    KW - Doughnut code

    KW - Error-correcting codes

    KW - Maximum-writing bits

    KW - Non-volatile memory

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

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

    U2 - 10.1587/transfun.E98.A.2484

    DO - 10.1587/transfun.E98.A.2484

    M3 - Article

    AN - SCOPUS:84948690804

    VL - E98A

    SP - 2484

    EP - 2493

    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 - 12

    ER -