LDPC Parity Check Matrix Scaling for Lower Encoding Complexity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing LDPC encoding methods require multiple base matrices, leading to increased power consumption and encoding complexity due to the need for multiple implementations.
Innovation Solution
The proposed solution involves using a single base matrix to generate multiple parity check matrices with different code lengths, reducing the need for multiple implementations and thus lowering power consumption and encoding complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If multiple base matrices are used to support different code lengths, then adaptability to different communication scenarios is improved, but device complexity and power consumption increase
Solution Approach 1:
The patent applies universality by designing a single base matrix that can generate multiple parity check matrices of different code lengths through parameter configuration. This single base matrix serves multiple functions, replacing the need for separate base matrices for different code lengths, thereby reducing device complexity while maintaining adaptability to various communication scenarios
Solution Approach 2:
The patent utilizes parameter changes by modifying the extension factor and column permutation parameters of the base matrix to generate different parity check matrices. By changing these parameters rather than using entirely different base matrices, the system achieves adaptability to different code lengths with reduced complexity
2Adaptability or versatility
If multiple base matrices are implemented, then support for various code lengths is improved, but power consumption increases
Solution Approach 1:
The single base matrix is designed to perform multiple functions by generating different parity check matrices through parameter adjustments. This universal base matrix eliminates the need to maintain and switch between multiple separate base matrices, directly reducing power consumption while supporting various code lengths
Solution Approach 2:
The patent merges the functionality of multiple base matrices into a single base matrix structure. By combining the capabilities of what would have been separate base matrices into one unified structure that can be configured for different code lengths, the system reduces power consumption associated with maintaining multiple independent implementations
3Device complexity
If a single base matrix is used to generate multiple parity check matrices, then encoding complexity is reduced, but flexibility in selecting optimal matrices may be limited
Solution Approach 1:
The patent compensates for the single base matrix structure by introducing multiple configurable parameters including extension factors, column permutation sequences, and submatrix arrangements. By changing these parameters, the system achieves the flexibility of multiple base matrices while maintaining the simplicity of a single base matrix implementation, thus reducing encoding complexity without sacrificing adaptability
Data Source
AI summary
A method includes performing low-density parity-check (LDPC) encoding on a first bit sequence based on a parity check matrix to obtain a first data packet and sending the first data packet. The parity check matrix includes a first parity check matrix and a second parity check matrix, both the first parity check matrix and the second parity check matrix conform to a first base matrix, and a code length of the first parity check matrix is different from a code length of the second parity check matrix.