Multi-Tier Coding for Magnetic Tape Error Correction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional tape drive storage systems face challenges in efficiently correcting errors, particularly random, burst, and large block errors, due to limitations in existing error correction mechanisms.
Innovation Solution
A three-tier coding scheme is implemented, utilizing Low Density Parity Check (LDPC) type codewords, M-blocks parity, and an erasure code, where LDPC type decoders are enhanced by Viterbi type detectors and iterative processing, with the erasure code providing redundancy to correct un-converged codewords.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional error correction mechanisms are used in magnetic tape storage, then device complexity is reduced, but error correction capability (particularly for random, burst, and large block errors) is insufficient
Solution Approach 1:
The patent segments the error correction process into three distinct tiers: first-tier LDPC decoding for initial error correction, second-tier block parity decoding for un-converged codewords, and third-tier erasure code decoding for remaining errors. This segmentation allows each tier to specialize in correcting specific types of errors, thereby improving overall error correction capability while managing system complexity through modular architecture.
Solution Approach 2:
The patent implements a nested multi-tier coding structure where erasure code blocks contain multiple block parity groups, which in turn contain multiple LDPC codeword blocks. This nested arrangement enables hierarchical error correction where inner tiers correct errors that outer tiers cannot resolve, achieving comprehensive error protection through layered redundancy.
2Reliability
If a three-tier coding scheme is implemented, then error correction capability is improved, but processing time and computational complexity increase
Solution Approach 1:
The patent applies preliminary action by performing first-tier LDPC decoding on all codeword blocks before proceeding to subsequent tiers. This preliminary error correction handles the majority of errors early in the process, reducing the burden on later tiers and minimizing overall processing time. The block parity and erasure code tiers are only activated for un-converged codewords, avoiding redundant computation.
Solution Approach 2:
The patent implements partial action by applying different levels of correction effort to different codeword blocks. First-tier LDPC decoding is applied universally, while second-tier block parity and third-tier erasure code decoding are selectively applied only to un-converged codewords. This selective approach reduces average processing time while maintaining high data integrity for all blocks.
3Productivity
If multiple tracks are used to increase storage capacity, then productivity is improved, but error propagation across tracks increases reliability issues
Solution Approach 1:
The patent segments data across multiple tracks, with each track containing a portion of the multi-tier coded data. This track-level segmentation isolates errors to specific tracks, preventing error propagation across the entire storage medium. Each track can be independently decoded and corrected, maintaining reliability while enabling high-capacity multi-track storage.
Data Source
AI summary
A data storage device is disclosed comprising at least one head configured to access a magnetic tape. Data is read from the magnetic tape to generate a read signal which is processed to decode a first M blocks of low density parity check (LDPC) type codewords using a LDPC type decoder. First un-converged codewords out of the first M blocks are decoded using a first M-blocks parity, and second un-converged codewords out of the first M blocks are decoded using an erasure code.