CN114285525B

CN114285525B - Method, device, terminal equipment and storage medium for decoding polarized code shared resource

Info

Publication number: CN114285525B
Application number: CN202111620502.0A
Authority: CN
Inventors: 张维栋
Original assignee: Zeku Technology Beijing Corp Ltd
Current assignee: Zeku Technology Beijing Corp Ltd
Priority date: 2021-12-28
Filing date: 2021-12-28
Publication date: 2023-10-03
Anticipated expiration: 2041-12-28
Also published as: CN114285525A

Abstract

The embodiment of the application discloses a method, a device, terminal equipment and a storage medium for decoding a polarization code shared resource, which are used for saving a part of hardware resources and also saving decoding time by the method for sharing the resource. The embodiment of the application is applied to terminal equipment, and the method comprises the following steps: in the decoding process, decoding an mth codeword by using a computing unit PE resource in a first period, decoding an nth codeword by using a sequencing resource, wherein m and n are positive integers, and the mth codeword is different from the nth codeword; the code word is a signal coded by utilizing a Huffman code.

Description

Method, device, terminal equipment and storage medium for decoding polarized code shared resource

Technical Field

The present application relates to the field of communications, and in particular, to a method, an apparatus, a terminal device, and a storage medium for decoding a polarization code shared resource.

Background

In the blind search process of 5G, parallelism is improved by packaging and adding Polar (Polar) decoding units, blind detection time is shortened, but performance is not very good.

Disclosure of Invention

The embodiment of the application provides a method, a device, terminal equipment and a storage medium for decoding a polarization code shared resource, which are used for saving a part of hardware resources and also saving decoding time by the method for sharing the resource.

The first aspect of the present application provides a method for decoding a multi-codeword shared resource, which is applied to a terminal device, and the method may include:

in the decoding process, decoding an mth code word by using a computing unit (Processor Element, PE) resource in a first period, decoding an nth code word by using a sequencing resource, wherein m and n are positive integers, and the mth code word is different from the nth code word; the code word is a signal coded by utilizing a Huffman code.

A second aspect of the present application provides an apparatus for decoding a multi-codeword shared resource, which may include:

the processing module is used for decoding an mth code word in a first period by using a computing unit PE resource and decoding an nth code word by using a sequencing resource in the decoding process, wherein m and n are positive integers, and the mth code word is different from the nth code word; the code word is a signal coded by utilizing a Huffman code.

A third aspect of the present application provides a terminal device, which may include:

A memory storing executable program code;

a processor coupled to the memory;

the processor is configured to perform the method according to the first aspect of the present application.

A further aspect of an embodiment of the application provides a computer readable storage medium comprising instructions which, when run on a processor, cause the processor to perform the method of the first aspect of the application.

In yet another aspect, an embodiment of the application discloses a computer program product for causing a computer to perform the method according to the first aspect of the application when the computer program product is run on the computer.

In yet another aspect, an embodiment of the present application discloses an application publishing platform, which is configured to publish a computer program product, where the computer program product, when run on a computer, causes the computer to perform the method according to the first aspect of the present application.

From the above technical solutions, the embodiment of the present application has the following advantages:

in the embodiment of the application, in the decoding process, an mth codeword is decoded by using a computing unit PE resource in a first period, an nth codeword is decoded by using a sequencing resource, m and n are positive integers, and the mth codeword and the nth codeword are different; the code word is a signal coded by utilizing a Huffman code. By the method of sharing the resources, not only a part of hardware resources can be saved, but also some decoding time can be saved.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present application, the drawings used in the description of the embodiments and the prior art will be briefly described, it being obvious that the drawings in the following description are only some embodiments of the present application, and that other drawings may be obtained according to these drawings.

FIG. 1 is a diagram of one embodiment of a method for decoding a shared resource of a polar code in an embodiment of the application;

FIG. 2A is a schematic diagram of a Polar code decoding depth binary tree;

FIG. 2B is a diagram illustrating a decoding structure of an SCL decoder for decoding a single codeword according to the present application;

FIG. 2C is a schematic diagram of decoding timing for PE calculation and ordering of single codewords according to the present application;

fig. 2D is a schematic diagram of a decoding structure of a plurality of codewords decoded by an SCL decoder according to the present application, wherein the shared resources are shared;

FIG. 2E is a diagram illustrating a decoding timing sequence for PE calculation and ordering of a plurality of codewords according to the present application;

FIG. 2F is a schematic diagram of a decoding sequence for PE calculation and ordering of multiple codewords according to the present application;

FIG. 2G is a diagram illustrating a token ring resource priority management unit managing multiple codeword contention resources in accordance with the present application;

FIG. 3 is a diagram illustrating an apparatus for decoding a shared resource of a polarization code according to an embodiment of the present application;

fig. 4 is a schematic diagram of an embodiment of a terminal device according to an embodiment of the present application;

fig. 5 is a schematic diagram of another embodiment of a terminal device according to an embodiment of the present application.

Detailed Description

In order that those skilled in the art will better understand the present application, reference will now be made to the accompanying drawings in which embodiments of the application are illustrated, it being apparent that the embodiments described are only some, but not all, of the embodiments of the application. Based on the embodiments of the present application, it should be understood that the present application is within the scope of protection.

