CN114285525A

CN114285525A - Method, device, terminal equipment and storage medium for polar code shared resource decoding

Info

Publication number: CN114285525A
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: 2022-04-05
Anticipated expiration: 2041-12-28
Also published as: CN114285525B

Abstract

The embodiment of the application discloses a method, a device, terminal equipment and a storage medium for polar code shared resource decoding, which are used for saving part of hardware resources and saving some decoding time by a resource sharing method. The embodiment of the application is applied to the terminal equipment, and the method comprises the following steps: in the decoding process, decoding an mth code word by using a PE resource in a calculation unit in a first period, and 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 encoded by using a Huffman code.

Description

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

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 polar code shared resource.

Background

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

Disclosure of Invention

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

A first aspect of the present application provides a method for decoding a multiple 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 Element (PE) resource in a first period, and decoding an nth code word by using an ordering 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 encoded by using a Huffman code.

A second aspect of the present application provides an apparatus for decoding multiple codewords sharing resources, which may include:

the processing module is used for decoding the mth code word by using the PE resources of the computing unit in a first period and decoding the nth code word by using the sequencing resources 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 encoded by using 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 with the memory;

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

Yet another aspect of the embodiments of the present application provides a computer-readable storage medium, comprising instructions, which when executed on a processor, cause the processor to perform the method of the first aspect of the present application.

In another aspect, an embodiment of the present invention discloses a computer program product, which, when running on a computer, causes the computer to execute the method of the first aspect of the present application.

In another aspect, an embodiment of the present invention discloses an application publishing platform, where the application publishing platform is configured to publish a computer program product, where when the computer program product runs on a computer, the computer is caused to execute the method according to the first aspect of the present application.

According to the technical scheme, the embodiment of the application has the following advantages:

in the embodiment of the application, in the decoding process, an mth code word is decoded by using a PE resource of a computing unit in a first period, an nth code word is decoded by using a sequencing resource, m and n are positive integers, and the mth code word is different from the nth code word; the code word is a signal encoded by using a Huffman code. By the method of sharing resources, not only can a part of hardware resources 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 following briefly introduces the embodiments and the drawings used in the description of the prior art, and obviously, the drawings in the following description are only some embodiments of the present application, and other drawings can be obtained according to the drawings.

FIG. 1 is a diagram illustrating an embodiment of a method for shared resource decoding of polar codes according to an embodiment of the present application;

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

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

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

fig. 2D is a schematic diagram of a decoding structure of the SCL decoder performing decoding of multiple codewords and sharing resources in the present application;

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

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

FIG. 2G is a diagram illustrating a token ring resource priority management unit managing multiple code contention resources according to the present application;

fig. 3 is a schematic diagram of an embodiment of an apparatus for decoding a polarization code shared resource in an embodiment of the present application;

FIG. 4 is a schematic diagram of an embodiment of a terminal device in the embodiment of the present application;

fig. 5 is a schematic diagram of another embodiment of the terminal device in the embodiment of the present application.

Detailed Description

For a person skilled in the art to better understand the present application, the technical solutions in the embodiments of the present application will be described below with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are only some embodiments of the present application, and not all embodiments. The embodiments in the present application shall fall within the protection scope of the present application.

At present, the fifth generation mobile communication (5G) technology is becoming mature day by day, the 5G technology in China is already in commercial use and falls to the ground, each large operator is actively preparing for the evolution and upgrade of 5G network equipment, meanwhile, terminal manufacturers at home and abroad follow the development of the 5G technology, many 5G electronic devices are designed and produced, aiming at the scenarios of high-reliability and Low-Latency Communications (urrllc) in 5G applications, products of each home have different advantages and disadvantages, based on different design concepts and balance thinking of overall performance, a large amount of optimization is performed on the urrllc, and most of the schemes adopt a design scheme of sacrificing area to replace time priority.

