CN111699643A - Polar code decoding method and device - Google Patents
Polar code decoding method and device Download PDFInfo
- Publication number
- CN111699643A CN111699643A CN201880089124.8A CN201880089124A CN111699643A CN 111699643 A CN111699643 A CN 111699643A CN 201880089124 A CN201880089124 A CN 201880089124A CN 111699643 A CN111699643 A CN 111699643A
- Authority
- CN
- China
- Prior art keywords
- sequence
- polarization code
- code
- decoding
- data structure
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Images
Classifications
-
- H—ELECTRICITY
- H03—ELECTRONIC CIRCUITRY
- H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
- H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
- H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
- H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
- H03M13/13—Linear codes
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L1/00—Arrangements for detecting or preventing errors in the information received
Abstract
A polar code decoding method and device are provided, wherein the method comprises the following steps: determining the value of a sequence parameter of a polarization code, wherein the sequence parameter of the polarization code comprises the length of a coding input bit sequence and the length of a rate matching output sequence; determining the position of an information bit of the polarization code corresponding to the value of the sequence parameter of the polarization code based on a pre-stored data structure; and decoding the polarization code according to the position of the information bit of the polarization code. In the embodiment of the application, the pre-stored data structure can be used for representing the positions of the K information bits of the polarization code corresponding to each value in the multiple values of the sequence parameters of the polarization code, so that the positions of the information bits of the polarization code corresponding to the values of the sequence parameters of the polarization code can be directly determined based on the pre-stored structure, and then readjustment operation is not needed in the decoding process, so that the decoding process can be effectively simplified, and the decoding efficiency can be improved.
Description
The present application relates to the field of communications technologies, and in particular, to a polar code decoding method and apparatus.
The rapid evolution of wireless communication predicts that the fifth generation (5G) communication system will exhibit some new features, and the most typical three communication scenarios include enhanced mobile internet (eMBB), mass machine connectivity communication (mtc), and high reliable low latency communication (URLLC), and the requirements of these communication scenarios will present new challenges to the existing Long Term Evolution (LTE) technology. Channel coding, the most basic radio access technology, is one of the important research objects to meet the requirements of 5G communication.
Polar Codes (Polar Codes) are selected as the control channel coding scheme in the 5G standard. The Polar code, which may also be referred to as Polar code, is the first, also known, only channel coding method that can be strictly proven to "reach" the channel capacity. The performance of polar codes is far superior to Turbo codes and Low Density Parity Check (LDPC) codes at different code lengths, especially for limited codes. In addition, polar codes have low computational complexity in encoding and decoding. These advantages make the polarization code have great development and application prospect in 5G.
At present, how to improve the efficiency of the polar code in decoding needs to be further studied.
Disclosure of Invention
The application provides a polar code decoding method and a polar code decoding device, which are used for solving the technical problems of more complex polar code decoding process and lower efficiency.
In a first aspect, an embodiment of the present application provides a polar code decoding method, where the method includes:
determining the value of a sequence parameter of a polarization code, wherein the sequence parameter of the polarization code comprises the length of a coding input bit sequence and the length of a rate matching output sequence; determining the position of the information bit of the polarization code corresponding to the value of the sequence parameter of the polarization code based on a pre-stored data structure; and decoding the polarization code according to the position of the information bit of the polarization code.
In the embodiment of the application, the pre-stored data structure is used for indicating the positions of K (K is a positive integer) information bits of the polarization code corresponding to each value in the multiple values of the sequence parameters of the polarization code, so that the positions of the information bits of the polarization code corresponding to the values of the sequence parameters of the polarization code can be directly determined based on the pre-stored structure, and then readjustment operation is not needed in the decoding process, so that the coding and decoding process can be effectively simplified, and the coding and decoding efficiency can be improved.
In one possible design, the sequence parameters of the polarization code further include a length of the coded output bit sequence.
In one possible design, the pre-stored data structure is a two-dimensional table.
In this embodiment of the application, the data structure for storage may also be an array, and the like, and is not limited specifically.
In one possible design, the pre-stored data structure includes node types of multiple nodes of the polarization code corresponding to each of multiple values of the sequence parameter of the polarization code, and the node type of any one of the multiple nodes is used to indicate a bit type corresponding to one or more consecutive positions in the encoded output bit sequence.
In this way, since a node may include one or more consecutive bits, the required storage space can be effectively saved by storing node types of a plurality of nodes.
In one possible design, polar code decoding is performed, including: and the node is used as the minimum decoding granularity to decode the polar code, so that the delay gain of parallel decoding can be improved.
In one possible design, polar code decoding is performed, including: and for any node in the plurality of nodes, decoding the node by using a decoding algorithm corresponding to the node type of the node.
By adopting the method, multiple possibilities can be provided for the polarization code acceleration algorithm, for example, a rapid decoding algorithm is provided for a plurality of continuous frozen bits, and if the decoding algorithm needs to be supported in the embodiment of the application, only one node type corresponding to the decoding algorithm needs to be defined, so that the decoding efficiency can be effectively improved.
In a second aspect, an embodiment of the present application provides a polar code encoding method, where the method includes:
determining the value of a sequence parameter of a polarization code, wherein the sequence parameter of the polarization code comprises the length of a coding input bit sequence and the length of a rate matching output sequence; determining the position of the information bit of the polarization code corresponding to the value of the sequence parameter of the polarization code based on a pre-stored data structure; and carrying out polarization code coding according to the position of the information bit of the polarization code.
In the embodiment of the application, the pre-stored data structure is used for representing the positions of the K information bits of the polarization code corresponding to each value in the multiple values of the sequence parameters of the polarization code, so that the positions of the information bits of the polarization code corresponding to the values of the sequence parameters of the polarization code can be directly determined based on the pre-stored structure, and then readjustment operation is not needed in the encoding process, so that the encoding and decoding process can be effectively simplified, and the encoding and decoding efficiency can be improved.
In one possible design, the sequence parameters of the polarization code further include a length of the coded output bit sequence.
In one possible design, the pre-stored data structure is a two-dimensional table.
In one possible design, the pre-stored data structure includes node types of multiple nodes of the polarization code corresponding to each of multiple values of the sequence parameter of the polarization code, and the node type of any one of the multiple nodes is used to indicate a bit type corresponding to one or more consecutive positions in the encoded output bit sequence.
In a third aspect, an embodiment of the present application provides a polar code decoding apparatus, where the apparatus includes:
the processing unit is used for determining the value of a sequence parameter of a polarization code, wherein the sequence parameter of the polarization code comprises the length of a coding input bit sequence and the length of a rate matching output sequence; determining the position of the information bit of the polarization code corresponding to the value of the sequence parameter of the polarization code based on the data structure stored in the storage unit; and decoding the polarization code according to the position of the information bit of the polarization code;
and the storage unit is used for storing a data structure, and the data structure is used for indicating the positions of K information bits of the polarization code corresponding to each value in multiple values of the sequence parameters of the polarization code.
In one possible design, the sequence parameters of the polarization code further include a length of the coded output bit sequence.
In one possible design, the pre-stored data structure is a two-dimensional table.
In one possible design, the pre-stored data structure includes node types of multiple nodes of the polarization code corresponding to each of multiple values of the sequence parameter of the polarization code, and the node type of any one of the multiple nodes is used to indicate a bit type corresponding to one or more consecutive positions in the encoded output bit sequence.
In a fourth aspect, an embodiment of the present application provides a polar code encoding apparatus, where the apparatus includes:
the processing unit is used for determining the value of a sequence parameter of a polarization code, wherein the sequence parameter of the polarization code comprises the length of a coding input bit sequence and the length of a rate matching output sequence; determining the position of the information bit of the polarization code corresponding to the value of the sequence parameter of the polarization code based on the data structure stored in the storage unit; and carrying out polarization code coding according to the position of the information bit of the polarization code;
and the storage unit is used for storing a data structure, and the data structure is used for indicating the positions of K information bits of the polarization code corresponding to each value in multiple values of the sequence parameters of the polarization code.
In one possible design, the sequence parameters of the polarization code further include a length of the coded output bit sequence.
In one possible design, the pre-stored data structure is a two-dimensional table.
In one possible design, the pre-stored data structure includes node types of multiple nodes of the polarization code corresponding to each of multiple values of the sequence parameter of the polarization code, and the node type of any node in the multiple nodes is used to indicate a bit type corresponding to one or more consecutive positions in the encoded output bit sequence.
In a fifth aspect, an embodiment of the present application provides a polar code decoding apparatus, including a processor and a memory; the data structure is used for representing the positions of K information bits of the polarization code corresponding to each value in multiple values of sequence parameters of the polarization code; a processor for executing the program stored by the memory, which when executed, causes the polar code decoding apparatus to perform the method of the first aspect and any of its possible designs. In one possible design, the polar code decoding means is a chip or an integrated circuit.
In a sixth aspect, an embodiment of the present application provides a polar code encoding apparatus, including a processor and a memory; the data structure is used for representing the positions of K information bits of the polarization code corresponding to each value in multiple values of sequence parameters of the polarization code; a processor for executing the program stored in the memory, which when executed, causes the polar code decoding apparatus to perform the method of the second aspect and any of its possible designs. In one possible design, the polarization code encoding device is a chip or an integrated circuit.
In a seventh aspect, an embodiment of the present application provides a polar code decoding apparatus, including: an input interface circuit for obtaining a coded output sequence; a logic circuit for performing the method of the first aspect and any possible design thereof based on the obtained encoded output sequence to obtain a decoding result; and the output interface circuit is used for outputting the decoding result.
In an eighth aspect, an embodiment of the present application provides a polar code encoding apparatus, including: an input interface circuit for obtaining a coded output sequence; logic circuitry for performing the method of the second aspect and any possible design thereof based on the obtained encoded output sequence to obtain a decoding result; and the output interface circuit is used for outputting the decoding result.
In a ninth aspect, embodiments of the present application provide a computer storage medium for storing a computer program comprising instructions for performing the method of the first or second aspect and any possible design thereof.
In a tenth aspect, embodiments of the present application provide a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method as set forth in the first or second aspect and any possible design thereof.
Fig. 1 is a schematic diagram of a communication system suitable for use in embodiments of the present application;
FIG. 2a is a schematic diagram of a decoding process of a polar code;
FIG. 2b is a schematic diagram of an encoding matrix;
FIG. 3a is an exemplary diagram of an encoding process;
FIG. 3b is an exemplary diagram of a decoding process;
FIG. 3c is a diagram of yet another example of an encoding process;
FIG. 3d is a diagram of another exemplary decoding process;
fig. 4 is a flowchart illustrating a polar code decoding method according to an embodiment of the present disclosure;
fig. 5 is another schematic diagram of a decoding process of a polar code according to an embodiment of the present application;
fig. 6 is a schematic diagram of a polar code encoding process according to an embodiment of the present application;
fig. 7 is a schematic structural diagram of a decoding apparatus according to an embodiment of the present application;
FIG. 8 is a block diagram of another decoding apparatus according to an embodiment of the present application;
FIG. 9 is a schematic structural diagram of another decoding apparatus according to an embodiment of the present application;
fig. 10 is a schematic structural diagram of another decoding device according to an embodiment of the present application.
Embodiments of the present application will be described in further detail below with reference to the accompanying drawings. The method and the device are based on the same inventive concept, and because the principles of solving the problems of the method and the equipment are similar, the implementation of the device and the method can be mutually referred, and repeated parts are not repeated.
Fig. 1 shows a schematic diagram of a communication system. As shown in fig. 1, a communication system 100 applied in the embodiment of the present application includes a transmitting end 101 and a receiving end 102. The transmitting end 101 may also be referred to as an encoding end, and the receiving end 102 may also be referred to as a decoding end. The sending end 101 may be a network device, and the receiving end 102 is a terminal device; or, the sending end 101 is a terminal device, and the receiving end 102 is a network device.
The network device may be any device with wireless transceiving function, including but not limited to: a base station (e.g., a base station NodeB, an evolved base station eNodeB, a base station in the fifth generation (5G) communication system, a base station or network device in a future communication system, an access node in a WiFi system, a wireless relay node, a wireless backhaul node), etc. The network device may also be a wireless controller in a Cloud Radio Access Network (CRAN) scenario. The network device may also be a network device in a 5G network or a network device in a future evolution network; but also wearable devices or vehicle-mounted devices, etc. The network device may also be a small station, a Transmission Reference Point (TRP), or the like. Although not expressly stated herein.
The terminal equipment is equipment with a wireless transceiving function, can be deployed on land and comprises an indoor or outdoor, a handheld, a wearable or a vehicle-mounted terminal; 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.). 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 in industrial control (industrial control), a wireless terminal in self driving (self driving), a wireless terminal in remote medical (remote medical), a wireless terminal in smart grid (smart grid), a wireless terminal in transportation safety (transportation safety), a wireless terminal in smart city (smart city), a wireless terminal in smart home (smart home), and the like. The embodiments of the present application do not limit the application scenarios. A terminal device may also be sometimes referred to as a User Equipment (UE), an access terminal device, a UE unit, a UE station, a mobile station, a remote terminal device, a mobile device, a UE terminal device, a wireless communication device, a UE agent, or a UE apparatus, etc.
Taking the 5G New Radio (NR) communication system as an example, the adopted polar code encoding and decoding process is shown in fig. 2a, and includes: step 201, the transmitting end obtains a bit sequence input for coding, i.e. an information bit sequence to be coded. Step 202, the transmitting end performs check coding to obtain a check coding codeword. Step 203, the sending end performs a distributed cyclic redundancy check (D-CRC) interleaving operation on the check-coded codeword. Step 204, the sending end performs polarization code encoding on the check encoding code word after the interleaving operation to obtain an encoded output bit sequence (a bit sequence output for encoding). In step 205, the sending end performs rate matching on a rate matching input sequence (i.e., the coded output bit sequence obtained in step 204) to obtain a rate matching output sequence (a rate matching output sequence). In step 206, the receiving end performs rate de-matching on the received data to be decoded to obtain a bit sequence to be decoded (i.e. a rate-matched input sequence or a coded output bit sequence). And step 207, the receiving end performs polarization code decoding on the bit sequence to be decoded. And step 208, the receiving end performs deinterleaving operation on the decoded sequence. In step 209, the receiving end determines whether the decoding result is decoded successfully by CRC check.
Further, as shown in FIG. 2b, there is shown an encoding matrix of 8 × 8, in which the vector U is (0, 0, 0, U)4，0，U6，U7，U8) Representing, after encoding the matrix, the encoded bits as a vector (X)1，X2，X3，X4，X5，X6， X7，X8) And (4) showing. As can be seen from FIG. 2b, during the coding process of Polar code, a part of the bits in u is used to carry information, called information bit set (information bits), and the set of indexes of these bits is denoted as information bits set (information bits)
The other part of the bits are set as fixed values predetermined by the receiving end and the transmitting end, which are called fixed bit sets or frozen bit sets (frozen bits), and the index sets are used
Complement of
And (4) showing. Polar code construction process or set
The selection process of (2) determines the performance of Polar codes. The construction process of Polar code is generally: determining that N polarized channels coexist according to the length (N) of the coded output bit sequence, respectively corresponding to N rows of a coding matrix, calculating the reliability of the polarized channels, and taking the indexes of the first K polarized channels with higher reliability as a set
Of (a) and the remaining (N-K) elementsUsing the corresponding index of the polarized channel as the index set of the fixed bit
Wherein, the set
Determining the position, set, of information bits
The position of the fixed bit is determined.
For the above construction process, one possible implementation is: constructing a code pattern sequence table according to the length (K) of the coding input bit sequence and the length (N) of the coding output bit sequence, wherein the code pattern sequence table is used for representing the reliability of N polarization channels; wherein, the code type sequence table has the following characteristics: the method meets the simple nesting characteristic, namely after the code type sequence table of the maximum mother code length is determined, the code type sequence table of other shorter mother codes can be obtained according to the code type sequence table of the maximum mother code length. In a specific implementation process, a sending end may first determine the length of a coded input bit sequence and the length of a coded output bit sequence, then query a code pattern sequence table, determine K polarization channels with higher reliability (i.e., the positions of K information bits), further map the K information bits to the K polarization channels with higher reliability, and fill frozen bits to other N-K polarization channels to complete coding, as shown in fig. 3 a; correspondingly, the decoding process can be regarded as the inverse process of the encoding process, and the receiving end can first determine the length of the encoded input bit sequence (i.e. the information bit sequence) and the length of the encoded output bit sequence, then query the code pattern sequence table to determine the positions of K information bits, and further extract the information bits from the encoded output bit sequence to complete decoding, as shown in fig. 3 b.
It should be noted that, from the receiving end, for example, the encoding output bit sequence is a bit sequence to be decoded or is called a decoding input bit sequence, and for example, the encoding input bit sequence is an information bit sequence or is called a decoding output bit sequence. It is understood that the names are not limited in the embodiments of the present application.
However, since the 5G NR adopts a rate matching scheme that merges schemes of multiple communication manufacturers while adopting a Polar code pattern sequence table, the encoding flow is as shown in fig. 3c, and it can be seen from the flow illustrated in fig. 3c that: in the encoding process, after the transmitting end queries the code pattern sequence table, the mapping relationship between the information bits and the polarization channel (i.e. the positions of the information bits) needs to be readjusted online in combination with the length (E) of the rate matching output bit sequence, thereby completing encoding. Correspondingly, as shown in fig. 3d, in the decoding process (the reverse process of the encoding process), after the receiving end queries the code pattern sequence table, the mapping relationship between the information bits and the polarization channel needs to be readjusted, so as to complete the decoding. According to the above, in the encoding process and the decoding process, after the code pattern sequence table is queried, the readjustment needs to be performed on line, and the efficiency is low.
Further, in the 5G communication system, the network device and the terminal device have instruction interaction in addition to data interaction, and the network device completes scheduling of the terminal device through the instruction and transmits format information of the scheduling. In order to reduce the overhead of instruction interaction, the network device usually does not send or only sends some scheduling signaling, and the terminal device monitors whether scheduling exists according to a certain rule. In the monitoring process, the terminal device needs to perform blind detection decoding without knowing the exact format. Because blind detection decoding has various possibilities, the decoding process needs to be executed for many times, and each decoding needs to complete table look-up action and readjustment action, so that the computation amount and the computation delay are large.
Based on this, the embodiment of the present application provides a polar code decoding method, which is used for solving the technical problems of a complicated decoding process and low efficiency.
Fig. 4 is a flowchart illustrating a decoding method according to an embodiment of the present application, and as shown in fig. 4, the decoding method includes:
and 403, decoding the polarization code according to the position of the information bit of the polarization code.
In the embodiment of the application, the pre-stored data structure can be used for representing the positions of the K information bits of the polarization code corresponding to each value in the multiple values of the sequence parameters of the polarization code, so that the positions of the information bits of the polarization code corresponding to the values of the sequence parameters of the polarization code can be directly determined based on the pre-stored structure, and then readjustment operation is not needed in the decoding process, so that the decoding process can be effectively simplified, and the decoding efficiency can be improved.
The polar code decoding method provided by the embodiment of the present application may be executed by a receiving end, and specifically, may be executed by a network device or may also be executed by a terminal device. The method can be applied to various wireless communication scenarios, such as a blind detection scenario, in which the decoding method can be executed by a terminal device.
The following description will be given by taking the above decoding method as an example applied to a blind detection scenario.
In a blind detection scene, when a receiving end executes a blind detection decoding process, firstly, values of sequence parameters of all possible polarization codes are listed, decoding is carried out on each possible value, the decoding result judges the correct error through verification, and the process is continued until a correct decoding result is searched, or all possible values are traversed or a certain preset condition is reached. For example, the parameter of the polarization code sequence has m +1 possible values, specifically: (K0, E0), (K1, E1), (K2, E2), … …, (Km, Em), then the receiving end can decode according to m +1 possible values.
In view of that for each possible value of the sequence parameter of the polar code, the positions of the K information bits of the polar code corresponding to the possible value are static information, so in the embodiment of the present application, the positions of the K information bits of the polar code corresponding to each group of possible values can be obtained through offline calculation, and the static information is stored through a data structure. It should be noted that the data structure in the embodiment of the present application may refer to a manner used for storing static information and the static information.
Further, the manner used for storing the static information may be various, such as a two-dimensional table (bivariate table), an array (array), a stack (stack), a queue (queue), a linked list (linked list), a graph (graph), or a hash table (hash), and the like, which is not limited specifically.
It should be noted that, in this embodiment of the application, the data structure is used to indicate positions of K information bits of the polarization code corresponding to each of multiple values of the sequence parameter of the polarization code, and in an example, the positions may be: the data structure is used to indicate positions of K information bits of the polarization code corresponding to each of various possible values (for example, m +1 types) of the sequence parameter of the polarization code, and this embodiment of the present application is mainly described by taking this case as an example.
Several possible examples of data structures are described below in connection with tabular illustration.
In a possible implementation manner, the positions of K information bits of the polarization code corresponding to each of the multiple values of the sequence parameter of the polarization code may be indicated by a bit type corresponding to each position in the encoded output bit sequence, where the bit type corresponding to any position is used to indicate that the bit at the position is an information bit or a frozen bit.
In this implementation, as shown in table 1, it is an example of a pre-stored data structure.
Table 1: data Structure example 1
With the above data structure, each value of the sequence parameter of the polarization code corresponds to one or more lines of data in table 1. In specific implementation, the value of the sequence parameter may be used as an index to read the bit type corresponding to each position in the encoded output bit sequence in one or more corresponding rows, and then the positions of the K information bits may be determined according to the bit type corresponding to each position.
In this implementation, as shown in table 2, it is yet another example of a pre-stored data structure.
Table 2: data Structure example 2
With the above data structure, the number of rows in table 2 corresponding to each value of the sequence parameter of the polarization code may be uncertain. In specific implementation, the identifier of a specific value of a sequence parameter of a polarization code may be searched in table 2, and then the bit type corresponding to each position in the encoded output bit sequence may be read from one or more rows corresponding to the identifier of the specific value, and the positions of K information bits may be determined according to the bit type corresponding to each position.
For example, if the sequence parameter of the polarization code takes the value of (K0, E0), the identifier of (K0, E0) may be searched in table 2, and then the two rows of data corresponding to (K0, E0) are queried to obtain the bit types corresponding to the 1 st position to the N0 th position in the encoded output bit sequence, and then the positions of K information bits are determined according to the bit types corresponding to the 1 st position to the N0 th position.
It should be noted that: the identifier of the value of the sequence parameter of the polarization code is information that can uniquely identify the value, and for example, the identifier may be a serial number of the value of the sequence parameter of the polarization code or may be directly the value, and is not limited specifically. The bit type (information bit or freeze bit) corresponding to each position may be represented by "0" or "1", where "0" represents a freeze bit and "1" represents an information bit, or "0" represents an information bit and "1" represents a freeze bit; in other possible implementations, other representations are possible, and are not particularly limited.
In yet another possible implementation manner, the positions of the K information bits of the polarization code corresponding to each of the multiple values of the sequence parameter of the polarization code may be indicated by node types of multiple nodes of the polarization code, where the node type of any one of the multiple nodes is used to indicate a bit type corresponding to one or more consecutive positions in the encoded output bit sequence. In this embodiment, any node may include one or more consecutive bits in the encoded output bit sequence, and therefore, it can also be said that the type of any node is used to indicate the bit type of the one or more consecutive bits included in the node.
In the embodiment of the present application, multiple node types may be predefined, for example, as shown in table 3, which is an example of multiple possible node types.
Table 3: multiple possible node types
The GoodBit described in table 3 specifically refers to a high-reliability bit, and when the high-reliability bit is decoded, the high-reliability bit can be directly decoded according to a hard decision result, so that the computation amount is saved.
In this implementation, as shown in table 4, it is an example of a pre-stored data structure.
Table 4: data Structure example 3
With the above data structure, each value of the sequence parameter of the polarization code corresponds to one or more lines of data in table 1. In specific implementation, the values of the sequence parameters can be used as indexes to read the node types of each node from one or more corresponding lines, and then the positions of the K information bits can be determined according to the node types of each node.
In this implementation, as shown in table 5, it is yet another example of a pre-stored data structure.
Table 5: data Structure example 4
With the above data structure, the number of rows in table 2 corresponding to each value of the sequence parameter of the polarization code may be uncertain. In specific implementation, the identifier of the specific value of the sequence parameter of the polar code may be searched in table 2, and then the node type of each node is read in one or more rows corresponding to the identifier of the specific value, and the positions of the K information bits may be determined according to the node type of each node.
It should be noted that the node type of each node in table 4 and table 5 can be represented by the node type number illustrated in table 3; for example, when the value of the polarization code sequence parameter is (K0, E0), each node includes 8 consecutive bits to be decoded, and if the node type of the node 1 is Rate _8, the corresponding square cell in table 3 may be filled with the number of Rate _8 or other information for identifying the node type as Rate _8, which is not limited specifically.
Thus, in the manner illustrated in table 3, since the node type may indicate one or more bit types corresponding to consecutive positions, the required storage space can be effectively saved by storing the node types of multiple nodes.
In this implementation, as shown in table 6, it is yet another example of a pre-stored data structure.
Table 6: data Structure example 5
For example, when the value of the polarization code sequence parameter is (K0, E0), each node includes 8 consecutive bits to be decoded, and if the node type of the node 1 is goodbiatall _8, the node types of the node 2, the node 3, and the node 4 are also goodbiatall _8, that is, the node type of goodbiatall _8 appears 3 times after the node 1, so that the number of times (i.e., 3) that the node type of goodbiatall _8 appears after the node 1 continuously can be filled in a square cell after the node type of the node 1 in table 6; if the node type of the node 5 is Rate _8, the number of the Rate _8 may be filled in the corresponding square box (the node type of the node a 1) in table 4, and the node types of the node 6 and the node 7 are both Rate _8, and then the number of times (i.e. 2) that the node type of the Rate _8 continuously appears after the node 5 may be filled in the following square box; and so on until the last node. Thus, by adopting the method in table 4, the node types of each node do not need to be listed one by one, so that the storage space can be further saved.
In table 6, the node type of each node may occupy 6 bits, and the number of consecutive occurrences of the node type may occupy 2 bits, in one example.
In the embodiment of the application, the node is introduced, and the bit type of one or more continuous bits included in the node is characterized by the node type, so that when decoding is performed, the node can be used as the minimum decoding granularity, so as to improve the delay gain of parallel decoding. Furthermore, a decoding algorithm corresponding to each node type can be predefined, so that when decoding is performed, the decoding algorithm corresponding to the node type of the node is directly used for decoding the node. By adopting the method, multiple possibilities can be provided for the polarization code acceleration algorithm, for example, a rapid decoding algorithm is provided for a plurality of continuous frozen bits, and if the decoding algorithm needs to be supported in the embodiment of the application, only one node type corresponding to the decoding algorithm needs to be defined, so that the decoding efficiency can be effectively improved.
In yet another possible scenario, the data structure includes positions of K information bits of the polarization code corresponding to each of the multiple values of the sequence parameter of the polarization code. As shown in table 7, yet another example of a data structure.
Table 7: data Structure example 6
As can be seen from table 7, the positions of the K information bits of the polarization code corresponding to the value (K0, E0) are the x1 th position, the x2 th position, the x3 th position, the x4 th position, the x 5th position, the x6 th position, the … … th position, and the xK0 th position, and all the positions except these positions are the positions of the frozen bits. In this way, only the positions of the information bits are listed, so that the storage space can be effectively saved, and the positions of the information bits can be determined more quickly based on the data structure.
In this embodiment of the present application, the sequence parameter of the polarization code may further include a length of the coded output bit sequence, where the length of the coded output bit sequence may be obtained by calculating a length of the coded input bit sequence and a length of the rate matching output sequence, and a specific calculation manner may refer to the prior art and is not described herein again.
In this case, the parameters of the above-described polarization code sequence (K0, E0), (K1, E1), (K2, E2), … …, (Km, Em) may be represented by (K0, N0, E0), (K1, N1, E1), (K2, N2, E2), … …, (Km, Nm, Em). Accordingly, the parameters of the polarization code sequence in the various examples of the data structure can be replaced, which is also shown in table 8 below by taking the above table 2 as an example, and other various examples can be referred to, and are not specifically listed here.
Table 8: data Structure example 7
By combining the above description, it can be seen from fig. 5 that, when decoding is performed in the embodiment of the present application, according to the value of the sequence parameter of the polarization code, a pre-stored data structure can be queried, the position of the information bit is determined, and then decoding is completed; by adopting the mode, the code type sequence table does not need to be stored, and the readjustment operation can be avoided on line, so that the operation power consumption can be saved, and the decoding delay can be reduced.
Fig. 6 is a flowchart illustrating a corresponding encoding method according to an embodiment of the present application, and as shown in fig. 6, the encoding method includes:
In the embodiment of the application, the pre-stored data structure can be used for representing the positions of the K information bits of the polarization code corresponding to each value in the multiple values of the sequence parameters of the polarization code, so that the positions of the information bits of the polarization code corresponding to the values of the sequence parameters of the polarization code can be directly determined based on the pre-stored structure, and then readjustment operation is not needed in the encoding process, so that the encoding process can be effectively simplified, and the encoding efficiency can be improved.
Here, the data structure involved in the encoding method illustrated in fig. 6 may refer to the description of the data structure involved in the decoding method illustrated in fig. 4, and is not repeated here.
It should be noted that the encoding method illustrated in fig. 6 and the decoding method illustrated in fig. 4 may be used in combination, for example, the transmitting end transmits information after encoding by using the encoding method illustrated in fig. 6, and the receiving end may decode information after receiving the information by using the decoding method illustrated in fig. 4. Or, the two may be used separately, for example, the transmitting end transmits information after encoding by using the encoding method illustrated in fig. 6, and the receiving end may decode by using the existing decoding method after receiving the information; for another example, the transmitting end transmits information after encoding by using the existing encoding method, and the receiving end may decode the information by using the decoding method illustrated in fig. 4 after receiving the information.
It is to be understood that each device in the above embodiments may include a corresponding hardware structure and/or software module for performing each function in order to realize the corresponding function. Those of skill in the art will readily appreciate that the present invention can be implemented in hardware or a combination of hardware and computer software, with the exemplary elements and algorithm steps described in connection with the embodiments disclosed herein. Whether a function is performed as hardware or computer software drives hardware depends upon the particular application and design constraints imposed on the solution. Skilled artisans may implement the described functionality in varying ways for each particular application, but such implementation decisions should not be interpreted as causing a departure from the scope of the present invention.
In case of an integrated unit, fig. 7 shows a possible exemplary block diagram of a polar code decoding apparatus according to an embodiment of the present invention, which apparatus 700 may be in the form of software. The apparatus 700 may include: a memory unit 701 and a processing unit 702. The storage unit 701 is configured to store a program code and a data structure of the apparatus 700, where the data structure is configured to indicate positions of K information bits of the polarization code corresponding to each of multiple values of the sequence parameter of the polarization code.
The storage unit 701 may be a memory. The processing unit 702 may be a processor or a controller, such as a general-purpose Central Processing Unit (CPU), a general-purpose processor, a Digital Signal Processing (DSP), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA) or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or perform the various illustrative logical blocks, modules, and circuits described in connection with the disclosure. The processor may also be a combination of computing functions, e.g., comprising one or more microprocessors, DSPs, and microprocessors, among others.
The apparatus 700 may be a receiving device (e.g., a terminal device) referred to in this application, or may also be a chip in the receiving device. The processing unit 702 may enable the apparatus 700 to perform the actions in the method example illustrated in fig. 4 above, for example, the processing unit 702 is configured to enable the apparatus 700 to perform steps 401 to 403 in fig. 4.
In a possible implementation, the sequence parameter of the polarization code further includes a length of the coded output bit sequence.
In one possible implementation, the pre-stored data structure is a two-dimensional table.
In a possible implementation manner, the pre-stored data structure includes node types of multiple nodes of the polarization code corresponding to each of multiple values of the sequence parameter of the polarization code, where the node type of any node in the multiple nodes is used to indicate a bit type corresponding to one or more consecutive positions in the encoded output bit sequence.
As shown in fig. 8, an embodiment of the present application further provides a polar code decoding apparatus 800, where the polar code decoding apparatus 800 is configured to execute the method shown in fig. 4. Part or all of the method shown in fig. 4 may be implemented by hardware or may be implemented by software, and when implemented by hardware, the polar code decoding apparatus 800 includes: an input interface circuit 801 for obtaining a coded output bit sequence; the logic circuit 802 is configured to execute the method shown in fig. 4 based on the obtained encoded output bit sequence, for specific reference, the description in the foregoing method embodiment is referred to, and details are not repeated here; and an output interface circuit 803 for outputting the decoding result.
Alternatively, the polar code decoding apparatus 800 may be a chip or an integrated circuit when implemented.
Alternatively, when part or all of the polar code decoding method of the above embodiment is implemented by software, as shown in fig. 9, the polar code decoding apparatus 800 includes: a memory 901, configured to store a program and a data structure, where the data structure is configured to indicate positions of K information bits of a polar code corresponding to each of multiple values of a sequence parameter of the polar code; a processor 902 for executing the program stored in the memory 901, when the program is executed, the polar code decoding apparatus 800 can implement the method provided in fig. 4.
Alternatively, the memory 901 may be a physically separate unit, or as shown in fig. 10, the memory 901 may be integrated with the processor 902.
It should be noted that, in the embodiment of the present application, the data structure may be stored in the memory of the polar code decoding apparatus before the polar code decoding apparatus leaves the factory, or may also be stored in the memory of the polar code decoding apparatus in an offline manner after the polar code decoding apparatus leaves the factory and before the decoding process is executed, and the time for storing the data structure is not specifically limited in the embodiment of the present application. Further, there may be various specific ways of storing the data structure, for example, the data structure may be stored in the memory by a fixed manner, or stored in the memory by a software program, which is not limited in particular.
Alternatively, when part or all of the above method shown in fig. 4 is implemented by software, the polar code decoding apparatus 800 may only include the processor 902, and the memory 901 for storing programs and data structures is located outside the polar code decoding apparatus 800, and the processor 902 is connected to the memory 901 through a circuit/electric wire and is used for reading and executing the programs stored in the memory 901.
In one example, the processor 902 may include a Central Processing Unit (CPU), and at this time, the above steps 401 to 403 may be performed by the CPU. In yet another example, the processor 902 may include a polar code decoding accelerator, and in this case, the above steps 401 to 403 may be performed by the polar code decoding accelerator, and further, the processor 902 may further include a CPU, and in a blind detection scenario, the CPU may control the blind detection process as a whole, and the polar code decoding accelerator decodes each value of the sequence parameter of the polar code.
The processor 902 may further include a hardware chip. The hardware chip may be an application-specific integrated circuit (ASIC), a Programmable Logic Device (PLD), or a combination thereof. The PLD may be a Complex Programmable Logic Device (CPLD), a field-programmable gate array (FPGA), a General Array Logic (GAL), or any combination thereof.
An embodiment of the present application further provides a computer storage medium storing a computer program, where the computer program includes instructions for executing the method shown in fig. 4.
Embodiments of the present application also provide a computer program product containing instructions which, when executed on a computer, cause the computer to perform the method shown in fig. 4.
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 can be accessed by a computer or a data storage device, such as a server, a data center, etc., that incorporates one or more of the 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.
The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.
Claims (11)
- A method for decoding a polar code, the method comprising:determining the value of a sequence parameter of a polarization code, wherein the sequence parameter of the polarization code comprises the length of a coding input bit sequence and the length of a rate matching output sequence;determining the position of the information bit of the polarization code corresponding to the value of the sequence parameter of the polarization code based on a pre-stored data structure;decoding the polarization code according to the position of the information bit of the polarization code;the pre-stored data structure is used for representing the positions of K information bits of the polarization code corresponding to each value in multiple values of the sequence parameters of the polarization code, and K is a positive integer.
- The method of claim 1, wherein:the sequence parameters of the polar code further comprise the length of the coded output bit sequence.
- The method of claim 1, wherein:the pre-stored data structure is a two-dimensional table.
- The method according to any one of claims 1 to 3, wherein the pre-stored data structure comprises node types of a plurality of nodes of the polarization code corresponding to each of a plurality of values of the sequence parameter of the polarization code, and the node type of any one of the plurality of nodes is used for indicating a bit type corresponding to one or more consecutive positions in the encoded output bit sequence.
- An apparatus for decoding a polar code, the apparatus comprising:the processing unit is used for determining the value of a sequence parameter of a polarization code, wherein the sequence parameter of the polarization code comprises the length of a coding input bit sequence and the length of a rate matching output sequence; determining the position of the information bit of the polarization code corresponding to the value of the sequence parameter of the polarization code based on the data structure stored in the storage unit; and decoding the polarization code according to the position of the information bit of the polarization code;and the storage unit is used for storing a data structure, the data structure is used for representing the positions of K information bits of the polarization code corresponding to each value in multiple values of the sequence parameters of the polarization code, and K is a positive integer.
- The polar-code decoding apparatus according to claim 5, wherein:the sequence parameters of the polar code further comprise the length of the coded output bit sequence.
- The polar-code decoding apparatus according to claim 5, wherein:the pre-stored data structure is a two-dimensional table.
- The polar code decoding apparatus according to any one of claims 5 to 7, wherein the pre-stored data structure includes node types of a plurality of nodes of the polar code corresponding to each of a plurality of values of the sequence parameter of the polar code, and the node type of any one of the plurality of nodes is used to indicate a bit type corresponding to one or more consecutive positions in the encoded output bit sequence.
- A polar code decoding apparatus, comprising a processor and a memory;the data structure is used for representing the positions of K information bits of the polarization code corresponding to each value in multiple values of sequence parameters of the polarization code, and K is a positive integer;a processor for executing the program stored in the memory, which when executed, causes the polar code decoding apparatus to perform the method of any one of claims 1-4.
- The apparatus of claim 9, wherein the polar code decoding means is a chip or an integrated circuit.
- A polar code decoding apparatus, comprising:an input interface circuit for obtaining a coded output sequence;logic circuitry for performing the method of any one of claims 1 to 4 based on the obtained encoded output sequence to obtain a decoding result;and the output interface circuit is used for outputting the decoding result.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2018/093928 WO2020000490A1 (en) | 2018-06-30 | 2018-06-30 | Method and device for decoding polar code |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111699643A true CN111699643A (en) | 2020-09-22 |
| CN111699643B CN111699643B (en) | 2021-11-09 |
Family
ID=68984610
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201880089124.8A Active CN111699643B (en) | 2018-06-30 | 2018-06-30 | Polar code decoding method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN111699643B (en) |
| WO (1) | WO2020000490A1 (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113381770B (en) * | 2021-06-10 | 2022-11-04 | Oppo广东移动通信有限公司 | Interleaving method, interleaver, and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016082142A1 (en) * | 2014-11-27 | 2016-06-02 | 华为技术有限公司 | Rate matching method and apparatus for polar code, and wireless communication device |
| CN106899379A (en) * | 2015-12-18 | 2017-06-27 | 华为技术有限公司 | Method and communication equipment for processing polarization code |
| CN107342773A (en) * | 2016-10-25 | 2017-11-10 | 华为技术有限公司 | Coding, interpretation method and equipment |
| CN107425857A (en) * | 2017-06-19 | 2017-12-01 | 华为技术有限公司 | One kind polarization code coding/decoding method and device |
| WO2018101805A1 (en) * | 2016-12-02 | 2018-06-07 | 엘지전자 주식회사 | Method for performing decoding by terminal and terminal for performing same method |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102122966B (en) * | 2011-04-15 | 2012-11-14 | 北京邮电大学 | Channel-polarization-based encoder for staggered structure duplication code, and encoding and decoding methods thereof |
| WO2018112983A1 (en) * | 2016-12-24 | 2018-06-28 | Huawei Technologies Co., Ltd. | Blind detection of code rates for codes with incremental shortening |
-
2018
- 2018-06-30 WO PCT/CN2018/093928 patent/WO2020000490A1/en active Application Filing
- 2018-06-30 CN CN201880089124.8A patent/CN111699643B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2016082142A1 (en) * | 2014-11-27 | 2016-06-02 | 华为技术有限公司 | Rate matching method and apparatus for polar code, and wireless communication device |
| EP3217662A1 (en) * | 2014-11-27 | 2017-09-13 | Huawei Technologies Co., Ltd. | Rate matching method and apparatus for polar code, and wireless communication device |
| CN106899379A (en) * | 2015-12-18 | 2017-06-27 | 华为技术有限公司 | Method and communication equipment for processing polarization code |
| CN107342773A (en) * | 2016-10-25 | 2017-11-10 | 华为技术有限公司 | Coding, interpretation method and equipment |
| WO2018101805A1 (en) * | 2016-12-02 | 2018-06-07 | 엘지전자 주식회사 | Method for performing decoding by terminal and terminal for performing same method |
| CN107425857A (en) * | 2017-06-19 | 2017-12-01 | 华为技术有限公司 | One kind polarization code coding/decoding method and device |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2020000490A1 (en) | 2020-01-02 |
| CN111699643B (en) | 2021-11-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN114884610B (en) | Method, apparatus and device for polarization encoding | |
| CN108574561B (en) | Method and device for coding polarization code | |
| CN108282259B (en) | Coding method and device | |
| TWI794260B (en) | Method, device and equipment for determining transmission block size | |
| WO2018171401A1 (en) | Information processing method, apparatus and device | |
| KR102221430B1 (en) | Polar encoding and decoding method, transmitting device, and receiving device | |
| CN111446969B (en) | Polarization code encoding method and device of cascade CRC (cyclic redundancy check) code | |
| WO2021103978A1 (en) | Polar code encoding method, and device | |
| US20210075485A1 (en) | Channel state information encoding method and apparatus, storage medium and processor | |
| KR20200093627A (en) | Encoding of systematic punctured polar codes associated with internal code | |
| CN111699643B (en) | Polar code decoding method and device | |
| CN112425078B (en) | Polarization code decoding method, device, chip, storage medium and program product | |
| CN111490798B (en) | Decoding method and decoding device | |
| CN111447042B (en) | Polarization coding and decoding method and device | |
| WO2019029748A1 (en) | Polar code encoding method and device | |
| CN111713023B (en) | Polar code decoding method and decoding device | |
| WO2018171764A1 (en) | Polar code sequence construction method and device | |
| US11171673B2 (en) | Decoding method and apparatus | |
| US11362677B2 (en) | Channel encoding method and encoding apparatus | |
| WO2023226689A1 (en) | Encoding method and apparatus, and decoding method and apparatus | |
| WO2023226690A1 (en) | Coding and decoding method and apparatus | |
| CN111786680B (en) | Method and device for determining generator matrix | |
| WO2023273893A1 (en) | Polar code construction method and apparatus | |
| CN114499758B (en) | Channel coding method, device, equipment and computer readable storage medium | |
| EP4246815A1 (en) | Coding method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |