Methods, apparatus, electronic devices, and media for calculating the g-function in polar code decoding

By determining the parameters and target elements in the coding equivalent graph in polarization code decoding, the estimated bits of the g function node are directly calculated, which solves the problem of large amount of calculations of g function nodes in polarization code decoding, and improves the calculation efficiency.

CN113872613BActive Publication Date: 2024-12-03GUANGZHOU HUIRUI SITONG INFORMATION SCI & TECH CO LTD
View PDF 0 Cites 0 Cited by

Patent Information

Application Number
CN202111162122.7
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2021-09-30
Publication Date
2024-12-03
Estimated Expiration
2041-09-30

AI Technical Summary

Technical Problem

In polarization code decoding, the calculation of the g function node is not known, resulting in large calculation amounts, which increases the computational complexity.

Method used

By determining the first and second parameters in the coded equivalent graph, the target decoded bits and the target elements in the target encoding matrix are determined based on these parameters, and the estimated bits of the g-function associated node are directly calculated, and the input pairs are used. The number likelihood ratio LLR value calculates the LLR value, avoiding assuming that the estimated bit is 0 or 1.

Benefits of technology

The calculation amount of g function node calculation is effectively reduced, the efficiency of polarization code decoding is improved, and the problem of large calculation amount is solved due to unknown estimation bits.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN113872613B_ABST
    Figure CN113872613B_ABST
Patent Text Reader

Abstract

The present disclosure provides a method, device, electronic device and medium for calculating the g function in polar code decoding, the method comprising: determining a first parameter and a second parameter of a first node in a coding equivalent graph, the first node being a node associated with the g function, the first parameter being used to characterize the layer of the first node in the coding equivalent graph, and the second parameter characterizing the level of the first node in the coding equivalent graph; determining a target decoding bit and a target element in a target coding matrix based on the first parameter and the second parameter; determining an estimated bit of the first node based on the target element and the target decoding bit; determining an LLR value of the first node based on the estimated bit and the log-likelihood ratio LLR value input to the first node. Through the present disclosure, the technical problem of large amount of calculation caused by unknown estimated bits when calculating g function nodes in the related art is solved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present disclosure relates to the field of communication technology, and in particular to a method, device, electronic device and medium for calculating a g function in polar code decoding. Background Art

[0002] Polar codes are channel polarization codes. Due to their low decoding complexity, they have become one of the research hotspots in the field of channel coding today. For example, they are used as channel codes for future wireless communications and have been selected for uplink and downlink enhanced mobile broadband (eMBB) control channel coding of the new fifth generation (5G) air interface (also known as 5G New Radio (NR)). These codes compete with the error correction codes of related technologies and have low coding complexity. In addition, polarization codes are currently the only error correction coding technology that can be mathematically proven to reach the Shannon limit. Among them, the Successive Cancellation List (SCL) algorithm is a widely accepted Polar decoding algorithm. Summary of the invention

[0003] The inventors have found that in order to obtain the final decoding bit, the related polar code decoding method needs to calculate the logarithm likelihood ratio (LLR) value of each node in the coding equivalent graph and the corresponding path metric value. When calculating each node, it is necessary to calculate the LLR value of all decoding paths, calculate the path metric value of the corresponding decoding path according to the LLR value, sort all path metric values, and select several paths with large path metric values ​​for subsequent expansion. If the node is a g function, it is also necessary to assume the corresponding LLR value when the estimated bit in the g function is 0 or 1, which increases the amount of calculation. The purpose of the embodiments of the present disclosure is to provide a method, device, electronic device and medium for calculating the g function in polar code decoding, which can determine the value of the estimated bit in the g function to solve the technical problem of large amount of calculation caused by unknown estimated bits when calculating the g function nodes. The specific technical solution is as follows:

[0004] In a first aspect of the implementation of the present disclosure, a method for calculating a g function in polar code decoding is first provided, including: determining a first parameter and a second parameter of a first node in a coding equivalent graph, wherein the first node is a node associated with the g function, the first parameter is used to characterize a layer of the first node in the coding equivalent graph, and the second parameter characterizes a level of the first node in the coding equivalent graph; determining a target decoding bit and a target element in a target coding matrix based on the first parameter and the second parameter; wherein the target coding matrix is ​​an X-times Kronecker matrix, X is a logarithm of a mother code length with a base of 2, and X is a positive integer; determining an estimated bit of the first node based on the target element and the target decoding bit; and determining an LLR value of the first node according to the estimated bit and a log-likelihood ratio (LLR) value input to the first node.

