IP Library › Granted Patent US 10,379,756
Granted Patent B2
US 10,379,756 · App. 15/380,983 · Granted Aug 13, 2019

Logical format utilizing lateral encoding of data for storage on magnetic tape

Inventors: Roy D. Cideciyan (Rueschlikon, CH); Simeon Furrer (Altdorf, CH); Ernest S. Gale (Tucson, AZ); Mark A. Lantz (Adliswil, CH)
Assignee: International Business Machines Corporation
G06F3/0619G06F3/064G06F3/0655G06F3/0682G06F11/1076H03M13/27H03M13/2909H03M13/1515
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 10,379,756
App. No.
15/380,983
Granted
Aug 13, 2019
Kind
B2
Abstract

In one embodiment, a method includes receiving data to store to a magnetic tape medium using a tape drive, the data being organized into a predetermined number of two-dimensional arrays, each two-dimensional array including a plurality of narrow-spread (NS) codewords positioned orthogonally to a plurality of wide-spread (WS) codewords (relative spread referring to space occupied on the magnetic tape medium when written). The method also includes successively writing each of the NS codewords onto a plurality of tracks of the magnetic tape medium using a first number of channels of the tape drive capable of writing data to tape tracks simultaneously. A first NS codeword from a first two-dimensional array is completely written to the magnetic tape medium prior to starting to write a second NS codeword from the first two-dimensional array. Also, the plurality of NS codewords are protected with a stronger encoding than the plurality of WS codewords.

Claims (43)

1. A tape drive, comprising:

a plurality of write head elements;

a processing circuit; and

logic integrated with the processing circuit, executable by the processing circuit, or integrated with and executable by the processing circuit, the logic being configured to cause the processing circuit to:

receive data to store to a magnetic tape medium using the plurality of write head elements, the data being organized into a predetermined number of two-dimensional arrays, each two-dimensional array comprising a plurality of narrow-spread (NS) codewords positioned orthogonally to a plurality of wide-spread (WS) codewords; and

successively write each of the NS codewords onto a plurality of tracks of the magnetic tape medium using a first number of the plurality of write head elements capable of writing data to tape tracks simultaneously, wherein a first NS codeword from a first two-dimensional array is completely written to the magnetic tape medium prior to starting to write a second NS codeword from the first two-dimensional array,

wherein the plurality of NS codewords are protected with a stronger encoding than the plurality of WS codewords.

2. The tape drive as recited in claim 1 , wherein the stronger encoding is based on a higher correctable percentage of erroneous symbols in a NS codeword as compared to a correctable percentage of erroneous symbols in a WS codeword.

3. The tape drive as recited in claim 1 , wherein the stronger encoding is based on T2/N2 being greater than T1/N1, wherein T1 equals floor(P1/2), N1 equals a length of a WS codeword, P1 is a WS codeword parity length and equals the WS codeword length minus a WS data word length, and wherein T2 equals floor(P2/2), N2 equals a length of a NS codeword, P2 is a NS codeword parity length and equals the NS codeword length minus a NS data word length.

4. The tape drive as recited in claim 3 , wherein more than one symbol of each NS codeword is written to each of the plurality of tracks of the magnetic tape medium, and wherein a WS codeword after being written to the magnetic tape medium occupies at least (N1−1) times as much distance on the magnetic tape medium in a longitudinal direction than a NS codeword after being written to the magnetic tape medium.

5. The tape drive as recited in claim 1 , wherein the logic further causes the processing circuit to:

encode a data set using two Reed-Solomon (RS) codes to produce the plurality of NS codewords and the plurality of WS codewords positioned orthogonally to each other within the predetermined number of two-dimensional arrays that represent the data set,

wherein each NS codeword comprises a different portion of the data set and parity produced from the different portion of the data set.

6. The tape drive as recited in claim 1 , wherein the logic further causes the processing circuit to:

byte-interleave a predetermined number of NS codewords together using a NS block interleaver to form byte-interleaved NS codewords prior to successively writing each of the NS codewords onto the plurality of tracks of the magnetic tape medium,

wherein a number of bytes along each track of the plurality of tracks of the magnetic tape medium occupied by the byte-interleaved NS codewords is a multiple of a number of bytes occupied by a single NS codeword multiplied by the predetermined number of NS codewords byte-interleaved together, and

wherein the predetermined number of NS codewords byte-interleaved together is in an inclusive range from 2 to 8.

7. A method for providing low-latency narrow-spread symbols to a decoder to drive timing recovery, the method comprising:

receiving data to store to a magnetic tape medium using a tape drive, the data being organized into a predetermined number of two-dimensional arrays, each two-dimensional array comprising a plurality of narrow-spread (NS) codewords positioned orthogonally to a plurality of wide-spread (WS) codewords; and

successively writing each of the NS codewords onto a plurality of tracks of the magnetic tape medium using a first number of channels of the tape drive capable of writing data to tape tracks simultaneously, wherein a first NS codeword from a first two-dimensional array is completely written to the magnetic tape medium prior to starting to write a second NS codeword from the first two-dimensional array,

wherein the plurality of NS codewords are protected with a stronger encoding than the plurality of WS codewords.

8. The method as recited in claim 7 , wherein the stronger encoding is based on a higher correctable percentage of erroneous symbols in a NS codeword as compared to a correctable percentage of erroneous symbols in a WS codeword.

