LDPC Parity Check Matrix Block Sizing for Flexible Code Rates
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 diverse 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 the parity check matrix, then the encoding and decoding process is simplified, but the system cannot support various input lengths and code rates
Solution Approach 1:
The patent applies dynamics by making the block size of the parity check matrix variable rather than fixed. The system dynamically selects appropriate block sizes from a set of predefined sizes based on the input data length and desired code rate, allowing the LDPC code to adapt to various transmission requirements while maintaining efficient encoding and decoding performance for each specific configuration
Solution Approach 2:
The patent changes the parameter of block size in the parity check matrix to resolve the contradiction. By defining multiple parity check matrices with different block sizes and selecting the appropriate one based on input conditions, the system achieves both adaptability to various input lengths/code rates and manageable complexity through parameterization rather than requiring completely different structures for each case
2Adaptability or versatility
If multiple parity check matrices with different block sizes are maintained, then various input lengths and code rates are supported, but the memory storage and processing complexity increases
Solution Approach 1:
The patent segments the overall parity check matrix into smaller block-sized submatrices. By dividing the large parity check matrix into manageable blocks and maintaining multiple smaller matrices rather than one large matrix, the system reduces memory storage requirements while still supporting various input lengths through concatenation and selection of appropriate blocks for different transmission scenarios
Solution Approach 2:
The patent creates a universal set of parity check matrices with different block sizes that can serve multiple functions. Each matrix in the set can be used for different input lengths and code rates, allowing a single standardized set of matrices to handle diverse transmission requirements without requiring separate specialized matrices for each case, thus reducing the total quantity needed
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.