[0005] In a second aspect of the implementation of the present disclosure, a calculation device for a g function in polar code decoding is further provided, including: a first determination module, configured to determine a first parameter and a second parameter of a first node in a coding equivalent graph, wherein the first node is a node associated with the g function, the first parameter is used to characterize a layer of the first node in the coding equivalent graph, and the second parameter characterizes a level of the first node in the coding equivalent graph; a second determination module, configured to determine a target decoding bit and a target element in a target coding matrix based on the first parameter and the second parameter; wherein the target coding matrix is ​​an X-times Kronecker matrix, and X is a logarithm of a mother code length with a base of 2; a third determination module, configured to determine an estimated bit of the first node based on the target element and the target decoding bit; and a fourth determination module, configured to determine an LLR value of the first node according to the estimated bit and a log-likelihood ratio LLR value input to the first node.

[0006] In a third aspect of the implementation of the present disclosure, an electronic device is further provided, including a processor, a communication interface, a memory, and a communication bus, wherein the processor, the communication interface, and the memory communicate with each other through the communication bus; the memory is used to store a computer program; and the processor is used to implement the method for calculating the g function in polar code decoding according to the first aspect when executing the program stored in the memory.

[0007] In a fourth aspect of the implementation of the present disclosure, a computer-readable storage medium is further provided, on which a computer program is stored. When the program is executed by a processor, the method for calculating the g function in polar code decoding described in the first aspect is implemented.

[0008] In an embodiment of the present disclosure, a first parameter and a second parameter of a first node associated with a g-function in a coding equivalent diagram are first determined; based on the first parameter and the second parameter, a target decoding bit and a target element in a target coding matrix are determined; based on the target element and the target decoding bit, an estimated bit of the first node is determined; and based on the estimated bit and a log-likelihood ratio (LLR) value input to the first node, an LLR value of the first node is determined. That is, in the present disclosure, the estimated bit of a node associated with a g-function can be directly determined, and in the process of determining the LLR value, there is no need to assume whether the estimated bit in the g-function is 0 or 1, thereby solving the technical problem of large amount of calculation due to unknown estimated bits when calculating g-function nodes in the related art. BRIEF DESCRIPTION OF THE DRAWINGS

[0009] In order to more clearly illustrate the technical solutions in the embodiments of the present disclosure or related technologies, the drawings required for use in the embodiments or related technical descriptions are briefly introduced below.

[0010] Figure 1 It is a decoding diagram of the SCL code tree when N=4 and M=2 in the embodiment of the present disclosure;

[0011] Figure 2 1 is a flow chart of a method for calculating a g function in polar code decoding in an embodiment of the present disclosure;

[0012] Figure 3 This is a coding equivalent diagram when N=8 and M=3 in the embodiment of the present disclosure;

[0013] Figure 4 In the embodiments of the present disclosure Figure 2 Specific flow chart of step 204;

[0014] Figure 5 This is a coding equivalent diagram when N=8 and M=3 in the embodiment of the present disclosure;

[0015] Figure 6 is a schematic diagram of a 3-fold Kronecker matrix in an embodiment of the present disclosure;

[0016] Figure 7 In the embodiments of the present disclosure Figure 2 Specific flow chart of step 206;

[0017] Figure 8 In the embodiments of the present disclosure Figure 2 Specific flow chart of step 208;

[0018] Fig. 9 is a flow chart of a method for calculating a g function in polar code decoding in another embodiment of the present disclosure;

[0019] Fig.10Schematic diagram of the structure of a calculation device for the g function in polar code decoding in one embodiment of the present disclosure;

[0020] Fig.11 In the embodiments of the present disclosure Fig.10 A schematic diagram of the specific structure of the second determination module;

[0021] Fig.12 In the embodiments of the present disclosure Fig.10 A schematic diagram of the specific structure of the third determination module;

[0022] Fig.13 In the embodiments of the present disclosure Fig.10 A schematic diagram of the specific structure of the fourth determination module;

[0023] Fig.14 A schematic diagram of a structure of a calculation device for a g function in polar code decoding in another embodiment of the present disclosure;

[0024] Fig.15 Schematic diagram of the structure of an electronic device in an embodiment of the present disclosure. DETAILED DESCRIPTION

[0025] In order to make the purpose, technical solution and advantages of the embodiments of the present disclosure clearer, the technical solution in the embodiments of the present disclosure will be clearly and completely described below in conjunction with the drawings in the embodiments of the present disclosure. Obviously, the described embodiments are part of the embodiments of the present disclosure, not all of the embodiments. Based on the embodiments in the present disclosure, all other embodiments obtained by ordinary technicians in this field without making creative work are within the scope of protection of the present disclosure.

[0026] In the following description, the suffixes such as "module" and "unit" used to represent elements are only used to facilitate the description of the present disclosure, and they themselves have no specific meaning. Therefore, "module" and "component" can be used interchangeably.

[0027] First, the relevant background in the embodiments of the present disclosure is explained.

