Systematic U|U+V Coding Structure for Low-Complexity Decoding
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Existing channel coding methods, such as classical algebraic coding and modern coding, face challenges in decoding performance when code length is small or medium, and lack low-complexity decoding algorithms.
Innovation Solution
A coding method using a systematic (U|U+V)-code with a generator matrix that includes identity sub-matrices, allowing for flexible adaptation of code lengths and coding rates, reducing storage overhead and complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If classical algebraic coding (BCH/RS code) is used, then code distance is good, but decoding complexity is high
Solution Approach 1:
The code is segmented into two parts: a U code component and a V code component. The generator matrix is divided into sub-matrices (G1, G2, G3, G4) that correspond to different code segments. This segmentation allows the decoder to process different parts of the code independently, reducing overall decoding complexity while maintaining good code distance properties through the structured combination of segments.
Solution Approach 2:
The patent creates a composite code structure by combining U code and V code components into a (U|U+V) code. This composite structure integrates the error correction capabilities of both code types while enabling more efficient decoding algorithms that exploit the specific structure of the composite generator matrix, thus achieving good reliability with reduced decoding complexity.
2Device complexity
If modern coding (Turbo code, LDPC code) is used, then decoding complexity is low and decoding performance is good for large code length, but decoding performance is greatly reduced when code length decreases
Solution Approach 1:
The patent employs parameter changes by using a structured generator matrix with specific sub-matrix configurations that can be adapted to different code lengths. The identity sub-matrices and check sub-matrices are arranged in a pattern that maintains good decoding performance across various code lengths, not just for large code lengths. This structural parameter design enables modern-like low decoding complexity while achieving good performance even for medium and small code lengths.
3Ease of manufacture
If generator matrix of (U|U+V)-code is stored directly, then coding can be performed, but storage overhead is high
Solution Approach 1:
The generator matrix is segmented into multiple sub-matrices (G1, G2, G3, G4) with specific structures. Instead of storing the complete generator matrix, the system stores only the essential sub-matrices that can be used to reconstruct the full generator matrix when needed. This segmentation significantly reduces storage overhead while maintaining the ability to perform coding operations.
Solution Approach 2:
The patent extracts and stores only the critical components of the generator matrix (the sub-matrices G1, G2, G3, G4) rather than the entire matrix. These extracted sub-matrices contain the essential information needed to generate the (U|U+V) code, allowing the system to reduce storage requirements while preserving full coding functionality through computational reconstruction when the complete generator matrix is needed.
Data Source
AI summary
A coding method and apparatus are provided. The method includes: coding an information bit by using a preset generator matrix of a systematic (U|U+V)-code to obtain a codeword of a systematic code. The preset generator matrix of the systematic (U|U+V)-code includes a first identity sub-matrix of a U code and a second identity sub-matrix of a V code. A plurality of elements in a same column as the first identity sub-matrix are all 0. A plurality of elements in a same column as the second identity sub-matrix are all 0.