CUED Publications database

Rewritable storage channels with hidden state

Venkataramanan, R and Tatikonda, S and Lastras, L and Franceschini, M (2014) Rewritable storage channels with hidden state. IEEE Journal on Selected Areas in Communications, vol. 32, no. 5, pp. 815-824, May 2014, 32. pp. 815-824. ISSN 0733-8716 (Unpublished)

Full text not available from this repository.


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

Item Type: Article
Uncontrolled Keywords: cs.IT cs.IT math.IT
Divisions: Div F > Signal Processing and Communications
Depositing User: Cron Job
Date Deposited: 17 Jul 2017 20:16
Last Modified: 07 Mar 2019 13:07
DOI: 10.1109/JSAC.2014.140502