Channel Coding Generator Construction With Two-Sequence Storage
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Current channel coding technologies face challenges in efficiently supporting various code lengths and bit rates due to high storage complexity, particularly in random coding, which limits their effectiveness in wireless communication systems.
Innovation Solution
The method determines generator polynomials or matrices for channel coding by using two sequences, reducing storage space and complexity by extracting subsequences from prestored sequences, and constructing generator polynomials or matrices for different lengths and bit rates, thereby improving system communication confidentiality.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Adaptability or versatility
If random coding is used for channel coding, then coding flexibility for different lengths and bit rates is improved, but storage complexity increases
Solution Approach 1:
The generator polynomial is segmented into two independent sequences: a first sequence determining the high-order coefficients and a second sequence determining the low-order coefficients. This segmentation allows each sequence to be stored separately and combined during encoding, reducing the overall storage requirement from storing all possible generator polynomials to storing only two base sequences.
Solution Approach 2:
The two stored sequences serve as universal building blocks that can generate multiple different generator polynomials through their linear combination. These generated polynomials can then be used for channel coding with various code lengths and bit rates, making the storage structure universally applicable to multiple coding scenarios without requiring separate storage for each case.
2Adaptability or versatility
If multiple generator polynomials are stored to support different code lengths and bit rates, then coding adaptability is improved, but storage space increases
Solution Approach 1:
Instead of storing multiple complete generator polynomials, the system stores two base sequences that can be copied and combined in different ways to generate the required generator polynomials on-demand. This copying approach reduces storage space while maintaining the ability to support various coding configurations.
Solution Approach 2:
The system changes the parameter representation from storing complete generator polynomials to storing two fundamental sequences. By changing how the coding parameters are represented and stored, the system achieves the same coding adaptability with significantly reduced storage requirements.
Data Source
AI summary
Embodiments of this application disclose a channel coding method and apparatus. The method includes: obtaining a subsequence based on a first sequence and a second sequence; and determining a generator polynomial or a generator matrix based on the subsequence, where the generator polynomial or the generator matrix is used for cyclic code encoding. According to embodiments of this application, generator polynomials or generator matrices for channel coding of different lengths and different bit rates are determined by using two sequences, so that storage space is reduced, and storage complexity is reduced.