LDPC Group-Wise Interleaving for Low-Power Burst Error Correction
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data transmission using LDPC codes faces challenges in maintaining excellent communication quality, particularly due to errors and burst errors in communication paths, which affect decoding performance and power consumption.
Innovation Solution
The implementation of a data processing device and method that performs LDPC encoding based on specific parity check matrices with varying encoding rates, followed by group-wise interleaving and mapping to signal points, to enhance error correction and communication quality.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If LDPC encoding is performed with increased code length to improve error correction capability, then decoding performance is improved, but power consumption increases
Solution Approach 1:
The LDPC code is divided into multiple bit groups (e.g., 360 bits per group), and group-wise interleaving is applied to reorder these groups. This segmentation approach allows the system to achieve error correction performance close to that of full-length codes while reducing the computational complexity and power consumption of decoding operations.
Solution Approach 2:
The patent employs specific parity check matrix structures with varying degrees of progressiveness and optimized column weights. By carefully selecting and adjusting parameters such as the progressiveness parameter and column weight distribution in the parity check matrix, the system achieves near-Shannon-limit performance with reduced decoding iterations, thereby lowering power consumption.
2Reliability
If group-wise interleaving is applied to reduce burst error impact, then communication quality is improved, but device complexity increases
Solution Approach 1:
The code is divided into manageable bit groups that can be independently interleaved and processed. This segmentation simplifies the interleaving operation to basic group reordering, reducing the complexity compared to bit-level interleaving while still effectively dispersing burst errors across different code positions.
Solution Approach 2:
Group-wise interleaving is performed as a preliminary step before modulation and transmission. By pre-arranging the bit groups in an optimized sequence that distributes burst error impacts, the system simplifies subsequent decoding operations and reduces the overall processing complexity during real-time communication.
3Reliability
If LDPC code with longer code length is used to approach Shannon limit, then block error probability is reduced, but decoding time increases
Solution Approach 1:
By segmenting the long LDPC code into smaller bit groups and applying group-wise interleaving, the patent enables parallel processing during decoding. This approach maintains the error correction benefits of long codes while reducing decoding time through improved computational efficiency and potential parallelization of decoding operations.
Solution Approach 2:
The patent optimizes the parity check matrix parameters including column weights and progressiveness to enable faster convergence of iterative decoders. By carefully selecting these parameters, the system achieves low block error probabilities with fewer decoding iterations, thereby reducing overall decoding time despite using long code lengths.
Data Source
AI summary
The present technology relates to a data processing device and a data processing method, which are capable of securing excellent communication quality in data transmission using an LDPC code. In group-wise interleave, an LDPC code in which a code length N is 16200 bits and an encoding rate r is 6/15, 8/15, or 10/15 is interleaved in units of bit groups of 360 bits. In group-wise deinterleave, a sequence of the LDPC code that has undergone the group-wise interleave is restored to an original sequence. For example, the present technology can be applied to a technique of performing data transmission using an LDPC code.