Currently, the fifth generation mobile communication (5G) technology is mature, the 5G technology in China is commercial and falls to the ground, all large operators are actively preparing the evolution and upgrading of 5G network equipment, meanwhile, terminal manufacturers at home and abroad follow the development of the 5G technology, design and produce a plurality of 5G electronic equipment, aiming at the high-reliability low-delay communication (ultra-Reliable and Low Latency Communications, uRLLC) scene in 5G application, all products of each family have different advantages and disadvantages, and based on the trade-off thinking of different design concepts and overall performance, a great deal of optimization is carried out on the uRLLC, and most of schemes adopt a sacrificial area to replace a time-priority design scheme.

For the high-reliability low-delay communication scene, the transmission delay of an air interface, the network forwarding delay and the retransmission probability are reduced as much as possible so as to meet the extremely high delay and reliability requirements. For this reason, a shorter frame structure and a more optimized signaling flow are needed, and novel techniques such as non-scheduling multiple access and Device-to-Device (D2D) are introduced to reduce signaling interaction and data transfer, and more advanced modulation coding and retransmission mechanisms are applied to improve transmission reliability. The control region in 5G has only a physical downlink control channel (Physical Downlink Control Channel, PDCCH) for scheduling downlink transmission on a physical downlink shared channel (Physical Downlink Shared Channel, PDSCH) and uplink transmission on an uplink physical shared channel (Physical Uplink Shared Channel, PUSCH), and downlink control information (Downlink Control Information, DCI) carried by the PDCCH includes modulation and coding schemes of uplink and downlink allocation grant, resource allocation, hybrid automatic repeat request (Hybrid Automatic Repeat reQuest, HARQ) information, and important information notifying one or more User Equipments (UEs) of a slot format, but since the DCI is received in the PDCCH, the terminal cannot know the exact time-frequency position of the DCI transmission in advance, but can only search for the DCI in a rough physical resource range, which is also called Blind Detection or Blind search (Blind Detection).

In the blind search process of 5G, the coding performance of the PDCCH is determined by the coding time of the Polar codes, and meanwhile, the coding performance of the uRLLC is also a key core index of the terminal equipment, the number and the code length of the code words of the Polar codes are determined by the maximum value of the candidate set of the PDCCH and the maximum value of the non-overlapping control channel unit (Control Channel Element, CCE) according to different subcarrier interval configurations, the longer the code length is, the larger the PDCCH candidate set is, the longer the blind detection time is, otherwise, the shorter the calculation time is, and the better the performance of the uRLLC is. Compared with the traditional scheme of shortening blind detection time by improving parallelism through packaging and adding Polar decoding units, the Polar decoding method of sharing computing resources by multiple codewords under the same condition reduces certain hardware resources and obtains larger performance improvement on decoding time.

It should be noted that Polar code (Polar code) is a forward error correction coding scheme used for signal transmission. The core of the construction is that the sub-channels are processed through channel polarization (channel polarization), different reliability is presented by adopting a method on the coding side, when the code length is continuously increased, part of channels tend to be perfect channels (without error codes) with the capacity approaching 1, the other part of channels tend to be pure noise channels with the capacity approaching 0, and the direct information transmission on the channels with the capacity approaching 1 is selected to approach the channel capacity, so that the method can be strictly proved to reach the shannon limit. On the decoding side, the polarized channel can obtain the performance similar to the maximum likelihood decoding with lower complexity by using a simple successive interference cancellation decoding method.

Polar codes are a linear channel coding method proposed based on the channel polarization theory, and the code words are the only type of coding method which can reach the shannon limit, and has a low coding complexity, and when the coding length is N, the complexity is O (NlogN). The theoretical basis of Polar codes is channel polarization. The channel polarization includes a channel combination and a channel decomposition section. When the number of combined channels goes to infinity, polarization occurs: some of the channels will tend to be noise free and others will tend to be all noise channels, a phenomenon known as channel polarization. The transmission rate of the noiseless channel will reach the channel capacity I (W), while the transmission rate of the full-noise channel will approach zero. The coding strategy of Polar codes is the characteristic of applying the phenomenon, and utilizes a noiseless channel to transmit useful information of users, and the full-noise channel transmits contracted information or does not transmit information.

In the embodiment of the application, the terminal equipment can be deployed on land, including indoor or outdoor, handheld, wearable or vehicle-mounted; can also be deployed on the water surface (such as ships, etc.); but may also be deployed in the air (e.g., on aircraft, balloon, satellite, etc.).

In the embodiment of the present application, the terminal device may be a Mobile Phone (Mobile Phone), a tablet computer (Pad), a computer with a wireless transceiving function, a Virtual Reality (VR) terminal device, an augmented Reality (Augmented Reality, AR) terminal device, a wireless terminal device in industrial control (industrial control), a wireless terminal device in unmanned driving (self driving), a wireless terminal device in remote medical (remote medical), a wireless terminal device in smart grid (smart grid), a wireless terminal device in transportation security (transportation safety), a wireless terminal device in smart city (smart city), or a wireless terminal device in smart home (smart home), and the like.

By way of example, and not limitation, in embodiments of the present application, the terminal device may also be a wearable device. The wearable device can also be called as a wearable intelligent device, and is a generic name for intelligently designing daily wear by applying wearable technology and developing wearable devices, such as glasses, gloves, watches, clothes, shoes and the like. The wearable device is a portable device that is worn directly on the body or integrated into the clothing or accessories of the user. The wearable device is not only a hardware device, but also can realize a powerful function through software support, data interaction and cloud interaction. The generalized wearable intelligent device includes full functionality, large size, and may not rely on the smart phone to implement complete or partial functionality, such as: smart watches or smart glasses, etc., and focus on only certain types of application functions, and need to be used in combination with other devices, such as smart phones, for example, various smart bracelets, smart jewelry, etc. for physical sign monitoring.

