# US 2012/0075739 A1 · High-rate transition control code for magnetic recording channels

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

- Number: US 2012/0075739 A1
- Document ID: US20120075739A1
- Status: Published application
- Kind: A1
- Application number: 13/275,156
- Filed: 2011-10-17
- Published: 2012-03-29
- Earliest claimed: 2009-09-25
- Assignees: STMicroelectronics S.r.l.
- Inventors: Hakan C. Ozdemir; Razmik Karabed; Richard Barndt
- Web page: https://patentgrep.com/patent/US20120075739A1

## CPC

- G11B 5/09: Digital recording
- G11B 20/10009: {Improvement or modification of read or write signals}
- G11B 20/10194: {using predistortion during writing (G11B20/10055 takes precedence)}
- G11B 20/10398: {jitter, timing deviations or phase and frequency errors}
- G11B 20/1833: {by adding special lists or symbols to the coded information (G11B20/1806, G11B20/1866 take precedence)}
- G11B 2220/2516: Hard disks
- 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

A method and apparatus for reducing noise in a communication signal is provided. The method includes converting raw channel data from the communication signal to a sequence of transition code symbols, each symbol having a plurality of bits, each bit having a position within the symbol. The method also includes sending the bits of each symbol to a plurality of bins, each bin corresponding to the position of each bit within the symbol. For each bin having a number of transitions greater than a number of non-transitions, the method also includes flipping every bit in the bin and setting a corresponding bit in a flip control word to a first value. The method still further includes binary adding the flip control word to each transition code symbol.

## Claims

### Claim 1

A method, comprising:
converting raw channel data from a received communication signal into a sequence of transition code symbols, each symbol having a plurality of bits, each bit having a position within the respective symbol;
sending each bit of each symbol to one of a plurality of bins, each bin corresponding to the position of the respective bit within the symbol;
for each bin having a number of transitions greater than a number of non-transitions, flipping every bit within the bin; and
saving an identifier of every bin for which every bit was flipped.

### Claim at position 2

2-20. (canceled)

### Claim 21 (depends on 1)

The method of claim 1, wherein the plurality of bins comprises N bins and the flip control word comprises N bits.

### Claim 22 (depends on 1)

The method of claim 1, further comprising:
using a 1+D circuit to convert the raw channel data to the sequence of transition code symbols.

### Claim 23 (depends on 1)

The method of claim 1, further comprising:
using a 1/(1+DN) circuit to convert the raw channel data to the sequence of transition code symbols.

### Claim 24 (depends on 23)

The method of claim 23, wherein N equals 10.

### Claim 25 (depends on 1)

The method of claim 1, wherein the received communication signal is a non-return-to-zero (NRZ) signal.

### Claim 26 (depends on 1)

The method of claim 1, further comprising:
for each bin, counting the number of transitions and the number of non-transitions in the respective bin.

### Claim 27 (depends on 1)

The method of claim 1, further comprising:
using at least one exclusive OR (XOR) logic gate to binary add the flip control word to each transition code symbol.

### Claim 28

An apparatus, comprising:
a data converter circuit configured to convert raw channel data from a received communication signal into a sequence of transition code symbols, each transition code symbol having a plurality of bits, each bit having a position within the respective transition code symbol;
a plurality of bins, each bin corresponding to the position of the respective bit within the symbol and each bin configured to receive one bit of each transition code symbol; and
a control block configured to flip every bit within each bin having a number of transitions greater than a number of non-transitions and to generate an identifier of every bin for which every bit was flipped.

### Claim 29 (depends on 28)

The apparatus of claim 28, wherein the plurality of bins comprises N bins and the flip control word comprises N bits.

### Claim 30 (depends on 28)

The apparatus of claim 28, further comprising:
a 1+D circuit configured to convert the raw channel data to the sequence of transition code symbols.

### Claim 31 (depends on 28)

The apparatus of claim 28, further comprising:
a 1/(1+DN) circuit configured to convert the raw channel data to the sequence of transition code symbols.

### Claim 32 (depends on 31)

The apparatus of claim 31, wherein N equals 10.

### Claim 33 (depends on 28)

The apparatus of claim 28, wherein the received communication signal is a non-return-to-zero (NRZ) signal.

### Claim 34 (depends on 28)

The apparatus of claim 28, further comprising:
a counter configured to count, for each bin, the number of transitions and the number of non-transitions in the respective bin.

### Claim 35 (depends on 28)

The of claim 28, further comprising:
at least one exclusive OR (XOR) logic gate configured to binary add the flip control word to each transition code symbol.

### Claim 36

An apparatus, comprising:
a data converter circuit configured to convert raw channel data from a received communication signal into a sequence of transition code symbols, each transition code symbol having a plurality of bits, each bit having a position within the respective transition code symbol and each bit representing a transition or a non-transition within the raw channel data;
a plurality of bins, each bin corresponding to the position of the respective bit within the symbol and each bin configured to receive one bit of each transition code symbol;
a counter configured to count a number of transitions within each bin; and
a control block coupled to the counter and configured to flip every bit within each bin having a number of transitions greater than 50% of the bits within the respective bin and to generate an identifier of every bin for which every bit was flipped.

### Claim 37 (depends on 36)

The apparatus of claim 36, wherein the plurality of bins comprises N bins and the flip control word comprises N bits.

### Claim 38 (depends on 37)

The apparatus of claim 37, wherein N equals 10.

### Claim 39 (depends on 36)

The apparatus of claim 36, wherein the received communication signal is a non-return-to-zero (NRZ) signal.
