IP Library Granted Patent US 7,831,886
Granted Patent B2
US 7,831,886 · App. 12/335,167 · Granted Nov 9, 2010

Fast H-ARQ acknowledgement generation method using a stopping rule for turbo decoding

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 7,831,886
App. No.
12/335,167
Granted
Nov 9, 2010
Kind
B2
Abstract

A stopping rule for Turbo decoding that is applied for both good and bad code blocks is disclosed. If the iteration either converges or diverges, decoding is terminated. In an alternative embodiment, the result of the stopping rule testing may be used for H-ARQ acknowledgement generation: if the iteration converges, an ACK is generated and if the iteration diverges, a NACK is generated. Optionally, the maximum number of decoding iterations may be dynamically selected based on MCS levels.

Claims (11)

1. A method for decoding a signal using an iterative turbo decoder comprising:

performing decoing interation of a code block;

determining, using a stopping criterion, whether a later decoding iteration converges or diverges when compared to an earlier decoding iteration; and

generating a decoding acknowledgement on the condition that the later decoding iteration converges or diverges.

2. The method of claim 1 further comprising terminating further decoding iterations on the condition that the later decoding iteration converges or diverges.

3. The method of claim 1 , wherein the decoding acknowledgement is an Acknowledgement (ACK) on the condition that the later decoding iteration converges.

4. The method of claim 1 , wherein the decoding acknowledgement is an Non-Acknowledgement (NACK) on the condition that the later decoding iteration diverges.

5. The method of claim 4 , wherein further decoding iteration are termination when an iteration count reaches a predetermined threshold.

6. The method of claim 1 , wherein determining whether the decoding iteration converges or diverges includes evaluating a sign change ratio between the later decoding iteration and one or more earlier decoding iterations.

7. The method of claim 6 , wherein on the condition that the sign change ratio is increasing, the later decoding iteration is diverging.

8. The method of claim 6 , wherein on the condition that the sign change ratio is zero, the later decoding iteration is converging.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 2, 2013
From: INTERDIGITAL TECHNOLOGY CORPORATION
To: INTEL CORPORATION
Reel/Frame 029555/0727 →