LDPC Parity Check Matrix Scaling for Variable Code Lengths
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current LDPC encoding and decoding methods struggle to support various input lengths and code rates, limiting their applicability in communication systems that require high-level length compatibility for transmitting different types of data.
Innovation Solution
A method and apparatus for LDPC encoding and decoding that utilize a parity check matrix with a block size having at least two different integer values, allowing for the conversion of a first sequence to a second sequence using a predetermined rule, enabling encoding and decoding of information bits across various input lengths and code rates.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a fixed block size is used for parity check matrix in LDPC encoding, then the encoding process is simple, but the system cannot support various input lengths and code rates
Solution Approach 1:
The patent implements dynamic block size selection where the block size of the parity check matrix is adjusted according to the input length and code rate requirements. The system can switch between different block sizes (e.g., 6480, 5760, 4320, etc.) based on the specific transmission conditions, enabling flexible adaptation to various input lengths and code rates while maintaining efficient LDPC encoding performance.
Solution Approach 2:
The patent changes the block size parameter of the parity check matrix to match different input lengths and code rates. By selecting appropriate block sizes from a predefined set and configuring the parity check matrix accordingly, the system achieves high-level length compatibility and supports diverse transmission requirements without requiring completely different encoding schemes.
2Adaptability or versatility
If multiple parity check matrices with different block sizes are maintained, then various input lengths are supported, but memory storage requirements increase
Solution Approach 1:
The patent pre-calculates and stores only the essential parameters (such as exponent values) for generating parity check matrices of different block sizes, rather than storing complete matrices. This allows the system to reconstruct the required parity check matrix on-demand based on the input length and code rate, significantly reducing memory storage requirements while maintaining the ability to support various input lengths.
Solution Approach 2:
The patent uses a base parity check matrix structure that can be scaled or transformed to generate parity check matrices of different block sizes. By maintaining a compact representation (such as an exponent matrix or generator matrix) and applying mathematical transformations, the system can generate the required parity check matrix for any supported block size without storing multiple complete matrices.
Data Source
AI summary
A channel encoding method in a communication or broadcasting system is provided. The channel encoding method includes reading a first sequence corresponding to a parity check matrix, converting the first sequence to a second sequence by applying a certain rule to a block size corresponding to a parity check matrix and the first sequence, and encoding information bits based on the second sequence. The block size has at least two different integer values.