CN111698060B - Encoding method, apparatus, device and storage medium - Google Patents
Encoding method, apparatus, device and storage medium Download PDFInfo
- Publication number
- CN111698060B CN111698060B CN202010590328.9A CN202010590328A CN111698060B CN 111698060 B CN111698060 B CN 111698060B CN 202010590328 A CN202010590328 A CN 202010590328A CN 111698060 B CN111698060 B CN 111698060B
- Authority
- CN
- China
- Prior art keywords
- vector
- row vector
- sub
- target
- line
- 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.)
- Active
Links
Classifications
-
- 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
- H04L1/004—Arrangements for detecting or preventing errors in the information received by using forward error control
- H04L1/0056—Systems characterized by the type of code used
- H04L1/0057—Block codes
-
- 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
Abstract
The application discloses a coding method, a coding device, coding equipment and a storage medium, and belongs to the technical field of communication. The method comprises the following steps: performing k times of segmentation calculation processing on a target row vector to be coded to obtain a final row vector, and taking the final row vector as a coding result for coding the target row vector; the ith segmentation calculation process comprises the following steps: dividing the intermediate line vector obtained by i-1 th dividing calculation into n sub-line vectors; vector addition operation is carried out on the n sub-row vectors according to a preset calculation strategy, and an intermediate row vector of the ith segmentation calculation processing is obtained according to the result of the vector addition operation; the target row vector is used as an intermediate row vector obtained by the 0 th segmentation calculation process, and the intermediate row vector obtained by the k-th segmentation calculation process is used as a final row vector. The technical scheme provided by the embodiment of the application can reduce the operation complexity of the polar encoding process, thereby saving the computing resource and reducing the encoding time.
Description
Technical Field
The present application relates to the field of communications technologies, and in particular, to an encoding method, apparatus, device, and storage medium.
Background
In a wireless communication system, communication data is generally transmitted depending on a wireless signal, however, since the wireless signal is easily interfered, the transmitted communication data and the received communication data may not coincide, and a technique of channel coding is introduced in the wireless communication system for error correction. The polarization code is a relatively common channel coding method, and in practical application, the polarization code mainly comprises two coding processes of interleaving (Chinese: interleaving) and polar encoding (Chinese: polarization encoding). Wherein the polar encoding process involves encoding a row vector.
In the related art, in the pole encoding process, very complex matrix multiplication operation is involved in encoding a row vector, and the operation complexity is high.
At present, how to reduce the operation complexity of the polar encoding process, so as to save the computing resources and reduce the encoding time has become a urgent problem to be solved.
Disclosure of Invention
Based on the above, the embodiment of the application provides a coding method, a device, equipment and a storage medium, which can reduce the operation complexity of the polar encoding process, thereby saving the computing resource and reducing the encoding time.
In a first aspect, there is provided an encoding method comprising:
performing k times of segmentation calculation processing on a target row vector to be coded to obtain a final row vector, and taking the final row vector as a coding result for coding the target row vector;
the ith segmentation calculation process comprises the following steps:
dividing the intermediate line vector obtained by i-1 th dividing calculation into n sub-line vectors; vector addition operation is carried out on the n sub-line vectors according to a preset calculation strategy, and an intermediate line vector of the ith segmentation calculation processing is obtained according to the result of the vector addition operation; the target line vector is used as an intermediate line vector obtained by the 0 th segmentation calculation process, and the intermediate line vector obtained by the k-th segmentation calculation process is used as the final line vector.
In one embodiment, performing a vector addition operation on the n subrows according to a preset calculation policy includes:
for each odd-numbered sub-row vector of the n sub-row vectors, the odd-numbered sub-row vector and the next sub-row vector are added to obtain an added sub-row vector corresponding to the odd-numbered sub-row vector.
In one embodiment, obtaining the intermediate line vector of the ith segmentation calculation process according to the result of the vector addition operation includes:
and replacing the sub-line vectors which are sequenced into odd numbers in the n sub-line vectors with corresponding addition sub-line vectors, and forming an intermediate line vector of the ith segmentation calculation processing by utilizing the n sub-line vectors obtained after replacement.
In one embodiment, each of the n subrows includes an equal number of vector elements.
In one embodiment, the target row vector includes a number of vector elements of N, k=log 2 N，n＝2 i 。
In one embodiment, for a target line vector to be encoded, performing k segmentation calculation processes, and before obtaining a final line vector, the encoding method further includes:
acquiring an initial row vector to be coded; if the number of vector elements included in the initial row vector is an odd number, adding 1 target vector element into the initial row vector to obtain the target row vector; and if the number of vector elements included in the initial row vector is even, taking the initial row vector as the target row vector.
In one embodiment, for a target line vector to be encoded, performing k segmentation calculation processes to obtain a final line vector, including:
Creating h p-bit unsigned shaping arrays, wherein the product of h and p is greater than or equal to the number of vector elements included in the target row vector; sequentially storing vector elements included in the target row vector into the h p-bit unsigned shaping arrays; and carrying out k times of segmentation calculation processing on vector elements stored in the h p-bit unsigned shaping arrays to obtain the final row vector.
In a second aspect, there is provided an encoding apparatus including:
the coding module is used for carrying out k times of segmentation calculation processing on a target line vector to be coded to obtain a final line vector, and taking the final line vector as a coding result for coding the target line vector;
the ith segmentation calculation process comprises the following steps:
dividing the intermediate line vector obtained by i-1 th dividing calculation into n sub-line vectors; vector addition operation is carried out on the n sub-line vectors according to a preset calculation strategy, and an intermediate line vector of the ith segmentation calculation processing is obtained according to the result of the vector addition operation; the target line vector is used as an intermediate line vector obtained by the 0 th segmentation calculation process, and the intermediate line vector obtained by the k-th segmentation calculation process is used as the final line vector.
In one embodiment, the encoding module is specifically configured to: for each odd-numbered sub-row vector of the n sub-row vectors, the odd-numbered sub-row vector and the next sub-row vector are added to obtain an added sub-row vector corresponding to the odd-numbered sub-row vector.
In one embodiment, the encoding module is specifically configured to: and replacing the sub-line vectors which are sequenced into odd numbers in the n sub-line vectors with corresponding addition sub-line vectors, and forming an intermediate line vector of the ith segmentation calculation processing by utilizing the n sub-line vectors obtained after replacement.
In one embodiment, each of the n subrows includes an equal number of vector elements.
In one embodiment, the target row vector includes a number of vector elements of N, k=log 2 N，n＝2 i 。
In one embodiment, the encoding apparatus further includes a row vector acquisition module configured to: acquiring an initial row vector to be coded; if the number of vector elements included in the initial row vector is an odd number, adding 1 target vector element into the initial row vector to obtain the target row vector; and if the number of vector elements included in the initial row vector is even, taking the initial row vector as the target row vector.
In one embodiment, the encoding module is specifically configured to: creating h p-bit unsigned shaping arrays, wherein the product of h and p is greater than or equal to the number of vector elements included in the target row vector; sequentially storing vector elements included in the target row vector into the h p-bit unsigned shaping arrays; and carrying out k times of segmentation calculation processing on vector elements stored in the h p-bit unsigned shaping arrays to obtain the final row vector.
In a third aspect, there is provided a computer device comprising a memory and a processor, the memory storing a computer program which, when executed by the processor, implements the encoding method of any of the first aspects described above.
In a fourth aspect, there is provided a computer readable storage medium having stored thereon a computer program which, when executed by a processor, implements the encoding method of any of the first aspects described above.
The technical scheme provided by the embodiment of the application has the beneficial effects that at least:
in the encoding method provided by the embodiment of the application, the target row vector to be encoded is subjected to k times of segmentation calculation processing to obtain a final row vector, and the final row vector is used as an encoding result for encoding the target row vector, wherein the ith segmentation calculation processing comprises the following steps: the method comprises the steps of segmenting an intermediate line vector obtained by i-1 th segmentation calculation processing to obtain n sub line vectors, carrying out vector addition operation on the n sub line vectors according to a preset calculation strategy, and obtaining the intermediate line vector of the i-th segmentation calculation processing according to a vector addition operation result, so that in the coding method provided by the embodiment of the application, the coding process of the target line vector only involves the vector addition operation, and in general, the operation complexity of the vector addition operation is far lower than that of the matrix multiplication operation, therefore, the coding method provided by the embodiment of the application can reduce the operation complexity of the polar encoding process, thereby saving calculation resources and reducing coding time.
Drawings
Fig. 1 is a block diagram of an electronic device according to an embodiment of the present application;
FIG. 2 is a flowchart of an encoding method according to an embodiment of the present application;
FIG. 3 is a schematic diagram of a segmentation calculation process for a target line vector according to an embodiment of the present application;
fig. 4 is a flowchart of performing a vector addition operation on n sub-line vectors according to a preset calculation strategy, and obtaining an intermediate line vector of an ith segmentation calculation process according to a result of the vector addition operation in the embodiment of the present application;
FIG. 5 is a schematic diagram of a segmentation calculation process for a target line vector according to an embodiment of the present application;
FIG. 6 is a flowchart of obtaining a target row vector according to an embodiment of the present application;
FIG. 7 is a schematic diagram of a segmentation calculation process for a target line vector according to an embodiment of the present application;
FIG. 8 is a schematic diagram of a segmentation calculation process for a target line vector according to an embodiment of the present application;
FIG. 9 is a schematic diagram of a segmentation calculation process for a target line vector according to an embodiment of the present application;
FIG. 10 is a schematic diagram of a segmentation calculation process for a target line vector according to an embodiment of the present application;
FIG. 11 is a schematic diagram of a segmentation calculation process for a target line vector according to an embodiment of the present application;
FIG. 12 is a schematic diagram of a segmentation calculation process for a target line vector according to an embodiment of the present application;
FIG. 13 is a block diagram of an encoding apparatus according to an embodiment of the present application;
fig. 14 is a block diagram of another encoding apparatus according to an embodiment of the present application.
Detailed Description
For the purpose of making the objects, technical solutions and advantages of the present application more apparent, the embodiments of the present application will be described in further detail with reference to the accompanying drawings.
The theory of channel polarization was first proposed by turkish scholars Erdai Arikan, based on which Erdai Arikan gives the first channel coding method known to humans that can be strictly demonstrated to reach channel capacity, named polarization code. In the 3GPP protocol standard, a polarization code is determined as a channel coding method of a control channel.
In practical applications, the polarization code mainly includes two coding processes, i.e., interleaving and polar encoding. Wherein the polar encoding process involves encoding a row vector.
In the related art, d=ug exists in the polar encoding process N This matrix multiplication operation, where d is the encoded row vector, u is the row vector to be encoded, G N To generate the matrix, and, That is, G N Is G 2 Wherein N is the number of vector elements that u comprises, t=log 2 N，/>
D=ug in polar encoding process N The computational complexity of this matrix multiplication is typically high, e.g., when N is 1024, t is 10 (log 2 1024)，G N As a 1024 x 1024 matrix due to G N Is very bulky, therefore, d=ug N The complexity of the matrix multiplication is high. The high operation complexity not only wastes the calculation resources, but also increases the time occupied by the polar encoding process.
In view of the foregoing, an embodiment of the present application provides an encoding method, which can reduce the operation complexity of the polar encoding process, thereby saving the computing resources and reducing the encoding time, and hereinafter, the embodiment of the present application will describe the encoding method in detail.
The coding method provided by the embodiment of the application can be applied to communication Equipment, and optionally, the communication Equipment can be a base station or UE (User Equipment).
Referring to fig. 1, an exemplary internal structure of a communication device is shown. As shown in fig. 1, the communication device includes a processor, a memory, a receiver, and a transmitter connected by a system bus. Wherein the processor of the communication device is configured to provide computing and control capabilities. The memory of the communication device includes a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The internal memory provides an environment for the operation of the operating system and computer programs in the non-volatile storage media. The above-mentioned computer program may implement the encoding method provided by the embodiment of the present application when executed by a processor. The receiver is configured to receive communication data transmitted by the other communication device, and the transmitter is configured to transmit communication data to the other communication device.
It will be appreciated by those skilled in the art that the structure shown in fig. 1 is merely a block diagram of a portion of a communication device and is not limiting of the communication device to which the inventive arrangements are applied, and that a particular communication device may include more or fewer components than shown, or may combine certain components, or have a different arrangement of components.
Referring to fig. 2, a flowchart of an encoding method according to an embodiment of the present application is shown, where the encoding method may be applied to the communication device described above. As shown in fig. 2, the encoding method may include the steps of:
step 201, for a target row vector to be encoded, the communication device performs k times of segmentation calculation processing to obtain a final row vector.
It should be noted that in an alternative embodiment of the present application, the target row vector may be a row vector to be encoded involved in the polar encoding process.
It should also be noted that in an alternative embodiment of the present application, if the target row vector includes N vector elements, k=log 2 N. For example, if the target row vector includes 8 vector elements, the communication device may perform 3 (log) 2 8) The sub-segmentation calculation process may be performed by the communication device to perform 10 (log) on the target row vector if the target row vector includes 1024 vector elements 2 1024 A number of segmentation calculations.
Next, the procedure of the ith segmentation calculation process, i being a positive integer greater than or equal to 1 and less than or equal to k, will be briefly described, wherein the procedure of the ith segmentation calculation process includes step A1 and step A2.
And A1, the communication equipment divides the intermediate line vector obtained by i-1 th division calculation into n sub-line vectors.
In an alternative embodiment of the present application, an intermediate row vector may be obtained after each segmentation calculation process. In the process of the ith segmentation calculation process, the communication device may acquire the intermediate line vector obtained in the last segmentation calculation process (i.e., the ith-1 st segmentation calculation process).
Note that, when i is 1, that is, when the 1 st segmentation calculation process is performed, the target line vector may be regarded as the "intermediate line vector obtained by the last segmentation calculation process", that is, as the intermediate line vector obtained by the 0 th segmentation calculation process.
After the intermediate line vector of the i-1 th segmentation calculation process is obtained, the communication device may segment the intermediate line vector into n sub-line vectors, where each sub-line vector in the n sub-line vectors obtained by segmentation includes a part of vector elements of the intermediate line vector, and all vector elements included in the n sub-line vectors are exactly identical to vector elements included in the intermediate line vector.
In an alternative embodiment of the application, n may take a value of 2 i . In an alternative embodiment of the present application, the number of vector elements included in each of the n sub-line vectors is equal, that is, the communication device may uniformly segment the intermediate line vector obtained by the i-1 th segmentation calculation processing into n sub-line vectors.
Referring to fig. 3, taking the example that the target row vector includes 8 vector elements, it is known from the above description that the communication device can perform 3 (log) 2 8) A sub-division calculation process in which the communication device can divide the target line vector into 2 (2 1 ) The number of vector elements included in the 2 sub-line vectors is equal, and the communication device may segment the intermediate line vector obtained by the 1 st segmentation calculation into 4 (2 2 ) The number of vector elements included in the 4 sub-line vectors is equal, and the communication device can segment the intermediate line vector obtained by the 2 nd segmentation calculation into 8 (2) 3 ) And the number of vector elements included in the 8 subrows is equal.
And A2, the communication equipment performs vector addition operation on the n subrows according to a preset calculation strategy, and obtains an intermediate row vector of the ith segmentation calculation according to the result of the vector addition operation.
The communication device may use the intermediate line vector obtained by the kth segmentation calculation process as the final line vector.
As an example, the target line vector may include 8 vector elements, in the 1 st segmentation calculation process, the communication device may perform a vector addition operation on the 2 sub-line vectors obtained by segmentation according to a preset calculation policy, and obtain an intermediate line vector of the 1 st segmentation calculation process according to a result of the vector addition operation, in the 2 nd segmentation calculation process, the communication device may perform a vector addition operation on the 4 sub-line vectors obtained by segmentation according to the preset calculation policy, and obtain an intermediate line vector of the 2 nd segmentation calculation process according to a result of the vector addition operation, in the 3 rd segmentation calculation process, the communication device may perform a vector addition operation on the 8 sub-line vectors obtained by segmentation according to a preset calculation policy, and obtain an intermediate line vector of the 3 rd segmentation calculation process according to a result of the vector addition operation, where the intermediate line vector of the 3 rd segmentation calculation process is the final line vector.
Step 202, the communication device uses the final row vector as a coding result of coding the target row vector.
In the encoding method provided by the embodiment of the application, the target row vector to be encoded is subjected to k times of segmentation calculation processing to obtain a final row vector, and the final row vector is used as an encoding result for encoding the target row vector, wherein the ith segmentation calculation processing comprises the following steps: the method comprises the steps of segmenting an intermediate line vector obtained by i-1 th segmentation calculation processing to obtain n sub line vectors, carrying out vector addition operation on the n sub line vectors according to a preset calculation strategy, and obtaining the intermediate line vector of the i-th segmentation calculation processing according to a vector addition operation result, so that in the coding method provided by the embodiment of the application, the coding process of the target line vector only involves the vector addition operation, and in general, the operation complexity of the vector addition operation is far lower than that of the matrix multiplication operation, therefore, the coding method provided by the embodiment of the application can reduce the operation complexity of the polar encoding process, thereby saving calculation resources and reducing coding time.
Next, the technical process of performing a vector addition operation on n sub-line vectors according to a preset calculation policy by using a communication device, and obtaining an intermediate line vector of an ith segmentation calculation process according to a result of the vector addition operation will be described, with reference to fig. 4, where the technical process may include the following steps:
In step 301, for each odd-numbered sub-row vector of the n sub-row vectors, the communication device adds each odd-numbered sub-row vector to a subsequent sub-row vector to obtain an added sub-row vector corresponding to each odd-numbered sub-row vector.
As above example, the target row vector includes 8 vector elements, and as can be seen from the above description, the communication device can perform 3 (log) 2 8) The sub-division calculation processing, for the 2 sub-row vectors obtained by the division in the 1 st division calculation processing, the communication device may add the 1 (odd) sub-row vector and the 2 (subsequent) sub-row vector to obtain an added sub-row vector corresponding to the 1 st sub-row vector, for the 4 sub-row vectors obtained by the division in the 2 nd division calculation processing, the communication device may add the 1 (odd) sub-row vector and the 2 (subsequent) sub-row vector to obtain an added sub-row vector corresponding to the 1 st sub-row vector, and at the same time, the communication device may add the 3 (odd) sub-row vector and the 4 (subsequent) sub-row vector to obtain an added sub-row vector corresponding to the 3 rd sub-row vector, for the 8 sub-row vectors obtained by the division in the 3 rd division calculation processing, the communication device may The device may add the 1 st (odd) sub-row vector and the 2 nd (next) sub-row vector to obtain an added sub-row vector corresponding to the 1 st sub-row vector, and at the same time, the communication device may add the 3 rd (odd) sub-row vector and the 4 th (next) sub-row vector to obtain an added sub-row vector corresponding to the 3 rd sub-row vector, and in addition, the communication device may add the 5 th (odd) sub-row vector and the 6 th (next) sub-row vector to obtain an added sub-row vector corresponding to the 5 th sub-row vector, and the communication device may add the 7 th (odd) sub-row vector and the 8 th (next) sub-row vector to obtain an added sub-row vector corresponding to the 7 th sub-row vector.
And 302, the communication equipment replaces the sub-line vectors which are sequenced to be odd numbers in the n sub-line vectors with corresponding addition sub-line vectors, and the n sub-line vectors obtained after replacement are utilized to form an intermediate line vector of the ith segmentation calculation processing.
As an example, referring to fig. 5, for the intermediate line vector obtained by the 1 st segmentation calculation, the communication device may segment the intermediate line vector into 4 sub-line vectors X1, X2, X3 and X4, the communication device may replace the 1 st (odd) sub-line vector X1 with the added sub-line vector x1+x2 corresponding to the 1 st sub-line vector, and replace the 3 rd (odd) sub-line vector X3 with the added sub-line vector x3+x4 corresponding to the 3 rd sub-line vector, so that the intermediate line vector obtained by the 2 nd segmentation calculation may be obtained.
For the intermediate line vector obtained by the 2 nd segmentation calculation process, the communication device may segment the intermediate line vector into 8 sub-line vectors Y1, Y2, Y3, Y4, Y5, Y6, Y7 and Y8, and the communication device may replace the 1 st (odd) sub-line vector Y1 with an added sub-line vector y1+y2 corresponding to the 1 st sub-line vector, replace the 3 rd (odd) sub-line vector Y3 with an added sub-line vector y3+y4 corresponding to the 3 rd sub-line vector, replace the 5 th (odd) sub-line vector Y5 with an added sub-line vector y5+y6 corresponding to the 5 th sub-line vector, and replace the 7 th (odd) sub-line vector Y7 with an added sub-line vector y7+y8 corresponding to the 7 th sub-line vector, so as to obtain the intermediate line vector obtained by the 3 rd segmentation calculation process.
The following will briefly describe the principles of the coding scheme according to the embodiments of the present application:
as described above, the polar encoding process has d=ug N This matrix multiplication operation, wherein:
from the above equation, it follows that:
wherein t=log 2 N。
D=ug N Can be rewritten as:
wherein u is 11 And u 12 For the two sub-line vectors obtained by splitting u, this splitting is the splitting involved in the 1 st splitting calculation process, the line vector [ (u) 11 +u 12 ) u 12 ]The intermediate line vector is obtained by the 1 st segmentation calculation process.
Let a= (u) 1 +u 2 )，B＝u 2 。
Then there are:
d＝[AG N/2 BG N/2 ]。
the above formula can be rewritten as follows in the same manner as the formula (1):
d＝[(u 21 +u 22 )G N/4 u 22 G N/4 (u 23 +u 24 )G N/4 u 24 G N/4 ]。 (2)
wherein u is 21 And u 22 Is two sub-line vectors obtained by cutting A, u 23 And u 24 Is a two sub-line vector obtained by slicing B, in other words, u can be considered as 21 、u 22 、u 23 And u 24 Is the intermediate line vector [ (u) obtained by the 1 st segmentation calculation process 11 +u 12 ) u 12 ]4 sub-line vectors obtained by segmentation, wherein the segmentation belongs to the segmentation in the 2 nd segmentation calculation process, and the line vectors [ (u) 21 +u 22 ) u 22 (u 23 +u 24 ) u 24 ]The intermediate line vector obtained by the 2 nd segmentation calculation process is obtained.
According to the same rewrite theory as that of the formula (1) and the formula (2), it can be derived that:
d＝[(u k1 +u k2 ) u k2 (u k3 +u k4 ) u k4 …… (u k(N-1) +u kN ) u kN ]。 (3)
wherein u is k1 、u k2 、……、u k(N-1) 、u kN N sub-line vectors are obtained by cutting the intermediate line vector obtained by the k-1 cutting process, and the cutting belongs to the cutting in the k cutting calculation process, and the line vector [ (u) k1 +u k2 ) u k2 (u k3 +u k4 ) u k4 …… (u k(N-1) +u kN ) u kN ]The intermediate line vector obtained by the kth segmentation calculation process is the final line vector.
As can be seen from the above formula (3), the final row vector can be taken as the encoding result of the row vector u to be encoded.
It should be noted that, in an alternative embodiment of the present application, before performing step 201, the communication device may perform a technical process of acquiring the target row vector, please refer to fig. 6, and the technical process may include the following steps:
Step 401, the communication device obtains an initial row vector to be encoded.
In step 402, if the number M of vector elements included in the initial row vector does not meet the target condition, the communication device adds a target vector element to the initial row vector to obtain a target row vector, so that the number of vector elements included in the target row vector meets the target condition.
Wherein the target condition is log 2 And M is an integer.
For example, if the initial row vector includes 7 vector elements, because log 2 7 is not an integer and the target condition described above is not satisfied, so the communication device may add 1 target vector element to the initial row vector such that the initial row vector after adding the target vector element includes 8 vector elements, due to log 2 8 is an integer, the target condition described above is satisfied, and the communication device may take the initial row vector after adding the target vector element as the target row vector.
It should be noted that in an alternative embodiment of the present application, the target vector element may be either 0 or 1. In an alternative embodiment of the present application, the communication device may add the target vector factor at the end of the initial row vector.
In step 403, if the number M of vector elements included in the initial row vector satisfies the target condition, the communication device takes the initial row vector as the target row vector.
For example, if the initial row vector includes 8 vector elements, because log 2 8 is an integer, and the target condition described above is satisfied, so the communication device can take the initial row vector as a target row vector.
Optionally, in an embodiment of the present application, the communication device may create h p-bit unsigned shaping arrays, where the product of h and p is greater than or equal to the number N of vector elements included in the target row vector, and then the communication device may sequentially store the vector elements included in the target row vector into the h p-bit unsigned shaping arrays, and then, for the vector elements stored in the h p-bit unsigned shaping arrays, the communication device may perform k segmentation computation processing to obtain a final row vector.
Referring to fig. 7, the communication device may create N/32 (N/32 is an integer) 32-bit unsigned shaped arrays, and the communication device may sequentially store vector elements included in the target row vector into the N/32-bit unsigned shaped arrays.
Referring to fig. 8, assuming that the number of vector elements included in the target row vector is 1024 (32×32), the communication device may create 32-bit unsigned shaping arrays, and the communication device may sequentially store the vector elements included in the target row vector into the 32-bit unsigned shaping arrays. In the process of the 1 st segmentation process, the communication device may segment the 32 bit unsigned shaped arrays, where vector elements stored in the first 16 32 bit unsigned shaped arrays form a 1 st subrow vector, vector elements stored in the last 16 32 bit unsigned shaped arrays form a 2 nd subrow vector, and then, the communication device calculates an intermediate row vector of the 1 st segmentation calculation process according to a manner shown in fig. 8, where vector elements of the intermediate row vector are sequentially stored in the 32 bit unsigned shaped arrays.
Referring to fig. 9, in the 2 nd segmentation calculation process, for the intermediate line vector obtained in the 1 st segmentation calculation process, the communication device may segment the 32 bit unsigned shaping arrays stored in the intermediate line vector into 4 parts, where the 4 parts include 8 32 bit unsigned shaping arrays, and the vector elements stored in the 4 parts form 4 sub line vectors, and then the communication device calculates the intermediate line vector obtained in the 2 nd segmentation calculation process according to the manner shown in fig. 9, where the vector elements of the intermediate line vector are sequentially stored in the 32 bit unsigned shaping arrays.
Referring to fig. 10, in the 3 rd slicing calculation process, for the intermediate line vector obtained in the 2 nd slicing calculation process, the communication device may slice the 32 bit unsigned shaping arrays stored in the intermediate line vector into 8 parts, where the 8 parts include 4 32 bit unsigned shaping arrays, and the vector elements stored in the 8 parts form 8 sub line vectors, and then the communication device calculates the intermediate line vector obtained in the 3 rd slicing calculation process according to the manner shown in fig. 10, where the vector elements of the intermediate line vector are sequentially stored in the 32 bit unsigned shaping arrays.
Referring to fig. 11, in the 4 th segmentation calculation process, for the intermediate line vector obtained in the 3 rd segmentation calculation process, the communication device may segment the 32 bit unsigned shaping arrays stored in the intermediate line vector into 16 parts, where the 16 parts include 2 32 bit unsigned shaping arrays, and the vector elements stored in the 16 parts form 16 sub line vectors, and then the communication device calculates the intermediate line vector obtained in the 4 th segmentation calculation process according to the manner shown in fig. 11, where the vector elements of the intermediate line vector are sequentially stored in the 32 bit unsigned shaping arrays.
Referring to fig. 12, in the 5 th segmentation calculation process, for the intermediate line vector obtained in the 4 th segmentation calculation process, the communication device may segment the 32 bit unsigned shaping arrays stored in the intermediate line vector into 32 parts, where the 32 parts include 1 32 bit unsigned shaping array, and the vector elements stored in the 32 parts form 32 sub line vectors, and then the communication device calculates the intermediate line vector obtained in the 5 th segmentation calculation process according to the manner shown in fig. 12, where the vector elements of the intermediate line vector are sequentially stored in the 32 bit unsigned shaping arrays.
In the process of the 6 th to the kth segmentation calculation, the communication device starts to segment the vector elements stored in the 32-bit unsigned shaping array, and the embodiment of the application is not shown in the drawing.
Referring to fig. 13, a block diagram of an encoding apparatus 500 according to an embodiment of the present application is shown, where the encoding apparatus 500 may be configured in the communication device described above. As shown in fig. 13, the encoding apparatus 500 may include: encoding module 501.
The encoding module 501 is configured to perform k-time segmentation calculation processing on a target line vector to be encoded, obtain a final line vector, and use the final line vector as an encoding result of encoding the target line vector.
The ith segmentation calculation process comprises the following steps:
dividing the intermediate line vector obtained by i-1 th dividing calculation into n sub-line vectors; vector addition operation is carried out on the n sub-line vectors according to a preset calculation strategy, and an intermediate line vector of the ith segmentation calculation processing is obtained according to the result of the vector addition operation; the target line vector is used as an intermediate line vector obtained by the 0 th segmentation calculation process, and the intermediate line vector obtained by the k-th segmentation calculation process is used as the final line vector.
In one embodiment of the present application, the encoding module 501 is specifically configured to: for each odd-numbered sub-row vector of the n sub-row vectors, the odd-numbered sub-row vector and the next sub-row vector are added to obtain an added sub-row vector corresponding to the odd-numbered sub-row vector.
In one embodiment of the present application, the encoding module 501 is specifically configured to: and replacing the sub-line vectors which are sequenced into odd numbers in the n sub-line vectors with corresponding addition sub-line vectors, and forming an intermediate line vector of the ith segmentation calculation processing by utilizing the n sub-line vectors obtained after replacement.
In one embodiment of the present application, each of the n subrows includes an equal number of vector elements.
In one embodiment of the present application, the target row vector includes a number of vector elements of N, k=log 2 N，n＝2 i 。
In one embodiment of the present application, the encoding module 501 is specifically configured to: creating h p-bit unsigned shaping arrays, wherein the product of h and p is greater than or equal to the number of vector elements included in the target row vector; sequentially storing vector elements included in the target row vector into the h p-bit unsigned shaping arrays; and carrying out k times of segmentation calculation processing on vector elements stored in the h p-bit unsigned shaping arrays to obtain the final row vector.
Referring to fig. 14, a block diagram of another encoding apparatus 600 according to an embodiment of the present application is shown, where the encoding apparatus 600 includes a row vector acquisition module 502 in addition to the respective modules included in the encoding apparatus 500.
The row vector obtaining module 502 is configured to: acquiring an initial row vector to be coded; if the number M of vector elements included in the initial line vector does not meet the target condition, adding target vector elements into the initial line vector to obtain the target line vector, so that the number of vector elements included in the target line vector meets the target condition, wherein the target condition is log 2 M is an integer; and if the number M of vector elements included in the initial row vector meets the target condition, taking the initial row vector as the target row vector.
The coding device provided by the embodiment of the application can realize the method embodiment, and the implementation principle and the technical effect are similar, and are not repeated here.
The specific limitation of the encoding device may be referred to as limitation of the encoding method hereinabove, and will not be described herein. The respective modules in the above-described encoding apparatus may be implemented in whole or in part by software, hardware, and combinations thereof. The above modules may be embedded in hardware or may be independent of a processor in the computer device, or may be stored in software in a memory in the computer device, so that the processor may call and execute operations corresponding to the above modules.
In one embodiment of the present application, there is provided a communication device including a memory and a processor, the memory storing a computer program, the processor implementing the following steps when executing the computer program:
performing k times of segmentation calculation processing on a target row vector to be coded to obtain a final row vector, and taking the final row vector as a coding result for coding the target row vector;
the ith segmentation calculation process comprises the following steps:
dividing the intermediate line vector obtained by i-1 th dividing calculation into n sub-line vectors; vector addition operation is carried out on the n sub-line vectors according to a preset calculation strategy, and an intermediate line vector of the ith segmentation calculation processing is obtained according to the result of the vector addition operation; the target line vector is used as an intermediate line vector obtained by the 0 th segmentation calculation process, and the intermediate line vector obtained by the k-th segmentation calculation process is used as the final line vector.
In one embodiment of the application, the processor when executing the computer program further performs the steps of: for each odd-numbered sub-row vector of the n sub-row vectors, the odd-numbered sub-row vector and the next sub-row vector are added to obtain an added sub-row vector corresponding to the odd-numbered sub-row vector.
In one embodiment of the application, the processor when executing the computer program further performs the steps of: and replacing the sub-line vectors which are sequenced into odd numbers in the n sub-line vectors with corresponding addition sub-line vectors, and forming an intermediate line vector of the ith segmentation calculation processing by utilizing the n sub-line vectors obtained after replacement.
In one embodiment of the present application, each of the n subrows includes an equal number of vector elements.
In one embodiment of the present application, the target row vector includes a number of vector elements of N, k=log 2 N，n＝2 i 。
In one embodiment of the application, the processor when executing the computer program further performs the steps of: acquiring an initial row vector to be coded; if the number M of vector elements included in the initial line vector does not meet the target condition, adding target vector elements into the initial line vector to obtain the target line vector, so that the number of vector elements included in the target line vector meets the target condition, wherein the target condition is log 2 M is an integer; and if the number M of vector elements included in the initial row vector meets the target condition, taking the initial row vector as the target row vector.
In one embodiment of the application, the processor when executing the computer program further performs the steps of: creating h p-bit unsigned shaping arrays, wherein the product of h and p is greater than or equal to the number of vector elements included in the target row vector; sequentially storing vector elements included in the target row vector into the h p-bit unsigned shaping arrays; and carrying out k times of segmentation calculation processing on vector elements stored in the h p-bit unsigned shaping arrays to obtain the final row vector.
The implementation principle and technical effects of the communication device provided by the embodiment of the present application are similar to those of the above-mentioned method embodiment, and are not described herein again.
In one embodiment of the present application, there is provided a computer-readable storage medium having stored thereon a computer program which, when executed by a processor, performs the steps of:
performing k times of segmentation calculation processing on a target row vector to be coded to obtain a final row vector, and taking the final row vector as a coding result for coding the target row vector;
the ith segmentation calculation process comprises the following steps:
dividing the intermediate line vector obtained by i-1 th dividing calculation into n sub-line vectors; vector addition operation is carried out on the n sub-line vectors according to a preset calculation strategy, and an intermediate line vector of the ith segmentation calculation processing is obtained according to the result of the vector addition operation; the target line vector is used as an intermediate line vector obtained by the 0 th segmentation calculation process, and the intermediate line vector obtained by the k-th segmentation calculation process is used as the final line vector.
In one embodiment of the application, the computer program when executed by the processor further implements the steps of: for each odd-numbered sub-row vector of the n sub-row vectors, the odd-numbered sub-row vector and the next sub-row vector are added to obtain an added sub-row vector corresponding to the odd-numbered sub-row vector.
In one embodiment of the application, the computer program when executed by the processor further implements the steps of: and replacing the sub-line vectors which are sequenced into odd numbers in the n sub-line vectors with corresponding addition sub-line vectors, and forming an intermediate line vector of the ith segmentation calculation processing by utilizing the n sub-line vectors obtained after replacement.
In one embodiment of the present application, each of the n subrows includes an equal number of vector elements.
In one embodiment of the present application, the target row vector includes a number of vector elements of N, k=log 2 N，n＝2 i 。
In one embodiment of the application, the computer program when executed by the processor further implements the steps of: acquiring an initial row vector to be coded; if the number M of vector elements included in the initial line vector does not meet the target condition, adding target vector elements into the initial line vector to obtain the target line vector, so that the number of vector elements included in the target line vector meets the target condition, wherein the target condition is log 2 M is an integer; and if the number M of vector elements included in the initial row vector meets the target condition, taking the initial row vector as the target row vector.
In one embodiment of the application, the computer program when executed by the processor further implements the steps of: creating h p-bit unsigned shaping arrays, wherein the product of h and p is greater than or equal to the number of vector elements included in the target row vector; sequentially storing vector elements included in the target row vector into the h p-bit unsigned shaping arrays; and carrying out k times of segmentation calculation processing on vector elements stored in the h p-bit unsigned shaping arrays to obtain the final row vector.
The computer readable storage medium provided in this embodiment has similar principles and technical effects to those of the above method embodiment, and will not be described herein.
Any reference to memory, storage, database, or other medium used in embodiments provided herein may include non-volatile and/or volatile memory. The nonvolatile memory can include Read Only Memory (ROM), programmable ROM (PROM), electrically Programmable ROM (EPROM), electrically Erasable Programmable ROM (EEPROM), or flash memory. Volatile memory can include Random Access Memory (RAM) or external cache memory. By way of illustration and not limitation, RAM is available in a variety of forms such as Static RAM (SRAM), dynamic RAM (DRAM), synchronous DRAM (SDRAM), double Data Rate SDRAM (DDRSDRAM), enhanced SDRAM (ESDRAM), synchronous Link DRAM (SLDRAM), memory bus direct RAM (RDRAM), direct memory bus dynamic RAM (DRDRAM), and memory bus dynamic RAM (RDRAM), among others.
The technical features of the above-described embodiments may be arbitrarily combined, and all possible combinations of the technical features in the above-described embodiments are not described for brevity of description, however, as long as there is no contradiction between the combinations of the technical features, they should be considered as the scope of the description.
The above examples illustrate only a few embodiments of the application, which are described in detail and are not to be construed as limiting the scope of the claims. It should be noted that it will be apparent to those skilled in the art that several variations and modifications can be made without departing from the spirit of the application, which are all within the scope of the application. Accordingly, the scope of protection of the present application is to be determined by the appended claims.
Claims (10)
1. The coding method is characterized by being applied to communication equipment, wherein the communication equipment is a base station or user equipment; the encoding method comprises the following steps:
performing k times of segmentation calculation processing on a target row vector to be coded to obtain a final row vector, and taking the final row vector as a coding result for coding the target row vector; wherein the target row vector is a row vector to be coded involved in the polarization coding process; the target row vector includes a number of vector elements of N, k=log 2 N；
The ith segmentation calculation process comprises the following steps:
dividing the intermediate line vector obtained by i-1 th dividing calculation into n sub-line vectors;
vector addition operation is carried out on the n subrows according to a preset calculation strategy, and an intermediate row vector of the ith segmentation calculation processing is obtained according to the result of the vector addition operation; the vector addition operation is performed on the n subrows according to a preset calculation strategy, including: for each odd-numbered sub-row vector in the n sub-row vectors, adding each odd-numbered sub-row vector to the next sub-row vector to obtain an added sub-row vector corresponding to each odd-numbered sub-row vector; the step of obtaining the intermediate line vector of the ith segmentation calculation process according to the result of the vector addition operation comprises the following steps: replacing the sub-line vectors which are sequenced into odd numbers in the n sub-line vectors with corresponding addition sub-line vectors, and forming an intermediate line vector of the ith segmentation calculation processing by utilizing the n sub-line vectors obtained after replacement;
and taking the target row vector as an intermediate row vector obtained by the 0 th segmentation calculation process, and taking the intermediate row vector obtained by the k-th segmentation calculation process as the final row vector.
2. The encoding method according to claim 1, wherein each of the n subrows includes an equal number of vector elements.
3. The encoding method according to claim 1, wherein n = 2 i 。
4. The encoding method according to claim 3, wherein, before performing the segmentation calculation processing k times for the target row vector to be encoded to obtain the final row vector, the encoding method further comprises:
acquiring an initial row vector to be coded;
if the number M of vector elements included in the initial row vector does not meet the target condition, adding target vector elements into the initial row vector to obtain the target row vector, so that the number of vector elements included in the target row vector meets the target condition, wherein the target condition is log 2 M is an integer;
and if the number M of vector elements included in the initial row vector meets the target condition, taking the initial row vector as the target row vector.
5. The method of claim 4, wherein the target vector element is 0 or 1.
6. The method of claim 4, wherein adding a target vector element in the initial row vector comprises:
The target vector element is added at the end of the initial row vector.
7. The encoding method according to claim 1, wherein the performing k-time segmentation calculation processing on the target row vector to be encoded to obtain a final row vector includes:
creating h p-bit unsigned shaping arrays, wherein the product of h and p is greater than or equal to the number of vector elements included in the target row vector;
sequentially storing vector elements included in the target row vector into the h p-bit unsigned shaping arrays;
and carrying out k times of segmentation calculation processing on the vector elements stored in the h p-bit unsigned shaping arrays to obtain the final row vector.
8. The coding device is characterized by being applied to communication equipment, wherein the communication equipment is a base station or user equipment; the encoding device includes:
the coding module is used for carrying out k times of segmentation calculation processing on a target line vector to be coded to obtain a final line vector, and taking the final line vector as a coding result for coding the target line vector; wherein the target row vector is a row vector to be coded involved in the polarization coding process; the target row vector includes a number of vector elements of N, k=log 2 N；
The ith segmentation calculation process comprises the following steps:
dividing the intermediate line vector obtained by i-1 th dividing calculation into n sub-line vectors;
vector addition operation is carried out on the n subrows according to a preset calculation strategy, and an intermediate row vector of the ith segmentation calculation processing is obtained according to the result of the vector addition operation; the vector addition operation is performed on the n subrows according to a preset calculation strategy, including: for each odd-numbered sub-row vector in the n sub-row vectors, adding each odd-numbered sub-row vector to the next sub-row vector to obtain an added sub-row vector corresponding to each odd-numbered sub-row vector; the step of obtaining the intermediate line vector of the ith segmentation calculation process according to the result of the vector addition operation comprises the following steps: replacing the sub-line vectors which are sequenced into odd numbers in the n sub-line vectors with corresponding addition sub-line vectors, and forming an intermediate line vector of the ith segmentation calculation processing by utilizing the n sub-line vectors obtained after replacement;
and taking the target row vector as an intermediate row vector obtained by the 0 th segmentation calculation process, and taking the intermediate row vector obtained by the k-th segmentation calculation process as the final row vector.
9. A communication device comprising a memory and a processor, the memory storing a computer program which, when executed by the processor, implements the encoding method of any of claims 1 to 7.
10. A computer readable storage medium, having stored thereon a computer program which, when executed by a processor, implements the encoding method according to any of claims 1 to 7.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010590328.9A CN111698060B (en) | 2020-06-24 | 2020-06-24 | Encoding method, apparatus, device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202010590328.9A CN111698060B (en) | 2020-06-24 | 2020-06-24 | Encoding method, apparatus, device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN111698060A CN111698060A (en) | 2020-09-22 |
| CN111698060B true CN111698060B (en) | 2023-10-20 |
Family
ID=72483966
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202010590328.9A Active CN111698060B (en) | 2020-06-24 | 2020-06-24 | Encoding method, apparatus, device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN111698060B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101588183A (en) * | 2009-06-26 | 2009-11-25 | 北京交通大学 | A kind of LDPC sign indicating number fast encoding method and system |
| CN103001648A (en) * | 2012-12-05 | 2013-03-27 | 无锡创灵科技有限公司 | Simple coding device and simple coding method of quasi-cyclic Low Density Parity Check (LDPC) code based on Field Programmable Gate Array (FPGA) |
| CN103259865A (en) * | 2013-05-23 | 2013-08-21 | 中国科学院计算机网络信息中心 | Self-adaptive DNS zone file transmission method and system based on network coding |
| CN107666370A (en) * | 2016-07-29 | 2018-02-06 | 华为技术有限公司 | Coding method and equipment |
| CN108390677A (en) * | 2018-03-20 | 2018-08-10 | 山东大学 | A kind of coding and decoding method of polarization code optimization |
| CN108809486A (en) * | 2017-05-03 | 2018-11-13 | 华为技术有限公司 | Polar code coding/decoding methods and device |
| CN110391872A (en) * | 2018-04-19 | 2019-10-29 | 华为技术有限公司 | The coding and decoding method and device of polarization code |
| CN110430012A (en) * | 2019-07-11 | 2019-11-08 | 中国人民解放军陆军工程大学 | The polarization code the minimum weight codewords distribution estimation method of low complex degree |
| CN111132231A (en) * | 2019-12-31 | 2020-05-08 | 北京邮电大学 | Data transmission method, device, terminal and medium for polarization timeslot ALOHA |
Family Cites Families (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107370560B (en) * | 2016-05-12 | 2020-04-21 | 华为技术有限公司 | Method, device and equipment for coding and rate matching of polarization code |
| CN108288969B (en) * | 2017-01-07 | 2021-12-21 | 华为技术有限公司 | Method and apparatus for encoding and decoding data |
-
2020
- 2020-06-24 CN CN202010590328.9A patent/CN111698060B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101588183A (en) * | 2009-06-26 | 2009-11-25 | 北京交通大学 | A kind of LDPC sign indicating number fast encoding method and system |
| CN103001648A (en) * | 2012-12-05 | 2013-03-27 | 无锡创灵科技有限公司 | Simple coding device and simple coding method of quasi-cyclic Low Density Parity Check (LDPC) code based on Field Programmable Gate Array (FPGA) |
| CN103259865A (en) * | 2013-05-23 | 2013-08-21 | 中国科学院计算机网络信息中心 | Self-adaptive DNS zone file transmission method and system based on network coding |
| CN107666370A (en) * | 2016-07-29 | 2018-02-06 | 华为技术有限公司 | Coding method and equipment |
| CN108809486A (en) * | 2017-05-03 | 2018-11-13 | 华为技术有限公司 | Polar code coding/decoding methods and device |
| CN108390677A (en) * | 2018-03-20 | 2018-08-10 | 山东大学 | A kind of coding and decoding method of polarization code optimization |
| CN110391872A (en) * | 2018-04-19 | 2019-10-29 | 华为技术有限公司 | The coding and decoding method and device of polarization code |
| CN110430012A (en) * | 2019-07-11 | 2019-11-08 | 中国人民解放军陆军工程大学 | The polarization code the minimum weight codewords distribution estimation method of low complex degree |
| CN111132231A (en) * | 2019-12-31 | 2020-05-08 | 北京邮电大学 | Data transmission method, device, terminal and medium for polarization timeslot ALOHA |
Non-Patent Citations (2)
| Title |
|---|
| NEC. "R1-1712334".3GPP tsg_ran\WG1_RL1.2017,全文. * |
| 极化码在中继编码协作系统中的性能研究;项剑特;仰枫帆;;无线电工程(第03期);全文 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN111698060A (en) | 2020-09-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112449009B (en) | SVD-based communication compression method and device for Federal learning recommendation system | |
| CN110690941B (en) | Polar code rate matching method and device | |
| WO2018127196A1 (en) | Shift coefficient and lifting factor design for nr ldpc code | |
| US20190372591A1 (en) | Methods and apparatuses for data processing in communication system | |
| CN110958022A (en) | Data compression method and device for continuity curve and related equipment | |
| CN111858169A (en) | Data recovery method, system and related components | |
| US20180198466A1 (en) | Shift Coefficient And Lifting Factor Design For NR LDPC Code | |
| CN111698060B (en) | Encoding method, apparatus, device and storage medium | |
| JP7062046B2 (en) | Code block partitioning method, terminals, base stations and computer readable storage media | |
| CN108389124B (en) | Data processing method, data processing device, computer equipment and storage medium | |
| CN109391347B (en) | Coding and decoding method and device | |
| CN107733439B (en) | LDPC (Low Density parity check) coding method, coding device and communication equipment | |
| CN111030708A (en) | Iterative adjustable soft serial offset list decoding method and device for polarization code | |
| CN103401650A (en) | Blind identification method for (n, 1 and m) convolutional code with error codes | |
| CN110830166B (en) | Joint detection decoding method and device, computer equipment and storage medium | |
| CN107682019B (en) | TPC high-speed decoding method | |
| CN109802690B (en) | Decoding method, device and computer readable storage medium | |
| CN114204943A (en) | Encoding method and apparatus | |
| CN111131839B (en) | Data processing method, device, equipment and storage medium | |
| CN114915376B (en) | Decoding method, encoding method, apparatus, device, and storage medium | |
| CN114726481B (en) | 5G NR LDPC decoding method and related device | |
| CN111600613B (en) | Verification method, verification device, decoder, receiver and computer storage medium | |
| US11855657B2 (en) | Method and apparatus for decoding data packets in communication network | |
| CN117560020B (en) | Channel coding sparse check matrix reconstruction method and device and electronic equipment | |
| CN116662063B (en) | Error correction configuration method, error correction method, system, equipment and medium for flash memory |
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 | ||
| CB02 | Change of applicant information | ||
| CB02 | Change of applicant information |
Address after: 510663 Shenzhou Road 10, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangzhou, Guangdong Applicant after: Jingxin Network System Co.,Ltd. Address before: 510663 Shenzhou Road 10, Guangzhou Science City, Guangzhou economic and Technological Development Zone, Guangzhou, Guangdong Applicant before: COMBA TELECOM SYSTEMS (CHINA) Ltd. |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |