Structured LDPC Coding with Dynamic Expansion for Variable Block Sizes
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Low Density Parity Check (LDPC) coding systems face limitations in flexibility when processing data sequences of varying lengths, making it challenging to accommodate different code block sizes effectively.
Innovation Solution
The method involves determining a coding expansion factor based on the code block size, a parameter of the basic check matrix, and a positive integer value, allowing for encoding and decoding using the basic check matrix and the calculated expansion factor, which enables flexible data processing by adjusting the code block size and expanding the coding capacity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Device complexity
If structured LDPC codes with fixed basic check matrix dimensions are used, then decoding complexity is reduced, but flexibility in processing data sequences of varying lengths deteriorates
Solution Approach 1:
The patent applies dynamics by making the basic check matrix dimensions configurable rather than fixed. The method allows dynamic adjustment of the number of rows (m) and columns (n) of the basic check matrix Hb based on the actual data sequence length, enabling the LDPC code structure to adapt flexibly to varying data lengths while maintaining structured properties for efficient decoding.
Solution Approach 2:
The patent changes the parameters of the basic check matrix (dimensions m×n, expansion factor z, code block size) to match different data sequence lengths. By adjusting these parameters dynamically, the system maintains optimal decoding complexity while achieving flexibility in processing various data lengths.
2Adaptability or versatility
If the basic check matrix dimensions are increased to support larger code block sizes, then adaptability to different data lengths is improved, but device complexity increases
Solution Approach 1:
The patent segments the LDPC code structure into a compact basic check matrix Hb of size m×n and an expansion factor z. This segmentation allows the system to support large code block sizes (N = n×z×k) without requiring a proportionally large basic check matrix, thereby reducing storage and processing complexity while maintaining adaptability to different code block sizes.
Solution Approach 2:
The patent introduces the expansion factor z as an additional dimension parameter, transforming the relationship between basic check matrix size and supported code block size. Instead of linearly increasing matrix dimensions to support larger blocks, the system uses the exponential scaling provided by the expansion factor, reducing the growth rate of complexity.
3Ease of operation
If fixed code block sizes are used in LDPC coding, then encoding and decoding processes are simplified, but versatility in handling different data sequence lengths deteriorates
Solution Approach 1:
The patent creates a universal LDPC coding framework where a single basic check matrix structure can handle multiple code block sizes through parameter adjustment. The method allows the same encoding and decoding algorithms to work across different data sequence lengths by dynamically configuring matrix dimensions and expansion factors, achieving both simplicity and versatility.
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.