# US 2012/0254704 A1 · Reed-solomon decoder and reception apparatus

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

- Number: US 2012/0254704 A1
- Document ID: US20120254704A1
- Status: Published application
- Kind: A1
- Application number: 13/409,691
- Filed: 2012-03-01
- Published: 2012-10-04
- Earliest claimed: 2011-03-28
- Assignees: Kabushiki Kaisha Toshiba
- Inventors: Koichiro BAN
- Web page: https://patentgrep.com/patent/US20120254704A1

## CPC

- H03M 13/1515: {Reed-Solomon codes}
- H03M 13/155: {Shortening or extension of codes}
- H03M 13/1555: {Pipelined decoder implementations}
- H03M 13/618: {Shortening and extension of codes}
- 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

According to one embodiment, a Reed-Solomon decoder comprises an analyzer and a calculator. The analyzer analyzes a data frame and calculates a size of a last code word located at an end of a data portion, using information included in a header portion. The calculator calculates correction coefficients, using the size of the last code word, for correcting coefficients of an error locator polynomial and coefficients of an error value polynomial for the last code word in accordance with a difference between a base size of Reed-Solomon code words and the size of the last code word, before error detection for a code word located immediately before the last code word in the data portion begins.

## Claims

### Claim 1

A Reed-Solomon decoder comprising:
an analyzer to analyze a data frame including a data portion including at least two Reed-Solomon code words and a header portion including information indicating a size of the data portion and to calculate a size of a last code word located at an end of the data portion, using the information included in the header portion; and
a coefficient calculator to calculate correction coefficients, using the size of the last code word, for correcting coefficients of an error locator polynomial and coefficients of an error value polynomial for the last code word in accordance with a difference between a base size of the Reed-Solomon code words and the size of the last code word, before error detection for a code word located immediately before the last code word in the data portion begins.

### Claim 2 (depends on 1)

The decoder according to claim 1, wherein the coefficient calculator calculates the correction coefficients before error detection on a code word located at a beginning of the data portion begins.

### Claim 3 (depends on 1)

The decoder according to claim 1, wherein the coefficient calculator calculates the correction coefficients by repeating multiplication of initial values with multiplication factors a first number of times in accordance with the size of the last code word.

### Claim 4 (depends on 3)

The decoder according to claim 3, wherein the coefficient calculator calculates intermediate values by repeating multiplication of the initial values with the multiplication factors a second number of times before the analyzer finishes calculating the size of the last code word, and
after the analyzer finishes the calculation of the size of the last code word,
(A) if the size of the last code word is not greater than a threshold corresponding to the second number of times, the coefficient calculator calculates the correction coefficients by repeating multiplication of the intermediate values with the multiplication factors a number of times equal to a difference between the first number of times and the second number of times,
(B) if the size of the last code word exceeds the threshold, the coefficient calculator calculates the correction coefficients by repeating multiplication of the initial values with the multiplication factors the first number of times.

### Claim 5 (depends on 1)

The decoder according to claim 1, wherein the coefficient calculator, if the size of the last code word exceeds a threshold, repeats multiplication of first initial values with a multiplication factors a first number of times in accordance with the size of the last code word to calculate the correction coefficients, and if the size of the last code word is not greater than the threshold, the calculator repeats multiplication of second initial values with the multiplication factors a second number of times in accordance with the size of the last code word to calculate the correction coefficients.

### Claim 6 (depends on 1)

The decoder according to claim 1, wherein the coefficient calculator selects one set of initial values form a plurality of sets of initial values based on the size of the last code word, and repeats multiplication of selected initial values with multiplication factors a number of times in accordance with the size of the last code word to calculate the correction coefficients.

### Claim 7 (depends on 1)

The decoder according to claim 1, further comprising:
an error calculator configured to include at least one multiplier and to perform error location calculation with a Chien search, and
wherein the coefficient calculator shares the at least one multiplier with the error calculator.

### Claim 8 (depends on 1)

The decoder according to claim 1, further comprising:
an error calculator configured to include at least one multiplier and to perform error value calculation with a Forney algorithm, and
wherein the coefficient calculator shares the at least one multiplier with the error calculator.

### Claim 9 (depends on 1)

A reception apparatus, comprising:
a wireless receiver configured to receive the data frame; and
the decoder according to claim 1.
