Polar Code SCL Decoding with Adaptive Survivor Path Control
Find Innovative SolutionsGenerate Solutions
Solution Overview
Problem
Conventional polar code decoding methods are complex due to a fixed survivor path quantity, leading to increased system complexity and energy consumption, especially when the code length is short.
Innovation Solution
Adaptive determination of the survivor path quantity based on the code length and signal-to-noise ratio (SNR) during polar polar code decoding, allowing for a smaller value of survivor paths without compromising performance, and adaptive determination of the CRC check code length based on the information sequence length to optimize encoding complexity.
Engineering Contradictions & Design Principles
Engineering Contradiction Analysis
1Ease of operation
If a fixed survivor path quantity L is used for polar code decoding, then the decoding algorithm is simple to implement, but the system complexity and energy consumption increase
Solution Approach 1:
The patent applies dynamics by making the survivor path quantity L adjustable rather than fixed. The decoding algorithm dynamically adapts L based on channel conditions (SNR) and code length, allowing the system to optimize between simplicity and performance according to actual operating conditions. This resolves the contradiction by enabling the system to be simple when conditions permit while maintaining performance when conditions deteriorate.
Solution Approach 2:
The patent changes the parameter L (survivor path quantity) based on channel SNR and code length parameters. By adjusting this key parameter dynamically, the system achieves different levels of decoding performance and complexity trade-offs. When channel conditions are good, a smaller L reduces complexity; when conditions are poor, a larger L improves performance, thus resolving the fixed-parameter limitation.
2Reliability
If a relatively large survivor path quantity L is set to obtain good decoding performance, then the decoding accuracy improves, but the decoding complexity and energy consumption greatly increase
Solution Approach 1:
The patent makes the survivor path quantity L dynamic rather than static. The system adjusts L based on channel SNR and code length, enabling energy-efficient operation when channel conditions are good (smaller L) while maintaining decoding accuracy when conditions are poor (larger L). This dynamic adaptation resolves the contradiction between accuracy and energy consumption.
Solution Approach 2:
The patent changes the parameter L according to channel conditions and code characteristics. By optimizing L as a variable parameter rather than a fixed value, the system achieves the minimum necessary decoding accuracy for each situation without unnecessarily increasing energy consumption. This parameter optimization resolves the trade-off between reliability and energy use.
3Reliability
If a relatively large survivor path quantity L is used for all code lengths, then the decoding performance is maintained, but the system complexity increases for short code lengths
Solution Approach 1:
The patent applies local quality by tailoring the survivor path quantity L to specific code lengths and channel conditions rather than using a uniform value. For short code lengths with good channel conditions, a smaller L is used, reducing complexity locally. For longer code lengths or poor conditions, a larger L is applied. This localized optimization resolves the contradiction between maintaining performance and reducing complexity for different code lengths.
Solution Approach 2:
The patent changes the parameter L based on code length N and channel SNR, creating a adaptive relationship rather than a fixed value. This allows the system to optimize L for each specific decoding scenario, achieving good performance where needed while minimizing complexity where possible. The parameter adaptation resolves the one-size-fits-all problem.
4Ease of manufacture
If the CRC check code length is fixed, then the encoding process is simple, but the encoding complexity increases for different information sequence lengths
Solution Approach 1:
The patent makes the CRC check code length dynamic rather than fixed. The encoding process adapts the CRC length based on the information sequence length, allowing simple encoding for short sequences while providing enhanced error detection for longer sequences. This dynamic adjustment resolves the contradiction between process simplicity and adaptive complexity.
Solution Approach 2:
The patent changes the CRC check code length parameter according to the information sequence length. By making this parameter adaptive rather than fixed, the system achieves encoding simplicity when appropriate while providing necessary complexity for longer sequences. This parameter optimization resolves the trade-off between ease of manufacture and encoding complexity.
Data Source
AI summary
Embodiments of the present invention disclose a polar polar code encoding and decoding method and an apparatus. The decoding method may include: obtaining a polar polar code a code length N of the polar polar; determining a survivor path quantity L of the polar polar code according to the code length N of the polar polar code and a signal-to-noise ratio SNR for receiving the polar polar code, where L is a positive integer; and performing successive cancellation list SCL decoding on the polar polar code according to the survivor path quantity L, to obtain L survivor paths, and checking at least one of the L survivor paths, to obtain a decoding result of the polar polar code. The present invention can address a prior-art disadvantage that decoding is rather complex because of a fixed survivor path quantity L for polar code decoding.