# US 2010/0169746 A1 · Low-complexity soft-decision decoding of error-correction codes

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

- Number: US 2010/0169746 A1
- Document ID: US20100169746A1
- Status: Published application
- Kind: A1
- Application number: 12/651,399
- Filed: 2009-12-31
- Published: 2010-07-01
- Earliest claimed: 2008-12-31
- Assignees: STMicroelectronics S.r.l.
- Inventors: RAZMIK KARABED; HAKAN C. OZDEMIR; VINCENT BRENDAN ASHE; RICHARD BARNDT
- Web page: https://patentgrep.com/patent/US20100169746A1

## CPC

- G11B 20/18: Error detection or correction; Testing {, e.g. of drop-outs}
- G11B 20/1803: {by redundancy in data representation}
- G11B 20/1833: {by adding special lists or symbols to the coded information (G11B20/1806, G11B20/1866 take precedence)}
- G11B 2020/1222: {ECC block, i.e. a block of error correction encoded symbols which includes all parity data needed for decoding}
- G11B 2020/1836: {using a Reed Solomon [RS] code}
- G11B 2020/1863: {wherein the Viterbi algorithm is used for decoding the error correcting code}
- 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 system and method for correcting errors in an ECC block using soft-decision data. In an embodiment, a soft-decision ECC decoding method, uses “soft” data indicative of how reliable bits of data are when read out. Such reliability information may be used to identify particular symbols with a higher likelihood of error such that these symbols may be changed in an attempt to reduce the total number of errors in the data. In an embodiment, a soft-decision ECC decoding path may include a reliability checker operable to receive bits of data read from a data store and operable to associate a reliability factor with each bit of data. Then, an update module may iteratively change bits or groups of bits based upon an ordering of the reliability factors.

## Claims

### Claim 1

An error-correcting module, comprising:
a reliability checker operable to receive bits of data read from a data storage and operable to associate a reliability factor with each bit of data; and
an updater operable to iteratively correct errors based upon the reliability factor.

### Claim 2 (depends on 1)

The module of claim 1 wherein the reliability factor comprises soft-decision data including a ratio corresponding to a likelihood that the bit has been read incorrectly.

### Claim 3 (depends on 2)

The module of claim 2 wherein the ratio comprises a logarithmic ratio between a least costly path as determined by a Viterbi detector and a second least costly path as determined by the Viterbi detector.

### Claim 4 (depends on 2)

The module of claim 2 wherein the likelihood that is bit has been read incorrectly is proportional to the magnitude of the difference between a first determination of a Viterbi detector and a second determination of the Viterbi detector.

### Claim 5 (depends on 1)

The module of claim 1 wherein the reliability checker is further operable to determine that a bit that has been marked as an erasure.

### Claim 6 (depends on 1)

The module of claim 1, further comprising an ordering module operable to order bits according to each bit's respective reliability factor such that the updater iteratively corrects errors beginning with the least reliable bit.

### Claim 7 (depends on 7)

The ordering module of claim 7 comprising a gray-code ordering schema.

### Claim 8

An error correction code module, comprising
a hard-decision decoding path operable to correct code errors in a stream of bits using a hard-decision decoding method; and
a soft-decision decoding path operable to correct code errors in the stream of bits using a soft-decision decoding method.

### Claim 9 (depends on 8)

The module of claim 8, wherein the soft-decision decoding path comprises:
an ordering module operable to organize identified bits of data having potential errors into flip-words and operable to order to the flip-words into an ordering corresponding to a likelihood of error;
a flip module operable to change each bit in a flip-word; and
a nonpolynomial update unit operable to determine if a threshold of errors are eliminated after flipping bits in the flip word.

### Claim 10 (depends on 9)

The module of claim 9 wherein ordering module is operable to handle up to eleven flip-words wherein each flip-word comprises up to eight flip-bits.

### Claim 11 (depends on 9)

