Performance Analysis and Code Design for Resistive Random-Access Memory Using Channel Decomposition Approach
Fuente:
arXiv
Guardado en:
| Autores principales: | , , , , |
|---|---|
| Formato: | Preprint |
| Publicado: |
2024
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
| _version_ | 1866916514444083200 |
|---|---|
| author | Song, Guanghui Gao, Meiru Li, Ying Dai, Bin Cai, Kui |
| author_facet | Song, Guanghui Gao, Meiru Li, Ying Dai, Bin Cai, Kui |
| contents | A novel framework for performance analysis and code design is proposed to address the sneak path (SP) problem in resistive random-access memory (ReRAM) arrays. The main idea is to decompose the ReRAM channel, which is both non-ergodic and data-dependent, into multiple stationary memoryless channels. A finite-length performance bound is derived by analyzing the capacity and dispersion of these stationary memoryless channels. Furthermore, leveraging this channel decomposition, a practical sparse-graph code design is proposed using density evolution. The obtained channel codes are not only asymptotic capacity approaching but also close to the derived finite-length performance bound. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2412_06275 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | Performance Analysis and Code Design for Resistive Random-Access Memory Using Channel Decomposition Approach Song, Guanghui Gao, Meiru Li, Ying Dai, Bin Cai, Kui Information Theory A novel framework for performance analysis and code design is proposed to address the sneak path (SP) problem in resistive random-access memory (ReRAM) arrays. The main idea is to decompose the ReRAM channel, which is both non-ergodic and data-dependent, into multiple stationary memoryless channels. A finite-length performance bound is derived by analyzing the capacity and dispersion of these stationary memoryless channels. Furthermore, leveraging this channel decomposition, a practical sparse-graph code design is proposed using density evolution. The obtained channel codes are not only asymptotic capacity approaching but also close to the derived finite-length performance bound. |
| title | Performance Analysis and Code Design for Resistive Random-Access Memory Using Channel Decomposition Approach |
| topic | Information Theory |
| url | https://arxiv.org/abs/2412.06275 |