Punctured LDPC Code Layout for Burst-Error-Resistant Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current data transmission systems using LDPC codes face challenges in maintaining favorable communication quality due to burst errors and erasures, particularly in AWGN channels and multipath environments, which affect the decoding performance and increase power consumption.
Innovation Solution
The implementation of a transmission and reception system that employs a parity interleaving and group-wise interleaving scheme for LDPC codes, which separates parity bits to prevent simultaneous errors at check nodes, thereby improving resistance to burst errors and maintaining decoding performance in AWGN channels.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If LDPC codes are used for data transmission, then error correction capability is improved, but vulnerability to burst errors and erasures increases
Solution Approach 1:
The patent applies segmentation by dividing the LDPC code structure into information bits and parity bits, and further segmenting the parity bits into multiple groups that are interleaved. This segmentation prevents burst errors from affecting all parity bits simultaneously, as errors are distributed across different groups. The code length is set to 69120 bits with specific information bit lengths (64800, 65520, 66240, 66960, 67680, 68400, 69120), creating structured segments that enhance error resilience.
Solution Approach 2:
The patent introduces a new dimension of protection by applying interleaving across the parity bit groups. Instead of treating all parity bits uniformly, the invention creates a multi-dimensional structure where parity bits are arranged in groups and interleaved in a specific pattern. This dimensional transformation allows the system to withstand burst errors that would otherwise propagate through the entire code structure.
2Adaptability or versatility
If puncturing is applied to extend code length, then coding flexibility is improved, but communication quality deteriorates
Solution Approach 1:
The patent applies local quality by treating information bits and parity bits differently through selective puncturing. The information bit length is set to specific values (64800, 65520, 66240, 66960, 67680, 68400, 69120) while the total code length is fixed at 69120 bits. This local differentiation allows flexible adaptation to various coding rates while maintaining optimal error correction performance through careful preservation of critical information bits.
Solution Approach 2:
The patent utilizes parameter changes by varying the information bit length parameter while keeping the total code length constant at 69120 bits. This allows the system to adapt to different communication conditions and coding rate requirements. The specific parameter values for information bits (64800, 65520, 66240, 66960, 67680, 68400, 69120) provide discrete adaptation points that optimize performance across different channel conditions.
3Ease of operation
If conventional LDPC decoding is used, then decoding simplicity is maintained, but power consumption increases under burst error conditions
Solution Approach 1:
The patent applies preliminary action by pre-arranging the LDPC code structure with specific information bit lengths and parity bit groupings before transmission. The code is designed with predetermined parameters (code length 69120, information bit lengths 64800-69120) that are optimized to resist burst errors. This preliminary structuring enables the decoder to operate efficiently without requiring complex real-time error analysis, reducing power consumption while maintaining simplicity.
Data Source
Figure 1~2
Figure 3
Figure 4
AI summary
The present technology relates to a transmission device, a transmission method, a reception device, and a reception method for securing good communication quality in data transmission using an LDPC code. LDPC coding for information bits with an information length K = N × r is performed on the basis of an extended parity check matrix having rows and columns each extended by a predetermined puncture length L with respect to a parity check matrix of an LDPC code with a code length N of 69120 bits and a coding rate r of 14/16, so that an extended LDPC code having parity bits with a parity length M = N + L - K is generated. Then, a head of the information bits of the extended LDPC code is punctured by a puncture length L, so that a punctured LDPC code with the code length N of 69120 bits and the coding rate r is generated. The extended parity check matrix includes an information matrix portion corresponding to the information bits and a parity matrix portion corresponding to the parity bits. The present technology can be applied to, for example, data transmission using an LDPC code.