For a high-reliability low-delay communication scene, air interface transmission delay, network forwarding delay and retransmission probability should be reduced as much as possible to meet extremely high requirements on delay and reliability. For this reason, it is necessary to adopt a shorter frame structure and a more optimized signaling flow, introduce a new scheduling-free multiple access and Device-to-Device (D2D) communication technique to reduce signaling interaction and data transfer, and apply more advanced modulation coding and retransmission mechanisms to improve transmission reliability. The Control region in 5G only includes a Physical Downlink Control Channel (PDCCH) for scheduling Downlink transmission on a Physical Downlink Shared Channel (PDSCH) and Uplink transmission on an Uplink Physical Shared Channel (PUSCH), and the Downlink Control Information (DCI) carried by the PDCCH includes modulation and coding schemes of Uplink and Downlink allocation grants, resource allocation, Hybrid Automatic Repeat reQuest (HARQ) Information, and important Information such as a Blind slot format (slot format) for notifying one or more User Equipments (UEs) of the Information.

In the blind search process of 5G, the decoding time of Polar codes determines the decoding performance of PDCCH, and is also a key core index of terminal device uRLLC, the code word number and code length of Polar decoding are determined according to different subcarrier interval configurations, the maximum value of a candidate set of PDCCH and the maximum value of a non-overlapping Control Channel Element (CCE), 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, the better the performance of uRLLC is. Compared with the traditional scheme of improving the parallelism and shortening the blind detection time by packaging and adding Polar decoding units, in the method, the Polar decoding method of the multi-code word sharing computing resource reduces certain hardware resources under the same condition and obtains larger performance improvement on the decoding time.

It should be noted that Polar code (Polar code) is a forward error correction coding method for signal transmission. The core of the structure is that through channel polarization (channel polarization), a method is adopted at the encoding side to enable each sub-channel to present different reliability, when the code length continuously increases, a part of channels tend to a perfect channel (without error code) with the capacity close to 1, the other part of channels tend to a pure noise channel with the capacity close to 0, and the method for directly transmitting information on the channel with the capacity close to 1 to approach the channel capacity is the only method which 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 a simple successive interference cancellation decoding method.

Polar code is a linear channel coding method proposed based on channel polarization theory, the code word is the only type of coding method found so far which can reach shannon limit, and has lower coding and decoding complexity, when the coding length is N, the complexity is o (nlogn). The theoretical basis for Polar codes is channel polarization. The channel polarization includes channel combining and channel splitting sections. When the number of combined channels tends to infinity, then a polarization phenomenon occurs: one part of the channel tends to be a noiseless channel, and the other part tends to be a full-noise channel, which is a channel polarization phenomenon. The transmission rate of the noiseless channel will reach the channel capacity i (w), while the transmission rate of the full-noise channel tends to zero. The coding strategy of Polar codes just applies the characteristic of the phenomenon, and transmits useful information of users by using a noiseless channel, and transmits appointed information or unvarnished information by using a full-noise channel.

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 a ship and the like); and may also be deployed in the air (e.g., airplanes, balloons, satellites, etc.).

In this embodiment, 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 (AR) terminal device, a wireless terminal device in industrial control (industrial control), a wireless terminal device in self 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 safety (transportation safety), a wireless terminal device in city (smart city), a wireless terminal device in smart home (smart home), or the like.

By way of example and not limitation, in the embodiments of the present application, the terminal device may also be a wearable device. Wearable equipment can also be called wearable intelligent equipment, is the general term of applying wearable technique to carry out intelligent design, develop the equipment that can dress to daily wearing, like glasses, gloves, wrist-watch, dress and shoes etc.. A 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 realizes powerful functions through software support, data interaction and cloud interaction. The generalized wearable smart device includes full functionality, large size, and can implement full or partial functionality without relying on a smart phone, such as: smart watches or smart glasses and the like, and only focus on a certain type of application functions, and need to be used in cooperation with other devices such as smart phones, such as various smart bracelets for physical sign monitoring, smart jewelry and the like.

The following further describes the technical solution of the present application by way of an embodiment, as shown in fig. 1, which is a schematic view of an embodiment of a method for decoding a polarization code shared resource in an application embodiment, and is applied to a terminal device, where the embodiment of the method may include:

101. in the decoding process, decoding the mth code word by using the PE resource of the computing unit in a first period, and decoding the nth code word by using the sequencing resource; m and n are positive integers, and the mth code word and the nth code word are different; the code word is a signal encoded by using a Huffman code.

