Neural Network Channel Encoding for Polar Codeword Complexity
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional channel encoding and decoding processes for polar codes face high complexity due to the exponential increase in code sequences with increasing code length, making it difficult to traverse the entire codeword space efficiently.
Innovation Solution
Implementing a channel encoding method using an encoding neural network with small neural network units connected to generalize over the entire codeword space, utilizing a kernel matrix and training the network to achieve a mapping relationship with an error threshold, and incorporating encoding/decoding butterfly diagrams to match neural network units.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Reliability
If the code length is increased to improve error correction capability, then the reliability is improved, but the complexity of traversing the entire codeword space increases exponentially
Solution Approach 1:
The patent segments the entire codeword space into multiple sub-codeword spaces based on the codebook structure. Instead of traversing the entire large codeword space, the neural network learns and traverses smaller sub-codeword spaces separately. This segmentation reduces the complexity from exponential in the total code length to exponential in smaller segments, while still maintaining comprehensive coverage through the structured partitioning of the codebook.
2Productivity
If the quantity of information bits is increased to improve data transmission capacity, then the productivity is improved, but the complexity of traversing the entire codeword space is greatly increased
Solution Approach 1:
The patent divides the large codeword space corresponding to high information bit rates into multiple smaller sub-codeword spaces. The neural network processes these segments independently, reducing the traversal complexity from exponential in the total number of information bits to exponential in smaller segments. This allows high data transmission capacity to be achieved without proportionally increasing the traversal complexity.
Solution Approach 2:
The patent introduces a new dimension of organization by structuring the codebook into multiple sub-codebooks or partitions. This dimensional reorganization allows the neural network to navigate the codeword space more efficiently by operating in lower-dimensional subspaces rather than directly in the full high-dimensional space, thereby reducing complexity while maintaining capacity.
3Reliability
If a large neural network is used to cover the entire codeword space, then the reliability is improved, but the learning complexity and difficulty are increased
Solution Approach 1:
The patent segments the codeword space coverage task into multiple smaller sub-tasks, each handled by a smaller neural network component or learning process. Instead of training one large neural network to cover the entire codeword space, the system uses multiple smaller networks or a hierarchical structure that processes segments independently. This reduces the learning complexity from training a single large network to training multiple smaller networks, while still achieving comprehensive coverage through aggregation.
Solution Approach 2:
The patent applies partial action by having the neural network learn and process only specific sub-codeword spaces or partitions at a time, rather than attempting to learn the entire codeword space in one go. This partial coverage approach reduces the immediate learning burden while maintaining the ability to achieve complete coverage through multiple passes or hierarchical processing of different partitions.
Data Source
Figure 1~2a
Figure 2b~3
Figure 4~6
AI summary
Embodiments of this application provide an encoding method and apparatus, and a decoding method and apparatus, and relate to the communications field. In the method, a corresponding neural network unit may be generated based on a kernel matrix, and then an encoding neural network or a decoding neural network may consist of neural network units. In this way, the encoding neural network or the decoding neural network is obtained after small neural network units are connected, so that in an encoding/a decoding learning process, generalization can be implemented to entire codeword space by using a small learning sample, to weaken impact of information with a relatively long codeword on complexity and learning difficulty of a neural network.