Quasi-Cyclic LDPC Encoding Layout for Long-Frame Decoding Simplicity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing error correction encoding methods, particularly low density parity check (LDPC) codes, face challenges in achieving substantial encoding gain as frame length increases, leading to complex encoding and decoding processes and limited improvements in encoding gain with longer frames.
Innovation Solution
The proposed solution involves dividing transmission data into short sequences, encoding them using an m-stage quasi-cyclic LDPC method, generating redundant sequences, and further encoding these sequences to achieve improved encoding gain while maintaining a simplified decoding structure, allowing for efficient decoding without increasing circuit scale or memory usage.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the frame length is extended by increasing the number of stages of quasi-cyclic low-density parity check codes, then the encoding gain is improved, but the decoding processing becomes more complicated and the device complexity increases
Solution Approach 1:
The patent segments the long frame into multiple short sequences, each processed by separate encoding units. The transmission data sequence is divided into L-pieces of short sequences, with each encoded by an m-stage quasi-cyclic low density parity check encoding module. This segmentation allows the system to achieve encoding gain equivalent to long frames while maintaining simpler decoding processing for each segment.
Solution Approach 2:
The patent implements a nested structure where redundant sequences are generated by encoding the already-encoded sequences again through a second encoding module. The data replacing module rearranges the encoded sequences, which are then fed into another encoding stage, creating a nested encoding structure that enhances reliability without proportionally increasing decoding complexity.
2Reliability
If the frame length is increased to achieve larger encoding gain, then the encoding gain is improved, but the amount of calculations required for encoding and decoding processing increases
Solution Approach 1:
By dividing the transmission data sequence into L-pieces of short sequences and encoding each separately, the patent reduces the calculation amount for each encoding operation compared to encoding a single long frame. Each encoding unit processes only a portion of the data, thereby reducing the overall computational burden while maintaining the equivalent encoding gain of longer frames through the combined structure.
3Reliability
If the frame length is extended, then the encoding gain is improved, but the scale of encoding and decoding apparatus expands
Solution Approach 1:
The patent uses multiple encoding units that process short sequences in parallel, avoiding the need for a single large-scale encoding apparatus designed for long frames. Each encoding unit has a standardized, manageable scale, and the overall system achieves long-frame equivalent performance through the coordinated operation of multiple smaller units.
Solution Approach 2:
The encoding units are designed with universal functionality to handle different segments of data using the same m-stage quasi-cyclic low density parity check encoding method. This multi-functionality allows the apparatus to process divided sequences through identical modular units, preventing the need to expand the scale of individual apparatus components.
4Reliability
If the frame length is increased, then the encoding gain is improved, but the decoding apparatus becomes more complicated
Solution Approach 1:
The patent divides the encoded sequences into multiple segments and processes them through separate decoding operations. Each decoding unit handles a specific segment independently, maintaining simpler decoding logic compared to processing a single long frame. The data replacing module coordinates these segmented decoding operations to achieve the overall decoding of the original data sequence.
Data Source
AI summary
Provided is an encoding apparatus wherein a transmission data sequence is divided into L short sequences, each of which is then encoded by use of an m-stage pseudo-cyclic low-density parity check encoding system. Each of the L encoded sequences is further divided into shorter sequences, the number of which is identical to the number m of the stages of the pseudo-cyclic codes and each of which has a length m. The shorter sequences are rearranged in order by a replacing module, thereafter encoded, by use of the m-stage pseudo-cyclic low-density parity check encoding system, and outputted. Accordingly, a decoding apparatus with a simple structure where node processing circuits (e.g., minimum-value calculating circuits), the number of which is p that is a submultiple of the number m of the foregoing stages, are provided, can be employed to efficiently decode the codes having a large frame length and a large encoding gain.