Ethernet Check Code Processing for Idle Block Insertion
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
In Ethernet data transmission, the insertion or deletion of idle blocks leads to inconsistencies in check codes generated at the sender and receiver, resulting in high check error probabilities and poor transmission quality evaluation accuracy.
Innovation Solution
A check code processing method that integrates check bits from each byte of a code block to generate a first sequence, allowing for consistent check code calculation across transmission cycles, even when idle blocks are inserted or deleted, by using Bit Interleaved Parity (BIP) check codes and Operation Administration and Maintenance (OAM) blocks to transmit check codes.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If idle blocks are inserted or deleted in Ethernet data transmission, then data transmission flexibility is improved, but check code consistency deteriorates
Solution Approach 1:
The patent introduces a special check code block as an intermediary element that carries check code information independently of the data blocks. This mediator allows the receiver to verify data integrity without being affected by the insertion or deletion of idle blocks, thus resolving the contradiction between transmission flexibility and check code consistency.
Solution Approach 2:
The patent segments the check code calculation by applying it only to non-idle blocks and excluding idle blocks from the check code generation process. This segmentation allows the check code to remain consistent even when idle blocks are dynamically inserted or deleted, maintaining reliability while preserving transmission flexibility.
2Adaptability or versatility
If idle blocks are inserted or deleted, then transmission cycle variation is improved, but check error probability increases
Solution Approach 1:
The patent applies check code calculation in advance to all non-idle blocks before transmission, generating a check code that accounts for all actual data blocks. This preliminary action ensures that even if idle blocks are later inserted or deleted, the check code remains valid and check error probability does not increase.
3Measurement precision
If check code is calculated including idle blocks, then check coverage is improved, but check code stability deteriorates
Solution Approach 1:
The patent applies different quality rules to different parts of the data stream: non-idle blocks are included in check code calculation while idle blocks are excluded. This local differentiation ensures that check coverage maintains precision for actual data while stability is preserved by excluding the variable idle blocks from the check code generation.
Data Source
AI summary
Disclosed in embodiments of this disclosure are a check code processing method, an electronic device and a storage medium. The check code processing method comprising: performing operations on m bits of the nth byte of a code block to obtain the nth bit of a first sequence; and performing operation on the first sequence of the code block with a same transmission period to obtain a check code.


