IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Online ISSN : 1745-1337
Print ISSN : 0916-8508
Special Section on Information Theory and Its Applications
Double-Stack Erasure-Filled Channel and Level-By-Level Error Correction
Hironori UCHIKAWAManabu HAGIWARA
Author information
JOURNAL FREE ACCESS

2025 Volume E108.A Issue 3 Pages 376-383

Details
Abstract

Racetrack memory is a new type of high-capacity memory that stores data in magnetic nanowires called racetracks. Data is transferred through the nanowires to the access port for reading and writing. However, the data transfer process is imperfect and can lead to errors. Inspired by racetrack memory array architecture, the authors propose a new channel model in which missing data is filled with erasures at the end of the racetrack. Channel capacity and symmetric information rate for the proposed channel, a double-stack erasure-filled (DSEF) channel, are derived. Since the DSEF channel is a quaternary-input septenary-output channel, constructing good error-correcting codes is not trivial. We decompose the DSEF channel into two binary-input ternary-output channels to overcome this difficulty. This decomposition allowed us to construct an adequate error-correction scheme using existing binary codes, which is a meaningful achievement in terms of implementation.

References (19)
Content from these authors
© 2025 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top