# US 2017/0288700 A1 · Bch decorder in which folded multiplier is equipped

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

- Number: US 2017/0288700 A1
- Document ID: US20170288700A1
- Status: Published application
- Kind: A1
- Application number: 15/221,083
- Filed: 2016-07-27
- Published: 2017-10-05
- Earliest claimed: 2016-04-01
- Assignees: Korea University Research and Business Foundation
- Applicants: Korea University Research and Business Foundation
- Inventors: Jongsun Park; Hoyoung Tang
- Web page: https://patentgrep.com/patent/US20170288700A1

## CPC

- H03M 13/152: {Bose-Chaudhuri-Hocquenghem [BCH] codes}
- H03M 13/1105: {Decoding}
- H03M 13/1525: {Determination and particular use of error location polynomials}
- H03M 13/1545: {Determination of error locations, e.g. Chien search or other methods or arrangements for the determination of the roots of the error locator polynomial}
- H03M 13/158: {Finite field arithmetic processing}
- H03M 13/17: Burst error correction, e.g. error trapping, Fire codes
- H03M 13/2927: {Decoding strategies}
- H03M 13/37: Decoding methods or techniques, not specific to the particular type of coding provided for in groups H03M13/03 - H03M13/35
- 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

Provided is a BCH decoder in which a folded multiplier is equipped. The BCH decoder may include a key equation solver including a plurality of multipliers. The multiplier includes a plurality of calculation blocks configured to perform a calculation operation. Each of the calculation blocks repeatedly performs a calculation operation of a calculation stage for a plurality of calculation stages, outputs one output value on the basis of at least one input value in each calculation stage, and is connected to at least one another calculation block to transfer an output value of a current calculation stage as an input value of the at least one another calculation block in a next calculation stage.

## Claims

### Claim 1

A BCH (Bose-Chaudhuri-Hocquenghem) decoder in which a folded multiplier is equipped, the BCH decoder comprising:
a key equation solver including a plurality of multipliers;
wherein
the multiplier includes a plurality of calculation blocks configured to perform a calculation operation, and
each of the calculation blocks repeatedly performs a calculation operation of a calculation stage for a plurality of calculation stages, outputs one output value on the basis of at least one input value in each calculation stage, and is connected to at least one another calculation block to transfer an output value of a current calculation stage as an input value of the at least one another calculation block in a next calculation stage.

### Claim 2 (depends on 1)

The BCH decoder of claim 1, wherein the multiplier includes calculation blocks different from each other in a coefficient of primitive polynomial element.

### Claim 3 (depends on 2)

The BCH decoder of claim 2, wherein the plurality of calculation blocks includes at least one calculation block of which the coefficient of primitive polynomial element is 0 and at least one calculation block of which the coefficient of primitive polynomial element is 1.

### Claim 4 (depends on 3)

The BCH decoder of claim 3, wherein the number of calculation blocks of which the coefficient of primitive polynomial element is 0 is equal to the number of calculation blocks of which the coefficient of primitive polynomial element is 1.

### Claim 5 (depends on 1)

The BCH decoder of claim 1, wherein the calculation block is configured as a combination of an AND gate and an XOR gate.

### Claim 6 (depends on 3)

The BCH decoder of claim 3, wherein
the calculation block of which the coefficient of primitive polynomial element is 0 includes one AND gate and one XOR gate, and
the calculation block of which the coefficient of primitive polynomial element is 1 includes one AND gate and two XOR gates.

### Claim 7 (depends on 6)

The BCH decoder of claim 6, wherein
in the calculation block of which the coefficient of primitive polynomial element is 0, an output value of the XOR gate is dependent on an output value of the AND gate, and
in the calculation block of which the coefficient of primitive polynomial element is 1, an output value of one of the two XOR gates is dependent on an output value of the other XOR gate and an output value of the AND gate.

### Claim 8 (depends on 1)

The BCH decoder of claim 1, wherein the multiplier further includes a MUX which is connected in parallel to each of the calculation blocks and supplies a first input value to the plurality of calculation blocks in each of the calculation stages.

### Claim 9 (depends on 8)

The BCH decoder of claim 8, wherein, among the plurality of calculation blocks, one calculation block of which a coefficient of primitive polynomial element is 0 is configured to input an output value as a second input value of two or more other calculation blocks, and
the other calculation blocks except the one calculation block are configured to input an output value as a third input value of another calculation block.

### Claim 10 (depends on 9)

The BCH decoder of claim 9, wherein each of the calculation blocks performs a calculation on the basis of an input value received in each of the calculation stages and a predetermined fourth input value.

### Claim 11 (depends on 8)

The BCH decoder of claim 8, wherein the multiplier further includes a flip-flop which is connected between every two calculation blocks and configured to transfer an output value of a calculation block in a previous calculation stage as an input value of another calculation block in a next calculation stage in synchronization with a clock signal.

### Claim 12 (depends on 8)

The BCH decoder of claim 8, wherein if the first input value output from the MUX is a value for a last calculation stage, each of the calculation blocks provides an output value, which is a calculation result, as a final output value of the multiplier.
