IP Library Granted Patent US 10,158,379
Granted Patent B2
US 10,158,379 · App. 15/283,024 · Granted Dec 18, 2018

Reconfigurable FEC

Inventor: Volodymyr Shvydun (Los Altos, CA)
Assignee: INPHI CORPORATION
H03M13/617H03M13/153H03M13/159H03M13/1545H04B10/60H04L1/0045H03M13/152H03M13/1515
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 10,158,379
App. No.
15/283,024
Granted
Dec 18, 2018
Kind
B2
Abstract

The present invention is directed to data communication systems and methods thereof. According to various embodiments, the present invention provides a communication with a reconfigurable forward-error-correction (FEC) module. The FEC module processes data received from two or more communication lanes, and depending on the mode of operation, the FEC module can combine data from the two or more communication lanes and perform error correction on the combined data, or the FEC module can processes data from the two communications lanes separately and perform error correction independently for the each of the data communication lanes. There are other embodiments as well.

Claims (46)

1. A method for data communication, the method comprising:

receiving data from a plurality of communication lanes, the plurality of communication lanes including a first communication lane and a second communication lane, the first communication lane and the second communication lane operating at n-bit, n being associated with a data width;

determining an operating mode associated with the data;

performing syndrome computation (SC) to generate an equation using a 2n-bit vector if the operating mode is in a 2n-bit mode, the 2n-bit vector including data from the first communication lane and the second communication lane, the 2n-bit vector being stored in a first vector module and a second vector module, the SC computation being performed by a second processing module;

performing syndrome computation (SC) using a second first processing module to generate the equation using a first n-bit vector if the operating mode is in a n-bit mode, the first n-bit vector including data from the first communication lane, the n-bit vector being stored in the first vector module;

solving the equation using a key equation solver (KES) module;

generating a first polynomial and a second polynomial based at least on the equation; and

performing a Chieh Search (CS) using at least the first polynomial to determine an error location.

2. The method of claim 1 further comprising aligning data at least from the first communication lane using an accumulator.

3. The method of claim 1 wherein the operating mode is selected from an n-bit mode, a 2n-bit mode, and a 4n-bit mode.

4. The method of claim 1 further comprising forming the 2n-bit vector using data from the first communication lane and the second communication lane.

5. The method of claim 4 further comprising aligning data from the first communication lane and the second communication lane.

6. The method of claim 1 further comprising storing the data at a buffer.

7. The method of claim 6 further comprising correcting the data stored at the buffer using at least the error location.

8. The method of claim 1 wherein the plurality of communication lanes further comprises a third communication lane and a fourth communication lane operating at n-bit, and

wherein the method further comprising performing syndrome computation (SC) to generate the equation using an 4n-bit vector if the operating mode is in a 4n-bit mode, the 4n-bit vector including data from the first communication lane, the second communication lane, the third communication lane, and the fourth communication lane.

9. The method of claim 1 wherein the first polynomial is associated with the error location and the second polynomial is associated with an error value.

10. The method of claim 9 further comprising determining the error value using Forney algorithm.

11. The method of claim 1 further comprising processing Bose-Chaudhuri-Hocquenghem (BCH) codes associated with the data.

12. The method of claim 1 further comprising processing Reed Solomon codes associated with the data.

13. The method of claim 1 further comprising performing syndrome computation (SC) using a second processing module to generate the equation using a second n-bit vector if the operating mode is in a n-bit mode, a second n-bit vector including data from the second communication lane.

14. The method of claim 1 where n equals to 40.

15. The method of claim 1 further comprising storing the data using one or more accumulators.

16. The method of claim 1 further comprising selecting from two or more root values.

17. A method for data communication, the method comprising:

receiving data from a plurality of communication lanes, the plurality of communication lanes including a first communication lane and a second communication lane, the first communication lane and the second communication lane operating at n-bit, n being associated with a data width;

aligning the data;

selecting an operating mode associated with the data;

performing syndrome computation (SC) to generate an equation using a 2n-bit vector if the operating mode is in a 2n-bit mode, the 2n-bit vector including data from the first communication lane and the second communication lane, the 2n-bit vector being stored in a first vector module and a second vector module, the SC computation being performed by a second processing module;

performing syndrome computation (SC) using a first processing module to generate the equation using a first n-bit vector if the operating mode is in a n-bit mode, the first n-bit vector including data from the first communication lane, the n-bit vector being stored in the first vector module;

solving the equation using a key equation solver (KES) module;

generating a polynomial based at least on the equation; and

performing a Chieh Search (CS) using at least the first polynomial to determine an error location.

18. The method of claim 17 further comprising storing the data using a first-in-first-out (FIFO) buffer.

19. The method of claim 17 wherein the polynomial comprises a syndrome polynomial.

20. A method for data communication, the method comprising:

receiving data from a plurality of communication lanes, the plurality of communication lanes including a first communication lane and a second communication lane, the first communication lane and the second communication lane operating at n-bit, n being associated with a data width;

aligning the data using at least an accumulator;

storing the data at a buffer;

determining an operating mode associated with the data;

performing syndrome computation (SC) to generate an equation using a 2n-bit vector if the operating mode is in a 2n-bit mode, the 2n-bit vector including data from the first communication lane and the second communication lane, the 2n-bit vector being stored in a first vector module and a second vector module, the SC computation being performed by a second processing module;

performing syndrome computation (SC) using a first processing module to generate the equation using a first n-bit vector if the operating mode is in a n-bit mode, the first n-bit vector including data from the first communication lane, the n-bit vector being stored in the first vector module;

solving the equation using a key equation solver (KES) module;

generating a first polynomial and a second polynomial based at least on the equation;

performing a Chieh Search (CS) using at least the first polynomial to determine an error location; and

correcting the data stored at the buffer using at least the error location.

Assignments (4)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 27, 2021
From: CAVIUM INTERNATIONAL
To: MARVELL ASIA PTE LTD.
Reel/Frame 057336/0873 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 25, 2021
From: MARVELL TECHNOLOGY CAYMAN I
To: CAVIUM INTERNATIONAL
Reel/Frame 057279/0519 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Jun 23, 2021
From: INPHI CORPORATION
To: MARVELL TECHNOLOGY CAYMAN I
Reel/Frame 056649/0823 →
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 11, 2017
From: SHVYDUN, VOLODYMYR
To: INPHI CORPORATION
Reel/Frame 043273/0443 →
Continuity (2)
Continuation 14602185 · Jan 21, 2015
Related Publication 20170026058A1 · Jan 26, 2017