The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Dans les mémoires d'hippodrome (RM), une erreur de position (erreur d'insertion ou de suppression) résulte d'une lecture instable des données. Pour les erreurs de position dans RM avec plusieurs têtes de lecture (RH), nous proposons un système codé LDPC basé sur un protographe spécifié par un protographe et une permutation prenant en compte le protographe. La permutation prenant en compte les protographes facilite la conception et l'analyse du système codé. En résolvant un problème d'optimisation multi-objectifs, le système codé atteint les propriétés d'un décodage à convergence rapide, d'un bon seuil de décodage et d'une croissance de distance minimale linéaire. De plus, le système codé peut s’adapter à un nombre variable d’HR sans aucune modification. Les seuils de décodage asymptotique avec un nombre limité d'itérations vérifient les bonnes propriétés du système. De plus, pour différents nombres de RH, les résultats de simulation avec un petit et un grand nombre d'itérations présentent d'excellentes performances de décodage, à la fois avec des longueurs de blocs courtes et longues, et sans planchers d'erreur.
Ryo SHIBATA
Tokyo University of Science
Gou HOSOYA
Tokyo University of Science
Hiroyuki YASHIMA
Tokyo University of Science
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copier
Ryo SHIBATA, Gou HOSOYA, Hiroyuki YASHIMA, "Protograph-Based LDPC Coded System for Position Errors in Racetrack Memories" in IEICE TRANSACTIONS on Fundamentals,
vol. E102-A, no. 10, pp. 1340-1350, October 2019, doi: 10.1587/transfun.E102.A.1340.
Abstract: In racetrack memories (RM), a position error (insertion or deletion error) results from unstable data reading. For position errors in RM with multiple read-heads (RHs), we propose a protograph-based LDPC coded system specified by a protograph and a protograph-aware permutation. The protograph-aware permutation facilitates the design and analysis of the coded system. By solving a multi-objective optimization problem, the coded system attains the properties of fast convergence decoding, a good decoding threshold, and a linear minimum distance growth. In addition, the coded system can adapt to varying numbers of RHs without any modification. The asymptotic decoding thresholds with a limited number of iterations verify the good properties of the system. Furthermore, for varying numbers of RHs, the simulation results with both small and large number of iterations, exhibit excellent decoding performances, both with short and long block lengths, and without error floors.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E102.A.1340/_p
Copier
@ARTICLE{e102-a_10_1340,
author={Ryo SHIBATA, Gou HOSOYA, Hiroyuki YASHIMA, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Protograph-Based LDPC Coded System for Position Errors in Racetrack Memories},
year={2019},
volume={E102-A},
number={10},
pages={1340-1350},
abstract={In racetrack memories (RM), a position error (insertion or deletion error) results from unstable data reading. For position errors in RM with multiple read-heads (RHs), we propose a protograph-based LDPC coded system specified by a protograph and a protograph-aware permutation. The protograph-aware permutation facilitates the design and analysis of the coded system. By solving a multi-objective optimization problem, the coded system attains the properties of fast convergence decoding, a good decoding threshold, and a linear minimum distance growth. In addition, the coded system can adapt to varying numbers of RHs without any modification. The asymptotic decoding thresholds with a limited number of iterations verify the good properties of the system. Furthermore, for varying numbers of RHs, the simulation results with both small and large number of iterations, exhibit excellent decoding performances, both with short and long block lengths, and without error floors.},
keywords={},
doi={10.1587/transfun.E102.A.1340},
ISSN={1745-1337},
month={October},}
Copier
TY - JOUR
TI - Protograph-Based LDPC Coded System for Position Errors in Racetrack Memories
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 1340
EP - 1350
AU - Ryo SHIBATA
AU - Gou HOSOYA
AU - Hiroyuki YASHIMA
PY - 2019
DO - 10.1587/transfun.E102.A.1340
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E102-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2019
AB - In racetrack memories (RM), a position error (insertion or deletion error) results from unstable data reading. For position errors in RM with multiple read-heads (RHs), we propose a protograph-based LDPC coded system specified by a protograph and a protograph-aware permutation. The protograph-aware permutation facilitates the design and analysis of the coded system. By solving a multi-objective optimization problem, the coded system attains the properties of fast convergence decoding, a good decoding threshold, and a linear minimum distance growth. In addition, the coded system can adapt to varying numbers of RHs without any modification. The asymptotic decoding thresholds with a limited number of iterations verify the good properties of the system. Furthermore, for varying numbers of RHs, the simulation results with both small and large number of iterations, exhibit excellent decoding performances, both with short and long block lengths, and without error floors.
ER -