TU3.R3.2

Upper Bound on Coding Rate over Resistive Random-Access Memory Channel under Arbitrary Input Distribution

Guanghui Song, Qi Cao, Ying Li, Xidian University, China; Xuan He, Southwest Jiaotong University, China; Kui Cai, Singapore University of Technology and Design, Singapore

Session:
Codes for Storage 3

Track:
2: Modern Coding Theory

Location:
Ypsilon IV-V-VI

Presentation Time:
Tue, 9 Jul, 14:45 - 15:05

Session Chair:
Sihem Mesnager, Paris 8
Abstract
The achievable rate of code over resistive random-access memory (ReRAM) channel with finite selector failures was published in our recent work. The rate was derived under the assumption of independent and identically distributed (i.i.d.) input. In this work, focusing on the ReRAM channel in the case of single selector failure, we derive an upper bound on achievable rate under arbitrary input distribution. This upper bound is within 0.02 bits from the achievable rate of i.i.d. input, indicating that i.i.d. is very close to optimal for large memory arrays.
Resources