LDPC Parity Check Matrix for Variable-Rate Channel Coding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current communication systems, particularly 5G, face challenges in maintaining high data throughput and reliability due to channel noise, fading, and inter-symbol interference, necessitating advanced error-correcting codes for improved link performance.
Innovation Solution
The development of a low-density parity-check (LDPC) encoding/decoding method that supports various input lengths and coding rates, utilizing a designed parity check matrix with a weight distribution satisfying balancing conditions to enhance decoder throughput and flexibility.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If conventional error-correcting codes are used to address channel noise and interference, then communication reliability is improved, but data throughput and system flexibility are limited
Solution Approach 1:
The patent applies parameter changes by systematically varying the block size Z and coding rate parameters in the LDPC code design. The parity check matrix is constructed with configurable dimensions (Z×Z blocks) and density parameters, allowing the system to adapt between reliability-oriented configurations (lower coding rates, larger block sizes) and throughput-oriented configurations (higher coding rates, optimized block sizes), thus resolving the contradiction between reliability and productivity.
Solution Approach 2:
The patent implements dynamics through the configurable and adaptable LDPC code structure. The system can dynamically select different block sizes Z, coding rates, and parity check matrix configurations based on channel conditions and traffic requirements. This dynamic adaptability allows the system to optimize the balance between reliability and throughput in real-time, preventing the degradation that would occur with fixed conventional codes.
2Device complexity
If LDPC codes with fixed block sizes are used, then decoding complexity is reduced, but adaptability to various input lengths and coding rates is limited
Solution Approach 1:
The patent achieves universality through the modular LDPC code design where a single family of codes, parameterized by block size Z, can handle multiple input lengths and coding rates. The parity check matrix structure with Z×Z circulant blocks serves as a universal template that can be instantiated with different Z values and density parameters to support various communication scenarios, eliminating the need for multiple fixed-size code implementations.
Solution Approach 2:
The patent applies segmentation by dividing the parity check matrix into Z×Z circulant block segments. This segmented structure allows the overall code to be constructed from repeated modular units, where each block can be independently configured. This segmentation enables the system to support various input lengths by adjusting the number of blocks while maintaining a consistent decoding complexity per block, thus achieving versatility without proportional complexity increase.
3Reliability
If high-density parity check matrices are used, then error correction capability is improved, but decoder throughput is reduced
Solution Approach 1:
The patent applies local quality by creating non-uniform density distributions within the parity check matrix blocks. Rather than using uniform high-density matrices throughout, the design allows different Z×Z block segments to have locally optimized densities based on their position and function in the overall code structure. This local optimization maintains strong error correction capability in critical areas while reducing density in other areas to improve decoder throughput, resolving the contradiction between reliability and productivity.
Data Source
AI summary
A method for channel encoding in a communication or broadcasting system is provided. The method includes determining a block size Z, and performing encoding based on the block size and a first matrix corresponding to the block size, wherein the first matrix is determined based on information and a plurality of second matrices, and wherein a part of a column index indicating a position of a non-zero element in each row of the information includes an index according to mathematical expression 22 above.