# US 2006/0039509 A1 · Method for decoding data using windows of data

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

- Number: US 2006/0039509 A1
- Document ID: US20060039509A1
- Status: Published application
- Kind: A1
- Application number: 10/527,888
- Filed: 2003-09-10
- Published: 2006-02-23
- Earliest claimed: 2002-09-18
- Assignees: Koninklijke Philips Electronics N.V.
- Inventors: Patrick Galili; Laurent Pilot; Andrea Ancora
- Web page: https://patentgrep.com/patent/US20060039509A1

## CPC

- 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/2957: {Turbo codes and decoding}
- H03M 13/3723: {using means or methods for the initialisation of the decoder}
- H03M 13/3972: {using sliding window techniques or parallel windows}
- H03M 13/6561: {Parallelized implementations}
- 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

The present invention relates to a method for decoding data, said method using windows (WID) of input data The invention is characterized in that it comprises for a current window the steps of:—Performing a forward recursion, wherein said forward recursion is initialized with a forward state metric vector (a) from the upper stake (STK) of the previous window of the same step of the previous iteration, a window (WID) comprising a lower and an upper stake (STK), and—Performing a backward recursion, wherein said backward recursion is initialized with a backward state metric vector (b) from the lower stake (STK) of the next window of the same step of the previous iteration. Use: Receiver in a communication system

## Claims

### Claim 1

A method for decoding data, said method comprising iterations with some steps (SISO1, SISO2) using windows (WID) of input data, characterized in that the method comprises, for a current window (WID) of a step (SISO1, SISO2) within an iteration the steps of:
Performing a forward recursion, wherein said forward recursion is initialized with a forward state metric vector (α) from the upper stake (STK) of a previous window of the same step (SISO1, SISO2) of a previous iteration, a window (WID) comprising a lower and an upper stake (STK), and
Performing a backward recursion, wherein said backward recursion is initialized with a backward state metric vector (α) from the lower stake (STK) of a next window of the same step (SISO1, SISO2) of a previous iteration.

### Claim 2 (depends on 1)

A method as claimed in claim 1, characterized in that the forward state metric vector (α) computed last is stored in an upper stake of said current window (WID) during the forward recursion, and the backward state metric vector (β) computed last is stored in the lower stake (STK) of said current window (WID) during the backward recursion.

### Claim 3 (depends on 1)

A method as claimed in claim 1, characterized in that all the windows (WID) of a step (SISO) are processed in parallel.

### Claim 4

A decoder for decoding data, said decoding comprising iterations with some steps (SISO1, SISO2) using windows (WID) of input data, characterized in that it comprises computation units (CMP) for performing, for a current window (WID) of a step (SISO1, SISO2) within an iteration:
A forward recursion, wherein said forward recursion is initialized with a forward state metric vector (α) from the upper stake (STK) of a previous window of the same step (SISO1, SISO2) of a previous iteration, a window (WID) comprising a lower and an upper stake (STK), and
A backward recursion, wherein said backward recursion is initialized with a backward state metric vector (β) from the lower stake (STK) of a next window of the same step (SISO1, SISO2) of a previous iteration.

### Claim 5 (depends on 4)

A receiver adapted to receive input data, said input data being processed by the decoder as claimed in claim 4.

### Claim 6 (depends on 1, 2, 3)

A computer program product for a receiver, comprising a set of instructions which, when loaded into said receiver, causes the receiver to carry out the method as claimed in claims 1 to 3.

### Claim 7 (depends on 1, 2, 3)

A computer program product for a computer, comprising a set of instructions which, when loaded into said computer, causes the computer to carry out the method as claimed in claims 1 to 3.