[0028] The mainstream algorithm in polar code decoding is the SCL decoding algorithm. SCL decoding is based on Figure 1 Path expansion is performed based on , allowing the best M paths to be selected for the next expansion. After each expansion, the M paths with the largest path metric values ​​are saved, where M is the list width or list depth. Finally, the decoding selects the path with the largest path metric value among the M paths as the decoding output.

[0029] The decoding is performed in the form of a code tree in the related SCL algorithm. Figure 1For example, N=4, M=2, where N is the mother code length and M is the list width or list depth, the relevant SCL decoding algorithm flow is introduced, including the following steps:

[0030] Step 1: Calculate the path metrics of the two paths corresponding to the first layer u1 being 0 and 1;

[0031] Among them, the corresponding LLR value is calculated first. According to the characteristics of the LLR value expression, the odd-numbered layers use the f function LLR value equivalent recursive calculation:

[0032]

[0033] in,

[0034] Among them, i is the number of layers, which is used to determine whether it is an f function or a g function. When i is an odd number, the LLR value is obtained by the f function; when i is an even number, the LLR value is obtained by the g function; y is the LLR value after rate matching. is the estimated bit, L is the LLR value calculated by the current node, i is from 1 to N / 2, o is an odd number in i, e is an even number in i, P r represents the probability value of the corresponding item, and N is the mother code length.

[0035] The path metrics PM of the two paths are calculated according to the following path metric calculation formula. The first layer ends and the number of paths is 2, and no sorting selection is required.

[0036]

[0037] Among them, j is the current node index, u is the node decoding bit, and L is the LLR value calculated by the current node.

[0038] Step 2: Calculate the second layer, there are 4 paths in total, and calculate the corresponding LLR values;

[0039] Among them, the even-numbered layers are calculated using the g-function LLR value equivalent recursive formula:

[0040]

[0041] It should be noted that the meanings of the variables in formula (3) are the same as those in formula (1).

[0042] The path metrics of the four paths are calculated according to formula (2), and the two paths with the largest path metrics are selected in order as subsequent paths and put into the list. These two paths are then used to continue to extend to the third layer.

[0043] Step 3: Calculate the third layer, calculate the LLR value according to the equivalent recursive formula of the f function, sort and select the two paths with the largest path metrics, put them into the list and continue to expand to the fourth layer.

[0044] Step 4: Calculate the 4th layer and calculate the LLR value according to the equivalent recursive formula of the g function. There are also 4 paths in the layer, but the 4th layer is a leaf node, that is, the path with the largest path metric value is selected at the end of the entire decoding, and its corresponding codeword is the output result of the decoding.

[0045] from Figure 1 It can be seen that when decoding each layer, the decoding path needs to be divided into two paths to calculate the LLR value and the path metric value respectively. When decoding a sequence with a mother code length of N, the corresponding complexity is o(N 2 logN), when the code length N is large, the amount of calculation required is very large and occupies more resources.

[0046] The technical solution in the embodiment of the present disclosure will be described below in conjunction with the accompanying drawings in the embodiment of the present disclosure. The embodiment of the present disclosure provides a method for calculating the g function in polar code decoding, such as Figure 2 As shown, the method comprises the following steps:

[0047] Step 202: determining a first parameter and a second parameter of a first node in a coding equivalent graph, wherein the first node is a node associated with a g function, the first parameter is used to characterize a layer of the first node in the coding equivalent graph, and the second parameter characterizes a level of the first node in the coding equivalent graph;

[0048] Figure 3 The coding equivalent diagram is when N=8 and M=3, where N is the mother code length and M is the list width or list depth. Figure 3 As shown in the coding equivalent diagram, the order from left to right is the encoding process, and the order from right to left is the decoding process; in the decoding process, the corresponding left u is the decoding bit, and the right x is the result after rate matching, that is, the LLR value; where x means the same as y in formula (1), (2), and (3). During decoding, the corresponding bit number is converted into binary and arranged in reverse order. Figure 3 The “.” in represents the g function, and the “⊕” represents the f function; to decode the current bit, the previously decoded bit must be known.

[0049] Here, the decoding process using the coding equivalent diagram is explained by taking u0 as an example. First, the decoding order in the coding equivalent diagram is from right to left. S is obtained by decoding x0. 2,0 , we need to perform f function operation, that is, x0⊕x4 to get S 2,0 ; by S 2,0 Decoding to get S 1,0 It is necessary to perform f function operation, that is, S 2,0 ⊕S 2,2 Get S 1,0 , and S 2,2is obtained by x2⊕x6; by S 1,0 Decoding u0 requires f function operation, that is, S 1,0 ⊕S 1,1 Get u0; where S 1,1 By S 2,1 ⊕S 2,3 Got it, S 2,1 is obtained by x1⊕x5, S 2,3 is obtained by x3⊕x7; S in the encoding and decoding equivalent diagram 1,0 , S 2,0 , S 3,0 All are LLR values, S 0,0 The estimated bits are not shown in the coding equivalent diagram, and only the g function will calculate the estimated bits. 1,0 , S 2,0 , S 3,0 These are the LLR values, S 0,0 These are the decoded bits, and the estimated bits are not shown in the coding equivalent diagram.

