3results about How to "Reduce decoding complexity" patented technology

The application belongs to the technical field of communication, and discloses a stack decoding method, system, device, medium and terminal based on a soft output, which comprises the following steps: creating a structure and a stack and initializing; repeatedly judging the size of the path length in the structure at the top of the stack and the depth of a decoding tree, if the path length in the structure at the top of the stack is smaller than the depth of the decoding tree, recalculating the path metric, and sorting the stack according to the size of the path metric until the path length in the structure at the top of the stack is equal to the depth of the decoding tree, and counting the soft output probability of each decoding result; and correcting the decoding result according to a preset threshold to obtain a final decoding result. The method disclosed by the application can effectively reduce the calculation complexity under the premise of a low signal-to-noise ratio. In the case of (128, 64), compared with the traditional stack decoding, the stack decoding method of the polar adjustment convolution code based on the soft output can reduce the calculation amount by 82%.

The invention particularly relates to a polarization code PSS-RF-SCL decoding method based on a reliability function. In order to reduce decoding complexity and abandon a traditional path splitting strategy based on a search set, a path splitting strategy based on a reliability function is provided, and according to the strategy, whether information bits need to be subjected to path splitting or not is judged through the value of the reliability function. Secondly, a pruning strategy depending on an auxiliary path metric value is provided, and a PSS-RF-SCL decoding method is provided on the basis of the two decoding strategies for reducing complexity. During decoding, information bits with reliability function values lower than a threshold value alpha are regarded as bits needing path splitting, and paths with auxiliary path metric values higher than a threshold value beta are regarded as unreliable paths to be pruned. The threshold value alpha and the threshold value beta are obtained through statistical experiments. A simulation result shows that compared with a traditional path splitting strategy auxiliary SCL decoding method based on a search set, the provided PSS-RF-SCL decoding method has the advantage that the decoding complexity is obviously reduced on the premise of no performance loss.

This invention belongs to the field of channel coding technology, specifically relating to a low-complexity decoding method based on SC decoding. The method includes: performing SC decoding at the decoding end, followed by CRC verification; if the verification passes, the decoding result is obtained; otherwise, CA-SCL decoding is performed, including calculating a metric value based on the channel reliability estimate obtained after SC decoding, the log-likelihood ratio of the information bits, and the index value of the information bits; constructing a path splitting set B based on the metric value; performing path splitting on the path splitting set B, with the remaining bits directly hard-determined to obtain the decoding path; after decoding, performing CRC verification on all paths; if a path passes the CRC verification, selecting the path with the smallest PM value as the successfully decoded path; otherwise, decoding fails, and a retransmission of information is requested. This invention reduces the number of decoding path splits and the average list size, thus reducing decoding complexity.