A Code Word (Code Word) refers to a signal encoded by a Huffman Code. A frame contains m data bits (i.e., a message) and r redundant bits (check bits). The total length of the frame, data bits + redundancy bits, the X-th bit position containing data and check bits is typically referred to as an X-bit codeword. The code word is composed of a plurality of code elements, and the communication in the computer communication is represented by a plurality of binary codes.

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 sequencing resource is idle, and other codewords can be decoded using the sequencing resource.

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

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

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 taken to be minimum,

the return value representing the partial sum of the G function.

The SC decoding is a relatively extensive Polar code decoding algorithm adopted by various current manufacturers, the SC decoding algorithm not only can theoretically reach the Shannon channel capacity, but also has lower hardware design complexity, the SC decoding algorithm can be represented as a complete binary tree of depth-first traversal, a root node input channel likelihood Ratio (Log likelihood Ratio, LLR) and a depth-first traversal 2^NAnd sequentially estimating and constructing channel likelihood ratios by using the leaf nodes, as shown in fig. 2A, which is a schematic diagram of a Polar code decoding deep binary tree.

In fig. 1, the forward left branch message is an F function:

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

the forward-to-right branch message is a G function:

wherein, a0, a1, a2, … and a7 represent LLR values of the node, u0, u1, … and u7 represent partial and return values, in the iterative decoding process of SC, a computing unit (Processor Element, PE) is responsible for computing F & G functions, and the number of times of using computing resources PE is determined according to different depths of the binary tree. Assuming that the code length of Polar codes is 8, the deep binary tree has 4 layers, the highest layer has 8 LLR data, the layers sequentially go 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; that is, the PE is used 4 times in the highest layer, the PE is used 2 times in the second layer, and the PE is used 1 time in the first layer, and when the lowest layer is reached, a decision is formed according to the data of LLR to complete the decoding of the node. The deep binary tree traversal calculation is explained in conjunction with the above formula, as follows:

1) f-function was calculated at level 3 (Stage3), a0 paired with a4, a1 paired with a5, a2 paired with a6, a3 paired with a 7; wherein, the LRR value of each layer needs to be symmetrical when matching.

2) F-function was calculated at level 2 (Stage2), a0 paired with a2, a1 paired with a 3;

3) f-function was calculated at level 1 (Stage1), a0 paired with a 1;

4) carrying out decision on LLR (a0) at a layer 0 (Stage0) to obtain u 0;

5) iterate up to level 1 at level 0, return partial sum u 0;

6) computing the G function at level 1, a0 paired with a1, part sum u 0;

7) making a decision on LLR (a0) at layer 0 to obtain u 1;

8) iterate up to level 2 at level 0, return partial sums u0, u 1;

9) calculating the G function at layer 2, wherein a0 is matched with a2, a1 is matched with a3, and the partial sum is u0 and u 1;

10) repeating steps 3-7 to obtain fractions u2, u 3;

11) iterate up to level 3 at level 0, return partial sums u0, u1, u2, u 3;

12) at level 3, the G function is calculated, a0 paired with a4, a1 paired with a5, a2 paired with a6, a3 paired with a7, partial sum u0, u1, u2, u 3;

13) and (5) repeating the steps 2-10, and finishing decoding all the nodes to obtain a decoding result.

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

The advantage of SC decoding alone in performance is reduced when the code length is limited, so that Sequential Cancellation List (SCL) iterative decoding based on SC decoding is selected to solve such problems, and SCL decoding is added to SC decoding as the name suggests. After adding a plurality of decoding lists, it is necessary to process the plurality of decoding lists and select the best L decoding lists during the decoding process. When a deep binary tree is used for calculating to a leaf node through a PE, when the node is an information node instead of a frozen node, the node has two decision results, and the two decision results (0 and 1) are both stored in the SCL decoding process, namely two decoding lists are generated. With the increase of information node judgment, the number of decoding lists is increased, if the fission of the generated decoding list is completely unlimited, storage resources and decoding complexity become unthinkable, but the improvement of decoding performance is negligible, so that the maximum value of the number of decoding lists is set for balancing performance, resources and design complexity.

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

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

Optionally, the sorting the M decoding lists by using sorting resources, and performing replacement and clipping according to the path metric value to obtain L decoding lists, where the method includes: and sequencing the M decoding lists by using sequencing resources, and selecting the 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 at the same time, cuts and replaces the plurality of lists, and retains the L lists with the 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 can be replaced and cut according to a Path Metric (Path Metric).

The LLR Path Metric (Path Metric) value of the decoding list is an index for judging whether the decoding list survives or not, the Path Metric is approximate to zero when the actual value is the same as the decision value, the Path Metric value is approximate to 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 Metric 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 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 value, are selected according to the sorting result.

Therefore, the decoding structure of the SCL decoder needs to add a sorting unit, as shown in fig. 2B, which is a schematic diagram of the decoding structure of the SCL decoder for decoding a single codeword in the present application. In fig. 2B, the device includes a computing unit PE and a sorting unit, and after the single codeword is processed by the computing unit PE and the sorting unit, a Partial Sum (Partial Sum u) may be output and then returned to the computing unit PE for input. It is understood that the processing of the computing unit PE is mainly to compute the F-function and the G-function described above. Fig. 2C is a schematic diagram of the decoding timing for PE calculation and ordering for a single codeword in the present application. In the illustration of FIG. 2C, if the compute PE Resource is used in one cycle, then the compute Resource is IDLE (sequencing Resource IDLE), and if the compute Resource is used in one cycle, then the compute PE Resource is IDLE (PE Resource IDLE).

102. Decoding the x-th code word by using sequencing resources in a second period, and decoding the y-th code word by using computing element PE resources, wherein x and y are positive integers, and the x-th code word is different from the y-th code word.

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 yth codeword are the same or different, and the nth codeword and the xth 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 the same as the xth codeword, and the nth codeword is the same as the yth 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 xth codeword using the sequencing resource in the second period, and the yth codeword using the computing unit PE resource in the second period may include: the terminal device decodes the x-th code word by using the sequencing resource through the computing unit PE in the second period, and decodes the y-th code word by using the computing unit PE resource through the sequencing unit.

In the prior art, according to the characteristic analysis of the SCL decoder, the 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 overall decoding time of a single codeword is approximately the sum of the iterative PE calculation consumed time and the ordering consumed time. The method and the device have the advantages that the PE calculation and sequencing resources are shared by the multiple code words, the utilization rate of the PE calculation and sequencing can be fully improved, the PE calculation time or the sequencing calculation time in the decoding process can be optimized, namely the Polar average decoding time is shortened to the PE calculation time or the sequencing time, and the maximum value between the PE calculation time and the sequencing time is taken. Fig. 2D is a schematic diagram of a decoding structure of the SCL decoder performing decoding of multiple codewords and sharing resources in the present application. In fig. 2D, the calculation unit PE and the sorting unit are included, and for a plurality of Code words (including Code Word 0(Code Word 0), Code Word 1(Code Word 1) … … Code Word n (Code Word n)), after being processed by the calculation unit PE and the sorting unit, a Partial Sum (u)) may be output, and then returned and input to the calculation unit PE. Through the processing of the computing unit PE, a plurality of decoding lists can be obtained, and the path of each decoding list can be stored. It is understood that the processing of the computing unit PE is mainly to compute the F-function and the G-function described above.

When one code word uses the PE resources, other code words can obtain sequencing resources, when one code word is sequenced, other code words can obtain the PE resources, and the optimization of the average decoding time is obtained through a multi-code-word computing resource sharing competition scheme. Fig. 2E is a schematic diagram of decoding timing for PE calculation and ordering for a plurality of codewords according to the present application. In the illustration of fig. 2E, at

clocks

2 and 3, which may also be understood as cycle 2 and cycle 3, codeword 0(Code Word 0, CW 0) uses the compute PE resource (clock the PE resource); at

clocks

4 and 5, which may also be understood as

cycles

4 and 5, CW 0 uses the ordering resource and codeword 1(Code Word 1, CW 1) uses the computation PE resource; at

clocks

6 and 7, which may also be understood as

cycles

6 and 7, CW 0 uses compute PE resources and CW 1 uses sort resources; at