In the following, by way of example, the technical solution of the present application is further described, as shown in fig. 1, which is a schematic diagram of an embodiment of a method for decoding a shared resource of a polar code in an application embodiment, where the method embodiment may include:

101. in the decoding process, the computing unit PE resource is used for decoding the mth code word in the first period, and the sorting resource is used for decoding the nth code word; m and n are positive integers, and the mth codeword and the nth codeword are different; the code word is a signal coded by utilizing a Huffman code.

Code Word refers to a signal encoded with Huffman codes. A frame contains m data bits (i.e., messages) and r redundancy bits (check bits). The total length of the frame = data bits + redundancy bits, the X-th bit cell containing data and check bits is typically an X-bit codeword. The codeword is made up of a number of symbols and the communication in the computer communication is represented as a number of bits of binary code.

It can be understood that, in the decoding process, when the terminal device uses the PE resource for the mth codeword in the first period, the ordering resource is idle, and decoding can be performed for other codewords using the ordering resource.

Optionally, in the decoding process, the terminal device decodes the mth codeword using the computing unit PE resource in the first period, and decodes the nth codeword using the ordering resource, which may include: in the decoding process, the terminal equipment decodes the m code word by using a computing unit PE resource through a computing unit (Processor Element, PE) in the first period, and decodes the n code word by using a sorting resource through a sorting unit.

Optionally, the decoding, by the terminal device, the mth codeword in the first period using a computing unit PE resource includes: the terminal equipment calculates F functions and G functions on the mth code word in a first period by using a calculation unit PE resource;

the F function is: outputf=sign (LLR (a)). Sign (LLR (b)). Min (|llr (a), LLR (b) |);

the G function is:

wherein LLR (a) is the likelihood ratio of signal a, LLR (b) is the likelihood ratio of signal b, sign (LLR (a)) is the sign of LLR (a), sign (LLR (b)) is the sign of LLR (b), min is the minimum,representing the return value of the partial sum of the G functions.

The continuous cancellation (Successive Cancellation, SC) decoding is that the current manufacturers adopt a relatively wide Polar code decoding algorithm, the SC decoding algorithm can not only reach Shannon channel capacity in theory, but also has lower complexity of hardware design, the SC decoding algorithm can be expressed as a complete binary tree of depth-first traversal, the root node inputs channel likelihood ratio (Log likelihood Ratio, LLR), the depth-first traversal is 2 ^N The leaf nodes, in turn, estimate and construct channel likelihood ratios, as shown in fig. 2A, are a schematic representation of a Polar code decoding depth binary tree.

In the illustration of fig. 1, the forward-left branch message is F-function:

outputf＝sign(LLR(a))*sign(LLR(b))*min(|LLR(a)，LLR(b)|)

the forward right branch message is a G function:

wherein a0, a1, a2, …, a7 represent LLR values of the node, u0, u1, …, u7 represent partial and return values, and in the iterative decoding process of the SC, a computing unit (Processor Element, PE) is responsible for computing F & G functions, and determining the number of times of use of the computing resource PE according to different depths of the binary tree. Assuming that the Polar code has a code length of 8, the depth binary tree will have 4 layers, the highest layer has 8 LLR data, the layers are sequentially from high to low, the second layer has 4 LLR data, the first layer has 2 LLR data, and the 0 th layer has 1 LLR data; i.e., 4 PEs at the highest layer, 2 PEs at the second layer, and 1 PE at the first layer, decoding of the node is completed based on the data forming decisions of the LLRs when the lowest layer is reached. The deep binary tree traversal calculation is explained in conjunction with the above formula, as follows:

1) Calculating F functions at layer 3 (Stage 3), pairing a0 with a4, pairing a1 with a5, pairing a2 with a6, and pairing a3 with a 7; wherein the LRR values of each layer need to be symmetrical when paired.

2) Calculating F functions at layer 2 (Stage 2), pairing a0 with a2, and pairing a1 with a 3;

3) Calculating F functions at layer 1 (Stage 1), a0 paired with a 1;

4) Making a decision on LLR (a 0) at layer 0 (Stage 0) to obtain u0;

5) Iterating up to layer 1 at layer 0, returning a partial sum u0;

6) Calculating a G function at layer 1, a0 paired with a1, part and u0;

7) Making a decision on LLR (a 0) at layer 0 to obtain u1;

8) Iterating up to layer 2 at layer 0, returning partial sums u0, u1;

9) Calculating a G function at layer 2, a0 paired with a2, a1 paired with a3, partial sum u0, u1;

10 Repeating steps 3-7 to obtain a part and u2, u3;

11 Iterating up to layer 3 at layer 0, returning partial sum u0, u1, u2, u3;

12 At layer 3) the G function, a0 paired with a4, a1 paired with a5, a2 paired with a6, a3 paired with a7, partial sum u0, u1, u2, u3;

13 Repeating the steps 2-10, and decoding all nodes to obtain a decoding result.

The Likelihood Ratio (LR) is an index reflecting the authenticity.