[0050] Step 204: determine target decoding bits and target elements in a target coding matrix based on the first parameter and the second parameter; wherein the target coding matrix is ​​an X-fold Kronecker matrix, where X is the logarithm of the mother code length with a base of 2, that is, the mother code length K is 2 to the power of X, and X is a positive integer;

[0051] When the mother code length is 8, 8 is equal to 2 to the power of 3, so the corresponding method should be to use a 3-fold Kronecker product matrix; when the mother code length is 4, 4 is equal to 2 to the power of 2, so the corresponding method should be to use a 3-fold Kronecker product matrix, that is, the relationship between the multiple X of the Kronecker matrix and the mother code length N is: N=2 to the power of X.

[0052] Step 206, determining an estimated bit of the first node based on the target element and the target decoding bit;

[0053] The estimated bit of the first node is calculated by multiplying the elements of the corresponding row by the decoded bits of the layer from the node associated with the f function in the coding equivalent graph to the layer before the layer of the first node in the coding equivalent graph, and performing a modulo 2 sum operation.

[0054] Step 208: Determine the LLR value of the first node according to the estimated bit and the log-likelihood ratio LLR value input to the first node.

[0055] Through the above steps 202 to 208 of the embodiment of the present disclosure, the first parameter and the second parameter of the first node associated with the g function in the coding equivalent diagram are first determined; based on the first parameter and the second parameter, the target decoding bit and the target element in the target coding matrix are determined; based on the target element and the target decoding bit, the estimated bit of the first node is determined; according to the estimated bit and the log-likelihood ratio LLR value input to the first node, the LLR value of the first node is determined. That is to say, in the present disclosure, the estimated bit of the node associated with the g function can be directly determined, and in the process of determining the LLR value, there is no need to assume whether the estimated bit in the g function is 0 or 1, thereby solving the technical problem of large amount of calculation caused by unknown estimated bits when calculating the g function node in the related art.

[0056] In an optional implementation of the embodiment of the present disclosure, the method of determining the target decoding bits and the target elements in the target coding matrix based on the first parameter and the second parameter involved in step 204 of the present disclosure is further as follows Figure 4 The steps shown may include:

[0057] Step 402: Determine the row and column based on the first parameter and the second parameter;

[0058] The row value is row-2. (col-1) +[0:2 (col-1) -1]; the column value is row-2 (col-1) ; Where row is the first parameter and col is the second parameter. Where row∈(1:N),col∈(1:log2N), N is the mother code length.

[0059] Step 404: Determine the elements corresponding to the rows and columns in the target coding matrix as target elements;

[0060] Among them, in specific application scenarios, such as Figure 5 As shown, taking the mother code length as 8 and the list depth or list width as 3 as an example, Figure 5 The node where a is located is the first node, so the target encoding matrix is ​​a 3-fold Kronecker matrix, such as Figure 6 As shown in the figure, the value of the layer row where the node a is located is 6, and the value of the level col where it is located is 3. Then according to row-2 (col-1) The calculated column value is 2, based on row-2 (col-1) +[0:2 (col-1) -1] calculates the value of the row to be 2:5 (i.e., row 2 to row 5), then the elements of row 2, row 3, row 4, and row 5 in column 2 are obtained from the 3-fold Kronecker matrix as the target elements, i.e., the target elements are 1, 0, 1, and 0. It should be noted that [A:B] means from A_ to B, with a spacing of 1.

[0061] Step 406: Determine the target decoding bits corresponding to the row from the coding equivalent graph.

[0062] According to the previous step, the row value is determined to be 2:5 (ie, the 2nd to the 5th row), so the target decoding bits are the decoding bits from the 2nd to the 5th row in the coding equivalent diagram, ie, u1→u4.

[0063] In an optional implementation of the embodiment of the present disclosure, for the method of determining the estimated bit of the first node based on the target element and the target decoding bit involved in the above step 206, such as Figure 7 As shown, the following steps may further be included:

[0064] Step 702, multiplying the target element and the target decoding bit with the same value of the row respectively to obtain a product result;

[0065] Step 704: Perform a modulo-2 sum operation on the product result to obtain an estimated bit of the first node.

[0066] For the above steps 702 to 704, in a specific application scenario, the above node a is taken as an example to continue the description, that is, The corresponding estimated bits are modulo-2 summed from the calculated estimated bits, that is, the estimated bits and By performing a modulo-2 sum operation, the estimated bit of the g function associated with point a can be obtained. That is, the estimated bit of the g function associated with point a can be obtained by performing a modulo-2 sum operation on the estimated bit whose corresponding element in the matrix is ​​"1".