clocks

8 and 9, which may also be understood as

cycles

8 and 9, CW 0 uses the ordering resources and CW n uses the compute PE resources; in

clocks

10 and 11, which may also be understood as

cycles

10 and 11, CW 0 uses compute PE resources and CW n uses sequencing resources.

Fig. 2F shows another schematic diagram of decoding timing for PE calculation and ordering for multiple codewords in the present application. In the illustration of fig. 2F, at

clocks

2 and 3, which can also be understood as cycle 2 and cycle 3, CW 0 uses the compute PE resources; at

clocks

4 and 5, which may also be understood as cycle 4 and cycle 5, CW 0 uses the sequencing resources and CW 2 uses the compute PE resources; at

clocks

6 and 7, which can also be understood as cycle 6 and cycle 7, CW 0 uses compute PE resources and CW 2 uses sort resources; at

clocks

8 and 9, which may also be understood as cycle 8 and cycle 9, CW 0 uses the sequencing resources and CW 2 uses the compute PE resources; at

clocks

10 and 11, which can also be understood as cycle 10 and cycle 11, CW 1 uses compute PE resources and CW 2 uses sort resources; at

clocks

12 and 13, which can also be understood as 12 th cycle and 13 th cycle, CW 1 uses the sequencing resource, CW n uses the computation PE resource; at

clocks

14 and 15, which can also be understood as 14 th cycle and 15 th cycle, CW n uses the sequencing resource.

Optionally, under the condition that the mth codeword and the yth codeword simultaneously request PE resources, if the priority of the mth codeword is higher than the priority of the yth codeword, the first period is before the second period. It can be understood that, if the mth codeword and the yth codeword are different and the mth codeword and the yth codeword request PE resources at the same time, since the mth codeword has a higher priority than the yth codeword, PE resources are preferentially used for the mth codeword and used for the yth codeword after the mth codeword is used up. And the PE resources are used in the first cycle for the mth codeword and in the second cycle for the yth codeword, so the first cycle precedes the second cycle.

Optionally, the decoding, by the terminal device, the mth codeword in the first cycle using the PE resource may include: the terminal equipment determines that the priority of the mth code word is higher than that of the yth 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 decoding, by the terminal device, the y-th codeword using the PE resource in the second period may include: after the mth code word is used, the terminal device updates the priority of the code word through the token ring resource priority management unit, and decodes the yth code word using the PE resource in the second period.

That is, the token ring resource priority management unit manages the priorities of multiple codewords, when the mth codeword and the yth codeword request PE resources at the same time, according to the token ring resource priority management unit, it is determined that the priority of the mth codeword is higher than that of the nth codeword, the terminal device can preferentially use the PE resources for the mth codeword, and after the mth codeword is used, the priority of the yth codeword is updated to be the highest by the token ring resource priority management unit, and the terminal device can use the PE resources for the yth codeword.

It can be understood that the code length and the number of valid information of each codeword are different, which inevitably causes contention for computational resources in the SCL decoding process, and in order to ensure that each codeword has the same chance to contend for computational resources and complete decoding within a reasonable time, a token ring resource priority management unit may be designed, as shown in fig. 2G, which is a schematic diagram of a token ring resource priority management unit in the present application for managing multiple codeword contention resources. The token ring resource priority management unit controls equal probability distribution of computing resources to different code words, the code words with high priority firstly obtain the computing resources for decoding, the code words with low priority need to wait, when decoding of the code words with high priority is completed, the token ring resource priority management unit executes priority updating, the computing resource priority is changed into different code words, and each code word equally obtains the computing resources in 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 code word is decoded by using a PE resource of a computing unit in a first period, an nth code word is decoded by using a sequencing resource, m and n are positive integers, and the mth code word is different from the nth code word; the code word is a signal encoded by using a Huffman code. That is, when the mth codeword uses the PE resource, the ordering resource is idle, and the ordering resource can be used for the nth codeword. And the terminal equipment uses sequencing resources for the x-th code word in the second period and decodes the y-th code word by using the PE resources. That is, when the x-th codeword uses the sorting resource, the PE resource is idle, and the PE resource can be used for the y-th codeword. By the method of sharing resources, not only can a part of hardware resources be saved, but also some decoding time can be saved.

