# US 2012/0137194 A1 · Forward Error Correction with Configurable Latency

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

- Number: US 2012/0137194 A1
- Document ID: US20120137194A1
- Status: Published application
- Kind: A1
- Application number: 12/954,784
- Filed: 2010-11-26
- Published: 2012-05-31
- Earliest claimed: 2010-11-26
- Assignees: Avalon Microelectronics, Inc.
- Inventors: Wally Haas; Chuck Rumbolt
- Web page: https://patentgrep.com/patent/US20120137194A1

## CPC

- G06F 11/1076: {Parity data used in redundant arrays of independent storages, e.g. in RAID systems}
- G06F 11/0751: {Error or fault detection not based on redundancy (power supply failures G06F1/30; network fault management H04L41/06)}
- G06F 11/076: {by exceeding a count or rate limit, e.g. word- or bit count limit}
- G06F 11/10: Adding special bits or symbols to the coded information, e.g. parity check, casting out 9's or 11's
- G06F 11/102: {Error in check bits}
- H03M 13/152: {Bose-Chaudhuri-Hocquenghem [BCH] codes}
- H03M 13/3738: {with judging correct decoding}
- H03M 13/6505: {Memory efficient implementations}
- H03M 13/618: {Shortening and extension of codes}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- 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

A method of performing forward error correction with configurable latency, where a configurable latency algorithm evaluates a target Bit Error Rate (BER) against an actual BER and adjusts the size of a configurable buffer such that the target BER may be achieved when utilizing the smallest buffer size possible. When errors are corrected without the utilization of each of the configurable buffer locations, the algorithm reduces the size of the buffer by y buffer locations; the algorithm may continue to successively reduce the size of said buffer until the minimum number of buffer locations are utilized to achieve the target BER. If the buffer locations have been reduced such that the buffer size is too small and the target BER cannot be achieved, the algorithm may increase the size of the buffer until the minimum number of buffer locations are utilized to achieve the target BER.

## Claims

### Claim 1

A method of performing forward error correction with configurable latency, comprising:
(a) a plurality of data input to a transmission system, wherein said data includes a target bit error rate;
(b) a configurable size buffer with a plurality of buffer locations, wherein a forward error correction code corrects said data as said data is transmitted through said buffer;
(c) an error monitor to evaluate an actual bit error rate of said data output from said configurable size buffer; and
(d) a configurable latency algorithm, wherein said algorithm begins by utilizing the maximum number of available buffer locations to achieve said target bit error rate, and said algorithm then reduces the size of said buffer by y buffer locations when errors are corrected without the utilization of each of said buffer locations, whereby said algorithm may continue to successively reduce the size of said buffer until the minimum number of said buffer locations are utilized to achieve said target bit error rate or, where said buffer locations have been reduced such that said buffer size is too small and said target bit error rate cannot be achieved, said algorithm may increase the size of said buffer until the minimum number of said buffer locations are utilized to achieve said target bit error rate.

### Claim 2 (depends on 1)

The method of claim 1, wherein said forward error correction code is a Bose Ray-Chaudhuri (BCH) code.

### Claim 3 (depends on 2)

The method of claim 2, wherein said Bose Ray-Chaudhuri (BCH) code is a BCH (1023, 993) parent code, shortened to a BCH (1000, 970) code.

### Claim 4 (depends on 1)

The method of claim 1, wherein x=y or x≠y.