[0067] Take point a (first node) associated with the g function and point b associated with the f function in the N=8, M=3 coding equivalent diagram as examples to illustrate the estimated bit calculation process of the node. Point a is associated with the g function and this node is located at the third level. Therefore, it can be seen that its corresponding f function node is node b at the third level of the second layer. It should be noted here that the number of layers between the g function node and its corresponding f function node is 2. col-1 ; In addition, the value of the level col of point a is 3, which means that point a is 4 levels away from node b.

[0068] Depend on Figure 5 It can be seen that the g function node at the first level is 1 level away from the corresponding f function node, and the g function node at the second level is 2 levels away from the corresponding f function node. This is also true for other mother code lengths. In addition, the coded output of node b is x1, and x1 is the input S of the third level node at the second level. 2,1 is u1⊕u3, which is also the output S of the second-level node in the second layer. 2,1 , since there are 4 layers between point a and point b and point b is in layer 2, the corresponding column in the encoding matrix is ​​2 and the row is 2:5, corresponding to Figure 6The values ​​of the Kronecker matrix in are 1, 0, 1, 0. At this time, u1→u4 has been decoded and output. Multiply the corresponding values ​​in the Kronecker matrix with the decoded bits in the corresponding rows, that is, u1=u1*1, u2=u2*0, u3=u3*0, u4=u4*1. Perform modulo 2 sum on the corresponding estimated bits from the calculated estimated bits. and By performing a modulo-2 sum operation, the estimated bit of the g function associated with point a can be obtained. That is, the estimated bit of the g function associated with point a can be obtained by performing a modulo-2 sum operation on the estimated bit whose corresponding element in the matrix is ​​"1".

[0069] That is to say, for the g function operation, the corresponding layer of the f function corresponds to the corresponding column in the Kronecker matrix; the decoding bits corresponding to the previous layer from the f function to the g function determine the decoding bits used for calculation, which correspond to the corresponding rows in the Kronecker matrix; the corresponding element values ​​of the Kronecker matrix are determined according to the corresponding columns and rows of the Kronecker matrix; based on the decoding bits used for calculation and the corresponding element values ​​in the Kronecker matrix, the estimated bit of the first node is calculated, that is, the estimated bit in formula (3). Since the estimated bit can be determined directly, compared with the prior art where the estimated bit needs to be calculated as 1 and 0 respectively (it may be 1 or 0, which is uncertain, so both need to be calculated), the amount of calculation is greatly reduced.

[0070] In an optional implementation of the embodiment of the present disclosure, the method of determining the LLR value of the first node according to the estimated bit and the log-likelihood ratio LLR value input to the first node involved in step 208 of the present disclosure is as follows: Figure 8 As shown, the following steps may further be included:

[0071] Step 802: Obtain the LLR value of the second node and the LLR value of the third node; wherein the LLR value associated with the first node includes the LLR value of the second node and the LLR value of the third node; the layer of the second node in the coding equivalent graph is The level of the second node in the coding equivalent graph is col+1; the level of the third node in the coding equivalent graph is row, and the level of the third node in the coding equivalent graph is col+1; row is the first parameter, and col is the second parameter;

[0072] In a specific application scenario, the second node can be referred to as the upper right node of the first node, and its position in the coding equivalent graph is The third node can be called the right node of the first node, and its position in the encoding / decoding equivalent graph is (row, col+1).

[0073] Step 804: Based on the LLR value of the second node, the LLR value of the third node and the estimated bit, calculate the LLR value of the first node.

[0074] Among them, the LLR value calculation formula of the g function is:

[0075] Where L1 is the LLR value of the second node, L2 is the LLR value of the third node, i is the layer, and y is the LLR value after rate matching. To estimate the bit, L is the LLR value of the first node, and N is the layer of the coding equivalent graph.

[0076] It should be noted that L1 and L2 are consistent with L1 and L2 in the above formula (3).

[0077] Based on the above embodiments of the present disclosure, if the current node is associated with a g function, then according to the layer row where the current g function node is located and the corresponding level col, the behavior of the node associated with the corresponding f function is determined: row-2 (col-1) , column is col, where row∈(1:N),col∈(1:log2N), N represents the mother code length. Further, according to row-2 (col-1) Find the column where the corresponding encoding matrix (Kronecker matrix) is located, and select row-2 from it (col-1) +[0:2 (col-1) -1] row, that is, select the column from the Kronecker matrix as row-2 (col-1) , row-2 (col-1) +[0:2 (col-1) -1], combined with the estimated bits that have been decoded and output, perform the corresponding modulo 2 addition to calculate the current node's required In addition, according to the g function formula (3), if we want to calculate the LLR value of this node, we also need the L1 of the upper right node (corresponding to the second node) and the L2 of the right node (corresponding to the third node) of this node. When decoding the current bit, the previous decoded bits are known, that is, L1 and L2 are known.

