QC-LDPC Parity-Check Matrix Layout for Low-Complexity 1/2-Rate Encoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing LDPC codes face challenges with computationally intensive encoding processes due to high-density generator matrices, limiting their practical application, especially in wireless communication systems like IEEE 802.11 standards, where the supported block length is insufficient for achieving optimal error correction gains.
Innovation Solution
Implementing quasi-cyclic low-density parity-check (QC-LDPC) codes with a block length of 7776 and a code rate of 1/2, utilizing a parity check matrix with a quasi-cyclic structure and Khatri-Rao lifting to simplify encoding and decoding processes, and optimizing the binary matrix Γ for improved performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If traditional LDPC codes with high-density generator matrices are used, then error correction capability is improved, but encoding computational complexity increases significantly
Solution Approach 1:
The patent segments the generator matrix into multiple blocks, where each block corresponds to a specific set of information bits and parity bits. This segmentation transforms the single complex high-density generator matrix into multiple smaller, structured blocks that can be processed independently, reducing the overall computational complexity while maintaining the error correction capability through the structured arrangement of these blocks.
Solution Approach 2:
The patent changes the structural parameters of the generator matrix from a traditional high-density form to a quasi-cyclic low-density form with specific block structures. By modifying the density and cyclic properties of the matrix, the encoding complexity is reduced while the error correction performance is maintained through careful design of the block structures and their interconnections.
2Reliability
If longer block lengths are used to achieve optimal error correction gains, then reliability is improved, but processing time and complexity increase
Solution Approach 1:
The patent divides the long codeword into multiple blocks, each with its own structured sub-generator matrix. This segmentation allows parallel processing of different blocks during encoding, significantly reducing the effective processing time despite the long overall block length. The structured blocks can be computed independently and then combined to form the complete codeword.
Solution Approach 2:
The patent employs periodic or quasi-periodic structures in the generator matrix blocks, where patterns repeat across different blocks. This periodicity enables the use of pre-computed values and reusable computational templates, reducing the actual processing time required for each block while maintaining the benefits of long block lengths for error correction performance.
Data Source
Figure 1
Figure 2
Figure 3
AI summary
An apparatus (105) includes a transmitter (120) and one or more processors (2010). The one or more processors (2010) is configured to identify, according to a code rate of 1/2 and a code block size of 7776 bits, a first binary parity check matrix for a quasi-cyclic-low-density parity-check, QC-LDPC, code, the first binary parity check matrix corresponding to a first exponent matrix. The one or more processors (2010) encode data using the first binary parity check matrix. The transmitter (120) transmits the encoded data.