Time–Space Constrained Codes for Phase-Change Memories

DOI10.1109/TIT.2013.2257916MaRDI QIDQ5346435zbMATH OpenFDO

Authors Minghai Qin, Eitan Yaakobi, Paul Siegel

Publication date 8 June 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1207.4530

Mathematics Subject Classification ID

Communication theory (94A05) Other types of codes (94B60)

Abstract: Phase-change memory (PCM) is a promising non-volatile solid-state memory technology. A PCM cell stores data by using its amorphous and crystalline states. The cell changes between these two states using high temperature. However, since the cells are sensitive to high temperature, it is important, when programming cells, to balance the heat both in time and space. In this paper, we study the time-space constraint for PCM, which was originally proposed by Jiang et al. A code is called an emph{$$-constrained code} if for any $alpha$ consecutive rewrites and for any segment of $$ contiguous cells, the total rewrite cost of the $$ cells over those $alpha$ rewrites is at most $p$. Here, the cells are binary and the rewrite cost is defined to be the Hamming distance between the current and next memory states. First, we show a general upper bound on the achievable rate of these codes which extends the results of Jiang et al. Then, we generalize their construction for $$-constrained codes and show another construction for $$-constrained codes. Finally, we show that these two constructions can be used to construct codes for all values of $alpha$, $$, and $p$.

This page was built for publication: Time–Space Constrained Codes for Phase-Change Memories

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346435)