Two-Dimensional Product Code Encoding for Data Transmission
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing encoding methods in data transmission, particularly in high-throughput communication systems like data center interconnect links, face challenges with high decoding memory and delay due to noise and transmission errors, which are not adequately addressed by current forward error correction technologies.
Innovation Solution
An encoding method that includes a first encoding sub-block and multiple second encoding sub-blocks, utilizing a two-dimensional product code structure with component codewords and check matrices to protect information bits, reducing the number of check bits and decoding memory, and incorporating a second check matrix for error verification, thereby enhancing error correction capability and reducing power consumption.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional forward error correction encoding methods are used, then error correction capability is provided, but decoding memory and delay are high
Solution Approach 1:
The encoding block is divided into a first encoding sub-block and multiple second encoding sub-blocks. The first encoding sub-block contains information bits and check bits forming component codewords, while each second encoding sub-block provides additional protection for subsets of information bits through separate check matrices. This segmentation allows parallel decoding operations on smaller sub-blocks, reducing overall decoding delay while maintaining comprehensive error correction capability.
Solution Approach 2:
The patent employs a two-dimensional product code structure where information bits are arranged in a matrix and protected by check bits in both row and column dimensions. Each dimension has its own check matrix, creating a multi-dimensional protection scheme. This dimensional approach enables independent decoding along different axes, reducing the computational complexity and memory requirements compared to traditional single-dimension FEC codes.
2Reliability
If traditional forward error correction encoding methods are used, then error correction capability is provided, but decoding memory is high
Solution Approach 1:
By segmenting the encoding block into multiple second encoding sub-blocks, each with its own check matrix, the patent enables independent decoding of smaller units. This reduces the amount of data that must be held in memory simultaneously during decoding operations, lowering the decoding memory requirement from 1.8 Mbits to less than 1.8 Mbits while preserving the overall error correction capability through the combined protection of all sub-blocks.
Solution Approach 2:
The two-dimensional product code structure with separate check matrices for rows and columns allows the decoder to process information along different dimensions independently. This dimensional decomposition reduces the memory footprint by avoiding the need to store entire large-scale check matrices in memory, as only smaller sub-matrices corresponding to each sub-block need be maintained during decoding.
3Reliability
If more check bits are added to protect information bits, then error correction capability is improved, but power consumption increases
Solution Approach 1:
The patent divides the protection mechanism into multiple second encoding sub-blocks, each protecting a subset of information bits with its own check matrix. This segmentation allows the decoder to process and verify error correction for smaller units in parallel, reducing the total computational power required compared to processing a single large block, while still providing comprehensive protection through the aggregate of all sub-blocks.
Solution Approach 2:
Instead of providing uniform protection for all information bits through a single comprehensive check matrix, the patent applies partial protection through multiple second encoding sub-blocks, where each sub-block provides error correction for specific subsets of information bits. This partial action approach reduces the total number of check bits required compared to full protection schemes, thereby lowering power consumption while maintaining adequate error correction capability for high-throughput communication systems.
Data Source
AI summary
An encoding method, applied to the field of encoding technologies, may be used for reducing the delay and reducing the decoding memory, and includes: obtaining a data signal including a plurality of information bits; and performing encoding process on the data signal to obtain an encoded signal. An encoding block in the encoded signal includes a first encoding sub-block and at least one second encoding sub-block. The first encoding sub-block includes first component codewords and second component codewords, and all information bits constitute an information bit matrix. Each second encoding sub-block includes a first check matrix, which includes first check bit sets each determined based on bits of a first bit matrix with same side lengths, and the first check bit set and the bits of the first bit matrix constitute a third component codeword.