Systematic LDPC Encoding with Block-Triangular Parity Matrix
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
High-speed digital communication systems face challenges in noise, fading, and Inter-Symbol Interference (ISI), which affect link performance, necessitating improved error correction methods for reliable data throughput in applications like 60GHz personal area networks and next-generation mobile communications.
Innovation Solution
The use of systematic Low Density Parity Check (LDPC) codes with a specific matrix structure, including row and column permutations, and the calculation of parity bits through sub-matrix operations to encode and decode data efficiently, ensuring robustness against channel noise and interference.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If systematic LDPC codes with specific matrix structure are used, then error correction capability is improved, but device complexity increases
Solution Approach 1:
The parity check matrix H is segmented into sub-matrices (H11, H12, H21, H22) with specific structures. The information bits are separated from parity bits through systematic encoding, and the matrix is divided into sections that can be processed independently during decoding operations, reducing the computational burden while maintaining error correction capability.
Solution Approach 2:
The patent employs quasi-cyclic structure where sub-matrices are formed by cyclic shifting of base matrices. By changing the cyclic shift parameters (row shifts and column shifts), different LDPC code rates and lengths can be achieved while maintaining the same base matrix structure, thus reducing device complexity through parameter variation rather than structural redesign.
2Productivity
If row and column permutations are applied to the parity check matrix, then encoding efficiency is improved, but manufacturing precision requirements increase
Solution Approach 1:
The parity check matrix is pre-arranged into a systematic form with specific row and column permutations before encoding operations. The matrix structure is prepared in advance with information bits in the first k columns and parity bits in the remaining n-k columns, allowing efficient encoding through simple matrix-vector multiplication without requiring complex real-time permutations during operation.
3Reliability
If sparseness is maintained in the parity check matrix, then error correction performance is improved, but loss of information increases
Solution Approach 1:
The parity check matrix exhibits local quality variations where different sub-matrices have different sparsity patterns. The H11 sub-matrix contains the identity matrix structure ensuring information bit preservation, while other sub-matrices have varying sparsity to provide error correction capability. This localized differentiation allows the system to maintain both sparseness for error correction and sufficient information preservation for data integrity.
Data Source
Figure 1~3
Figure 4~6
Figure 7~8
AI summary
A method and apparatus are disclosed that include encoding a codeword using a systematic low density parity check matrix using an encoder, the low density parity check matrix comprising a first sub-matrix associated with information symbols, a second sub-matrix having a block triangular structure associated with a first subset of parity check symbols and a third sub-matrix that is invertible and associated with a second subset of parity check symbols, the encoding performed over the second sub-matrix before the third sub-matrix.