The performance advantages of SC decoding alone are reduced when the code length is limited, so iterative decoding based on successive cancellation lists (Successive Cancellation List, SCL) of SC decoding is chosen to solve such problems, as the name implies, SCL decoding increases the decoding list on the basis of SC decoding. After adding a plurality of decoding lists, the decoding lists need to be processed and the best L decoding lists are selected in the decoding process. When a deep binary tree is used to calculate a leaf node through PE, when the node is an information node and not a frozen node, the node has two judging results, and in the SCL decoding process, the two judging results (0 and 1) are stored, namely two decoding lists are generated. With the increase of information node decision, the number of decoding lists increases, if the generation of decoding lists is not limited at all, the memory resources and decoding complexity become indistinct, but the improvement of decoding performance is negligible, so that a maximum value of the number of decoding lists is set for balancing the performance, resources and design complexity.

Optionally, the decoding the mth codeword using the ordering resource may include: in the SCL decoding process of the continuous elimination list, L decoding lists are obtained, L is the maximum value of the number of the decoding lists, and L is an integer greater than 0; and decoding the L decoding lists by using sequencing resources.

Optionally, the decoding the L decoding lists using ordering resources may include: in the SCL decoding process of the continuous elimination list, M decoding bar lists are obtained; sequencing the M decoding lists by using sequencing resources, and replacing and cutting according to path metric values to obtain L decoding lists, wherein M is an integer greater than 0 and M is greater than L; and decoding according to the L decoding lists.

Optionally, the sorting the M decoding lists by using sorting resources, and replacing and clipping according to the path metric value to obtain L decoding lists may include: and sequencing the M decoding lists by using sequencing resources, and selecting to obtain L decoding lists with the minimum path metric value.

It can be understood that the terminal device searches a plurality of lists through the Polar decoder, cuts and replaces the plurality of lists, and keeps the L lists with optimal performance, so that the performance of the Polar code can be greatly improved, and the decoding performance of the Polar code approaches to the maximum likelihood. Assuming that the maximum number of decoding lists is set to 8, that is, when the number of decoding lists exceeds 8, the decoding lists may be replaced and cut according to a Path Metric (Path Metric) value.

The Path Metric (Path Metric) value of the decoding list is an index for judging whether the decoding list is survived, the Path Metric is approximately zero when the actual value is the same as the decision value, the Path Metric value is approximately the LLR of the node when the actual value is opposite to the decision value, the Path Metric value of each list is the accumulated value of the Path metrics of each node of the decoding list, the smaller the Path Metric value is, the more reliable the decoding list is, the SCL decoder sorts the decoding lists according to the Path Metric value of each decoding list, and then the L best decoding lists, namely the L decoding lists with the smallest Path Metric values, are selected according to the sorting result.

The decoding structure of the SCL decoder will require an additional ordering unit, as shown in fig. 2B, which is a schematic diagram of the decoding structure of the SCL decoder for decoding a single codeword according to the present application. In fig. 2B, the processing unit includes a calculating unit PE and a sorting unit, and after the single codeword is processed by the calculating unit PE and the sorting unit, a Partial Sum (Partial Sum u) may be output and input back to the calculating unit PE. It will be appreciated that the processing of the calculation unit PE is mainly to calculate the F-function and the G-function described above. Fig. 2C is a schematic diagram of decoding timing for PE calculation and ordering of single codewords according to the present application. In fig. 2C, if the calculation PE Resource is used in one cycle, the ordering Resource is IDLE (Sorting Resource IDLE), and if the ordering Resource is used in one cycle, the calculation PE Resource is IDLE (PE Resource IDLE).

102. And in a second period, the xth code word is decoded by using an ordering resource, the yth code word is decoded by using a computing unit PE resource, x and y are positive integers, and the xth code word and the yth code word are different.

Optionally, the mth codeword and the xth codeword are the same or different, and the nth codeword and the yth codeword are the same or different. The mth codeword and the y codeword are the same or different, and the nth codeword and the x codeword are the same or different.

Optionally, whether the first period precedes the second period or the second period precedes the first period, the mth codeword is identical to the x-th codeword, and the nth codeword is identical to the y-th codeword; or, the mth codeword is different from the xth codeword, and the nth codeword is different from the yth codeword.

Optionally, the decoding, by the terminal device, the x-th codeword using the sorting resource and the y-th codeword using the computing unit PE resource in the second period may include: and the terminal equipment decodes the x-th code word using the sorting resource through the computing unit PE in the second period, and decodes the y-th code word using the computing unit PE resource through the sorting unit.

In the prior art, according to the feature analysis of the SCL decoder, PE calculation and ordering are always performed serially during Polar decoding, and since the deep binary tree PE calculation G function needs to wait for the ordering result to determine the return value of u (partial sum), the single codeword overall decoding time approximates the sum of iterative PE calculation time and ordering time. The application provides a method for sharing PE computing and sequencing resources by a plurality of codewords, which can fully improve the utilization rate of PE computing and sequencing, optimize PE computing time or sequencing computing time in the decoding process, namely reduce Polar average decoding time to PE computing time or sequencing time and take the maximum value between the PE computing time and the sequencing time. As shown in fig. 2D, a schematic diagram of a decoding structure of the SCL decoder for decoding a plurality of codewords and sharing resources in the present application is shown. In fig. 2D, the apparatus includes a calculation unit PE and a sorting unit, and a plurality of codewords (including codeword 0 (Code Word 0) and codeword 1 (Code Word 1) … … codeword n (Code Word n)) may be output and input back to the calculation unit PE after being processed by the calculation unit PE and the sorting unit. The processing by the computing unit PE may obtain a plurality of decoding lists, and may store paths of each decoding list. It will be appreciated that the processing of the calculation unit PE is mainly to calculate the F-function and the G-function described above.