9. The method as recited in claim 7 , wherein the stronger encoding is based on T2/N2 being greater than T1/N1, wherein T1 equals floor(P1/2), N1 equals a length of a WS codeword, P1 is a WS codeword parity length and equals the WS codeword length minus a WS data word length, and wherein T2 equals floor(P2/2), N2 equals a length of a NS codeword, P2 is a NS codeword parity length and equals the NS codeword length minus a NS data word length.

10. The method as recited in claim 9 , wherein more than one symbol of each NS codeword is written to each of the plurality of tracks of the magnetic tape medium, and wherein a WS codeword after being written to the magnetic tape medium occupies at least (N1−1) times as much distance on the magnetic tape medium in a longitudinal direction than a NS codeword after being written to the magnetic tape medium.

11. The method as recited in claim 7 , further comprising:

encoding a data set using two Reed-Solomon (RS) codes to produce the plurality of NS codewords and the plurality of WS codewords positioned orthogonally to each other within the predetermined number of two-dimensional arrays that represent the data set, wherein each NS codeword comprises a different portion of the data set and parity produced from the different portion of the data set.

12. The method as recited in claim 7 , further comprising:

byte-interleaving a predetermined number of NS codewords together using a NS block interleaver to form byte-interleaved NS codewords prior to successively writing each of the NS codewords onto the plurality of tracks of the magnetic tape medium, wherein a number of bytes along each track of the plurality of tracks of the magnetic tape medium occupied by the byte-interleaved NS codewords is a multiple of a number of bytes occupied by a single NS codeword multiplied by the predetermined number of NS codewords byte-interleaved together, and wherein the predetermined number of NS codewords byte-interleaved together is in an inclusive range from 2 to 8.

13. The method as recited in claim 7 , wherein the plurality of NS codewords are written along a number of tracks of the magnetic tape medium equal to a maximum number of tracks that the tape drive is configured to write simultaneously.

14. A computer program product, the computer program product comprising a computer readable storage medium having program instructions embodied therewith, the embodied program instructions being executable by a processing circuit to cause the processing circuit to:

receive, by the processing circuit, data to store to a magnetic tape medium using a tape drive, the data being organized into a predetermined number of two-dimensional arrays, each two-dimensional array comprising a plurality of narrow-spread (NS) codewords positioned orthogonally to a plurality of wide-spread (WS) codewords; and

successively write, by the processing circuit, each of the NS codewords onto a plurality of tracks of the magnetic tape medium using a first number of channels of the tape drive capable of writing data to tape tracks simultaneously, wherein a first NS codeword from a first two-dimensional array is completely written to the magnetic tape medium prior to starting to write a second NS codeword from the first two-dimensional array,

wherein the plurality of NS codewords are protected with a stronger encoding than the plurality of WS codewords.

15. The computer program product as recited in claim 14 , wherein the stronger encoding is based on a higher correctable percentage of erroneous symbols in a NS codeword as compared to a correctable percentage of erroneous symbols in a WS codeword.

16. The computer program product as recited in claim 14 , wherein the stronger encoding is based on T2/N2 being greater than T1/N1, wherein T1 equals floor(P1/2), N1 equals a length of a WS codeword, P1 is a WS codeword parity length and equals the WS codeword length minus a WS data word length, and wherein T2 equals floor(P2/2), N2 equals a length of a NS codeword, P2 is a NS codeword parity length and equals the NS codeword length minus a NS data word length.

17. The computer program product as recited in claim 16 , wherein more than one symbol of each NS codeword is written to each of the plurality of tracks of the magnetic tape medium, and wherein a WS codeword after being written to the magnetic tape medium occupies at least (N1−1) times as much distance on the magnetic tape medium in a longitudinal direction than a NS codeword after being written to the magnetic tape medium.

18. The computer program product as recited in claim 14 , wherein the embodied program instructions are further executable by the processing circuit to cause the processing circuit to:

encode, by the processing circuit, a data set using two Reed-Solomon (RS) codes to produce the plurality of NS codewords and the plurality of WS codewords positioned orthogonally to each other within the predetermined number of two-dimensional arrays that represent the data set, wherein each NS codeword comprises a different portion of the data set and parity produced from the different portion of the data set.

19. The computer program product as recited in claim 14 , wherein the embodied program instructions are further executable by the processing circuit to cause the processing circuit to:

byte-interleave, by the processing circuit, a predetermined number of NS codewords together using a NS block interleaver to form byte-interleaved NS codewords prior to successively writing each of the NS codewords onto the plurality of tracks of the magnetic tape medium,

wherein a number of bytes along each track of the plurality of tracks of the magnetic tape medium occupied by the byte-interleaved NS codewords is a multiple of a number of bytes occupied by a single NS codeword multiplied by the predetermined number of NS codewords byte-interleaved together, and

wherein the predetermined number of NS codewords byte-interleaved together is in an inclusive range from 2 to 8.

20. The computer program product as recited in claim 14 , wherein the plurality of NS codewords are written along a number of tracks of the magnetic tape medium equal to a maximum number of tracks that the tape drive is configured to write simultaneously.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Dec 16, 2016
From: CIDECIYAN, ROY D.; FURRER, SIMEON; GALE, ERNEST S.; LANTZ, MARK A.
To: INTERNATIONAL BUSINESS MACHINES CORPORATION
Reel/Frame 040642/0019 →
Continuity (1)
Related Publication 20180173439A1 · Jun 21, 2018