# US 10,120,599 B2 · Low latency lateral decoding of data for retrieval from magnetic tape

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 10,120,599 B2
- Document ID: US10120599B2
- Status: Granted
- Kind: B2
- Application number: 15/380,987
- Filed: 2016-12-15
- Published: 2018-06-21
- Granted: 2018-11-06
- Earliest claimed: 2016-12-15
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Roy D. Cideciyan; Simeon Furrer; Ernest S. Gale; Mark A. Lantz
- Web page: https://patentgrep.com/patent/US10120599B2

## CPC

- G06F 3/0619: {in relation to data integrity, e.g. data losses, bit errors}
- G06F 3/064: {Management of blocks}
- G06F 3/0655: {Vertical data movement, i.e. input-output transfer; data movement between one or more hosts and one or more storage devices}
- G06F 3/0682: {Tape device}
- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- H03M 13/1515: {Reed-Solomon codes}
- H03M 13/27: using interleaving techniques
- H03M 13/2909: {Product codes}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- H03M: CODING; DECODING; CODE CONVERSION IN GENERAL (using fluidic means F15C4/00; optical analogue/digital converters G02F7/00; coding, decoding or code conversion, specially adapted for particular applications, see the relevant subclasses, e.g. G01D, G01R, G06F, G06T, G09G, G10L, G11B, G11C, H04B, H04L, H04M, H04N; ciphering or deciphering for cryptography or other purposes involving the need for secrecy G09C)

## Abstract

In one embodiment, a method includes reading a plurality of narrow-spread (NS) codewords from M tracks of a magnetic tape medium using a plurality of read elements, the plurality of NS codewords collectively comprising data logically organized as a predetermined number of two-dimensional arrays. Each two-dimensional array includes a predetermined number of NS codewords positioned orthogonally to a predetermined number of wide-spread (WS) codewords, with a first NS codeword from a first two-dimensional array being read in its entirety from the magnetic tape medium prior to reading a second NS codeword from the first two-dimensional array. The method also includes laterally decoding each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium in succession prior to decoding any WS codewords from the first two-dimensional array. The NS codewords are protected with a stronger encoding than the WS codewords within each two-dimensional array.

## Claims

### Claim 1

A tape drive, comprising:
a plurality of read 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:
read a plurality of narrow-spread (NS) codewords from M tracks of a magnetic tape medium using the plurality of read elements, the plurality of NS codewords collectively comprising data logically organized as a predetermined number of two-dimensional arrays, each two-dimensional array comprising a predetermined number of NS codewords positioned orthogonally to a predetermined number of wide-spread (WS) codewords, wherein a first NS codeword from a first two-dimensional array is read in its entirety from the magnetic tape medium prior to reading a second NS codeword from the first two-dimensional array; and
laterally decode each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium in succession prior to decoding any WS codewords from the first two-dimensional array,
wherein the predetermined number of NS codewords within each two-dimensional array are protected with a stronger encoding than the predetermined number of WS codewords within each two-dimensional array.

### Claim 2 (depends on 1)

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.

### Claim 3 (depends on 1)

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.

### Claim 4 (depends on 3)

The tape drive as recited in claim 3, wherein more than one symbol of the first NS codeword from the first two-dimensional array is read from each of the M tracks of the magnetic tape medium, and wherein a WS codeword stored 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 stored to the magnetic tape medium.

### Claim 5 (depends on 1)

The tape drive as recited in claim 1, wherein the logic further causes the processing circuit to:
reiterate the lateral decoding of each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium and decoding of each WS codeword from the first two-dimensional array.

### Claim 6 (depends on 1)

The tape drive as recited in claim 1, wherein the logic further causes the processing circuit to:
perform one or more digital front-end (DFE) functions on each of the M tracks of data read from the magnetic tape medium on a per-channel basis prior to laterally decoding each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium; and
perform soft detection on each of the M tracks of data read from the magnetic tape medium on the per-channel basis prior to laterally decoding each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium,
wherein bit decisions from performance of the soft detection are used in a first pass of performing the one or more DFE functions, and
wherein bit decisions from the lateral decoding of each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium are used in each subsequent pass of performing the one or more DFE functions.

### Claim 7 (depends on 6)

The tape drive as recited in claim 6, wherein the one or more DFE functions are selected from a group comprising: asymmetry cancellation, adaptive equalization, timing control, and gain adjustment.

### Claim 8 (depends on 1)

The tape drive as recited in claim 1, wherein the logic further causes the processing circuit to:
perform soft detection on each of the M tracks of data read from the magnetic tape medium on a per-channel basis prior to laterally decoding each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium,
wherein bit decisions from performance of the soft detection are used in each pass of performing one or more digital front-end (DFE) functions on each of the M tracks of data read from the magnetic tape medium subsequent to a first pass.

### Claim 9

