Back to Search
Start Over
Rewritable Storage Channels with Hidden State.
- Source :
- IEEE Journal on Selected Areas in Communications; May2014, Vol. 32 Issue 5, p815-824, 10p
- Publication Year :
- 2014
-
Abstract
- Many storage channels admit reading and rewriting of the content at a given cost. We consider rewritable channels with a hidden state which models the unknown characteristics of the memory cell. In addition to mitigating the effect of write noise, rewrites can help the write controller obtain a better estimate of the hidden state. The paper has two contributions. The first is a lower bound on the capacity of a general rewritable channel with hidden state. The lower bound is obtained using a coding scheme that combines Gelfand-Pinsker coding with superposition coding. The rewritable AWGN channel is discussed as an example. The second contribution is a simple coding scheme for a rewritable channel where the write noise and hidden state are both uniformly distributed. It is shown that this scheme is asymptotically optimal as the number of rewrites gets large. [ABSTRACT FROM PUBLISHER]
Details
- Language :
- English
- ISSN :
- 07338716
- Volume :
- 32
- Issue :
- 5
- Database :
- Complementary Index
- Journal :
- IEEE Journal on Selected Areas in Communications
- Publication Type :
- Academic Journal
- Accession number :
- 95720825
- Full Text :
- https://doi.org/10.1109/JSAC.2014.140502