[0078] In addition, if the current node is associated with the f function, since the f function does not need to calculate the estimated bit, the LLR of the node can be directly calculated according to formula (1). It should be noted that for the f function to calculate the LLR value of this node, the L3 of its right node and the L4 of the lower right node are also required. Among them, the position of L3 in the coding equivalent graph is (row, col+1), and the position of L4 in the coding equivalent graph is L1 in formula (1) is L3, and L2 in formula (1) is L4.

[0079] In an optional implementation of the embodiment of the present disclosure, after determining the LLR value of the first node according to the estimated bit and the log likelihood ratio LLR value associated with the first node, as follows: Fig. 9 The method shown also includes:

[0080] Step 902: Determine path metric values ​​of M decoding paths of the first node according to the LLR value of the first node, where M is a list width or a list depth.

[0081] Through the above Fig. 9 The method steps shown are to calculate the LLR value after directly determining the estimated bit of the first node, and then determine the path metric values ​​of the M decoding paths of the first node, and the other nodes in the coding equivalent graph are also processed in a similar manner based on the first node. That is, in the present disclosure, multiple decoding paths can be obtained based on the coding equivalent graph, and when decoding, all paths of all nodes are calculated, and finally the decoding path with the largest path metric value is used as the final decoding path, and decoding is performed according to the final decoding path to obtain a decoding result.

[0082] The embodiment of the present disclosure provides a device for calculating the g function in polar code decoding, such as Fig.10 As shown, the device comprises:

[0083] A first determining module 1002 is used to determine a first parameter and a second parameter of a first node in a coding equivalent graph, wherein the first node is a node associated with a g function, the first parameter is used to characterize a layer of the first node in the coding equivalent graph, and the second parameter characterizes a level of the first node in the coding equivalent graph;

[0084] A second determination module 1004 is used to determine a target decoding bit and a target element in a target coding matrix based on the first parameter and the second parameter; wherein the target coding matrix is ​​an X-times Kronecker matrix, where X is the logarithm of a mother code length with a base of 2;

[0085] A third determination module 1006, configured to determine an estimated bit of the first node based on the target element and the target decoding bit;

[0086] The fourth determination module 1008 is configured to determine the LLR value of the first node according to the estimated bit and the log-likelihood ratio LLR value input to the first node.

[0087] Through the device of the embodiment of the present disclosure, the first parameter and the second parameter of the first node associated with the g function in the coding equivalent diagram are first determined; based on the first parameter and the second parameter, the target decoding bit and the target element in the target coding matrix are determined; based on the target element and the target decoding bit, the estimated bit of the first node is determined; according to the estimated bit and the log-likelihood ratio LLR value input to the first node, the LLR value of the first node is determined. That is to say, in the present disclosure, the estimated bit of the node associated with the g function can be directly determined, and in the process of determining the LLR value, there is no need to assume whether the estimated bit in the g function is 0 or 1, which greatly improves the efficiency of determining the LLR value, thereby solving the technical problem of large amount of calculation caused by unknown estimated bits when calculating the g function node in the related art.

[0088] Alternatively, if Fig.11 As shown, the second determination module 1004 of the embodiment of the present disclosure may further include:

[0089] A first determining unit 1102, configured to determine a row and a column based on a first parameter and a second parameter;

[0090] A second determining unit 1104 is used to determine the elements corresponding to the rows and columns in the target coding matrix as target elements;

[0091] The third determining unit 1106 is configured to determine the target decoding bit corresponding to the row from the coding equivalent graph.

[0092] Optionally, in the embodiment of the present disclosure, the first determining unit 1102 may determine the row and column in the following manner:

[0093] The row value is row-2 (col-1) +[0:2 (col-1) -1]; the column value is row-2 (col-1) ; Among them, row is the first parameter and col is the second parameter.

[0094] Alternatively, if Fig.12 As shown, the third determination module 1006 of the embodiment of the present disclosure may further include:

[0095] A product unit 1202, used for multiplying the target element and the target decoding bit with the same value of the row respectively to obtain a product result;

[0096] The first calculation unit 1204 is used to perform a modulo-2 sum operation on the product result to obtain an estimated bit of the first node.

[0097] Alternatively, if Fig.13 As shown, the fourth determination module 1008 of the embodiment of the present disclosure may further include:

[0098] The acquisition unit 1302 is used to acquire the LLR value of the second node and the LLR value of the third node; wherein the LLR value associated with the first node includes the LLR value of the second node and the LLR value of the third node; the layer of the second node in the coding equivalent graph is The level of the second node in the coding equivalent graph is col+1; the level of the third node in the coding equivalent graph is row, and the level of the third node in the coding equivalent graph is col+1; row is the first parameter, and col is the second parameter;

