IP Library Granted Patent US 8,543,896
Granted Patent B2
US 8,543,896 · App. 13/022,775 · Granted Sep 24, 2013

Iterative decoder

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 8,543,896
App. No.
13/022,775
Granted
Sep 24, 2013
Kind
B2
Abstract

An iterative decoder for decoding a code block comprises a computation unit configured to perform forward and backward recursions over a code block or a code sub-block in each decoding iteration. A first forward/backward decoding scheme is used in a first iteration and a second forward/backward decoding scheme is used in a second iteration. The first and second decoding schemes are different in view of forward and backward processing.

Claims (55)

1. An iterative decoder for decoding a code block, comprising:

a computation unit configured to perform forward and backward recursions over a code block or a code sub-block in each decoding iteration, wherein a first forward/backward decoding scheme is used in a first iteration and a second forward/backward decoding scheme is used in a second iteration,

wherein the first and second decoding schemes are different in view of forward and backward processing and the second iteration is later than the first iteration.

2. The iterative decoder of claim 1 , wherein the computation unit is configured to use state metric values calculated in the first iteration for initializing one of a forward or backward recursion in the second iteration.

3. The iterative decoder of claim 2 , wherein the computation unit is configured to use the state metric values for initializing an acquisition phase of the one of a forward or backward recursion.

4. The iterative decoder of claim 2 , wherein the computation unit is configured to use in the first iteration state metric values calculated in a previous iteration for initializing a forward recursion and to use in the second iteration state metric values calculated in the first iteration for initialization a backward recursion.

5. The iterative decoder of claim 1 , wherein the first forward/backward decoding scheme comprises running one of the forward or backward recursions continuously over the code block or code sub-block and the other of the forward or backward recursions discontinuously over a plurality of window sections of the code block or code sub-block.

6. The iterative decoder of claim 1 , wherein the first forward/backward decoding scheme comprises running the forward and the backward recursions continuously over the code block or code sub-block.

7. The iterative decoder of claim 1 , wherein

the iterative decoder comprises at least a further computation unit,

the code block is partitioned in at least a first and a second code sub-block, and

each computation unit is configured to perform forward and backward recursions on a specific one of the first and second code sub-block.

8. The iterative decoder of claim 7 , wherein each computation unit is configured to use state metric values calculated by the other computation unit in a previous iteration.

9. The iterative decoder of claim 1 , wherein the code block is a turbo code block.

10. An iterative decoder for decoding a code block, comprising:

a computation unit configured to perform forward and backward recursions over the code block or a code sub-block in each decoding iteration, wherein a scheduling of forward and backward recursions is varied from one iteration to a later iteration, wherein forward and backward recursions are interchanged from the one iteration to the later iteration, and

a memory in which state metric values calculated in said one iteration and used for initializing a forward or backward recursion in said later iteration are stored.

11. The iterative decoder of claim 10 , wherein in the one iteration the forward recursion runs continuously over the code block or code sub block and the backward recursion is window-based, and in the later iteration the forward recursion is window-based and the backward recursion runs continuously over the code block or code sub block.

12. The iterative decoder of claim 10 , wherein the usage of an acquisition phase of forward and backward recursions is flipped from said one iteration to said later iteration.

13. A method of decoding a code block by iteration, comprising:

performing forward and backward recursions over the code block or a code sub-block in each decoding iteration using a computation unit, comprising:

using a first forward/backward decoding scheme in a first iteration; and

using a second forward/backward decoding scheme in a second iteration,

wherein the first and second decoding schemes are different in view of forward and backward processing and the second iteration is later than the first iteration.

14. The method of claim 13 , further comprising:

calculating state metric values in the first iteration for at least one of a forward or backward recursion; and

initializing at least one of a forward or backward recursion in the second iteration with the state metric values.

15. The method of claim 14 , wherein an acquisition phase of the one of a forward or backward recursion is initialized with the state metric values.

16. The method of claim 13 , further comprising:

initializing a forward recursion in the first iteration by using state metric values calculated in a previous iteration; and

initializing a backward recursion in the second iteration by using state metric values calculated in the first iteration.

17. The method of claim 13 , further comprising:

running one of the forward or backward recursions continuously over the code block or code sub-block; and

running the other of the forward or backward recursions discontinuously over a plurality of window sections of the code block or code sub-block.

18. The method of claim 13 , further comprising:

running the forward and the backward recursions continuously over the code block or the code sub-block.

19. The method of claim 13 , further comprising:

partitioning the code block in at least a first and a second code sub-block;

performing forward and backward recursions on the first code sub-block; and concurrently

performing forward and backward recursions on the second code sub-bock.

20. The method of claim 13 , wherein the code block is a turbo code block.

21. A method of decoding a code block by iteration, comprising:

performing forward and backward recursions over the code block or a code sub-block in a first decoding iteration according to a first forward/backward decoding scheme using a computation unit;

calculating state metric values in the first iteration using the computation unit;

storing the state metric values in a memory using the computation unit;

reading the stored state metric values using the computation unit;

initializing a forward or backward recursion in the second iteration by using the state metric values read from the memory using the computation unit;

performing forward and backward recursions over the code block or a code sub-block in the second decoding iteration according to a second forward/backward decoding scheme which is different in schedule to the first decoding scheme using the computation unit;

performing the forward and backward recursions over the code block or code sub-block according to a first decoding scheme in the first iteration;

deriving a second decoding scheme from the first decoding scheme by interchanging backward and forward recursions; and

performing the forward and backward recursions over the code block according to the second decoding scheme in the second iteration.

22. The method of claim 21 , wherein the second iteration is the next iteration to the first iteration.

23. The method of claim 21 , further comprising:

initializing an acquisition phase of a forward recursion in the first iteration by using state metric values calculated in a previous iteration; and

initializing an acquisition phase of a backward recursion in the second iteration by using the state metric values calculated in the first iteration.

Assignments (4)
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 18, 2012
From: INFINEON TECHNOLOGIES AG
To: INTEL MOBILE COMMUNICATIONS TECHNOLOGY GMBH
Reel/Frame 027548/0623 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 8, 2011
From: FRESIA, MARIA; BERKMANN, JENS; HUEBNER, AXEL
To: INFINEON TECHNOLOGIES AG
Reel/Frame 025758/0822 →