# US 2013/0155541 A1 · Detector Pruning Control System

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

- Number: US 2013/0155541 A1
- Document ID: US20130155541A1
- Status: Published application
- Kind: A1
- Application number: 13/327,279
- Filed: 2011-12-15
- Published: 2013-06-20
- Earliest claimed: 2011-12-15
- Assignees: LSI Corporation
- Inventors: Wei Feng; Lei Wang
- Web page: https://patentgrep.com/patent/US20130155541A1

## CPC

- H03M 13/1111: {Soft-decision decoding, e.g. by means of message passing or belief propagation algorithms}
- G11B 20/1833: {by adding special lists or symbols to the coded information (G11B20/1806, G11B20/1866 take precedence)}
- H03M 5/145: {Conversion to or from block codes or representations thereof}
- H03M 13/2957: {Turbo codes and decoding}
- H03M 13/3905: {Maximum a posteriori probability [MAP] decoding or approximations thereof based on trellis or lattice decoding, e.g. forward-backward algorithm, log-MAP decoding, max-log-MAP decoding}
- H03M 13/3994: {using state pinning or decision forcing, i.e. the decoded sequence is forced through a particular trellis state or a particular set of trellis states or a particular decoded symbol}
- H03M 13/6325: {Error control coding in combination with demodulation}
- H03M 13/6343: {Error control coding in combination with techniques for partial response channels, e.g. recording}
- G11B 2020/1859: {wherein a trellis is used for decoding the error correcting code}
- 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)
- 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

Various embodiments of the present invention provide apparatuses, systems and methods for data detection in a detector with a pruning control system. For example, a data detector is disclosed that includes a first set of counters operable to distinguish prunable data from non-prunable data in the data detector, a second set of counters operable to generate initial values for the first set of counters, and a prune control signal generator operable to generate a prune control signal based on the first set of counters. The second set of counters is operable to generate the initial values at least in part before a syncmark is detected in a data sector. The initial values are used to initialize the first set of counters when the syncmark is detected in the data sector. The prune control signal controls whether the data detector is allowed to prune a trellis.

## Claims

### Claim 1

A data detector comprising:
a first set of counters operable to distinguish prunable data from non-prunable data in the data detector;
a second set of counters operable to generate initial values for the first set of counters, wherein the second set of counters is operable to generate the initial values at least in part before a syncmark is detected in a data sector, and wherein the data detector is operable to initialize the first set of counters with the initial values when the syncmark is detected in the data sector; and
a prune control signal generator operable to generate a prune control signal based on the first set of counters, wherein the prune control signal controls whether the data detector is allowed to prune a trellis.

### Claim 2 (depends on 1)

The data detector of claim 1, further comprising a third set of counters operable to generate second initial values for the first set of counters, wherein the third set of counters is operable to generate the second initial values at least in part before a second syncmark is detected in the data sector, and wherein the data detector is operable to initialize the first set of counters with the second initial values when the second syncmark is detected in the sector.

### Claim 3 (depends on 2)

The data detector of claim 2, further comprising a fourth set of counters operable to generate ending values for the first set of counters, wherein the data detector is operable to use the ending values for the first set of counters when a data fragment being processed in the data detector ends before the second syncmark is detected.

### Claim 4 (depends on 1)

The data detector of claim 1, wherein the first set of counters comprises a clock cycle counter.

### Claim 5 (depends on 4)

The data detector of claim 4, wherein the first set of counters comprises a J counter tracking a current data position in a codeword.

### Claim 6 (depends on 5)

The data detector of claim 5, wherein the J counter is incremented when the clock cycle counter rolls over, and wherein the J counter rolls over when it reaches a codeword length.

### Claim 7 (depends on 6)

The data detector of claim 6, wherein the J counter is only incremented when the current data position is in user data bits or parity bits.

### Claim 8 (depends on 6)

The data detector of claim 6, wherein the first set of counters comprises a K counter tracking a current data position in a block of data comprising a parity portion and a user data portion.

### Claim 9 (depends on 8)

The data detector of claim 8, wherein the K counter contains a remainder of a value of the J counter divided by a length of the block of data.

### Claim 10 (depends on 1)

The data detector of claim 1, wherein the prunable data comprises user data bits, and wherein the non-prunable data comprises at least one bit of non-user data.

### Claim 11 (depends on 1)

The data detector of claim 1, wherein the data detector is operable to prune the trellis when a data sequence to be pruned from the trellis comprises a sequence that is not generated by an upstream maximum-transition-run encoder and the prune control signal is asserted.

### Claim 12 (depends on 3)

The data detector of claim 3, further comprising a first state machine operable to determine whether the initial values, the second initial values or the ending values are valid.

### Claim 13 (depends on 3)

The data detector of claim 3, further comprising a second state machine operable to control counting in the second set of counters, the third set of counters and the fourth set of counters.

### Claim 14 (depends on 1)

The data detector of claim 1, wherein the first set of counters, the second set of counters and the prune control signal generator comprise a pruning control system implemented as an integrated circuit.

### Claim 15 (depends on 1)

The data detector of claim 1, wherein the first set of counters, the second set of counters and the prune control signal generator comprise a pruning control system incorporated in a storage device.

### Claim 16 (depends on 1)

The data detector of claim 1, wherein the first set of counters, the second set of counters and the prune control signal generator comprise a pruning control system incorporated in a transmission device.

### Claim 17

A method of detecting data in a data detector with a pruning control system, comprising:
calculating initial values for a first set of counters using a second set of counters while searching for a syncmark in a sector of data;
calculating second initial values for the first set of counters using a second set of counters while searching for a second syncmark in the sector of data;
when the syncmark is detected, initializing the first set of counters with the initial values, and when the second syncmark is detected, initializing the first set of counters with the second initial values; and
generating a prune control signal based on the first set of counters.

### Claim 18 (depends on 17)

The method of claim 17, further comprising calculating ending values for the first set of counters for use when a data fragment is completed before the syncmark or the second syncmark are detected.

### Claim 19

A storage system comprising:
a storage medium maintaining a data set;
a read/write head assembly operable to write the data set to the storage medium and to read the data set from the storage medium;
a data detector with a pruning control system comprising:
a first set of counters operable to distinguish user data from non-user data in the data set;
a second set of counters operable to generate initial values for the first set of counters, wherein the second set of counters operates to generate the initial values at least in part before a syncmark is detected in a data sector, and wherein the initial values are used to initialize the first set of counters when the syncmark is detected in the data sector; and
a prune control signal generator operable to generate a prune control signal based on the first set of counters, wherein the prune control signal controls whether the data detector is allowed to prune a trellis.

### Claim 20 (depends on 19)

The storage system of claim 19, further comprising:
a third set of counters operable to generate second initial values for the first set of counters, wherein the third set of counters is operable to generate the second initial values at least in part before a second syncmark is detected in the data sector, and wherein the pruning control system is operable to initialize the first set of counters with the second initial values when the second syncmark is detected in the sector; and
a fourth set of counters operable to generate ending values for the first set of counters, wherein the pruning control system is operable to use the ending values for the first set of counters when a data fragment being processed in the data detector ends before the second syncmark is detected.
