US 12,009,919 B2
Error-tolerant forward error correction ordered set message decoder
Filippo Borlenghi, Borex (CH); and David Stauffer, Essex Junction, VT (US)
Assigned to KANDOU LABS SA, Lausanne (CH)
Filed by Kandou Labs SA, Lausanne (CH)
Filed on May 23, 2023, as Appl. No. 18/322,247.
Application 18/322,247 is a continuation of application No. 17/834,628, filed on Jun. 7, 2022, granted, now 11,658,771.
Application 17/834,628 is a continuation of application No. 17/207,565, filed on Mar. 19, 2021, granted, now 11,356,197, issued on Jun. 7, 2022.
Prior Publication US 2023/0299879 A1, Sep. 21, 2023
Int. Cl. H04L 1/00 (2006.01); G06F 13/42 (2006.01)
CPC H04L 1/0045 (2013.01) [H04L 1/0061 (2013.01); G06F 13/4282 (2013.01); G06F 2213/0042 (2013.01)] 20 Claims
OG exemplary drawing
 
1. A method comprising:
receiving a data frame including a set of super symbols, a set of sync bits and a received forward error correction (FEC) parity word and calculating a local FEC parity word based on the received frame;
identifying an unscrambled ordered set (UOS) candidate in the set of super symbols by comparing portions of each super symbol to corresponding portions of one or more known UOS values;
responsive to the identification of the UOS candidate, halting advancement of a descrambler operation for a predetermined number of bit intervals associated with a length of the super symbol;
comparing the received FEC parity word to the local FEC parity word and determining at least one bit error occurred in the data frame, and responsively determining the UOS candidate is a true UOS; and
descrambling scrambled super symbols received in a subsequent data frame to identify scrambled ordered sets.