TY - GEN
T1 - A write-reducing and error-correcting code generation method for non-volatile memories
AU - Kojo, Tatsuro
AU - Tawada, Masashi
AU - Yanagisawa, Masao
AU - Togawa, Nozomu
PY - 2015/2/5
Y1 - 2015/2/5
N2 - 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 writing bits even using error-correcting codes is one of the challenges in non-volatile memory design. In this paper, we propose a new write-reducing and error-correcting code, called Doughnut code. Doughnut code is based on state encoding limiting maximum and minimum Hamming distances. After that, we propose a code expansion method, which improves minimum and maximum Hamming distances by expanding a write-reducing code. When we apply our code expansion method to Doughnut code, we can obtain a write-reducing code whose error-correcting ability is equal to Hamming code. Experimental results show that the proposed write-reducing code reduces the number of writing bits by up to 36% compared to Hamming code.
AB - 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 writing bits even using error-correcting codes is one of the challenges in non-volatile memory design. In this paper, we propose a new write-reducing and error-correcting code, called Doughnut code. Doughnut code is based on state encoding limiting maximum and minimum Hamming distances. After that, we propose a code expansion method, which improves minimum and maximum Hamming distances by expanding a write-reducing code. When we apply our code expansion method to Doughnut code, we can obtain a write-reducing code whose error-correcting ability is equal to Hamming code. Experimental results show that the proposed write-reducing code reduces the number of writing bits by up to 36% compared to Hamming code.
UR - http://www.scopus.com/inward/record.url?scp=84937934262&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84937934262&partnerID=8YFLogxK
U2 - 10.1109/APCCAS.2014.7032780
DO - 10.1109/APCCAS.2014.7032780
M3 - Conference contribution
AN - SCOPUS:84937934262
T3 - IEEE Asia-Pacific Conference on Circuits and Systems, Proceedings, APCCAS
SP - 304
EP - 307
BT - 2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2014 IEEE Asia Pacific Conference on Circuits and Systems, APCCAS 2014
Y2 - 17 November 2014 through 20 November 2014
ER -