Joint Iterative decoding of spatially coupled low-density parity-check codes for position errors in racetrack memories

Ryo Shibata, Gou Hosoya, Hiroyuki Yashima

Research output: Contribution to journalArticle

4 Citations (Scopus)

Abstract

Racetrack memory (RM) has attracted much attention. In RM, insertion and deletion (ID) errors occur as a result of an unstable reading process and are called position errors. In this paper, we first define a probabilistic channel model of ID errors in RM with multiple read-heads (RHs). Then, we propose a joint iterative decoding algorithm for spatially coupled low-density parity-check (SC-LDPC) codes over such a channel. We investigate the asymptotic behaviors of SC-LDPC codes under the proposed decoding algorithm using density evolution (DE).With DE, we reveal the relationship between the number of RHs and achievable information rates, along with the iterative decoding thresholds. The results show that increasing the number of RHs provides higher decoding performances, although the proposed decoding algorithm requires each codeword bit to be read only once regardless of the number of RHs. Moreover, we show the performance improvement produced by adjusting the order of the SC-LDPC codeword bits in RM.

Original languageEnglish
Pages (from-to)2055-2063
Number of pages9
JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
VolumeE101A
Issue number12
DOIs
Publication statusPublished - 2018 Dec
Externally publishedYes

Keywords

  • Forward-backward algorithm
  • Insertion and deletion errors
  • Iterative decoding
  • Spatially coupled low-density parity-check code

ASJC Scopus subject areas

  • Signal Processing
  • Computer Graphics and Computer-Aided Design
  • Electrical and Electronic Engineering
  • Applied Mathematics

Fingerprint Dive into the research topics of 'Joint Iterative decoding of spatially coupled low-density parity-check codes for position errors in racetrack memories'. Together they form a unique fingerprint.

  • Cite this