Prime-Period LDPC-CC Encoding for Variable-Length Data
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current LDPC-CC technologies are limited in their time-varying periods, particularly for error correction capabilities, as they primarily focus on periods of 2, 3, and multiples thereof, lacking flexibility and high error correction for variable-length data transmission.
Innovation Solution
The development of an encoding and decoding method using low-density parity-check convolutional codes (LDPC-CC) with a time-varying period of q, where q is a prime number greater than 3, employing parity check polynomials to achieve a coding rate of (n−1)/n, enabling efficient encoding and decoding of arbitrary-length information sequences.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If LDPC-CC with time-varying periods of 2, 3, or multiples thereof is used, then the coding structure is simple and implementation is easier, but the error correction capability is limited
Solution Approach 1:
The patent changes the time-varying period parameter from traditional values (2, 3, or multiples) to a prime number greater than 3. This parameter change improves error correction capability by creating a more favorable parity check matrix structure with better distribution of non-zero elements, while maintaining the same basic LDPC-CC encoder architecture, thus avoiding significant complexity increase.
2Adaptability or versatility
If padding or puncturing processing is applied to adjust transmission information sequence length, then the LDPC code block length can be matched, but the coding rate changes or redundant sequences are transmitted
Solution Approach 1:
The patent employs a dynamic time-varying period structure where the parity check polynomial changes based on the current time index modulo the time-varying period. This dynamic structure allows the encoder to process information sequences of arbitrary length without requiring padding or puncturing, as the convolutional nature of the code adapts to any input length while maintaining a fixed coding rate.
3Reliability
If fixed-length LDPC code blocks are used, then the coding structure is well-defined, but it is difficult to match variable-length Ethernet frames
Solution Approach 1:
The patent segments the fixed-length LDPC code block structure into a convolutional code structure with sliding window properties. By using a time-varying period that changes with each time index, the code effectively processes data in continuous segments rather than fixed blocks, allowing arbitrary-length information sequences to be encoded while maintaining the mathematical structure of LDPC codes.
Data Source
AI summary
An encoding moihod and encoder of a lime-varying LDPC-CC with high error correction performance are provided. In an encoding method of performing low density parity check convolutional coding (LDPC-CC) of a time varying period of q using a parity check polynomial of a coding rate of (n−1)/n (where n is an integer equal to or greater than 2), the time varying period of q is a prime number greater than 3, the method receiving an information sequence as input and encoding the information sequence using Equation 1 of the attached detailed description as a g-th (g=0, 1, . . . q−1) parity check polynomial to satisfy 0: