Code Generation Limiting Maximum and Minimum Hamming Distances for Non-Volatile Memories
-
- KOJO Tatsuro
- Dept. of Computer Science and Communications Engineering, Waseda University
-
- TAWADA Masashi
- Dept. of Computer Science and Communications Engineering, Waseda University
-
- YANAGISAWA Masao
- Dept. of Computer Science and Communications Engineering, Waseda University
-
- TOGAWA Nozomu
- Dept. of Computer Science and Communications Engineering, Waseda University
Abstract
Data stored in non-volatile memories may be destructed due to crosstalk and radiation but we can restore their data by using error-correcting 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.
Journal
-
- IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
-
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences E98.A (12), 2484-2493, 2015
The Institute of Electronics, Information and Communication Engineers
- Tweet
Keywords
Details
-
- CRID
- 1390282681289133312
-
- NII Article ID
- 130005111994
-
- ISSN
- 17451337
- 09168508
-
- Text Lang
- en
-
- Data Source
-
- JaLC
- Crossref
- CiNii Articles
-
- Abstract License Flag
- Disallowed