# US 2003/0123173 A1 · Method and apparatus for encoding data to guarantee isolated transitions in a magnetic recording system

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

- Number: US 2003/0123173 A1
- Document ID: US20030123173A1
- Status: Published application
- Kind: A1
- Application number: 10/037,753
- Filed: 2002-01-02
- Published: 2003-07-03
- Earliest claimed: 2002-01-02
- Assignees: International Business Machine Corporation
- Inventors: Mario Blaum; Glen Alan Jaquette; Brian Harry Marcus; Constantin Michael Melas
- Web page: https://patentgrep.com/patent/US20030123173A1

## CPC

- G11B 20/10009: {Improvement or modification of read or write signals}
- G11B 20/1426: {conversion to or from block codes or representations thereof}
- G11B 5/00813: {magnetic tapes}
- G11B 5/09: Digital recording
- G11B 2020/1434: {8 to 9 modulation}
- G11B 2020/1446: {16 to 17 modulation}
- G11B: INFORMATION STORAGE BASED ON RELATIVE MOVEMENT BETWEEN RECORD CARRIER AND TRANSDUCER (recording measured values in a way that does not require playback through a transducer G01D9/00; recording or playback apparatus using mechanically marked tape, e.g. punched paper tape, or using unit records, e.g. punched or magnetically marked cards G06K; transferring data from one type of record carrier to another G06K1/18; circuits for coupling output of reproducer to radio receiver H04B1/20; gramophone pick-ups or like acoustic electromechanical transducers or circuits therefor H04R)

## Abstract

Provided is a method, system, and program for storing input groups of uncoded binary data on a storage medium. A plurality of uncoded data blocks in a data stream are received. An encoded data stream is obtained from concatenating successive encoded blocks such that the encoded data stream includes a predetermined bit pattern comprising a plurality of bits. The bit pattern always occurs within a first number of bits and two occurrences of a “1” or “0” occur within a second number of bits. The encoded data blocks are stored on the storage medium.

## Claims

### Claim 1

A method for storing input groups of uncoded binary data on a storage medium, comprising:
receiving a plurality of uncoded data blocks in a data stream;
generating one corresponding encoded data block for each uncoded data block, wherein an encoded data stream obtained from concatenating successive encoded blocks includes a predetermined bit pattern comprising a plurality of bits, wherein the bit pattern always occurs within a first number of bits and two occurrences of a “1” and “0” occur within a second number of bits; and
storing the encoded data stream on the storage medium.

### Claim 2 (depends on 1)

The method of claim 1, wherein the first number is greater than the second number.

### Claim 3 (depends on 1)

The method of claim 1, wherein the predetermined bit pattern represents a maximum amplitude peak in a constrained waveform that is guaranteed to occur within the first number of bits.

### Claim 4 (depends on 1)

The method of claim 1, wherein the encoded data blocks are generated using an encoder table.

### Claim 5 (depends on 1)

The method of claim 1, wherein decoding the encoded data block by determining the decoded data block corresponding to the encoded data block.

### Claim 6 (depends on 1)

The method of claim 1, wherein the encoding function is performed by a finite state code.

### Claim 7 (depends on 6)

The method of claim 6, wherein one encoded data block corresponds to multiple uncoded data blocks, and wherein a value of at least one adjacent block is used to determine the uncoded data block that corresponds to the encoded data block corresponding to multiple uncoded data blocks.

### Claim 8 (depends on 1)

The method of claim 1, wherein the predetermined bit pattern comprises “010”, each uncoded data block comprises eight bits, and each encoded data block comprises nine bits.

### Claim 9 (depends on 8)

The method of claim 8, wherein the first number comprises twelve and the second number comprises six.

### Claim 10 (depends on 1)

The method of claim 1, wherein the predetermined bit pattern comprises “010”, wherein each uncoded data block comprises sixteen bits and wherein each encoded data block comprises seventeen bits.

### Claim 11 (depends on 10)

The method of claim 10, wherein the first number comprises twenty bits and the second number comprises fourteen bits.

### Claim 12 (depends on 10)

The method of claim 10, wherein a correspondence of uncoded to encoded data blocks comprises a finite state code scheme.