It can be understood that the method for decoding Polar multi-codeword shared resources optimizes the deficiency that decoding is performed by a single codeword serial continuous elimination decoding list on a top-level architecture, and realizes parallel decoding of single computing resources by computing resources time-division multiplexing, wherein the computing resources in Polar decoding include a PE unit and a sequencing unit, the computing PE resources are core modules of Polar decoding, and the computing PE resource units not only bear all computing tasks of decoding, but also occupy large chip area resources. The PE resources for computing Polar decoding not only affect the decoding performance, but also are important for optimizing the chip area and the power consumption, according to the simulation result of the decoding architecture of the Polar multi-codeword shared resources, the scheme can achieve the purpose that the utilization rate of the computing resources can be increased, the average decoding time is shortened, the area is optimized, and an optimization thought and actual benefits are provided for PDCCH blind detection, low delay and high reliability of terminal equipment.

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

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

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

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

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

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

Optionally, under the condition that the mth codeword and the yth codeword simultaneously request PE resources, if the priority of the mth codeword is higher than the priority of the yth codeword, the first period is before the second period.

Optionally, the processing module 301 is specifically configured to determine, by the token ring resource priority management unit, that the priority of the mth code word is higher than the priority of the yth code word, and decode the mth code word by using the PE resource in the first cycle;

the processing module 301 is specifically configured to update the priority of the codeword through the token ring resource priority management unit after the mth codeword is used, and decode the yth codeword using the PE resource in the second period.

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

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

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

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

RF circuit 510 may be used for receiving and transmitting signals during information transmission and reception or during a call, and in particular, for processing downlink information of a base station after receiving the downlink information to processor 580; in addition, the data for designing uplink is transmitted to the base station. In general, RF circuit 510 includes, but is not limited to, an antenna, at least one Amplifier, a transceiver, a coupler, a Low Noise Amplifier (LNA), a duplexer, and the like. In addition, RF circuit 510 may also communicate with networks and other devices via wireless communication. The wireless communication may use any communication standard or protocol, including but not limited to Global System for Mobile communication (GSM), General Packet Radio Service (GPRS), Code Division Multiple Access (CDMA), Wideband Code Division Multiple Access (WCDMA), Long Term Evolution (LTE), email, Short Messaging Service (SMS), and the like.

The memory 520 may be used to store software programs and modules, and the processor 580 executes various functional applications and data processing of the mobile phone by operating the software programs and modules stored in the memory 520. The memory 520 may mainly include a program storage area and a data storage area, wherein the program storage area may store an operating system, an application program required by 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, a phonebook, etc.) created according to the use of the cellular phone, and the like. Further, the 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 cellular phone. Specifically, the input unit 530 may include a touch panel 531 and other input devices 532. The touch panel 531, also called a touch screen, can collect touch operations of a user on or near the touch panel 531 (for example, operations of the user on or near the touch panel 531 by using any suitable object or accessory such as a finger or a stylus pen), and drive the corresponding connection device according to a preset 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 direction 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 sensing device, converts the touch information into touch point coordinates, and sends the touch point coordinates to the processor 580, and can receive and execute commands sent by the processor 580. In addition, the touch panel 531 may be implemented by various types such as a resistive type, a capacitive type, an infrared ray, and a 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 (such as volume control keys, switch keys, etc.), a trackball, a mouse, a joystick, and the like.

The display unit 540 may be used to display information input by the 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 optionally, the Display panel 541 may be configured in the form of a 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 on or near the touch panel 531, the touch panel is transmitted 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 the touch panel 531 and the display panel 541 are shown as two separate components in fig. 5 to implement the input and output 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, motion sensor, and other sensors. Specifically, the light sensor may include an ambient light sensor and a proximity sensor, wherein the ambient light sensor may adjust the brightness of the display panel 541 according to the brightness of ambient light, and the proximity sensor may turn off the display panel 541 and/or the backlight when the mobile phone is moved to the ear. As one of the motion sensors, the accelerometer sensor can detect the magnitude of acceleration in each direction (generally, three axes), can detect the magnitude and direction of gravity when stationary, and can be used for applications of recognizing the posture of a mobile phone (such as horizontal and vertical screen switching, related games, magnetometer posture calibration), vibration recognition related functions (such as pedometer and tapping), and the like; as for other sensors such as a gyroscope, a barometer, a hygrometer, a thermometer, and an infrared sensor, which can be configured on the mobile phone, further description is omitted here.

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

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

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

