LDPC Parity Check Matrix Encoding With Reduced Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
The wide use of Low Density Parity Check (LDPC) codes is limited due to the high storage requirements for sparse and non-sparse parity check matrices, as well as the complexity of the traditional encoding process.
Innovation Solution
The method involves representing the parity check matrix using a generating sequence corresponding to row generators, allowing for cyclic shift or direct addressing to minimize storage space, thereby reducing the complexity of the encoding process.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the traditional sparse or non-sparse parity check matrix is used for LDPC encoding, then the error correction capability is maintained, but the storage space requirement becomes excessively large
Solution Approach 1:
The patent uses a generating sequence as a compact representation (copy) of the full parity check matrix. Instead of storing the entire M×N matrix, only the generating sequence needs to be stored, from which the full matrix can be reconstructed through cyclic shifts. This dramatically reduces storage space while maintaining the ability to perform encoding operations.
Solution Approach 2:
The patent extracts only the essential information needed to reconstruct the parity check matrix - specifically the generating sequence - rather than storing the complete matrix. This extraction approach keeps only the critical elements (the first row or generating sequence) that can generate the entire matrix through systematic cyclic shifts.
2Reliability
If the traditional LDPC encoding process is implemented, then the error correction performance is achieved, but the encoding complexity becomes excessively high
Solution Approach 1:
The patent segments the encoding process into two distinct phases: (1) generating the parity check matrix from the generating sequence using cyclic shifts, and (2) performing the actual encoding operations. This segmentation allows the system to work with a compact representation rather than the full matrix, reducing the complexity of matrix generation and manipulation while maintaining encoding performance.
Solution Approach 2:
The patent performs preliminary generation of the parity check matrix from the generating sequence before the actual encoding operation. By pre-generating the matrix structure using the compact generating sequence and cyclic shifts, the system prepares the encoding framework in advance, which simplifies the subsequent encoding process and reduces overall computational complexity.
Data Source
Figure 1~2
Figure 3~4
Figure 5~6
AI summary
Disclosed is a method for data transmission, comprising: generating the parity check matrix on the basis of the generating sequence corresponding to the preserved row generator; encoding the input data by the generated matrix obtained by said parity check matrix, and obtaining the output data comprising the parity check information. Also provided in the present invention is an apparatus for data transmission. The method and apparatus of the present invention could make the parity check matrix take the minimum storage space.