# US 2008/0307294 A1 · Efficient implementation to perform iterative decoding with large iteration counts

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

- Number: US 2008/0307294 A1
- Document ID: US20080307294A1
- Status: Published application
- Kind: A1
- Application number: 12/079,467
- Filed: 2008-03-26
- Published: 2008-12-11
- Earliest claimed: 2007-03-29
- Assignees: Sirius Satellite Radio, Inc.
- Inventors: Carl Scarpa; Edward Schell
- Web page: https://patentgrep.com/patent/US20080307294A1

## CPC

- H03M 13/6505: {Memory efficient implementations}
- H03M 13/05: using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits {(H03M13/2906 takes precedence)}
- H03M 13/1105: {Decoding}
- H03M 13/3746: {with iterative decoding}
- 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

Systems and methods are presented to improve the performance of a constant bit rate iterative decoder by providing elastic buffering, while utilizing a relatively simple decoder architecture capable of maintaining a fixed number of iterations of a lower value. An LDPC decoder can be designed, for example, to support less than the maximum possible number of iterations, and can, for example, be mated to elastic input and output buffers. If a given code block, or succession of code blocks, requires the maximum number of iterations for decoding, the decoder can, for example, run at such maximum number of iterations and the elastic input buffer can, for example, hold code blocks waiting to be processed so as to maintain a constant input rate. Alternatively, if one or more code blocks requires less than the nominal number of iterations, the output buffer can store those code blocks so as to preserve a constant output rate. It is emphasized that this abstract is provided to comply with the rules requiring an abstract, and is submitted with the understanding that it will not be used to interpret or limit the scope or the meaning of the claims.

## Claims

### Claim 1

A method of efficiently performing iterative decoding, comprising:
setting a decoder to operate at a nominal iteration rate N;
allowing the decoder to increase or decrease the number of iterations when needed or feasible; and
storing a queue of code blocks in each of an elastic input buffer and an elastic output buffer,
wherein the input rate of code blocks to the input buffer and the out put rate of code blocks from the output buffer is constant.

### Claim 2 (depends on 1)

The method of claim 1, wherein the decoder can increase to a maximum number of iterations M.

### Claim 3 (depends on 2)

The method of claim 2, wherein M is an integer multiple of N.

### Claim 4 (depends on 1)

The method of claim 1, wherein the decoder implements one of a Low Density Parity Code, a Turbo code and a modification of either of them.

### Claim 5 (depends on 1)

The method of claim 1, wherein the size of the elastic input buffer is a function of the expected number, Nseq, of sequential code blocks that would require M iterations.

### Claim 6 (depends on 5)

The method of claim 5, wherein the size of the elastic input buffer is Nseq multiplied by the size of a code block multiplied by M/N, or Nseq*M/N*Block_size.

### Claim 7 (depends on 1)

The method of claim 1, wherein the size of the elastic output buffer is a function of the expected number of sequential code blocks that can be processed with less than N iterations.

### Claim 8 (depends on 1)

The method of claim 1, wherein if the elastic input buffer is filled, the decoder operates at no more than N iterations per code block.

### Claim 9 (depends on 1)

The method of claim 1, wherein the decoder can exit processing of a code block upon the detection of one of a defined set of termination indicators.

### Claim 10 (depends on 9)

The method of claim 9, wherein the defined set of termination indicators include large portion of bits still in error after a defined number of iterations, static parity error count, and parity sum below a defined minimum threshold.

### Claim 11

A system for efficient iterative decoding, comprising:
a decoder set to operate at a nominal iteration rate N; and
an elastic input buffer and an elastic output buffer each coupled to the decoder,
wherein the input rate of code blocks to the input buffer and the out put rate of code blocks from the output buffer is constant.

### Claim 12 (depends on 11)

The system of claim 11, wherein in operation the decoder can increase or decrease the number of iterations when needed or feasible.

### Claim 13 (depends on 12)

The system of claim 12, wherein the decoder can increase to a maximum number of iterations M.

### Claim 14 (depends on 13)

The system of claim 13, wherein M=4N.

### Claim 15 (depends on 11)

The system of claim 11, wherein the decoder implements one of a Low Density Parity Code, a Turbo code and a modification of one of them.

### Claim 16 (depends on 13)

The system of claim 13, wherein the size of the elastic input buffer is a function of the expected number of sequential code blocks that can require M iterations.

### Claim 17 (depends on 11)

The system of claim 11, wherein the size of the elastic output buffer is a function of the expected number of sequential code blocks that can be processed with less than N iterations.

### Claim 18 (depends on 12)

The system of claim 12, wherein if the elastic input buffer is filled, the decoder operates at no more than N iterations per code block.

### Claim 19 (depends on 11)

The system of claim 11, wherein the decoder can exit processing of a code block upon the detection of one of a defined set of termination indicators.

### Claim 20

A program storage device readable by a processing unit, tangibly embodying a program of instructions executable by the processing unit to implement a method of efficiently performing iterative decoding, said method comprising:
setting a decoder to operate at a nominal iteration rate N;
increasing or decreasing the number of iterations when needed or feasible; and
storing a queue of code blocks in each of an elastic input buffer and an elastic output buffer,
wherein the input rate of code blocks to the input buffer and the out put rate of code blocks from the output buffer is constant.

### Claim 21 (depends on 20)

The programmable storage device of claim 20, wherein in said method the decoder can increase to a maximum number of iterations M.

### Claim 22 (depends on 20)

The programmable storage device of claim 20, wherein in said method M is an integer multiple of N.

### Claim 23 (depends on 20)

The programmable storage device of claim 20, wherein in said method the decoder implements one of a Low Density Parity Code, a Turbo code and a modification of either of them.

### Claim 24 (depends on 20)

The programmable storage device of claim 20, wherein in said method the size of the elastic input buffer is a function of the expected number, Nseq, of sequential code blocks that would require M iterations.

### Claim 25 (depends on 20)

The programmable storage device of claim 20, wherein in said method the size of the elastic input buffer is Nseq multiplied by the size of a code block multiplied by MIN, or Nseq*M/N*Block_size.

### Claim 26 (depends on 20)

The programmable storage device of claim 20, wherein in said method the size of the elastic output buffer is a function of the expected number of sequential code blocks that can be processed with less than N iterations.

### Claim 27 (depends on 20)

The programmable storage device of claim 20, wherein in said method if the elastic input buffer is filled, the decoder operates at no more than N iterations per code block.

### Claim 28 (depends on 20)

The programmable storage device of claim 20, wherein in said method the decoder can exit processing of a code block upon the detection of one of a defined set of termination indicators.

### Claim 29 (depends on 20)

The programmable storage device of claim 20, wherein in said method the defined set of termination indicators include large portion of bits still in error after a defined number of iterations, static parity error count, and parity sum below a defined minimum threshold.
