跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2611.09366 · v1

Anchored Iterative Decoding of Reed-Solomon Product Codes for High-Rate Magnetic Tape Storage

首次提交 2026-11-06 20:04
版本更新 2026-11-06 20:04
雷达观测 2026-11-09 11:19
arXiv ↗PDF ↗

摘要

We present a decoding algorithm for a Reed--Solomon product code targeted at the demanding reliability requirements of modern magnetic tape storage. For a code RS(256,224)×RS(175,173)RS(256, 224)\times RS(175, 173) in a BSC we achieve post-decoding bit error rate (BER) of 10−2010^{-20} at ≈5.3×10−3\approx 5.3\times 10^{-3} raw BER while maintaining the common requirement to detect and correct 4 out of 32 dead tracks. We resolve two common problems of miscorrections and stall patterns that arise under such a high raw BER via simplified versions of anchor decoding and binary image analysis. The highest efficiency is achieved by performing an unlimited iterative decoder, which performs decoding iterations until no changes are made. We give an empirical analysis of the average number of iterations: below the raw BER of 5×10−35\times 10^{-3}, four half-iterations are performed on average while improving substantially over a decoder that always performs 4 half-iterations. We provide a CPU implementation achieving 100-200 megabytes/s single-core throughput on a regular laptop and a design of a potential hybrid FPGA-CPU implementation of our decoder.

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

目前只收录了一个版本。收录下一版后,可以对照标题、作者、分类和摘要。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v1 · 2026-11-06 20:04 · 最新观测版本

Anchored Iterative Decoding of Reed-Solomon Product Codes for High-Rate Magnetic Tape Storage

We present a decoding algorithm for a Reed--Solomon product code targeted at the demanding reliability requirements of modern magnetic tape storage. For a code RS(256,224)×RS(175,173)RS(256, 224)\times RS(175, 173) in a BSC we achieve post-decoding bit error rate (BER) of 10−2010^{-20} at ≈5.3×10−3\approx 5.3\times 10^{-3} raw BER while maintaining the common requirement to detect and correct 4 out of 32 dead tracks. We resolve two common problems of miscorrections and stall patterns that arise under such a high raw BER via simplified versions of anchor decoding and binary image analysis. The highest efficiency is achieved by performing an unlimited iterative decoder, which performs decoding iterations until no changes are made. We give an empirical analysis of the average number of iterations: below the raw BER of 5×10−35\times 10^{-3}, four half-iterations are performed on average while improving substantially over a decoder that always performs 4 half-iterations. We provide a CPU implementation achieving 100-200 megabytes/s single-core throughput on a regular laptop and a design of a potential hybrid FPGA-CPU implementation of our decoder.

查看此版本解读 →查看此版本原文 ↗