Structured LDPC Coding with Adaptive Expansion Factors
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current Low Density Parity Check (LDPC) coding technologies face challenges in flexibility when processing data sequences of varying lengths, limiting their adaptability and efficiency in communication systems.
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 determined expansion factor, which includes operations such as padding bit addition and Cyclic Redundancy Check (CRC) sequence integration.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If traditional LDPC coding is used with fixed code block sizes, then decoding performance is optimized for specific block sizes, but adaptability to varying data sequence lengths is limited
Solution Approach 1:
The patent applies parameter changes by dynamically adjusting the code block size parameter to match the actual data sequence length. The encoder determines the appropriate code block size based on the input data length, and the decoder accordingly configures its decoding parameters. This allows the LDPC coding system to adapt to varying data sequence lengths while maintaining optimal decoding performance for each specific block size configuration.
2Productivity
If code block size is increased to improve throughput, then productivity increases, but device complexity increases due to larger check matrices
Solution Approach 1:
The patent applies segmentation by dividing the large code block into smaller sub-blocks that can be processed independently or in parallel. The check matrix is correspondingly segmented, allowing the decoder to process smaller portions of data with reduced memory requirements and computational complexity at each processing stage, while still achieving high overall throughput through efficient parallel processing of multiple segments.
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.