← Back to Patent Explorer
US5255272A Expired / Lapsed US ⏱️ 0.0 years remaining

Predictive tape drive error correction apparatus

Assignee: Storage Technology Corp
•
Filing: 1991-02-25
•
Granted: 1993-10-19
•
Expires: 2011-02-25
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The error correction apparatus of this invention maintains a set of pointers which are used to supplement the error correction characters written into the data tracks of the data frame. These pointers consist of indicators stored in a memory that note the location and nature of errors detected in the present data frame or in previous data frames read from the magnetic tape and stored in a buffer memory. The pointer information can be used by the error correction circuitry to determine which tracks typically produce the errors in the data frame. The error correction circuitry can then generate error patterns which can be combined with the data read and reread from the buffer to correct the errors contained therein.

Inventors

  • 👤 Richard A. Gill
  • 👤 Christopher P. Zook

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-11-07 18:00
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/08; G06F11/10; G06F11/1076; G06F11/1008; G11; G11B; G11B20/00; G11B20/10; G11B20/18; G11B20/1806; G11B20/1813; G11B20/20; H; H03; H03M; H03M13/00

Claims Analysis

Total Claims: 18
Claim 1
Independent Claim 126 words
A method of correcting errors in a data transmission that contains a plurality of sequential data frames, wherein each data frame consists of a plurality of tracks of data, comprising the steps of: storing said plurality of tracks of data in a memory for a presently received one of said plurality of data frames; generating pointers indicative of detected data errors in said presently received data frame; recording said generated pointers for each sequentially received data frame; generating error patterns indicative of said detected errors for said presently received data frame using said pointers for said presently received data frame and previously received ones of said data frames; and correcting said stored tracks of data in said presently received data frame using said generated error patterns.
Claim 2
Independent Claim 126 words
A method of correcting errors in a data transmission that contains a plurality of sequential data frames, wherein each data frame consists of a plurality of tracks of data, comprising the steps of: storing said plurality of tracks of data in a memory for a presently received one of said plurality of data frames; generating pointers indicative of detected data errors in said presently received data frame; recording said generated pointers for each sequentially received data frame; generating error patterns indicative of said detected errors for said presently received data frame using said pointers for said presently received data frame and previously received ones of said data frames; and correcting said stored tracks of data in said presently received data frame using said generated error patterns.
Claim 3
Dependent Claim 36 words
The method of claim 1 wherein said step of correcting includes the step of: combining said generated error patterns with said stored tracks of data for said presently received data frame in an exclusive OR operation.
Claim 4
Dependent Claim 28 words
The method of claim 1 wherein said step of recording including the step of: skew detection of a bad track of data in said presently received data frame.
Claim 5
Dependent Claim 29 words
The method of claim 1 wherein said step of recording includes the step of: detecting illegal 9-bit data in the data frame format in said presently received data frame.
Claim 6
Dependent Claim 25 words
The method of claim 1 wherein said step of recording includes the step of: detecting non-sync bytes of data in said presently received data frame.
Claim 7
Dependent Claim 27 words
The method of claim 1 wherein said step of recording includes the step of: detecting non-zero bytes in format prefix groups of said presently received data frame.
Claim 8
Dependent Claim 50 words
The method of claim 1 wherein said step of recording includes the step of: writing an indication of a detected error into a memory location in a track-in-error memory corresponding to the one of said tracks of data in which said detected error occurred in said presently received data frame.
Claim 9
Dependent Claim 40 words
The method of claim 7 wherein said step of recording further includes the step of: reading said indications from all of said memory locations in said track-in-error memory corresponding to said tracks of data in said presently received data frame.
Claim 10
Dependent Claim 107 words
Apparatus for correcting errors in a data transmission that consists of a plurality of sequential data frames, wherein each data frame includes a plurality of data tracks, comprising: means for deskewing data tracks received from said data transmission; means for storing said deskewed data tracks in a memory for a presently received one of said plurality of data frames; means for generating pointers indicative of detected data errors in said presently received deskewed data frame; means for storing said generated pointers for each sequentially received data frame; and means for correcting said stored deskewed data tracks for said presently received deskewed data frame using said stored pointers.
Claim 11
Dependent Claim 107 words
Apparatus for correcting errors in a data transmission that consists of a plurality of sequential data frames, wherein each data frame includes a plurality of data tracks, comprising: means for deskewing data tracks received from said data transmission; means for storing said deskewed data tracks in a memory for a presently received one of said plurality of data frames; means for generating pointers indicative of detected data errors in said presently received deskewed data frame; means for storing said generated pointers for each sequentially received data frame; and means for correcting said stored deskewed data tracks for said presently received deskewed data frame using said stored pointers.
Claim 12
Dependent Claim 57 words
The apparatus of claim 9 wherein said correcting means includes: means for generating an error pattern for said presently received deskewed data frame using said stored pointers for said presently received deskewed data frame and stored pointers for previously received ones of said data frames, indicative of said data transmission errors in each of said data tracks.
Claim 13
Dependent Claim 30 words
The apparatus of claim 10 wherein said correcting means further includes: means for combining said generated error patterns with said stored data tracks of said presently received deskewed data frame.
Claim 14
Dependent Claim 29 words
The apparatus of claim 11 wherein said correcting means further includes: means for storing said combined stored data tracks as corrected data for said presently received deskewed data frame.
Claim 15
Dependent Claim 31 words
The apparatus of claim 9 wherein said pointer storing means includes: means for detecting data transmission errors in each of said received data tracks of said presently received deskewed data frame.
Claim 16
Dependent Claim 35 words
The apparatus of claim 13 wherein said detecting means includes: vertical syndrome means for detecting parity errors across the same bit position in all of said data tracks of said presently received deskewed data frame.
Claim 17
Dependent Claim 39 words
The apparatus of claim 14 wherein said detecting means further includes: diagonal syndrome means for detecting parity errors across bit positions that differ in successive ones of all of said data tracks of said presently received deskewed data frame.
Claim 18
Dependent Claim 43 words
The apparatus of claim 15 wherein said detecting means further includes: means responsive to said vertical and diagonal syndrome means for generating pointers indicative of the ones of said data tracks in said presently received deskewed data frame that contain data transmission errors.

References Cited (Backward Citations)

US3745528A Cited
USRE28923E Cited
US3774154A Cited
USRE30187E Cited
US4201976A Cited
US4205324A Cited
US4433415A Cited
US4884274A Cited
US4870645A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1996-10-18 1997-04-19 1997-10-19 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 2000-10-18 2001-04-19 2001-10-19 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 2004-10-18 2005-04-19 2005-10-19 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag