Shared-Bit FEC Coding for High Gain and Low Delay

Resolve Bottlenecks,
Find Innovative Solutions
Generate Solutions

Solution Overview

Problem

Conventional coding technologies struggle to achieve both high coding gain and low delay simultaneously, especially in data communication systems requiring ultra-low delay and high reliability.

Innovation Solution

A coding method and apparatus that form a first codeword using k coding bits and n information bits, where n bits are shared among m previously formed codewords, with different quantities of bits shared between codewords to enhance protection and decoding speed, reducing delay.

Engineering Contradictions & Design Principles

VSEngineering Contradiction Analysis

1Reliability

If conventional FEC coding is used to ensure high coding gain, then reliability is improved, but delay increases

Engineering Contradiction:
Improvecoding gainVSAvoiddelay
Core Design Contradiction:
ReliabilityVSLoss of time

Solution Approach 1:

The codeword is segmented into two parts: n bits that are shared with previous codewords and (k-n) information bits that are newly generated. This segmentation allows the shared bits to benefit from multiple codeword protection while the information bits can be processed more quickly, resolving the contradiction between reliability and delay

Inventive Principle:
Principle #1Segmentation

Solution Approach 2:

Bits from previously formed codewords are reused in the current codeword formation. This preliminary action of reusing already-encoded bits provides inherent protection without requiring complete re-encoding, thus improving reliability while reducing the time needed for full coding operations

Inventive Principle:
Principle #10Preliminary action

2Reliability

If more codewords share bits to improve protection, then coding gain increases, but decoding complexity and delay increase

Engineering Contradiction:
Improvecoding gainVSAvoiddecoding complexity
Core Design Contradiction:
ReliabilityVSDevice complexity

Solution Approach 1:

Different bits in the codeword have different protection levels: the n shared bits are protected by multiple codewords while the (k-n) information bits have standard protection. This local differentiation optimizes the balance between coding gain and decoding complexity by applying enhanced protection only where necessary

Inventive Principle:
Principle #3Local quality

Data Source

PatentEP4120572B1Coding method and apparatus for data communication
Publication Date: 2025.10.29 HUAWEI TECH CO LTD
  • EP4120572B1 patent drawingFigure 1~3
  • EP4120572B1 patent drawingFigure 4
  • EP4120572B1 patent drawingFigure 5

AI summary

A coding method for data communication is provided, and may be applied to a plurality of scenarios such as a metro network, a backbone network, and a data center interconnection. The method includes: forming a first codeword, where the first codeword includes n image bits and n to-be-transmitted bits, the n image bits are selected from to-be-transmitted bits in m source codewords, the source codeword is a codeword formed before the first codeword, both n and m are positive integers, and n>m; and sending the n to-be-transmitted bits in the first codeword. The bit in the first codeword is protected by a plurality of codewords generated at different moments, and a coding gain effect is better. In addition, the bit in the codeword is protected by different quantities of codewords. A bit protected by a larger quantity of codewords has a higher convergence speed, so that a decoding speed of a decoder can be improved, thereby reducing a delay.