Structured LDPC Decoding with Dynamic Expansion Factor Selection
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Low Density Parity Check (LDPC) coding systems face limitations in flexibility when processing data sequences, as they are typically adapted to specific code block lengths and struggle to accommodate varying lengths effectively.
Innovation Solution
A method and apparatus for structured LDPC coding that determines a coding expansion factor based on the code block size, a parameter of the basic check matrix, and a positive integer value, allowing for flexible encoding and decoding of data sequences by using the basic check matrix and the calculated expansion factor.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If structured LDPC codes use a fixed basic check matrix for specific code block lengths, then encoding and decoding can be performed with low complexity, but the system cannot accommodate varying code block sizes effectively
Solution Approach 1:
The patent applies parameter changes by dynamically adjusting the coding expansion factor z based on the actual code block size. The basic check matrix Hb remains fixed, but the expansion factor is modified according to the formula z = ceil(CBS/(kb×p))×p, where CBS is the code block size, kb is the number of system columns, and p is the parallelism degree. This allows the same basic check matrix to support multiple code block sizes while maintaining structured properties for efficient encoding and decoding.
2Adaptability or versatility
If the LDPC system uses a larger coding expansion factor to support more code block sizes, then adaptability improves, but the processing complexity and resource requirements increase
Solution Approach 1:
The patent implements dynamics by making the coding expansion factor adaptive rather than static. The expansion factor is dynamically determined based on the code block size, basic check matrix parameters, and desired parallelism degree. This dynamic adjustment allows the system to optimize the expansion factor for each specific coding scenario, supporting a range of code block sizes without permanently increasing the maximum expansion factor, thus maintaining processing efficiency.
3Reliability
If the basic check matrix is designed for high coding performance, then reliability improves, but the flexibility to process different code block sizes decreases
Solution Approach 1:
The patent applies universality by designing a basic check matrix Hb that serves multiple functions: it maintains the structured properties necessary for high coding performance and low complexity encoding/decoding, while simultaneously supporting multiple code block sizes through dynamic expansion factor adjustment. The same basic check matrix can be used for different code block sizes by changing the expansion factor, making the system multi-functional without sacrificing coding performance.
Data Source
AI summary
The embodiments of the present disclosure provide a method and an apparatus for data processing with structured LDPC codes. The method includes: obtaining a code block size for structured LDPC coding; determining a coding expansion factor z based on at least one of the code block size, a parameter kb of a basic check matrix, a positive integer value p or the basic check matrix having mb rows and nb columns; and encoding a data sequence to be encoded, or decoding a data sequence to be decoded, based on the basic check matrix and the coding expansion factor. The present disclosure is capable of solving the problem in the related art associated with low flexibility in data processing with LDPC coding and improving the flexibility in data processing with LDPC coding.