LDPC Parity-Check Matrix Lifting Beyond Multiple-Z Constraints
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing LDPC code technologies face limitations in supporting various lengths and code rates due to the multiple relationship of lifting values, which restricts their application in mobile communication systems requiring high length compatibility.
Innovation Solution
A modified lifting method is proposed that allows the Z values to not have a multiple relationship, enabling the design of parity-check matrices with improved cycle characteristics and supporting various lengths without significant performance deterioration, by defining the maximum Z value and using divisors to determine Z values such as D, 2D, 3D, ..., SD, and optimizing the exponential matrix entries based on cycle characteristics.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If a modified lifting method is used to allow Z values without multiple relationship, then the support for various code lengths and improved cycle characteristics is achieved, but the complexity of determining parity-check matrices increases
Solution Approach 1:
The patent changes the parameter Z (lifting value) from requiring multiple relationships to allowing arbitrary values. By optimizing exponential matrix entries based on cycle characteristics for each Z value, the system achieves support for various code lengths while managing complexity through systematic parameter optimization rather than rigid structural constraints
Solution Approach 2:
The patent introduces dynamic determination of parity-check matrices based on code length requirements. Instead of using fixed lifting values, the system dynamically selects and optimizes exponential matrix entries according to the specific Z value and code length needed, allowing flexible adaptation to different communication scenarios
2Reliability
If Z values without multiple relationship are used, then error floor characteristics are improved, but the design complexity of parity-check matrices increases
Solution Approach 1:
The patent applies local quality by optimizing specific exponential matrix entries based on their position and the corresponding cycle characteristics. Different entries in the exponential matrix are optimized differently to improve error floor characteristics at specific locations in the Tanner graph, rather than applying uniform optimization across the entire matrix
Solution Approach 2:
The patent replaces the mechanical constraint of multiple relationships between Z values with an optimization-based approach. Instead of enforcing rigid structural rules, the system uses cycle characteristic analysis and exponential matrix optimization to achieve improved error floor characteristics, substituting mechanical design rules with analytical optimization
Data Source
AI summary
The present invention related to a 5G or pre-5G communication system to be provided to support a higher data transmission rate since 4G communication systems like LTE. The present invention relates to a method and an apparatus for encoding a channel in a communication or broadcasting system supporting parity-check matrices having various sizes are provided. The method for encoding a channel includes determining a block size of the parity-check matrix; reading a sequence for generating the parity-check matrix, and transforming the sequence by applying a previously defined operation to the sequence based on the determined block size.