When one codeword is using PE resources, other codewords can obtain ordering resources, when one codeword is ordering, other codewords can obtain PE resources, and the average decoding time is optimized by calculating a scheme of resource sharing competition through multiple codewords. Fig. 2E is a schematic diagram illustrating decoding timing for PE calculation and ordering of multiple codewords according to the present application. In FIG. 2E, codeword 0 (Code Word 0, CW 0) uses the compute PE resource (occupy the PE resource) at clocks 2 and 3, which can also be understood as cycle 2 and cycle 3; at clocks 4 and 5, it can also be understood that cycle 4 and cycle 5, CW 0 uses ordering resources, codeword 1 (Code Word 1, CW 1) uses compute PE resources (occupy the PE resource); at clocks 6 and 7, also understood as cycle 6 and 7, CW 0 uses the computation PE resources and CW 1 uses the ordering resources (occupy the Sorting resource); at clock 8 and 9, it can also be understood that cycle 8 and cycle 9, CW 0 uses the ordering resources and CW n uses the computation PE resources (used the PE resource); at clock 10 and 11, it can also be understood that cycle 10 and 11, CW 0 uses the computation PE resources and CW n uses the ordering resources (used the Sorting resource).

Fig. 2F is another schematic diagram of decoding timing for PE calculation and ordering of multiple codewords according to the present application. In the illustration of fig. 2F, at clocks 2 and 3, it can also be understood that cycle 2 and cycle 3, CW 0 uses the computing PE resources; at clock 4 and 5, also understood as cycle 4 and cycle 5, CW 0 uses ordering resources and CW 2 uses computational PE resources; at clocks 6 and 7, also understood as cycle 6 and 7, CW 0 uses the computation PE resources and CW 2 uses the ordering resources; at clock 8 and 9, also understood as cycle 8 and 9, CW 0 uses ordering resources and CW 2 uses computational PE resources; at clock 10 and 11, also understood as cycle 10 and 11, CW 1 uses the computation PE resources and CW 2 uses the ordering resources; at clock 12 and 13, also understood as cycle 12 and 13, CW 1 uses ordering resources and CW n uses computational PE resources; in clocks 14 and 15, which can also be understood as 14 th and 15 th cycles, CW n uses ordering resources.

Optionally, in the case where the mth codeword and the y codeword simultaneously request PE resources, if the priority of the mth codeword is higher than the priority of the y codeword, the first period is before the second period. It will be appreciated that if the mth codeword and the y codeword are different and the mth codeword and the y codeword request PE resources at the same time, since the mth codeword has a higher priority than the y codeword, the PE resources are preferentially used for the mth codeword, and after the mth codeword is used, the PE resources are used for the y codeword. And PE resources are used for the mth codeword in a first period and PE resources are used for the y codeword in a second period, so the first period precedes the second period.

Optionally, the decoding, by the terminal device, the mth codeword in the first period using the computing unit PE resource may include: the terminal equipment determines that the priority of the mth code word is higher than the priority of the y-th code word through a token ring resource priority management unit, and decodes the mth code word by using PE resources in a first period;

the terminal device decodes the y-th codeword using the computing unit PE resource in the second period, which may include: after the mth code word is used, the terminal equipment updates the priority of the code word through the token ring resource priority management unit, and decodes the use PE resource of the mth code word in a second period.

When the priority management unit of the token ring resource determines that the priority of the mth codeword is higher than the priority of the nth codeword, the terminal equipment can use PE resources preferentially for the mth codeword, after the mth codeword is used, the priority of the nth codeword is updated to be highest by the token ring resource priority management unit, and the terminal equipment can use PE resources for the mth codeword.

It can be understood that the code length and the number of valid information of each codeword are different, which will tend to cause contention for computing resources during SCL decoding, so as to ensure that each codeword has the same opportunity to contend for computing resources, and complete decoding in a reasonable time, a token ring resource priority management unit may be designed, as shown in fig. 2G, which is a schematic diagram of managing multi-codeword contention resources by the token ring resource priority management unit in the present application. The token ring resource priority management unit controls the equal probability distribution of the computing resource to different code words, the code word with high priority firstly obtains the computing resource for decoding, the code word with low priority needs to wait, and after the decoding of the code word with high priority is completed, the token ring resource priority management unit executes priority update, the computing resource priority is replaced by different code words, and each code word equally obtains the computing resource from the whole PDCCH blind detection process.

It should be noted that step 102 is an optional step.

In the embodiment of the application, in the decoding process, an mth codeword is decoded by using a computing unit PE resource in a first period, an nth codeword is decoded by using a sequencing resource, m and n are positive integers, and the mth codeword and the nth codeword are different; the code word is a signal coded by utilizing a Huffman code. That is, when the mth codeword uses PE resources, the ordering resources are idle, and the ordering resources can be used for the nth codeword. And the terminal equipment uses the sorting resource for the xth code word in the second period and decodes the xth code word by using the computing unit PE resource. That is, when the xth codeword uses the ordering resource, the PE resource is idle, and the PE resource can be used for the yth codeword. By the method of sharing the resources, not only a part of hardware resources can be saved, but also some decoding time can be saved.