### Claim 13 (depends on 1)

The method of claim 1, wherein the predetermined bit pattern comprises “111”, wherein each uncoded data block comprises nine bits and wherein each encoded data block comprises ten bits.

### Claim 14 (depends on 13)

The method of claim 13, wherein the first number is fourteen.

### Claim 15 (depends on 1)

The method of claim 1, wherein the predetermined bit pattern comprises “111”, wherein each uncoded data block comprises sixteen bits, and wherein each encoded data block comprises seventeen bits.

### Claim 16 (depends on 15)

The method of claim 15, wherein the first number is twenty-one.

### Claim 17 (depends on 15)

The method of claim 15, wherein a correspondence of uncoded to encoded data blocks comprises a finite state code scheme.

### Claim 18 (depends on 1)

The method of claim 1, wherein the predetermined bit pattern comprises either “0100” or “0010”, wherein each uncoded data block comprises nine bits and wherein each encoded data block comprises ten bits.

### Claim 19 (depends on 18)

The method of claim 18, wherein the first number is twelve.

### Claim 20 (depends on 1)

The method of claim 1, wherein the predetermined bit pattern comprises either “0100” or “0010”, wherein each uncoded data block comprises sixteen bits.

### Claim 21 (depends on 20)

The method of claim 20, wherein each encoded data block comprises seventeen bits and wherein the first number comprises nineteen bits.

### Claim 22 (depends on 20)

The method of claim 20, wherein a correspondence of uncoded to encoded data blocks comprises a finite state code scheme and wherein the first number is fifteen.

### Claim 23 (depends on 1)

The method of claim 1, wherein the encoded data block can be used in partial response and extended partial response systems.

### Claim 24 (depends on 1)

The method of claim 1, wherein the predetermined bit pattern is included in one encoded data block or spans two encoded data blocks.

### Claim 25

A system for storing input groups of uncoded binary data on a storage medium, comprising:
means for receiving a plurality of uncoded data blocks in a data stream;
means for generating one corresponding encoded data block for each uncoded data block, wherein an encoded data stream obtained from concatenating successive encoded blocks includes a predetermined bit pattern comprising a plurality of bits, wherein the bit pattern always occurs within a first number of bits and two occurrences of a “1” and “0” occur within a second number of bits; and
means for storing the encoded data stream on the storage medium.

### Claim 26 (depends on 25)

The system of claim 25, wherein the first number is greater than the second number.

### Claim 27 (depends on 25)

The system of claim 25, wherein the predetermined bit pattern represents a maximum amplitude peak in a constrained waveform that is guaranteed to occur within the first number of bits.

### Claim 28 (depends on 25)

The system of claim 25, wherein the encoding function is performed by a finite state code.

### Claim 29 (depends on 28)

The system of claim 28, wherein one encoded data block corresponds to multiple uncoded data blocks, and wherein a value of at least one adjacent block is used to determine the uncoded data block that corresponds to the encoded data block corresponding to multiple uncoded data blocks.

### Claim 30 (depends on 25)

The system of claim 25, wherein the predetermined bit pattern comprises “010”, each uncoded data block comprises eight bits, and each encoded data block comprises nine bits.

### Claim 31 (depends on 25)

The system of claim 25, wherein the predetermined bit pattern comprises “111”, wherein each uncoded data block comprises nine bits and wherein each encoded data block comprises ten bits.

### Claim 32 (depends on 25)

The system of claim 25, wherein the predetermined bit pattern comprises “111”, wherein each uncoded data block comprises sixteen bits, wherein each encoded data block comprises seventeen bits.

### Claim 33 (depends on 25)

The system of claim 25, wherein the predetermined bit pattern comprises either “0100” or “0010”, wherein each uncoded data block comprises nine bits and wherein each encoded data block comprises ten bits.

### Claim 34 (depends on 25)

The system of claim 25, wherein the predetermined bit pattern is included in one encoded data block or spans two encoded data blocks.

### Claim 35

