Protograph LDPC Code Layout for Lower Decoding Thresholds
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing methods for generating rate-compatible low-density parity-check (LDPC) codes from protographs often result in higher decoding thresholds and suboptimal performance due to limitations in edge connections and optimization techniques, particularly in puncturing and code extension methods, which do not guarantee all possible connections in the graph structure and lead to a wider gap to capacity limits.
Innovation Solution
The method involves selecting a desired code rate and optimizing the number of variable and check nodes in a protograph, searching for all possible edges to compute permutations, and selecting the protograph with the lowest iterative decoding threshold to ensure linear minimum distance growth and low decoding thresholds, thereby constructing LDPC codes with improved performance.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If conventional puncturing or code extension methods are used to generate rate-compatible LDPC codes, then code rate adaptability is improved, but decoding threshold increases and performance deteriorates
Solution Approach 1:
The patent applies parameter changes by systematically varying the edge connections in the protograph to optimize the decoding threshold. Specifically, different edge connection patterns (parameters) are evaluated to find the configuration that minimizes the decoding threshold while maintaining the desired code rate adaptability through puncturing or extension operations.
Solution Approach 2:
The patent employs preliminary action by pre-optimizing the protograph structure before generating the actual LDPC codes. The edge connections in the protograph are carefully designed and constrained beforehand to ensure that all derived rate-compatible codes (through puncturing or extension) will have optimal decoding performance, rather than optimizing each code individually.
2Device complexity
If conventional protograph methods are used, then encoding complexity is reduced, but the gap to capacity limits increases
Solution Approach 1:
The patent optimizes the edge connection parameters in the protograph to minimize the gap to capacity limits. By systematically searching and evaluating different edge connection configurations, the method finds the optimal parameter set that achieves near-capacity performance while preserving the low encoding complexity inherent in protograph-based constructions.
Solution Approach 2:
The patent uses feedback from decoding threshold calculations to guide the selection of edge connections. The iterative decoding threshold is computed for different protograph configurations, and this feedback information is used to select the configuration that achieves the lowest threshold and smallest gap to capacity, thereby improving reliability without increasing complexity.
3Ease of manufacture
If edge connections are not fully optimized in protographs, then design simplicity is maintained, but decoding threshold increases
Solution Approach 1:
The patent systematically varies and optimizes the edge connection parameters in the protograph to minimize the decoding threshold. By evaluating different parameter configurations (edge connections) and selecting the optimal ones, the method achieves low decoding thresholds while maintaining the systematic and structured nature of protograph-based design.
Solution Approach 2:
The patent replaces ad-hoc or manual protograph design methods with a systematic computational approach. Instead of relying on intuitive or manual optimization of edge connections, the method uses automated algorithms to search and evaluate all possible edge connection configurations, objectively selecting the optimal configuration based on decoding threshold criteria.
Data Source
AI summary
Digital communication coding methods resulting in rate-compatible low density parity-check (LDPC) codes built from protographs. Described digital coding methods start with a desired code rate and a selection of the numbers of variable nodes and check nodes to be used in the protograph. Constraints are set to satisfy a linear minimum distance growth property for the protograph. All possible edges in the graph are searched for the minimum iterative decoding threshold and the protograph with the lowest iterative decoding threshold is selected. Protographs designed in this manner are used in decode and forward relay channels.