It can be understood that the method for decoding the Polar multiple code word shared resource optimizes the defect of decoding the single code word serial continuous elimination decoding list on the top layer architecture, and makes different code words realize single computing resource parallel decoding through computing resource time division multiplexing, the computing resource in Polar decoding comprises a PE unit and a sequencing unit, the computing PE resource is a core module of Polar decoding, and the computing PE resource unit not only bears all computing tasks of decoding, but also occupies larger chip area resource. The calculation PE resource of Polar decoding not only affects decoding performance, but also is of vital importance to chip area and power consumption optimization, and according to the simulation result of the decoding architecture of Polar multi-code word shared resources, the scheme realizes that the utilization rate of the calculation resource can be greatly increased, shortens average decoding time, optimizes area, and provides optimization thought and practical benefit for PDCCH blind detection and low delay high reliability of terminal equipment.

As shown in fig. 3, an embodiment of an apparatus for decoding a polarization code shared resource according to an embodiment of the present application is shown, which may include:

a processing module 301, configured to decode an mth codeword using a computing unit PE resource in a first period during a decoding process, decode an nth codeword using an ordering resource, where m and n are positive integers, and the mth codeword and the nth codeword are different; the code word is a signal coded by utilizing a Huffman code.

Optionally, the processing module 301 is further configured to decode, in a second period, an xth codeword using an ordering resource, decode an xth codeword using a computing unit PE resource, where x and y are positive integers, and the xth codeword is different from the yth codeword.

Optionally, the processing module 301 is specifically configured to obtain L decoding lists in the continuous elimination list SCL decoding process, where L is the maximum value of the number of decoding lists, and L is an integer greater than 0; and decoding the L decoding lists by using sequencing resources.

Optionally, the processing module 301 is specifically configured to obtain M decoding bar lists during the process of decoding the continuous cancellation list SCL; sequencing the M decoding lists by using sequencing resources, and replacing and cutting according to path metric values to obtain L decoding lists, wherein M is an integer greater than 0 and M is greater than L; and decoding according to the L decoding lists.

Optionally, the processing module 301 is specifically configured to sort the M decoding lists by using the sorting resource, and select to obtain L decoding lists with the smallest path metric value.

Optionally, in the case where the mth codeword and the y codeword simultaneously request PE resources, if the priority of the mth codeword is higher than the priority of the y codeword, the first period is before the second period.

Optionally, the processing module 301 is specifically configured to determine, through the token ring resource priority management unit, that the priority of the mth codeword is higher than the priority of the y codeword, and decode, in a first period, the mth codeword using a PE resource;

the processing module 301 is specifically configured to update, by the token ring resource priority management unit, the priority of the codeword after the use of the mth codeword is completed, and decode, in a second period, the use of PE resources by the mth codeword.

As shown in fig. 4, which is a schematic diagram of an embodiment of a terminal device in the embodiment of the present application, an apparatus for decoding a polarization code shared resource as shown in fig. 3 may be included.

As shown in fig. 5, which is a schematic diagram of another embodiment of a terminal device in an embodiment of the present application, may include:

fig. 5 is a block diagram showing a part of the structure of a mobile phone related to a terminal device provided by an embodiment of the present application. Referring to fig. 5, the mobile phone includes: radio Frequency (RF) circuitry 510, memory 520, input unit 530, display unit 540, sensor 550, audio circuitry 560, wireless fidelity (wireless fidelity, wi-Fi) module 570, processor 580, power supply 590, and the like. Those skilled in the art will appreciate that the handset configuration shown in fig. 5 is not limiting of the handset and may include more or fewer components than shown, or may combine certain components, or may be arranged in a different arrangement of components.

The following describes the components of the mobile phone in detail with reference to fig. 5:

the RF circuit 510 may be used for receiving and transmitting signals during a message or a call, and in particular, after receiving downlink information of a base station, the signal is processed by the processor 580; in addition, the data of the design uplink is sent to the base station. Typically, the RF circuitry 510 includes, but is not limited to, an antenna, at least one amplifier, a transceiver, a coupler, a low noise amplifier (Low Noise Amplifier, LNA), a duplexer, and the like. In addition, the RF circuitry 510 may also communicate with networks and other devices via wireless communications. The wireless communications may use any communication standard or protocol including, but not limited to, global system for mobile communications (Global System of Mobile communication, GSM), general packet radio service (General Packet Radio Service, GPRS), code division multiple access (Code Division Multiple Access, CDMA), wideband code division multiple access (Wideband Code Division Multiple Access, WCDMA), long term evolution (Long Term Evolution, LTE), email, short message service (Short Messaging Service, SMS), and the like.

The memory 520 may be used to store software programs and modules, and the processor 580 performs various functional applications and data processing of the cellular phone by executing the software programs and modules stored in the memory 520. The memory 520 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, application programs required for at least one function (such as a sound playing function, an image playing function, etc.), and the like; the storage data area may store data (such as audio data, phonebook, etc.) created according to the use of the handset, etc. In addition, memory 520 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid-state storage device.

