GLDPC Parity-Check Structure for High-Throughput Encoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current channel coding techniques face challenges in achieving high data throughput with efficient encoding and decoding resources, particularly in digital communication systems, where existing GLDPC codes may not fully leverage the potential of Cordaro-Wagner component codes for improved performance.
Innovation Solution
The proposed solution involves constraining the structure of the parity part of the parity-check matrix to exploit the additional freedom in replacing rows with Cordaro-Wagner component code check matrices, achieving a repeat-accumulate code structure, and iteratively labeling components to optimize performance measures such as girth and extrinsic message degree, thereby enhancing the encoding and decoding efficiency.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Productivity
If conventional GLDPC codes are used, then error correction capability is provided, but encoding and decoding efficiency is insufficient for high data throughput requirements
Solution Approach 1:
The code is segmented into information bits and parity bits with distinct structural roles. The parity-check matrix is divided into information parity-submatrix and parity parity-submatrix, allowing separate processing paths for information and parity bits during encoding, which improves throughput while maintaining error correction capability
Solution Approach 2:
The invention changes the structural parameters of the parity-check matrix by imposing specific constraints on the information parity-submatrix (each column having at most two non-zero elements) and parity parity-submatrix (each row having exactly two non-zero elements). These parameter changes enable more efficient encoding algorithms while preserving the GLDPC code's error correction properties
2Ease of manufacture
If the parity-check matrix structure is constrained to achieve repeat-accumulate code structure, then encoding efficiency is improved, but code design flexibility is reduced
Solution Approach 1:
Different structural constraints are applied to different parts of the parity-check matrix. The information parity-submatrix has constraints on column weights (at most two non-zero elements), while the parity parity-submatrix has constraints on row weights (exactly two non-zero elements). This local differentiation achieves encoding efficiency without overly constraining the overall code design
Solution Approach 2:
The parity-check matrix structure is pre-designed with specific constraints before the actual coding process. The repeat-accumulate code structure is established in advance through careful construction of the information and parity submatrices, allowing efficient encoding to be performed without complex real-time computations
3Reliability
If Cordaro-Wagner component codes are used to replace rows in the parity-check matrix, then error correction performance is improved, but implementation complexity increases
Solution Approach 1:
The Cordaro-Wagner component codes serve multiple functions: they provide the structural constraints needed for efficient encoding (limiting column and row weights) while simultaneously delivering improved error correction performance. This multi-functionality achieves performance enhancement without proportionally increasing implementation complexity
Solution Approach 2:
The invention creates a composite code structure by combining GLDPC code framework with Cordaro-Wagner component codes. The resulting code inherits the structural advantages of GLDPC codes (efficient encoding) while incorporating the error correction strengths of Cordaro-Wagner codes, achieving a synergistic effect that balances performance and complexity
Data Source
Figure 1
Figure 2
Figure 3~4
AI summary
Provided is a system and method for determining a generalized LDPC code for forward error correction channel coding that has a repeat-accumulate code structure to allow for easy encoding. Cordaro-Wagner component code check matrices may be selected, wherein each of the selected Cordora-Wagner component code check matrices has two rows which replace a row of a first parity check matrix to derive a second parity check matrix defining the generalized LDPC code.