A method, comprising:
reading a plurality of narrow-spread (NS) codewords from M tracks of a magnetic tape medium using a plurality of read elements, the plurality of NS codewords collectively comprising data logically organized as a predetermined number of two-dimensional arrays, each two-dimensional array comprising a predetermined number of NS codewords positioned orthogonally to a predetermined number of wide-spread (WS) codewords, wherein a first NS codeword from a first two-dimensional array is read in its entirety from the magnetic tape medium prior to reading a second NS codeword from the first two-dimensional array; and
laterally decoding each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium in succession prior to decoding any WS codewords from the first two-dimensional array,
wherein the predetermined number of NS codewords within each two-dimensional array are protected with a stronger encoding than the predetermined number of WS codewords within each two-dimensional array.

### Claim 10 (depends on 9)

The method as recited in claim 9, 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.

### Claim 11 (depends on 9)

The method as recited in claim 9, 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.

### Claim 12 (depends on 11)

The method as recited in claim 11, wherein more than one symbol of each NS codeword is read from each of the M tracks of the magnetic tape medium, and wherein a WS codeword stored 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 stored to the magnetic tape medium.

### Claim 13 (depends on 9)

The method as recited in claim 9, further comprising:
reiterating the lateral decoding of each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium and decoding of each WS codeword from the first two-dimensional array.

### Claim 14 (depends on 9)

The method as recited in claim 9, further comprising:
performing one or more digital front-end (DFE) functions on each of the M tracks of data read from the magnetic tape medium on a per-channel basis prior to laterally decoding each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium; and
performing soft detection on each of the M tracks of data read from the magnetic tape medium on the per-channel basis prior to laterally decoding each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium,
wherein bit decisions from performance of the soft detection are used in a first pass of performing the one or more DFE functions, and
wherein bit decisions from the lateral decoding of each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium are used in each subsequent pass of performing the one or more DFE functions.

### Claim 15 (depends on 14)

The method as recited in claim 14, wherein the one or more DFE functions are selected from a group comprising: asymmetry cancellation, adaptive equalization, timing control, and gain adjustment.

### Claim 16 (depends on 9)

The method as recited in claim 9, further comprising:
performing soft detection on each of the M tracks of data read from the magnetic tape medium on a per-channel basis prior to laterally decoding each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium,
wherein bit decisions from performance of the soft detection are used in each pass of performing one or more digital front-end (DFE) functions on each of the M tracks of data read from the magnetic tape medium subsequent to a first pass.

### Claim 17

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:
cause, by the processing circuit, reading of a plurality of narrow-spread (NS) codewords from M tracks of a magnetic tape medium using a plurality of read elements, the plurality of NS codewords collectively comprising data logically organized as a predetermined number of two-dimensional arrays, each two-dimensional array comprising a predetermined number of NS codewords positioned orthogonally to a predetermined number of wide-spread (WS) codewords, wherein a first NS codeword from a first two-dimensional array is read in its entirety from the magnetic tape medium prior to reading a second NS codeword from the first two-dimensional array; and
laterally decode, by the processing circuit, each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium in succession prior to decoding any WS codewords from the first two-dimensional array,
wherein the predetermined number of NS codewords within each two-dimensional array are protected with a stronger encoding than the predetermined number of WS codewords within each two-dimensional array.

### Claim 18 (depends on 17)

The computer program product as recited in claim 17, 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.

### Claim 19 (depends on 17)

The computer program product as recited in claim 17, 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.

### Claim 20 (depends on 19)

The computer program product as recited in claim 19, wherein more than one symbol of the first NS codeword from the first two-dimensional array is read from each of the M tracks of the magnetic tape medium, and wherein a WS codeword stored 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 stored to the magnetic tape medium.

### Claim 21 (depends on 17)

The computer program product as recited in claim 17, wherein the embodied program instructions are further executable by the processing circuit to cause the processing circuit to:
reiterate, by the processing circuit, the lateral decoding of each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium and decoding of each WS codeword from the first two-dimensional array.

### Claim 22 (depends on 17)

The computer program product as recited in claim 17, wherein the embodied program instructions are further executable by the processing circuit to cause the processing circuit to:
perform, by the processing circuit, one or more digital front-end (DFE) functions on each of the M tracks of data read from the magnetic tape medium on a per-channel basis prior to laterally decoding each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium; and
perform, by the processing circuit, soft detection on each of the M tracks of data read from the magnetic tape medium on the per-channel basis prior to laterally decoding each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium,
wherein bit decisions from performance of the soft detection are used in a first pass of performing the one or more DFE functions, and
wherein bit decisions from the lateral decoding of each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium are used in each subsequent pass of performing the one or more DFE functions.

### Claim 23 (depends on 22)

The computer program product as recited in claim 22, wherein the one or more DFE functions are selected from a group comprising: asymmetry cancellation, adaptive equalization, timing control, and gain adjustment.

### Claim 24 (depends on 17)

The computer program product as recited in claim 17, wherein the embodied program instructions are further executable by the processing circuit to cause the processing circuit to:
perform, by the processing circuit, soft detection on each of the M tracks of data read from the magnetic tape medium on a per-channel basis prior to laterally decoding each NS codeword from the first two-dimensional array read from the M tracks of the magnetic tape medium,
wherein bit decisions from performance of the soft detection are used in each pass of performing one or more digital front-end (DFE) functions on each of the M tracks of data read from the magnetic tape medium subsequent to a first pass.
