Looking for breakthrough ideas for innovation challenges? Try Patsnap Eureka!

Base station rapid decoding method based on polarization code SCL algorithm

A fast decoding and polar code technology, applied in the field of channel coding, can solve the problems of large path duplication delay and reduce decoding delay, so as to improve communication efficiency, speed up decoding speed, and avoid invalid path duplication. Effect

Pending Publication Date: 2022-01-28
SICHUAN TIANYI COMHEART TELECOM
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0009] Aiming at the problem of large path duplication time delay, the present invention proposes a fast decoding method for base stations based on polar code SCL algorithm to reduce decoding time delay

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Base station rapid decoding method based on polarization code SCL algorithm
  • Base station rapid decoding method based on polarization code SCL algorithm
  • Base station rapid decoding method based on polarization code SCL algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment 1

[0041] In this example, if figure 1 As shown, in view of the problem of long path duplication delay, a fast base station decoding method based on the polar code SCL algorithm is proposed to reduce the decoding delay, which can be applied to 5G communication between base stations, or between other devices 5G network communication. The methods specifically include:

[0042] Step 1: Set the basic parameters of decoding, including the list width L and the code length N, then all the likelihood ratios and the dimensions of the intermediate bits are L N (log N+1), and set the bit sequence number of the current decoding The starting value is i=0, the initial path metric value is 0, and a path sequence number table is set to record which path each path is copied from, and the dimension is L·(log N+1).

[0043] Step 2: Calculate the likelihood ratio of the i-th bit. When calculating the likelihood ratio for the middle bit, it is necessary to copy the path according to the path number...

Embodiment 2

[0051] In this embodiment, on the basis of the first embodiment, the implementation process of each step of the method is further disclosed.

[0052] In this embodiment, regarding the process of setting the basic parameters of decoding in step 1, the code length is set to N in this embodiment, and the total number of intermediate stages is S=log(N)+1.

[0053] The dimension of the likelihood ratio is L·N·S, the l-th path is translating the i-th information bit and the likelihood ratio in the s-th stage is denoted as LLR l (i,s).

[0054] The dimension of the intermediate bit is L·N·S, the l-th path is translating the i-th information bit and the intermediate bit in the s-th stage is denoted as b l (i,s).

[0055] The dimension of the path number table is L·S, and the path number value of the lth path at the sth stage is recorded as p l (s), indicating that the lth path at the current moment adopts the pth path l Likelihood ratios and intermediate bits for (s) paths.

[00...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a base station rapid decoding method based on a polarization code SCL algorithm. The method comprises the following steps of: setting a list width L of decoding, a code length N, a bit sequence number initial value i of current decoding, an initial path metric value and a path sequence number table; calculating the likelihood ratio of the ith bit; splitting a path and calculating path metric values; selecting L minimum path metric values from the calculated path metric values for path updating, and updating the path sequence number table of each intermediate stage according to a path selection result; updating an intermediate bit required in a likelihood ratio calculation process, and updating the path sequence number table; judging a bit sequence number initial value i and a code length N, if i is smaller than N, returning to the step 2, otherwise, entering the next step; and performing CRC (Cyclic Redundancy Check) verification on the obtained decoding sequences, selecting the sequences passing the verification as final output sequences, and if all the sequences do not pass the verification, determining that the decoding fails. According to the method, the copied data volume can be reduced to the maximum extent, so that the decoding time delay is reduced.

Description

technical field [0001] The invention relates to the technical field of channel coding, in particular to a fast decoding method for a base station based on a polar code SCL algorithm, which is applied to fast communication of a base station. Background technique [0002] In the 5G NR protocol, the uplink and downlink of the physical layer are divided into control channels and data channels. For the control channel, when the number of transmitted bits is greater than 11, the polar code (Polar code) is used for channel coding. [0003] The original author of the Polar code proposed the SC (Successive Cancellation) decoding algorithm. Its essence is to find a decoding path in a binary tree from the root node to the leaf node in a greedy manner, and the bits on the path are used as the final output bits. There may be transmission errors in the wireless channel, and decoding in a greedy manner may deviate from the correct decoding path, and the error cannot be recovered, which ev...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): H03M13/13
CPCH03M13/13
Inventor 秦振庭高中有栾琨明
Owner SICHUAN TIANYI COMHEART TELECOM
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Patsnap Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Patsnap Eureka Blog
Learn More
PatSnap group products

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