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

Variable cyclic redundancy character detector

Assignee: Bull HN Information Systems Inc
•
Filing: 1976-07-02
•
Granted: 1977-08-23
•
Expires: 1996-07-02
📄 Original PDF 🌐 Google Patents 🔄 Sync Now

Abstract

Abstract The invention disclosed reduces unrecoverable read errors from a magnetic tape resulting from the apparent lack of a cyclic check character (CCC), sometimes referred to as a cyclic redundancy check character, or a longitudinal check character (LCC), sometimes referred to as a longitudinal redundancy check character. The detector provides a variable read window to synchronize receipt of the CCC and/or LCC with their associated data blocks even though the CCC and/or LCC was not written in the appropriate time frame called for by the write specification of the tape in question.

Inventors

  • 👤 Edward R. Besenfelder
  • 👤 Jack L. Gooding

Bibliographic Details

Application Number —
Jurisdiction US
Data Source google_patents
Last Synchronized 2026-10-26 11:16
CPC Classifications
G; G06; G06F; G06F11/00; G06F11/07; G06F11/14; G11; G11B; G11B20/00; G11B20/10; G11B20/18

Claims Analysis

Total Claims: 8
Claim 1
Independent Claim 211 words
A variable cyclic redundancy character detector for use in a magnetic tape unit used in a data processing system comprising: a. discrimination means for determining whether data or a blank was read from the magnetic tape and what type coding was used in writing the data on the magnetic tape; b. data shifting means connected to the discrimination means for aligning and shifting the data read from the magnetic tape, the data shifting means further comprising a plurality of data registers; c. logic means connected to the data shifting means for determining if the cyclic redundancy character has been read, where it is in the data shifting means, and whether or not the cyclic redundancy character was a blank; d. control signal means connected to the logic means for providing the necessary signals to the logic means to interpret the data being read from the magnetic tape; e. counting means connected to the logic means for varying the time frame for looking for the cyclic redundancy character from the magnetic tape; f. parity checking means connected to the data shifting means for determining the validity of the data read from the magnetic tape and for generating a signal each time a byte of data is read from the data shifting means.
Claim 2
Dependent Claim 211 words
A variable cyclic redundancy character detector for use in a magnetic tape unit used in a data processing system comprising: a. discrimination means for determining whether data or a blank was read from the magnetic tape and what type coding was used in writing the data on the magnetic tape; b. data shifting means connected to the discrimination means for aligning and shifting the data read from the magnetic tape, the data shifting means further comprising a plurality of data registers; c. logic means connected to the data shifting means for determining if the cyclic redundancy character has been read, where it is in the data shifting means, and whether or not the cyclic redundancy character was a blank; d. control signal means connected to the logic means for providing the necessary signals to the logic means to interpret the data being read from the magnetic tape; e. counting means connected to the logic means for varying the time frame for looking for the cyclic redundancy character from the magnetic tape; f. parity checking means connected to the data shifting means for determining the validity of the data read from the magnetic tape and for generating a signal each time a byte of data is read from the data shifting means.
Claim 3
Dependent Claim 52 words
The variable cyclic redundancy character detector of claim 1, wherein the discrimination means further comprises: comparison means for determining if a logical one has been written in at least one bit of the data byte, and; tape interpretation means for determining the coding standard used in writing data on the magnetic tape.
Claim 4
Dependent Claim 60 words
A variable cyclic redundancy character detector as recited in claim 1, wherein the counting means further comprises: a loadable, programmable counter; decoding means responsive to a selected plurality of the counter's outputs for providing an output signal only if a predetermined number has been counted and a non-blank cyclic redundancy character has not been read prior to the predetermined count.
Claim 5
Dependent Claim 40 words
The variable cyclic redundancy character detector of claim 1, wherein the data shifting means further comprises: a plurality of data registers selectively responsive to control signals for aligning data; and a plurality of intermediate registers for storing the aligned data.
Claim 6
Dependent Claim 74 words
The variable cyclic redundancy character detector of claim 1, wherein the parity checking means further comprises: an arithmetic unit for performing the appropriate algorithm on the data from the data shifting means to calculate the cyclic redundancy character value; parity logic gates for determining the parity of the cyclic redundancy character; and error indication means for indicating when the cyclic redundancy character read from the magnetic tape is not the same as that calculated.
Claim 7
Independent Claim 189 words
A method of reducing unrecoverable read errors from magnetic tape generally associated with data processing system comprising: a. reading the data record from the magnetic tape; b. aligning each bit of the data byte in parallel; c. detecting whether one or more of the bits of the data byte is a logical one; d. preparing for the reading of a cyclic redundancy character when step c) above indicates an all zero byte; e. inserting a blank cyclic redundancy character if a cyclic redundancy character is not read within a preset number of byte spaces after the last non-zero data byte; f. comparing the computed value of the cyclic redundancy character with the cyclic redundancy character actually read; g. repeating steps a) through f) on the same data record with a different preset number inserted in step e), if the computed cyclic redundancy character value is not equal to the actual cyclic redundancy character value; h. repeating steps a) through g) until the correct cyclic redundancy character is read or it is determined that the data block is invalid; and, i. reading the next data record from the magnetic tape.
Claim 8
Independent Claim 189 words
A method of reducing unrecoverable read errors from magnetic tape generally associated with data processing system comprising: a. reading the data record from the magnetic tape; b. aligning each bit of the data byte in parallel; c. detecting whether one or more of the bits of the data byte is a logical one; d. preparing for the reading of a cyclic redundancy character when step c) above indicates an all zero byte; e. inserting a blank cyclic redundancy character if a cyclic redundancy character is not read within a preset number of byte spaces after the last non-zero data byte; f. comparing the computed value of the cyclic redundancy character with the cyclic redundancy character actually read; g. repeating steps a) through f) on the same data record with a different preset number inserted in step e), if the computed cyclic redundancy character value is not equal to the actual cyclic redundancy character value; h. repeating steps a) through g) until the correct cyclic redundancy character is read or it is determined that the data block is invalid; and, i. reading the next data record from the magnetic tape.

References Cited (Backward Citations)

US3519988A Cited
US3670304A Cited
US3708783A Cited
US3725861A Cited
US3774154A Cited
US3812531A Cited
US3792436A Cited
US3789400A Cited
US3882459A Cited

USPTO Annuity & Maintenance Windows

Annuity Stage Window Opens Payment Deadline Surcharge Period Until Estimated Fee Status
3.5 Years (Year 4) 1980-08-22 1981-02-21 1981-08-23 $2000.00 Window Closed / Lapsed
7.5 Years (Year 8) 1984-08-22 1985-02-21 1985-08-23 $3760.00 Window Closed / Lapsed
11.5 Years (Year 12) 1988-08-22 1989-02-21 1989-08-23 $7700.00 Window Closed / Lapsed

Assigned Categories & Tags

No categories assigned to this patent yet.

Assign Category Tag