The input unit 530 may be used to receive input numeric or character information and generate key signal inputs related to user settings and function control of the handset. In particular, the input unit 530 may include a touch panel 531 and other input devices 532. The touch panel 531, also referred to as a touch screen, may collect touch operations thereon or thereabout by a user (e.g., operations of the user on the touch panel 531 or thereabout by using any suitable object or accessory such as a finger, a stylus, etc.), and drive the corresponding connection device according to a predetermined program. Alternatively, the touch panel 531 may include two parts, a touch detection device and a touch controller. The touch detection device detects the touch azimuth of a user, detects a signal brought by touch operation and transmits the signal to the touch controller; the touch controller receives touch information from the touch detection device and converts it into touch point coordinates, which are then sent to the processor 580, and can receive commands from the processor 580 and execute them. In addition, the touch panel 531 may be implemented in various types such as resistive, capacitive, infrared, and surface acoustic wave. The input unit 530 may include other input devices 532 in addition to the touch panel 531. In particular, other input devices 532 may include, but are not limited to, one or more of a physical keyboard, function keys (e.g., volume control keys, switch keys, etc.), a trackball, mouse, joystick, etc.

The display unit 540 may be used to display information input by a user or information provided to the user and various menus of the mobile phone. The display unit 540 may include a display panel 541, and alternatively, the display panel 541 may be configured in the form of a liquid crystal display (Liquid Crystal Display, LCD), an Organic Light-Emitting Diode (OLED), or the like. Further, the touch panel 531 may cover the display panel 541, and when the touch panel 531 detects a touch operation thereon or thereabout, the touch operation is transferred to the processor 580 to determine the type of the touch event, and then the processor 580 provides a corresponding visual output on the display panel 541 according to the type of the touch event. Although in fig. 5, the touch panel 531 and the display panel 541 are two independent components to implement the input and input functions of the mobile phone, in some embodiments, the touch panel 531 and the display panel 541 may be integrated to implement the input and output functions of the mobile phone.

The handset may also include at least one sensor 550, such as a light sensor, a motion sensor, and other sensors. Specifically, the light sensor may include an ambient light sensor that may adjust the brightness of the display panel 541 according to the brightness of ambient light, and a proximity sensor that may turn off the display panel 541 and/or the backlight when the mobile phone moves to the ear. As one of the motion sensors, the accelerometer sensor can detect the acceleration in all directions (generally three axes), and can detect the gravity and direction when stationary, and can be used for applications of recognizing the gesture of a mobile phone (such as horizontal and vertical screen switching, related games, magnetometer gesture calibration), vibration recognition related functions (such as pedometer and knocking), and the like; other sensors such as gyroscopes, barometers, hygrometers, thermometers, infrared sensors, etc. that may also be configured with the handset are not described in detail herein.

Audio circuitry 560, speakers 561, microphone 562 may provide an audio interface between the user and the handset. The audio circuit 560 may transmit the received electrical signal converted from audio data to the speaker 561, and the electrical signal is converted into a sound signal by the speaker 561 and output; on the other hand, microphone 562 converts the collected sound signals into electrical signals, which are received by audio circuit 560 and converted into audio data, which are processed by audio data output processor 580 for transmission to, for example, another cell phone via RF circuit 510, or for output to memory 520 for further processing.

Wi-Fi belongs to a short-distance wireless transmission technology, and a mobile phone can help a user to send and receive e-mails, browse web pages, access streaming media and the like through a Wi-Fi module 570, so that wireless broadband Internet access is provided for the user. Although fig. 5 shows Wi-Fi module 570, it is to be understood that it does not belong to the necessary constitution of the handset, and can be omitted entirely as required within the scope of not changing the essence of the invention.

Processor 580 is the control center of the handset, connects the various parts of the entire handset using various interfaces and lines, and performs various functions and processes of the handset by running or executing software programs and/or modules stored in memory 520, and invoking data stored in memory 520, thereby performing overall monitoring of the handset. Optionally, processor 580 may include one or more processing units; preferably, processor 580 may integrate an application processor that primarily handles operating systems, user interfaces, applications, etc., with a modem processor that primarily handles wireless communications. It will be appreciated that the modem processor described above may not be integrated into the processor 580.

The handset further includes a power supply 590 (e.g., a battery) for powering the various components, which may preferably be logically connected to the processor 580 via a power management system so as to perform functions such as managing charging, discharging, and power consumption by the power management system.

Although not shown, the mobile phone may further include a camera, a bluetooth module, etc., which will not be described herein.

In the embodiment of the present invention, a processor 580 is configured to decode an mth codeword using a computing unit PE resource and decode an nth codeword using a sorting resource in a first period in a decoding process, where m and n are positive integers, and the mth codeword and the nth codeword are different; the code word is a signal coded by utilizing a Huffman code.

Optionally, the processor 580 is further configured to decode an xth codeword using the ordering resource and decode a yth codeword using the computing unit PE resource in the second period, where x and y are positive integers, and the xth codeword is different from the yth codeword.

Optionally, the processor 580 is specifically configured to obtain L decoding lists during the process of decoding the continuous elimination list SCL, where L is the maximum number of the decoding lists, and L is an integer greater than 0; and decoding the L decoding lists by using sequencing resources.

Optionally, the processor 580 is specifically configured to obtain M decoding bar lists during the decoding process of the continuous cancellation list SCL; sequencing the M decoding lists by using sequencing resources, and replacing and cutting according to path metric values to obtain L decoding lists, wherein M is an integer greater than 0 and M is greater than L; and decoding according to the L decoding lists.

Optionally, the processor 580 is specifically configured to sort the M decoding lists by using the sorting resource, and select to obtain L decoding lists with the smallest path metric value.

Optionally, the processor 580 is specifically configured to determine, through the token ring resource priority management unit, that the priority of the mth codeword is higher than the priority of the y codeword, and decode, in a first period, the mth codeword using the PE resource;

processor 580 is specifically configured to update the priority of the codeword by the token ring resource priority management unit after the use of the mth codeword is completed, and decode the use of PE resource by the mth codeword in the second period.