The module of claim 9 wherein the threshold comprises a number of errors to be corrected such that the total number or errors is less than an error correction capability of the hard-decision decoding path.

### Claim 12 (depends on 9)

The module of claim 9, wherein the soft-decision decoding path further comprises a modification block operable to modify bits in the stream of bits if the threshold is met.

### Claim 13 (depends on 8)

The module of claim 8 wherein the soft-decision decoding path is invoked if and only of the hard-decision decoding path cannot correct all code errors on a first attempt.

### Claim 14 (depends on 8)

The module of claim 8 wherein the hard-decision decoding path comprises:
a Berlekamp-Messey algorithm module operable to determine one or more code errors in a sector of data, the sector of data comprising a sequence of bits as determined by a Viterbi detector; and
a Chien-Forney search engine coupled to the Berlekamp-Messey algorithm module operable to correct the one or more code errors.

### Claim 15

A controller, comprising:
a read channel, including:
a reliability checker operable to receive bits of data read from a data storage and operable to associate a reliability factor with each bit of data; and
an updater operable to iteratively correct errors based upon the reliability factor.

### Claim 16 (depends on 15)

The controller of claim 15 further comprising an integrated circuit disposed on a single die.

### Claim 17 (depends on 15)

The controller of claim 15 further comprising at least two integrated circuits disposed on a separate integrated circuit dies and communicatively coupled to each other.

### Claim 18

A hard-disk drive system, comprising:
a storage medium;
a read head operable to read data from the storage medium; and
a read channel coupled to the read head having an error-code correction module including:
a reliability checker operable to receive bits of data read from a data storage and operable to associate a reliability factor with each bit of data; and
an updater operable to iteratively correct errors based upon the reliability factor.

### Claim 19 (depends on 18)

The hard-disk drive system of claim 18, further comprising a controller coupled to the storage medium, the read head and the read channel, the controller operable to control the operations of the hard-disk drive system.

### Claim 20

A computer system, comprising:
a processor;
a storage medium coupled to the processor;
a controller for controlling a read head that is operable to read data from the storage medium; and
a read channel coupled to the read head having an error-code correction module including:
a reliability checker operable to receive bits of data read from a data storage and operable to associate a reliability factor with each bit of data; and
an updater operable to iteratively correct errors based upon the reliability factor.

### Claim 21

A method, comprising:
reading bits of data from a data storage;
determining a reliability factor for each bit of data; and
correcting errors in the data based upon the determined reliability factors.

### Claim 22 (depends on 21)

The method of claim 21, further comprising grouping bits of data into flip-words based upon each bit's reliability factor wherein a flip-word comprises bits having the same reliability factor.

### Claim 23 (depends on 22)

The method of claim 22, further comprising ordering the flip-words in an order corresponding to the magnitude of each flip-word's reliability factor.

### Claim 24 (depends on 23)

The method of claim 23, further comprising:
changing each bit in a first flip-word;
determining a total number of errors remaining in the bits of data read from the data store; and
if the total number of errors is determined to be less than a correction capability of an associated Chien-Forney search engine, then attempting to resolve all remaining errors with the Chien-Forney search engine.

### Claim 25 (depends on 24)

The method of claim 24, further comprising iteratively repeating the changing of each bit in each flip-word such that each possible combination of each flip-word combinations is checked for total numbers of errors.

### Claim 25 (depends on 24)

The method of claim 24, further comprising iteratively repeating the changing of each bit in each flip-word such according to a grey-code method.

### Claim 26

A method, comprising:
determining that a grouping of bits of data read from a data store includes errors;
determining the number of errors in the read data;
if the total number of errors exceeds a threshold, then iteratively changing bits in the least reliable bits of data until the total number of errors no longer exceeds the threshold.

### Claim 27 (depends on 26)

The method of claim 26 wherein the threshold comprises 20 errors.

### Claim 28 (depends on 26)

The method of claim 26 wherein the grouping of bits comprises a data sector.
