IP Library Granted Patent US 6,865,712
Granted Patent B2
US 6,865,712 · App. 10/244,790 · Granted Mar 8, 2005

Optimized turbo decoder

Assignee: Infineon Technologies AG
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 6,865,712
App. No.
10/244,790
Granted
Mar 8, 2005
Kind
B2
Abstract

A turbo decoder for decoding a data signal transmitted via a disturbed channel has a symbol estimator. The symbol estimator contains a computing device, which, with knowledge of the error protection code used at the transmitter end, calculates transition metric values, forward and reverse recursion metric values and the output values (LLR). The computing device includes at least one hardware computing chip constructed of combinatorial logic for generating at least one type of the values.

Claims (32)

1. A turbo decoder for decoding a data signal, error-protection-coded with a turbo code at a transmitter end, transmitted via a disturbed channel, and detected by a receiver, the turbo decoder comprising:

at least one symbol estimator including:

an input for receiving data symbols attributable to the detected data signal;

an output for providing output values for determining estimated data symbols of the data signal forming a basis for the error protection coding at the transmitter end; and

a computing device configured to calculate, with the error protection code used at the transmitter end:

transition metric values; and

forward and reverse recursion metric values, and the output values therefrom;

said computing device containing a hardware computing chip constructed of combinatorial logic for generating at least one type of the values.

2. The turbo decoder according to claim 1 , wherein said hardware computing chip includes a first hardware computing chip, and said first hardware computing chip includes four adders with outputs disposed in parallel and at least one twos complement stage disposed following said adders for generating the transition metric values.

3. The turbo decoder according to claim 2 , wherein said first hardware computing chip contains eight adders disposed in parallel for generating the transition metric values.

4. The turbo decoder according to claim 2 , wherein said first hardware computing chip contains four memories for storing four transition metric values.

5. The turbo decoder according to claim 1 , wherein said symbol estimator has a control device for controlling said first hardware computing chip whereby said first hardware computing chip alternately determines the transition metric values according to a first and a second computing rule.

6. The turbo decoder according to claim 1 , wherein said hardware computing chip includes a second hardware computing chip, and said second hardware computing chip contains an addition stage having a Q number of adders disposed in parallel and a maximization stage having a plurality of maximum units disposed in parallel for generating the forward and reverse recursion metric values, and each of said maximum units receives the outputs from two of said adders at input and outputs a larger one of the adder outputs.

7. The turbo decoder according to claim 6 , wherein Q=16.

8. The turbo decoder according to claim 6 , wherein said symbol estimator has a control device for controlling said second hardware computing chip, whereby forward and reverse recursion intervals having sliding interval boundaries are used within a datablock for calculating the forward and reverse recursion metric values.

9. The turbo decoder according to claim 1 , wherein said hardware computing chip includes a third hardware computing chip, and said third hardware computing chip contains an addition stage having a number P of adders with outputs disposed in parallel and a maximization stage having two maximum units disposed in parallel for generating the output values, and each of said maximum units receives the outputs from P/2 of said adders at input and outputs a largest one of the adder outputs.

10. The turbo decoder according to claim 9 , wherein P=16.

11. The turbo decoder according to claim 9 , wherein said third hardware computing chip has a subtractor for determining a difference between the outputs of said two maximum units for generating the output values.

12. The turbo decoder according to claim 1 , wherein said symbol estimator has a control device for controlling said third hardware computing chip whereby said third hardware computing chip combines the forward and reverse recursion metric values within sliding interval boundaries.

13. The turbo decoder according to claim 6 , wherein said second hardware computing chip and said third hardware computing chip use common ones of said adders in a multiplex operation.

14. The turbo decoder according to claim 1 , further comprising:

a digital signal processor for carrying out a turbo interleaving and a deinterleaving procedure and for calculating statistical information representative of an instantaneous channel state in accordance with a predetermined sequence program; and

a bidirectional interface for connecting said digital signal processor to said symbol estimator for exchanging data.

15. The turbo decoder according to claim 1 , wherein said symbol estimator is used for calculating a first reliability information and a second reliability information during an iteration pass.

16. A turbo decoder for decoding a data signal, error-protection-coded with a turbo code at a transmitter end, transmitted via a disturbed channel, and detected by a receiver, comprising:

at least one symbol estimator including:

an input for receiving data symbols attributable to the detected data signal;

an output for providing output values for determining estimated data symbols of the data signal forming a basis for the error protection coding at the transmitter end; and

a computing device configured to calculate, with the error protection code used at the transmitter end:

transition metric values; and

forward and reverse recursion metric values and the output values therefrom;

said computing device containing computing chips including a first computing chip, a second hardware computing chip and a third computing chip, constructed of combinatorial logic for generating at least one type of the values.

Assignments (7)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 29, 2022
From: INTEL DEUTSCHLAND GMBH
To: INTEL CORPORATION
Reel/Frame 061356/0001 →
CHANGE OF NAME Recorded Nov 6, 2015
From: INTEL MOBILE COMMUNICATIONS GMBH
To: INTEL DEUTSCHLAND GMBH
Reel/Frame 037057/0061 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 19, 2012
From: INTEL MOBILE COMMUNICATIONS TECHNOLOGY GMBH
To: INTEL MOBILE COMMUNICATIONS GMBH
Reel/Frame 027556/0709 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 13, 2012
From: INFINEON TECHNOLOGIES DELTA GMBH
To: INTEL MOBILE COMMUNICATIONS TECHNOLOGY GMBH
Reel/Frame 027531/0108 →
CORRECTIVE ASSIGNMENT TO CORRECT THE EFFECTIVE DATE NEEDS TO BE CORRECT TO 09/30/2009 PREVIOUSLY RECORDED ON REEL 026685 FRAME 0688. ASSIGNOR(S) HEREBY CONFIRMS THE ASSIGNMENT. Recorded Sep 15, 2011
From: INFINEON TECHNOLOGIES AG
To: INFINEON TECHNOLOGIES DELTA GMBH
Reel/Frame 027245/0484 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 2, 2011
From: INFINEON TECHNOLOGIES AG
To: INFINEON TECHNOLOGIES DELTA GMBH
Reel/Frame 026685/0688 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 27, 2005
From: BECKER, BURKHARD; DOETSCH, MARKUS; JUNG, PETER; KELLA, TIDEYA; PLECHINGER, JORG; SCHMIDT, PETER; SCHNEIDER, MICHAEL
To: INFINEON TECHNOLOGIES AG
Reel/Frame 016193/0984 →
Priority Claims (1)
DE 100 12 873 · Mar 16, 2000 · national
Continuity (2)
Continuation PCTDE010098300 · Mar 12, 2001
Related Publication 20030067868A1 · Apr 10, 2003