The handset also includes a power supply 590 (e.g., a battery) for powering the various components, which may preferably be logically coupled to the processor 580 via a power management system, such that the power management system may be used to manage charging, discharging, and power consumption.

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

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

Optionally, the processor 580 is further configured to decode an xth codeword using the sequencing resource in a second period, and decode an yth codeword using the computing unit PE resource, 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 in a decoding process of the continuous cancellation list SCL, where L is a maximum value of the number of the decoding lists, and L is an integer greater than 0; coding the L coding lists using ordering resources.

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

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

Optionally, the processor 580 is specifically configured to determine, by the token ring resource priority management unit, that the priority of the mth code word is higher than the priority of the yth code word, and decode the mth code word using the PE resource in the first cycle;

the processor 580 is specifically configured to update the priority of the codeword through the token ring resource priority management unit after the mth codeword is used, and decode the yth codeword using the PE resource in the second period.

In the above embodiments, the implementation may be wholly or partially realized 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, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored in a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website site, computer, server, or data center to another website site, computer, server, or data center via wired (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that a computer can store or a data storage device, such as a server, a data center, etc., that is integrated with 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)), among others.

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

In the several embodiments provided in the present application, it should be understood that the disclosed system, apparatus and method may be implemented in other manners. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.

The units described as separate parts may or may not be physically separate, and parts displayed 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 can be selected according to actual needs to achieve the purpose of the solution of the embodiment.

In addition, functional units in the embodiments of the present application may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.

The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially implemented or contributed to by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute 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), a magnetic disk or an optical disk, and other various media capable of storing program codes.

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

Claims

1. A method for decoding polarization code shared resources is applied to a terminal device, and is characterized in that the method comprises the following steps:

in the decoding process, decoding an mth code word by using a PE resource in a calculation unit in a first period, and 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 encoded by using a Huffman code.

2. The method of claim 1, further comprising:

decoding the x-th code word by using sequencing resources in a second period, and decoding the y-th code word by using computing element PE resources, wherein x and y are positive integers, and the x-th code word is different from the y-th code word.

3. The method of claim 1, wherein the decoding the mth codeword using the ordered resource comprises:

in the decoding process of the continuous elimination list SCL, obtaining L decoding lists, wherein L is the maximum value of the number of the decoding lists, and is an integer larger than 0;

coding the L coding lists using ordering resources.

4. The method of claim 1, wherein said coding the L coding lists using an ordering resource comprises:

obtaining M decoding bar lists in the decoding process of the continuous elimination list SCL;

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

coding according to the L coding lists.

5. The method according to claim 4, wherein said sorting said M decoding lists using sorting resources, and performing replacement 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 the L decoding lists with the minimum path metric value.

6. The method of any of claims 1-5, wherein in the case that the mth codeword and the yth codeword request PE resources at the same time, the first period precedes the second period if the mth codeword has a higher priority than the yth codeword.

7. The method of claim 6, wherein decoding the mth codeword in the first cycle using the PE resources comprises:

determining that the priority of the mth code word is higher than that of the yth code word through a token ring resource priority management unit, and decoding the mth code word by using a PE resource in a first period;

decoding the y-th codeword in the second period using the PE resource, comprising:

after the mth code word is used, the priority of the code word is updated through the token ring resource priority management unit, and the yth code word is decoded by using the PE resource in the second period.

8. An apparatus for polar code shared resource decoding, comprising:

9. A terminal device, comprising:

a memory storing executable program code;

a processor coupled with the memory;

the processor is configured to decode an mth codeword using a PE resource in a first cycle and decode an nth codeword using an ordered resource in a decoding process, where m and n are positive integers, and the mth codeword is different from the nth codeword; the code word is a signal encoded by using a Huffman code.

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