[0099] The second calculation unit 1304 is configured to calculate the LLR value of the first node based on the LLR value of the second node, the LLR value of the third node, and the estimated bit.

[0100] Among them, the LLR value calculation formula of the g function is:

[0101] Where L1 is the LLR value of the second node, L2 is the LLR value of the third node, i is the layer, and y is the LLR value after rate matching. To estimate the bit, L is the LLR value of the first node, and N is the layer of the coding equivalent graph.

[0102] Alternatively, if Fig.14 As shown, the device of the embodiment of the present disclosure is Fig.10 The foundation may also include:

[0103] The fifth determination module 1402 is used to determine the path metric values ​​of M decoding paths of the first node according to the LLR value of the first node after determining the LLR value of the first node according to the estimated bit and the log-likelihood ratio LLR value associated with the first node, where M is the list width or the list depth.

[0104] The present disclosure also provides an electronic device, such as Fig.15 As shown, it includes a processor 1501, a communication interface 1502, a memory 1503 and a communication bus 1504, wherein the processor 1501, the communication interface 1502, and the memory 1503 communicate with each other through the communication bus 1504.

[0105] Memory 1503, used for storing computer programs;

[0106] Processor 1501 is used to execute the program stored in memory 1503 to implement Figure 1 The method steps in Figure 1 The method steps are the same as in, and will not be repeated here.

[0107] The communication bus mentioned in the above terminal can be a Peripheral Component Interconnect (PCI) bus or an Extended Industry Standard Architecture (EISA) bus. The communication bus can be divided into an address bus, a data bus, a control bus, etc. For ease of representation, Fig.15 Only one thick line is used in the diagram, but this does not mean that there is only one bus or only one type of bus.

[0108] The communication interface is used for communication between the above terminal and other devices.

[0109] The memory may include a random access memory (RAM) or a non-volatile memory, such as at least one disk memory. Optionally, the memory may also be at least one storage device located away from the aforementioned processor.

[0110] The above-mentioned processor can be a general-purpose processor, including a central processing unit (CPU), a network processor (NP), etc.; it can also be a digital signal processor (DSP), an application specific integrated circuit (ASIC), a field programmable gate array (FPGA) or other programmable logic devices, discrete gate or transistor logic devices, discrete hardware components.

[0111] In yet another embodiment provided by the present disclosure, a computer-readable storage medium is further provided, wherein instructions are stored in the computer-readable storage medium, and when the instructions are executed on a computer, the computer executes the method for calculating the g function in polar code decoding described in any one of the above embodiments.

[0112] In yet another embodiment provided by the present disclosure, a computer program product including instructions is further provided. When the computer program product is executed on a computer, the computer is enabled to execute the method for calculating the g function in polar code decoding described in any one of the above embodiments.

[0113] In the above embodiments, it can be implemented in whole or in part by software, hardware, firmware or any combination thereof. When implemented by software, it can 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 the computer program instructions are loaded and executed on a computer, the process or function described in the embodiment of the present disclosure is generated in whole or in part. The computer can be a general-purpose computer, a special-purpose computer, a computer network, or other programmable device. The computer instructions can 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 can be transmitted from a website site, computer, server or data center by wired (e.g., coaxial cable, optical fiber, digital subscriber line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.) mode to another website site, computer, server or data center. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that includes one or more available media integrated. The available medium can be a magnetic medium (e.g., a floppy disk, a hard disk, a tape), an optical medium (e.g., a DVD), or a semiconductor medium (e.g., a solid-state hard disk Solid State Disk (SSD)), etc.

[0114] It should be noted that, in this article, relational terms such as first and second, etc. are only used to distinguish one entity or operation from another entity or operation, and do not necessarily require or imply any such actual relationship or order between these entities or operations. Moreover, the terms "include", "comprise" or any other variants thereof are intended to cover non-exclusive inclusion, so that a process, method, article or device including a series of elements includes not only those elements, but also other elements not explicitly listed, or also includes elements inherent to such process, method, article or device. In the absence of further restrictions, the elements defined by the sentence "comprise a ..." do not exclude the existence of other identical elements in the process, method, article or device including the elements.

[0115] Each embodiment in this specification is described in a related manner, and the same or similar parts between the embodiments can be referred to each other, and each embodiment focuses on the differences from other embodiments. In particular, for the system embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the partial description of the method embodiment.

[0116] The above description is only a preferred embodiment of the present disclosure and is not intended to limit the protection scope of the present disclosure. Any modification, equivalent replacement, improvement, etc. made within the spirit and principle of the present disclosure are included in the protection scope of the present disclosure.

Claims

