IP Library Granted Patent US 8,468,431
Granted Patent B2
US 8,468,431 · App. 13/171,211 · Granted Jun 18, 2013

System and method for multi-dimensional encoding and decoding

Inventors: Avi Steiner (Kiryat Motzkin, IL); Erez Sabbag (Kiryat Tivon, IL); Avigdor Segal (Netanya, IL); Ilan Bar (Kiryat Motzkin, IL); Eli Sterin (Yoqneam, IL)
Assignee: Densbits Technologies Ltd.
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,468,431
App. No.
13/171,211
Granted
Jun 18, 2013
Kind
B2
Abstract

A system and method is provided for decoding a set of bits using a plurality of hypotheses, for example, each independently tested on-the-fly. Initial bit states and associated reliability metrics may be received for the set of bits. A current hypothesis may be decoded for correcting the set of bits, wherein the current hypothesis defines different bit states and associated reliability metrics for the set of bits. If decoding the current hypothesis is not successful, a subsequently ordered hypothesis may be decoded, wherein the hypotheses are ordered such that their associated reliability metric is a monotonically non-decreasing sequence. Decoding may proceed iteratively until the current hypothesis is successful.

Claims (27)

1. A method for decoding a set of bits using a processor, the method comprising:

receiving initial bit states and associated reliability metrics for the set of bits;

decoding a current hypothesis for correcting the set of bits, wherein the current hypothesis defines different bit states and associated reliability metrics for the set of bits; and

if decoding the current hypothesis is not successful, decoding a subsequently ordered hypothesis, wherein the hypotheses are ordered such that their associated reliability metric is a monotonically non-decreasing sequence.

2. The method of claim 1 comprising generating each subsequent hypothesis after decoding the current hypothesis for on-the-fly enumeration of error correction hypotheses.

3. The method of claim 1 , wherein each pair of current and subsequent hypotheses are decoded in consecutive clock cycles.

4. The method of claim 1 , wherein the hypotheses are ordered from a relatively higher to a relatively lower likelihood that the associated hypotheses correct errors.

5. The method of claim 1 , wherein if decoding the current hypothesis is successful, stopping decoding.

6. The method of claim 5 , wherein decoding the current hypothesis is successful if the reliability metrics associated with the set of bits corrected by the hypothesis satisfies a threshold condition or is the greatest among reliability metrics of all the other hypotheses.

7. The method of claim 1 , wherein the reliability metrics are values in a finite uniform grid of one or more dimensions.

8. The method of claim 7 , wherein the finite uniform grid is an integer grid.

9. The method of claim 7 , wherein the reliability metrics in the finite uniform grid are incremented according to a monotonic measure using a linear ordering operation.

10. The method of claim 7 , wherein the reliability metric associated with each hypothesis is a sum of absolute value log-likelihood ratio (sum-|LLR|) of the bit states of each hypothesis mapped to values in the uniform field and are incremented in a monotonically increasing order.

11. The method of claim 1 , wherein the different hypotheses are used to correct the set of bits for soft decoding or to correct more errors than are defined by component codes encoding the set of bits for hard decoding.

12. A system for decoding a set of bits, the system comprising:

a memory to store the set of bits; and

a processor to receive initial bit states and associated reliability metrics for the set of bits, to decode a current hypothesis for correcting the set of bits, wherein the current hypothesis defines different bit states and associated reliability metrics for the set of bits, and, if decoding the current hypothesis is not successful, to decode a subsequently ordered hypothesis, wherein the hypotheses are ordered such that their associated reliability metric is a monotonically non-decreasing sequence.

13. The system of claim 12 , wherein the processor generates each subsequent hypothesis after decoding the current hypothesis for on-the-fly enumeration of error correction hypotheses.

14. The system of claim 12 , wherein the processor decodes each pair of current and subsequent hypotheses in consecutive clock cycles.

15. The system of claim 12 , wherein the hypotheses are ordered from a relatively higher to a relatively lower likelihood that the associated hypotheses correct errors.

16. The system of claim 12 , wherein if decoding the current hypothesis is successful, the processor stops decoding.

17. The system of claim 16 , wherein decoding the current hypothesis is successful if the reliability metrics associated with the set of bits corrected by the hypothesis satisfies a threshold condition or is the greatest among reliability metrics of all the other hypotheses.

18. The system of claim 12 , wherein the reliability metrics are values in a finite uniform grid of one or more dimensions.

19. The system of claim 18 , wherein the finite uniform grid is an integer grid.

20. The system of claim 18 , wherein the processor uses a linear ordering operation to order the hypotheses such that their associated reliability metrics are ordered according to a monotonic measure.

21. The system of claim 18 , wherein the reliability metric associated with each hypothesis is a sum of absolute value log-likelihood ratio (sum-|LLR|) of the bit states of each hypothesis mapped to values in the uniform field and the processor orders the hypotheses such that their associated mapped sum-|LLR| values are monotonically increasing.

22. The system of claim 12 , wherein the processor uses different hypotheses to correct the set of bits for soft decoding or to correct more errors than are defined by component codes encoding the set of bits for hard decoding.

Assignments (9)
MERGER Recorded Mar 3, 2023
From: AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITED; BROADCOM INTERNATIONAL PTE. LTD.
To: AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITED
Reel/Frame 062952/0850 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Sep 14, 2020
From: AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITED
To: BROADCOM INTERNATIONAL PTE. LTD.
Reel/Frame 053771/0901 →
CORRECTIVE ASSIGNMENT TO CORRECT THE EXECUTION DATE PREVIOUSLY RECORDED AT REEL: 047422 FRAME: 0464. ASSIGNOR(S) HEREBY CONFIRMS THE MERGER. Recorded Mar 6, 2019
From: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.
To: AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITED
Reel/Frame 048883/0702 →
MERGER Recorded Oct 5, 2018
From: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.
To: AVAGO TECHNOLOGIES INTERNATIONAL SALES PTE. LIMITED
Reel/Frame 047422/0464 →
RELEASE OF SECURITY INTEREST Recorded Jan 11, 2017
From: KREOS CAPITAL IV (EXPERT FUND) LIMITED
To: DENSBITS TECHNOLOGIES LTD.
Reel/Frame 041339/0921 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jan 27, 2016
From: DENSBITS TECHNOLOGIES LTD.
To: AVAGO TECHNOLOGIES GENERAL IP (SINGAPORE) PTE. LTD.
Reel/Frame 037622/0224 →
SECURITY INTEREST Recorded Mar 18, 2015
From: DENSBITS TECHNOLOGIES LTD.
To: KREOS CAPITAL IV (EXPERT FUND) LIMITED
Reel/Frame 035222/0547 →
SECURITY INTEREST Recorded Jul 30, 2014
From: DENSBITS TECHNOLOGIES LTD.
To: KREOS CAPITAL IV (EXPERT FUND) LIMITED
Reel/Frame 033444/0628 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Feb 26, 2014
From: STEINER, AVI; SABBAG, EREZ; SEGAL, AVIGDOR; BAR, ILAN; STERIN, ELI
To: DENSBITS TECHNOLOGIES LTD.
Reel/Frame 032297/0898 →
Continuity (2)
Provisional Application 61360817 · Jul 1, 2010
Related Publication 20120005560A1 · Jan 5, 2012