Polar code adaptive decoding method and system
A decoding system and self-adaptive technology, applied in the transmission system, digital transmission system, error correction/detection using linear codes, etc., can solve the problems of reducing decoding complexity, not suitable for long code applications, and high training complexity , to achieve the effect of reducing computational complexity, reducing the number of path extensions, and improving applicability
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0036] combine figure 1As shown, a polar code adaptive decoding method of the present invention first constructs a neural network and trains it, then inputs the path information to be decoded into the neural network to obtain the maximum number of paths in each layer of the information code binary tree; through the neural network The maximum path number of each layer in the information code binary tree of the decoder is obtained, so that the search width of each layer can be selected and determined, and then it can be applied to various SNR scenarios, improving the applicability of the method. Furthermore, the maximum number of paths in each layer is input to the decoder, and then the path to be decoded is extended in parallel according to the maximum number of paths in each layer to obtain candidate paths, thereby reducing the number of path extensions in each layer, thereby reducing the decoding The time and space complexity of the device; then calculate the transition proba...
Embodiment 2
[0062] combine image 3 In the decoding system shown, the code length N is 8, the number of information bits K is 4, and the search width L max is 4, the black nodes are the nodes visited by the system, and the gray nodes are the nodes visited by the traditional list decoding algorithm. The input vector of the neural network unit in this embodiment is a received codeword with a length of 8, and the output is a search width sequence with a length of 2, which is then transmitted to the decoding unit. In the decoding unit, when i=7, the corresponding Z 1 =1, so only one path is extended, and the same applies when i=8. Compared with the traditional list decoding algorithm, the number of access nodes in this system is significantly reduced, and it has a significant advantage in computational complexity.
[0063] combine Figure 4 as shown, Figure 4 The code length in N=64, the initial maximum search width L max =4, signal-to-noise ratio EbN0=1.0-4.0dB, under various signal-t...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com