1. A method for calculating a g function in polar code decoding, characterized in that: include: Determine a first parameter and a second parameter of a first node in a coding equivalent graph, wherein the first node is a node associated with a g function, the first parameter is used to characterize a layer of the first node in the coding equivalent graph, and the second parameter characterizes a level of the first node in the coding equivalent graph; Determine a target decoding bit and a target element in a target coding matrix based on the first parameter and the second parameter; wherein the target coding matrix is ​​an X-times Kronecker matrix, where X is the logarithm of a mother code length with a base of 2; determining an estimated bit for the first node based on the target element and the target decoded bit; Determine an LLR value of the first node according to the estimated bit and the log-likelihood ratio LLR value input to the first node; The step of determining target decoding bits and target elements in a target coding matrix based on the first parameter and the second parameter includes: determining a row and a column based on the first parameter and the second parameter; Determine the elements corresponding to the row and the column in the target coding matrix as the target elements; Determining a target decoding bit corresponding to the row from the coding equivalent graph; The determining, based on the target element and the target decoding bit, an estimated bit of the first node comprises: Multiplying the target element and the target decoding bit having the same value as the row respectively to obtain a product result; Performing a modulo-2 sum operation on the product result to obtain an estimated bit of the first node; The determining the LLR value of the first node according to the estimated bit and the log likelihood ratio LLR value input to the first node includes: Obtaining the LLR value of the second node and the LLR value of the third node; wherein the LLR value associated with the first node includes the LLR value of the second node and the LLR value of the third node; the layer of the second node in the coding equivalent graph is The level of the second node in the coding equivalent graph is co1+1; the layer of the third node in the coding equivalent graph is row, and the level of the third node in the coding equivalent graph is co1+1; row is the first parameter, and col is the second parameter; The LLR value of the first node is calculated based on the LLR value of the second node, the LLR value of the third node and the estimated bit.

2. The method according to claim 1, characterized in that The determining of the row and the column based on the first parameter and the second parameter comprises: The row and the column are determined by: The value of the row is row-2 (col-1) +[0:2 (col-1) -1]; The value of the column is row-2 (col-1) ; Among them, row is the first parameter, and co1 is the second parameter.

3. The method according to claim 1, characterized in that The LLR value calculation formula of the g function is: Wherein, L1 is the LLR value of the second node, L2 is the LLR value of the third node, i is the layer, y is the LLR value after rate matching, To estimate the bit, L is the LLR value of the first node, and N is the mother code length.

4. The method according to claim 1, characterized in that: After determining the LLR value of the first node according to the estimated bit and the log likelihood ratio LLR value associated with the first node, the method further includes: According to the LLR value of the first node, path metric values ​​of L decoding paths of the first node are determined, wherein L is a list width or a list depth.

5. A device for calculating the g function in polar code decoding, characterized in that: include: A first determining module is configured to determine a first parameter and a second parameter of a first node in a coding equivalent graph, wherein the first node is a node associated with a g function, the first parameter is used to characterize a layer of the first node in the coding equivalent graph, and the second parameter characterizes a level of the first node in the coding equivalent graph; A second determination module is used to determine a target decoding bit and a target element in a target coding matrix based on the first parameter and the second parameter; wherein the target coding matrix is ​​an X-fold Kronecker matrix, where X is the logarithm of a mother code length with a base of 2; A third determination module, configured to determine an estimated bit of the first node based on the target element and the target decoding bit; a fourth determination module, configured to determine an LLR value of the first node according to the estimated bit and the log likelihood ratio LLR value input to the first node; Wherein, the second determining module includes: A first determining unit, configured to determine a row and a column based on the first parameter and the second parameter; A second determining unit, configured to determine the elements corresponding to the row and the column in the target coding matrix as the target elements; A third determining unit, configured to determine the target decoding bit corresponding to the row from the coding equivalent graph; The third determination module comprises: a product unit, used for respectively multiplying the target element and the target decoding bit having the same value as the row to obtain a product result; A first calculation unit, configured to perform a modulo-2 sum operation on the product result to obtain an estimated bit of the first node; The determining the LLR value of the first node according to the estimated bit and the log likelihood ratio LLR value input to the first node includes: Obtaining the LLR value of the second node and the LLR value of the third node; wherein the LLR value associated with the first node includes the LLR value of the second node and the LLR value of the third node; the layer of the second node in the coding equivalent graph is The level of the second node in the coding equivalent graph is co1+1; the layer of the third node in the coding equivalent graph is row, and the level of the third node in the coding equivalent graph is co1+1; row is the first parameter, and col is the second parameter; The LLR value of the first node is calculated based on the LLR value of the second node, the LLR value of the third node and the estimated bit.

6. An electronic device, characterized in that: It includes a processor, a communication interface, a memory and a communication bus, wherein the processor, the communication interface and the memory communicate with each other through the communication bus; Memory, used to store computer programs; A processor, for implementing any of the methods described in claims 1-4 when executing a program stored in a memory.

7. A computer-readable storage medium having a computer program stored thereon, characterized in that: When the program is executed by a processor, the method according to any one of claims 1 to 4 is implemented.