An article of manufacture including code for storing input groups of uncoded binary data on a storage medium, wherein the code is capable of causing operations comprising:
receiving a plurality of uncoded data blocks in a data stream;
generating one corresponding encoded data block for each uncoded data block, wherein an encoded data stream obtained from concatenating successive encoded blocks includes a predetermined bit pattern comprising a plurality of bits, wherein the bit pattern always occurs within a first number of bits and two occurrences of a “1” and “0” occur within a second number of bits; and
storing the encoded data stream on the storage medium.

### Claim 36 (depends on 35)

The article of manufacture of claim 35, wherein the first number is greater than the second number.

### Claim 37 (depends on 35)

The article of manufacture of claim 35, wherein the predetermined bit pattern represents a maximum amplitude peak in a constrained waveform that is guaranteed to occur within the first number of bits.

### Claim 38 (depends on 35)

The article of manufacture of claim 35, wherein the encoded data blocks are generated using an encoder table.

### Claim 39 (depends on 35)

The article of manufacture of claim 35, wherein decoding the encoded data block by determining the decoded data block corresponding to the encoded data block.

### Claim 40 (depends on 35)

The article of manufacture of claim 35, wherein the encoding function is performed by a finite state code.

### Claim 41 (depends on 40)

The article of manufacture of claim 40, wherein one encoded data block corresponds to multiple uncoded data blocks, and wherein a value of at least one adjacent block is used to determine the uncoded data block that corresponds to the encoded data block corresponding to multiple uncoded data blocks.

### Claim 42 (depends on 35)

The article of manufacture of claim 35, wherein the predetermined bit pattern comprises “010”, each uncoded data block comprises eight bits, and each encoded data block comprises nine bits.

### Claim 43 (depends on 42)

The article of manufacture of claim 42, wherein the first number comprises twelve and the second number comprises six.

### Claim 44 (depends on 35)

The article of manufacture of claim 35, wherein the predetermined bit pattern comprises “010”, wherein each uncoded data block comprises sixteen bits and wherein each encoded data block comprises seventeen bits.

### Claim 45 (depends on 44)

The article of manufacture of claim 44, wherein the first number comprises twenty bits and the second number comprises fourteen bits.

### Claim 46 (depends on 44)

The article of manufacture of claim 44, wherein a correspondence of uncoded to encoded data blocks comprises a finite state code scheme.

### Claim 47 (depends on 35)

The article of manufacture of claim 35, wherein the predetermined bit pattern comprises “111”, wherein each uncoded data block comprises nine bits and wherein each encoded data block comprises ten bits.

### Claim 48 (depends on 47)

The article of manufacture of claim 47, wherein the first number is fourteen.

### Claim 49 (depends on 35)

The article of manufacture of claim 35, wherein the predetermined bit pattern comprises “111”, wherein each uncoded data block comprises sixteen bits, and wherein each encoded data block comprises seventeen bits.

### Claim 50 (depends on 49)

The article of manufacture of claim 49, wherein the first number is twenty-one.

### Claim 51 (depends on 49)

The article of manufacture of claim 49, wherein a correspondence of uncoded to encoded data blocks comprises a finite state code scheme.

### Claim 52 (depends on 35)

The article of manufacture of claim 35, wherein the predetermined bit pattern comprises either “0100” or “0010”, wherein each uncoded data block comprises nine bits and wherein each encoded data block comprises ten bits.

### Claim 53 (depends on 52)

The article of manufacture of claim 52, wherein the first number is twelve.

### Claim 54 (depends on 35)

The article of manufacture of claim 35, wherein the predetermined bit pattern comprises either “0100” or “0010”, wherein each uncoded data block comprises sixteen bits.

### Claim 55 (depends on 54)

The article of manufacture of claim 54, wherein each encoded data block comprises seventeen bits and wherein the first number comprises nineteen bits.

### Claim 56 (depends on 54)

The article of manufacture of claim 54, wherein a correspondence of uncoded to encoded data blocks comprises a finite state code scheme and wherein the first number is fifteen.

### Claim 57 (depends on 35)

The article of manufacture of claim 35, wherein the encoded data block can be used in partial response and extended partial response systems.

### Claim 58 (depends on 35)

The article of manufacture of claim 35, wherein the predetermined bit pattern is included in one encoded data block or spans two encoded data blocks.