In the above embodiments, it may be implemented in whole or in part by software, hardware, firmware, or any combination thereof. When implemented in software, may be implemented in whole or in part in the form of a computer program product. The computer program product includes one or more computer instructions. When loaded and executed on a computer, produces a flow or function in accordance with embodiments of the present invention, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a computer network, or other programmable apparatus. The computer instructions may be stored in a computer-readable storage medium or transmitted from one computer-readable storage medium to another computer-readable storage medium, for example, the computer instructions may be transmitted from one website, computer, server, or data center to another website, computer, server, or data center by a wired (e.g., coaxial cable, fiber optic, digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer readable storage medium may be any available medium that can be stored by a computer or a data storage device such as a server, data center, etc. that contains an integration of one or more available media. The usable medium may be a magnetic medium (e.g., floppy Disk, hard Disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., solid State Disk (SSD)), etc.

It will be clear to those skilled in the art that, for convenience and brevity of description, specific working procedures of the above-described systems, apparatuses and units may refer to corresponding procedures in the foregoing method embodiments, which are not repeated herein.

In the several embodiments provided in the present application, it should be understood that the disclosed systems, devices, and methods may be implemented in other manners. For example, the apparatus embodiments described above are merely illustrative, e.g., the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, e.g., multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be an indirect coupling or communication connection via some interfaces, devices or units, which may be in electrical, mechanical or other form.

The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.

In addition, each functional unit in the embodiments of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit. The integrated units may be implemented in hardware or in software functional units.

The integrated units, if implemented in the form of software functional units and sold or used as stand-alone products, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be embodied essentially or in part or all of the technical solution or in part in the form of a software product stored in a storage medium, including instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to perform all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-Only Memory (ROM), a random access Memory (RAM, random Access Memory), a magnetic disk, or an optical disk, or other various media capable of storing program codes.

The above embodiments are only for illustrating the technical solution of the present application, and not for limiting the same; although the application has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical scheme described in the foregoing embodiments can be modified or some technical features thereof can be replaced by equivalents; such modifications and substitutions do not depart from the spirit and scope of the technical solutions of the embodiments of the present application.

Claims

1. A method for decoding a shared resource of a polarization code, applied to a terminal device, the method comprising:

in the SCL decoding process of the continuous elimination list, when computing unit PE resources are used for computing LLR for the mth code word in the first period, sequencing resources are in an idle state, the n-th code word is sequenced by using the sequencing resources, m and n are positive integers, and the mth code word and the n-th code word are different; the code word is a signal coded by utilizing a Huffman code.

2. The method according to claim 1, wherein the method further comprises:

and when the x-th code word uses the sorting resource to sort in the second period, the computing unit PE resource is in an idle state, the computing unit PE resource is used for computing LLR for the y-th code word, x and y are positive integers, and the x-th code word and the y-th code word are different.

3. The method of claim 1, wherein the ordering the nth codeword using the ordering resource comprises:

in the SCL decoding process of the continuous elimination list, L decoding lists are obtained, L is the maximum value of the number of the decoding lists, and L is an integer greater than 0;

and ordering the L coding lists by using the ordering resources.

4. The method of claim 1, wherein ordering L decoding lists using the ordering resources comprises:

in the SCL decoding process of the continuous elimination list, M decoding lists are obtained;

sequencing the M decoding lists by using the sequencing resources, and replacing and cutting according to the path metric values to obtain L decoding lists, wherein M is an integer greater than 0 and M is greater than L;

and sorting according to the L decoding lists.

5. The method of claim 4, wherein said sorting the M decoding lists using sorting resources, replacing and clipping according to path metric values to obtain L decoding lists, comprises:

and sequencing the M decoding lists by using sequencing resources, and selecting to obtain L decoding lists with the minimum path metric value.

6. The method according to any of claims 1-5, wherein the first period precedes the second period if the mth codeword has a higher priority than the y codeword in case the mth codeword and the y codeword simultaneously request PE resources.

7. The method of claim 6 wherein computing LLRs for the mth codeword using computing unit PE resources during the first period comprises:

determining, by a token ring resource priority management unit, that the priority of the mth codeword is higher than the priority of the y codeword, and calculating an LLR for the mth codeword using a PE resource in a first period;

ordering the y-th codeword using compute unit PE resources in a second cycle, comprising:

and after the use of the mth code word is finished, updating the priority of the code word through the token ring resource priority management unit, and sequencing the use of PE resources by the mth code word in a second period.

8. An apparatus for decoding a shared resource of a polar code, comprising: the processing module is used for sequencing an nth codeword by using the sequencing resource when the computing unit PE resource is used for computing the LLR for the mth codeword in a first period in the SCL decoding process of the continuous elimination list, m and n are positive integers, and the mth codeword is different from the nth codeword; the code word is a signal coded by utilizing a Huffman code.

9. A terminal device, comprising:

a memory storing executable program code;

a processor coupled to the memory;

the processor is configured to, in a continuous elimination list SCL decoding process, when computing an LLR for an mth codeword using a computing unit PE resource in a first period, sort resources in an idle state, sort an nth codeword using the sort resources, where m and n are positive integers, and the mth codeword and the nth codeword are different; the code word is a signal coded by utilizing a Huffman code.

10. A computer readable storage medium comprising instructions which, when run on a processor, cause the processor to perform the method of any of claims 1-7.