Magnetic tape storage boosted by advanced reed solomon decoding method
Anchored Iterative Decoding of Reed-Solomon Product Codes for High-Rate Magnetic Tape Storage
Information Theory
Summary
Magnetic tape storage needs very reliable data correction to keep information safe. The authors present a new way to decode data using a special kind of Reed-Solomon error correction code that can fix many errors even when the raw error rate is quite high. They improve how the decoder handles tricky cases where errors could cause confusion or get stuck. Their method keeps running decoding steps until no more changes happen, which reduces errors significantly while working efficiently on normal laptops and has designs for faster hardware use.
What this means in practice
- •For data storage engineers: Improve magnetic tape drives by implementing the new decoding method to achieve ultra-low error rates while handling common damage scenarios like dead tracks.
- •For hardware accelerator developers: Design hybrid FPGA-CPU systems to speed up Reed-Solomon product code decoding using the proposed iterative and anchor decoding techniques.
Authors
Alexander Chvanov, Nikolay Malkovsky
Abstract
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)\times RS(175, 173)$ in a BSC we achieve post-decoding bit error rate (BER) of $10^{-20}$ at $\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\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.