WO2019128809A1 - Information processing method and device - Google Patents

Abstract

The present application provides an information processing method, and a QC-LDPC constructed by the method helps to reduce an error layer that occurs during decoding and further improve decoding performance. The method comprises: determining a first extension factor and a correction value of the first extension factor; determining a check matrix according to the first extension factor and the correction value of the first extension factor; and encoding an information sequence of length K using the check matrix.

Description

Method and apparatus for processing information

The present application claims priority to the Chinese Patent Application, filed on Dec. 29, PCT----------

Technical field

The present application relates to the field of information processing, and in particular, to a method and apparatus for processing information.

Background technique

Low density parity check (LDPC) is a class of linear block codes with sparse check matrices proposed by Dr. Robert G. Gallage in 1963. Because LDPC codes not only have good performance close to the Shannon limit, but also have the advantages of low decoding complexity and flexible structure, they have been widely used in many fields in recent years. The quasi-cyclic low-density parity check (QC-LDPC) is an LDPC code with a quasi-cyclic structure, which is a subclass of the LDPC code, because of its simple description, easy construction, and saving. The advantages of storage space have become a research hotspot in the field of channel coding in recent years.

The construction process of the QC-LDPC code is the construction process of the parity check matrix of the QC-LDPC code. The check matrix of QC-LDPC is obtained by extending the base matrix by a spreading factor on the basis of a base matrix. However, many existing methods for constructing the QC-LDPC check matrix inevitably have error leveling. The error leveling layer is a key factor that causes the decoding performance to be low in the actual application process of QC-LDPC.

Summary of the invention

The present application provides a method and apparatus for processing information, and the QC-LDPC constructed by the method helps to reduce the error leveling layer occurring in the decoding process, thereby improving the decoding performance.

In a first aspect, the present application provides a method for processing information, the method comprising: determining a first spreading factor and a correction value of a first spreading factor; determining a check matrix according to the first spreading factor and the modified value; using a school The proof matrix encodes a sequence of information of length K, which is a positive integer.

The method for processing information in the embodiment of the present application may correct the spreading factor corresponding to the length K of the information sequence in which the error leveling occurs when determining the spreading factor Z of the QC-LDPC check matrix, so as to skip the error level. The position of the layer can thus improve the decoding performance of the QC-LDPC.

In conjunction with the first aspect, in some implementations of the first aspect, the correction value of the first spreading factor is related to the length K of the information sequence. For example, the length K of the information sequence and the correction value of the first spreading factor satisfy at least one of the following table:

Length of information sequence K Correction value of the first expansion factor 96 1 152 1 176 1

272 2 304 2 368 2 400 3

In conjunction with the first aspect, in some implementations of the first aspect, the length K of the information sequence and the correction value of the first spreading factor satisfy at least one of the following tables:

Length of information sequence K Correction value of the first expansion factor 96 1 152 1 176 1 272 2 368 2 400 6

In conjunction with the first aspect, in some implementations of the first aspect, determining the correction value of the first spreading factor comprises determining a correction value of the first spreading factor based on the length K of the information sequence and the code rate R. That is to say, the correction value of the first spreading factor can be related to the length K of the information sequence and the code rate R. A more refined correction can be achieved by determining the correction value of the first spreading factor in combination with K and the code rate R as compared to determining the correction value of the first spreading factor based only on the length K of the information sequence.

In conjunction with the first aspect, in some implementations of the first aspect, the length K of the information sequence, the correction value of the first spreading factor, and the code rate R satisfy at least one of the following tables:

In conjunction with the first aspect, in some implementations of the first aspect, the information sequence K, the correction value of the first spreading factor, and the code rate R satisfy at least one of the following tables:

In this embodiment, the value range (0, 1) of the code rate R can be divided into six sections. For the length K of an information sequence, the correction value of the first spreading factor can be determined from the above table regardless of the actual code rate. In this way, according to the interval in which the actually used code rate falls, the first spreading factor is corrected by using the correction value corresponding to the interval, so that the finer correction of the spreading factor of the check matrix can be realized, and the decoding of the LDPC is further improved. performance.

In a second aspect, the present application provides an apparatus for processing information having the functionality to implement the method of any of the above-described first aspects and any one of the possible implementations of the first aspect. The functions may be implemented by hardware or by corresponding software implemented by hardware. The hardware or software includes one or more units corresponding to the functions described above. For example, the apparatus includes a processing unit, the processing unit is configured to: determine a correction factor of the first spreading factor and the first spreading factor; determine a check matrix according to the first spreading factor and the corrected value of the first spreading factor; use a check matrix pair A sequence of information of length K is encoded, and K is a positive integer. Further, the apparatus may further include a receiving unit, configured to receive the information sequence of length K to be encoded.

In a possible implementation manner, the apparatus for processing information in the second aspect may be a terminal or a base station.

The QC-LDPC constructed by the apparatus for processing information provided by the embodiment of the present application helps to reduce the error leveling layer occurring in the decoding process, thereby improving the decoding performance.

In a third aspect, the present application provides a computer readable storage medium having stored therein computer instructions that, when executed on a computer, cause the computer to perform any of the first aspect or the first aspect described above The method in the implementation.

In a fourth aspect, the present application provides a chip (or a chip system) including a memory and a processor for storing a computer program, the processor for calling and running the computer program from the memory, so that the communication with the chip is installed The apparatus performs the method of the first aspect above and any one of its possible implementations.

In a fifth aspect, the application provides a computer program product, comprising: computer program code, when the computer program code is run on a computer, causing the computer to perform the first aspect and any one possible implementation thereof The method in .

In a sixth aspect, the present application provides a method for processing information, the method comprising: determining a first spreading factor and a correction value of a first spreading factor; determining a check matrix according to a first spreading factor and a modified value of the first spreading factor The decoding sequence is used to decode the decoded sequence.

It should be noted that, in the decoding process, the process of determining the check matrix by the decoding end (or the receiving end of information and/or data) is the same as that of the transmitting end. Therefore, the relationship between the correction value of the first spreading factor and the length K of the information sequence described in any one of the possible implementation manners of the first aspect, or the correction value of the first spreading factor, the length K of the information sequence, and The relationship satisfied between the code rates R is also applicable in the method of processing information of the sixth aspect. For the sake of brevity, it will not be repeated here.

The QC-LDPC constructed by the method for processing information provided by the present application helps to reduce the error leveling layer occurring in the decoding process, thereby improving the decoding performance.

In a seventh aspect, the present application provides an apparatus for processing information, the apparatus having the function of implementing the method in any of the above-described sixth aspects and any one of the possible implementations of the sixth aspect. The functions may be implemented by hardware or by corresponding software implemented by hardware. The hardware or software includes one or more units corresponding to the functions described above. For example, the apparatus includes a processing unit, the processing unit is configured to: determine a correction value of the first spreading factor and the first spreading factor; determine a check matrix according to the first spreading factor and the corrected value of the first spreading factor; The decoding sequence is decoded.

In a possible implementation manner, the apparatus for processing information in the seventh aspect may be a terminal or a base station.

In an eighth aspect, the present application provides a computer readable storage medium having stored therein computer instructions that, when executed on a computer, cause the computer to perform any of the foregoing sixth or sixth aspects The method in the implementation.

In a ninth aspect, the present application provides a chip (or a chip system) including a memory and a processor for storing a computer program, the processor for calling and running the computer program from the memory such that communication of the chip is installed The apparatus performs the method of the sixth aspect described above and any one of its possible implementations.

In a tenth aspect, the application provides a computer program product, comprising: computer program code, when the computer program code is run on a computer, causing the computer to perform the sixth aspect and any possible implementation thereof The method in .

The method for processing information in the embodiment of the present application corrects the expansion factor (ie, the first spreading factor) of the check matrix, so that the check matrix used for encoding skips the position of the error leveling layer, thereby Improve decoding performance.

DRAWINGS

FIG. 1 is a wireless communication system 100 suitable for use in an embodiment of the present application.

2 is a schematic diagram of a check matrix for constructing an LDPC based on a matrix.

3 is a graph comparing the performance of an LDPC code and a polarization code when K=94 and N=420.

FIG. 4 is a schematic flowchart of a method 200 of encoding according to an embodiment of the present application.

Figure 5 is a schematic diagram of BLER derived from the BG2 matrix and LOMS algorithm in NR.

6 to 11 are examples of determining whether or not there is an error leveling layer based on a performance curve.

FIG. 12 is a schematic block diagram of an apparatus 600 for processing information according to an embodiment of the present application.

FIG. 13 is a schematic structural diagram of an apparatus 700 for processing information according to an embodiment of the present application.

FIG. 14 is a schematic block diagram of an apparatus 800 for processing information according to an embodiment of the present application.

FIG. 15 is a schematic structural diagram of an apparatus 900 for processing information according to an embodiment of the present application.

Detailed ways

The technical solutions in the present application will be described below with reference to the accompanying drawings.

The technical solutions in the present application will be described below with reference to the accompanying drawings.

FIG. 1 is a wireless communication system 100 suitable for use in an embodiment of the present application. The wireless communication system can include at least one network device 101 in communication with one or more terminal devices (e.g., terminal device 102 and terminal device 103 shown in FIG. 1). The network device may be a base station, or may be a device integrated with the base station controller, or may be another device having similar communication functions.

The terminal is a device having a communication function, and may include a handheld device having a wireless communication function, an in-vehicle device, a wearable device, a computing device, or other processing device connected to the wireless modem. The terminals can be deployed on land, including indoors or outdoors, handheld or on-board; they can also be deployed on the water (such as ships, etc.); they can also be deployed in the air (such as airplanes, balloons, satellites, etc.). The terminal may be a mobile phone, a tablet, a computer with wireless transceiver function, a virtual reality (VR) terminal device, an augmented reality (AR) terminal device, industrial control (industrial) Wireless terminal in control), wireless terminal in self driving, wireless terminal in remote medical, wireless terminal in smart grid, wireless in transport safety A terminal, a wireless terminal in a smart city, a wireless terminal in a smart home, and the like. Terminals can be called different names in different networks, such as: user equipment, mobile stations, subscriber units, stations, cellular phones, personal digital assistants, wireless modems, wireless communication devices, handheld devices, laptops, cordless phones, Wireless local loop station, etc. For convenience of description, the present application is simply referred to as a terminal.

A base station (BS), which may also be called a base station device, is a device deployed in a radio access network to provide wireless communication functions. The name of a base station may be different in different wireless access systems. For example, in a universal mobile telecommunications system (UMTS) network, a base station is called a Node B, and a base station in an LTE network is called a base station. For an evolved Node B (eNB or eNodeB), a base station in a new radio (NR) network is called a transmission reception point (TRP) or a generation node B (gNB). Or other base stations may be used in other networks where multiple technologies are converged, or in other various evolved networks. The invention is not limited to this.

The wireless communication system mentioned in the embodiments of the present application includes, but is not limited to, a narrow band-Internet of things (NB-IoT), a global system for mobile communications (GSM), and an enhanced data rate. GSM evolution (EDGE), wideband code division multiple access (WCDMA), code division multiple access (CDMA2000), time division synchronization code Three divisions of time division-synchronization code division multiple access (TD-SCDMA), long term evolution (LTE), and next-generation 5G mobile communication systems, namely enhanced mobile broadband (eMBB) ), ultra reliable low latency communication (URLLC) and enhanced mass machine type communication (eMTC) or new communication systems that will emerge in the future.

The network device in FIG. 1 communicates with the terminal device using wireless technology. When the network device sends a signal, it is the encoding end. When the network device receives the signal, it is the decoding end. The terminal device is also the same. When the terminal device sends a signal, it is the encoding end. When the terminal device receives the signal, it is the decoding end.

In addition, the encoding end is the information and/or data transmitting end, and the decoding end is the receiving end of the information and/or data.

For ease of understanding, the related concepts involved in this application are briefly introduced.

Low density parity check (LDPC) is a kind of linear block code with sparse check matrix, which means that the check matrix of LDPC code has far more zero elements than non-zero elements, and non-zero elements. The distribution is irregular. Wherein, a linear block code whose code length is equal to N and whose length of the information sequence is equal to K can be uniquely determined by its check matrix. LDPC codes not only have good performance close to the Shannon limit, but also have low decoding complexity and flexible structure. They are hotspots in the field of channel coding in recent years, and have been widely used in deep space communication, optical fiber communication, satellite digital video and audio broadcasting. And other fields.

A quasi-cyclic low density parity check (QC-LDPC) is a subclass of LDPC. The parity check matrix of the QC-LDPC is obtained by expanding a base matrix. Hereinafter, the base matrix is denoted as H _b , and the parity check matrix is denoted as H. Wherein, the position of the non-zero element in the base matrix, for example, the row and column where the non-zero element is located, can be described by a base graph (BG).

If the size of the base matrix H _b is m _b × n _b , the size of the check matrix H is (m _b · Z) × (n _b · Z), where Z is called the spreading factor of the check matrix.

The expression of the check matrix H of QC-LDPC is given below:

是零矩阵或循环移位矩阵，其中，循环移位矩阵是对Z×Z大小的单位矩阵I循环移位a _ij位得到的。因此，也将a _ij称作循环移位矩阵的移位因子，在有些示例中，a _ij也可表示为P _i,j。a _ij的取值范围是-1≤a _ij<Z。 In equation (1), each element of the check matrix H

Is a zero matrix or cyclic shift matrix, wherein the cyclic shift matrix is obtained by cyclically shifting the a _ij bit of the unit matrix I of the Z×Z size. Therefore, a _ij is also referred to as the shift factor of the cyclic shift matrix, and in some examples, a _ij can also be expressed as P _i,j . The range of a _ij is -1 ≤ a _ij <Z.

If the check matrix H is a full rank matrix, then (n _b -m _b )·Z information bits can be placed in the (n _b -m _b ) column of the base matrix, we will (n _b -m _b ) of the base matrix The column is called the information column and let k _b =n _b -m _b .

When QC-LDPC encoding is employed, if the length K of the information sequence is divisible by k _b , then each information bit position after expansion is used to place information bits. If K is not divisible by k _b , resulting in Z·k _b >K, there will be (Z·k _b -K) redundant information bit positions in the parity check matrix H of the extended LDPC, which may be referred to as padding bits.

2 is a schematic diagram of a check matrix for constructing an LDPC based on a matrix. Referring to Figure 2, where A represents the number of bits shifted and I is the identity matrix. It is well known to those skilled in the art that a linear block code having a code length of N and a number of information bits K can be defined by a generator matrix G _K×N . The information sequence S _L×K to be encoded is mapped to the code words by the generator matrix G _K×N . The linear block code can also be equivalently described by a check matrix H _{(NK) × K.}

The flow of determining the check matrix of the QC-LDPC specified in the new radio (NR) will be described below.

(1) Determine k _b based on the length K of the information sequence.

Specifically, the process of determining k _b according to the length K of the information sequence is as follows:

If K>640

k _b =10;

Else if K>560

k _b =9;

Else if K>192

k _b =8;

Else

k _b =6

End

(2) Determine the spreading factor Z according to k _b .

Specifically, the determined expansion factor Z must satisfy the expression (2), and the value of Z must fall into Table 1.

k _b ×Z>K (2)

Table 1

It should be noted that, in the step (2), if the value of Z satisfying the expression (2) is not an integer, the Z is rounded up, so that the value of Z falls into Table 1.

For example, if Z=65.5 of the expression (2) is satisfied, then 65.5 is rounded up, and the value of Z should be the smallest integer greater than 65.5 in Table 1, which is 72.

According to Table 1, the index corresponding to the value of Z (corresponding to the value of set indexi _LS in Table 1) is determined.

As can be seen in Table 1, the index corresponding to 72 is 5.

(3) The check matrix is determined according to the spreading factor Z.

Specifically, according to the value of the expansion factor Z, an index corresponding to the value of Z is obtained. Taking the above Table 1 as an example, the extension factor Z is determined, and the corresponding value of the set index i _LS is obtained. A check matrix is determined based on the value. Taking Table 2 as an example, Table 2 is an example of a check matrix. The check matrix can be determined by querying Table 2 below.

In Table 2, the first column and the second column are respectively a row index and a column index of a non-zero element, which can be used as information of the base map, and are represented here as H _BG . Among them, for each set indexi _LS , each non-zero element has a corresponding value V _i,j . The shift factor P _i,j = mod(V _i,j ,Z) is correspondingly shifted.

Table 2

Here, an example is given to determine the check matrix by querying the table according to the index corresponding to Z.

For example, the above Z=72 is taken as an example, and the index corresponding to 72 is 5.

In order to obtain a check matrix corresponding to Z=72, it is necessary to perform a remainder operation on each element pair 72 of the matrix corresponding to the index 5 in Table 2 (ie, Set index i _LS = 5 in Table 2). That is, the shift factor P _i,j in the check matrix corresponding to Z=72 is mod(V _i,j , 72), where Vi _{and j} are non-i rows and j columns in the matrix corresponding to the index 5 The value of the zero element. V _{i,j is} the remainder of 72, and the resulting remainder is the shift factor of the cyclic shift matrix of the non-zero element corresponding to Z=72. In a possible implementation, each non-zero element may be replaced by a Z×Z-sized cyclic shift matrix to obtain a check matrix, where each cyclic shift matrix is a non-zero of the unit matrix I according to the position. The shift factor of the element is obtained by cyclic shifting.

(4) Encoding according to the check matrix.

The flow of determining the check matrix of the QC-LDPC in the prior art is described above. When determining the spreading factor Z of the check matrix, the performance of the block error rate (BLER) is equal to 10 ^-2 , and the performance of the BLER at other values is not considered, so it will appear in some places. Error leveling affects decoding performance.

3 is a graph comparing the performance of an LDPC code and a polarization code when K=94 and N=420. Referring to FIG. 3, compared with the polarization code (ie, Polar code), the LDPC exhibits a relatively significant error leveling layer when the BLER is less than 10 ^-4 . Where N is the length after encoding.

It should be noted that FIG. 3 is a graph of BLER obtained by iterating 20 times according to the BG2 matrix and (layered offset min-sum, LOMS) decoding algorithm.

The BG2 matrix is the matrix HBG defined in Table 2 above.

The LOMS decoding algorithm is one of the decoding algorithms of the LDPC. At present, the common LDPC decoding algorithms are evolved based on a message passing algorithm, which is also called a belief propagation algorithm. The LOMS decoding algorithm is a variant of the message passing algorithm, which is characterized by iterative calculation between the check node and the bit node (also called a variable node). Details regarding the LOMS algorithm and the check nodes and bit nodes can be referred to the prior art and will not be described in detail herein.

It is well known to those skilled in the art that when studying the frame error rate and/or bit error rate of LDPC, the performance under different signal to noise ratios will be analyzed. The decoding performance curve is usually divided into two regions: a low/medium signal to noise ratio region and a high signal to noise ratio region. In the low/medium signal-to-noise ratio region, the decisive factor causing the error is that the signal-to-noise ratio is too low. Due to insufficient signal strength, a large number of erroneous bits occur and the bit error rate is high. In the high signal-to-noise ratio region, the signal strength is already large enough, and decoding failures are still mainly caused by trap sets. The concept of trap sets can be referred to the prior art and will not be described in detail herein.

The error leveling layer refers to a sudden decrease in the error performance curve from the low/medium channel to the high signal to noise ratio region.

In some systems, the bit error rate is required to be extremely low, such as data storage and optical communication systems, requiring bit error rates below 10 ^-12 to 10 ^-15 . Therefore, how to reduce the error leveling of LDPC codes is one of the key issues in practical applications of LDPC.

To this end, the present application proposes a method of information processing. The LDPC constructed by this method helps to reduce the error leveling layer occurring in the decoding process, so as to improve the decoding performance of the LDPC.

Referring to FIG. 4, FIG. 4 is a schematic flowchart of a method 200 for processing information according to an embodiment of the present application. Method 200 can be performed by a sender of information and/or data. The sender of information and/or data can also be considered as the encoding end. For example, it is executed by the terminal device 102 in the uplink transmission scenario shown in FIG. 1. For another example, it can be performed by the network device 101 in the downlink transmission scenario shown in FIG.

The main steps 210-230 of the method 200 of the embodiment of the present application are described in detail below.

210. Determine a correction value of the first spreading factor and the first spreading factor.

The first spreading factor here refers to the spreading factor of the check matrix of the LDPC, that is, the spreading factor Z described above.

In the embodiment of the present application, whether the modification of the first spreading factor needs to be performed may be determined according to the length K of the information sequence.

For ease of understanding and differentiation, the expansion factor before the correction is referred to as a first expansion factor, and the expansion factor after correction is referred to as a second expansion factor.

Through performance simulation, it can be found that at some given error rate BLER, the length K of the information sequence has an error leveling layer on some values, and the expansion factor corresponding to the length K of these information sequences can be corrected.

There are several ways to determine if the length K of the information sequence is at a given BLER for the presence of an error leveling layer. Only two examples are given in this article.

Referring to FIG. 5, FIG. 5 is a schematic diagram of a BLER obtained by taking a BG2 matrix and an LOMS algorithm in the NR as an example. 5, with K=96 and N=420 as an example, a method for judging whether the length K=96 of the information sequence is at BLER=1e-5 and BLER=1e-6 is present, as in the following manner 1 Said.

Mode 1

It is determined whether there is an error leveling layer according to the slope of the curve and the preset decision threshold.

In mode 1, the three-segment curve slopes K1, K2, and K3 are first defined. Where K1 is the slope of BLER=1e-2 to BLER=1e-3. K2 is the slope of BLER = 1e-4 to BLER = 1e-5. K3 is the slope of BLER = 1e-5 to BLER = 1e-6.

A comparison of these slopes is compared to a predetermined decision threshold to determine if there is an error leveling.

Specifically, the change in these slopes is compared to a predetermined decision threshold. If the change in slope is greater than or equal to the predetermined decision threshold, then an error leveling is considered. If the change in slope is less than the preset decision threshold, then there is no error leveling.

Further, the decision threshold is an integer greater than 1, for example, 1.1, 1.2, 1.3, 1.4, 1.5, and the like. Among them, the decision threshold is set according to the strictness of the judgment. If the decision to level the error is relatively strict, the decision threshold can be set higher. If the decision to level the error is relatively loose, the decision threshold can be set lower.

It should be noted that whether the length K of the information sequence has an error leveling layer is for a certain BLER. In other words, it is judged whether or not the length K of the information sequence has an error leveling layer, that is, whether or not the length K of the information sequence has an error leveling layer at a certain BLER.

For example, if it is judged whether K=96 has an error leveling layer at BLER=1e-5, it is determined whether K1/K2 ≥ the decision threshold value 1 is established. If K1/K2 ≥ the decision threshold value of 1, it is considered that K=96 has an error leveling layer at BLER=1e-5.

For another example, if it is judged whether K=96 has an error leveling layer at BLER=1e-6, it is determined whether K1/K3 ≥ the decision threshold value 2 is established. If K1/K3 ≥ decision threshold 2, then K = 96 is considered to have an error leveling at BLER = 1e-6.

The lengths of the information sequence according to the method in Mode 1 are given below as K=[40,48,56 64,72,80,88,96,104,112,120,128,136,144,152,160,168,176,184,192,200,208,224,240,256,272,288,304,320,336,352,368,384,400, 424, 448,472, 688, 520, 544, 568, 592, 624, 688, 688, 720, 752, 784, 824, 864, 944, 1000, 1048, 1080, 1144, 1176, 1208, 1240, 1272 , 1304, 1336, 1368, 1432, 1496, 1560, 1624, 1688, 1752, 1816, 1880, 1944, 2040, 2104, 2168, 2232, 2296, 2424, 2488, 2552, 2616, 2680, 2744, 2808, 2872 , 2992, 3120, 3256, 3384, 3512, 3640, 3768, 3840], and the error rate is [1/12, 1/8, 1/6, 1/3, 1/2, 2/3] Flat statistical results.

Table 3 is the statistical result of the error leveling at the decision threshold = 1.5 and BLER equal to 1e-5. Table 4 is the statistical result of the error leveling at the decision threshold = 1.1 and BLER equal to 1e-6.

Among them, 0 in the table indicates that there is no error leveling layer, and 1 in the table indicates that there is an error leveling layer.

table 3

Table 4

The statistical results of the error leveling at the decision threshold = 1.1 and BLER = 1e-5 are given in Table 5 below. The statistical results of the error leveling at the decision threshold = 1.1 and BLER = 1e-5 are given in Table 6 below.

table 5

Table 6

Mode 2

Determine if there is an error leveling based on the performance curve.

Referring to Fig. 6, Fig. 6 is an example of determining whether or not there is an error leveling layer based on a performance curve. Fig. 6 is a graph showing the signal-to-noise ratio (SNR) required for K = 96, BLER = 1e-1, and code rates R of 0.67, 0.5, 0.33, 0.17, 0.13, and 0.08, respectively. . The spike in Figure 5 means that an error leveling has occurred. By correcting the expansion factor corresponding to the peak position, you can skip these error leveling layers. Specifically, the fitting can be performed at a performance curve corresponding to each code rate. The raw data is then compared to the fitted data for comparison. If the difference exceeds the preset decision threshold, then an error leveling is considered.

7 to 11 respectively show K=96, and BLER is 1e-2, 1e-3, 1e-4, 1e-5, and 1e-6, respectively, and the code rates R are 0.67, 0.5, 0.33, 0.17, and 0.13, respectively. A plot of the signal-to-noise ratio (SNR) required at 0.08. The method for judging whether there is an error leveling is similar to that of FIG. 5, and will not be repeated here.

It should be noted that the performance curves in Figures 5-11 are simulated in an additive white Gaussian noise (AWGN) environment.

In addition, the length K of the sequence of information in Figures 6-11 includes check bits. As shown in Figures 6-11, the parity bit is 24 bits. For example, the 24-CRC shown in Figure 6. Where CRC represents a cyclic redundancy check.

It should be understood that the above manners 1 and 2 are only examples for judging whether there is an error leveling layer, and those skilled in the art may also judge the length K of the information sequence according to other methods for determining the error leveling layer. There is a fault leveling layer at the BLER, which is not limited in this application.

It can be understood that it is not absolute whether the length K of the information sequence has an error level at a given BLER. For example, it has been described above that the decision threshold is related to the degree of rigor of the decision leveling layer. Therefore, whether the length K of the information sequence has an error leveling layer at a certain BLER is related to the size of the set decision threshold value. Alternatively, when other methods are used to determine whether there is an error leveling layer, it may be related to other factors. Therefore, the present application does not limit the method of determining which level of error is to be used. In other words, any method of determining the error leveling layer can be used, and in the case where there is an error leveling layer, the expansion factor of the check matrix can be corrected using the method of the present application to minimize the error level. Floor.

As an optional embodiment, the transmitting end may determine the first spreading factor by the process of determining the spreading factor of the check matrix in the NR described above. That is, the first spreading factor is determined based on the length K of the information sequence.

The correction value of the first spreading factor may be related to the length of the information sequence. Alternatively, it may be related to the length K of the information sequence and the code rate R. In a possible implementation manner, the correction value of the first expansion factor may be determined by looking up a table.

Alternatively, at least one of the following Table 7 may be satisfied between the correction value of K and the first spreading factor. The first spreading factor is corrected according to the correction value of the first spreading factor given in Table 7, and the information sequence K<400 (for example, K=96, 152, 176, etc.) in Table 5 can be eliminated at BLER=1e- The error that occurred at 5 levels was flat.

Table 7

Length of information sequence K Correction value of the first expansion factor 96 1 152 1 176 1 272 2 304 2 368 2 400 3

Alternatively, at least one of the following Table 8 may be satisfied between the correction value of K and the first spreading factor. The first spreading factor is corrected according to the correction value of the first spreading factor given in Table 8, and the information sequence K<400 (for example, K=96, 152, 176, etc.) in Table 6 can be eliminated at BLER=1e- Errors appearing at 6 levels.

Table 8

Length of information sequence K Correction value of the first expansion factor 96 1 152 1 176 1 272 2 368 2 400 6

It can be seen that Tables 7 and 8 are mainly corrected for the length K of the information sequence. Further, in order to achieve finer adjustment, the first spreading factor may be corrected in conjunction with the code rate R with reference to Tables 7 and 8, instead of only correcting for the K pair.

Table 9

Those skilled in the art will appreciate that the six values of the code rate R are given in Table 9, but this is only an example. In the encoding process, if the actually used code rate is not equal to any of the six values given in Table 9, other methods may be used to determine the correction value of the first spreading factor.

As is well known, the value of the code rate R is 0 < R < 1, and therefore, the interval (0, 1) of the six code rates shown in Table 9 can be divided into six intervals, each of which corresponds to one correction value. Thus, according to the interval in which the actually used code rate falls, the first spreading factor is corrected by using the correction value corresponding to the interval. See Table 10.

Table 10

220. Determine a parity check matrix according to the first spreading factor and the modified value of the first spreading factor.

After the step 210 determines the correction values of the first expansion factor and the first expansion factor respectively, the first expansion factor is corrected by using the correction value of the first expansion factor to obtain the modified expansion factor. For example, the first spreading factor can be added to the corrected value to obtain a modified spreading factor. Alternatively, it may be another correction method.

Next, the check matrix is determined using the second spreading factor.

The process of determining the check matrix according to the second spreading factor is the same as the process of the step (3) in the flow of determining the check matrix by the lookup table 2 according to the spreading factor Z in the NR described above. In order to avoid redundancy, it will not be described in detail here.

It should be noted that if the second spreading factor obtained after the first spreading factor is modified does not belong to the table 1, the value of the second spreading factor may be directly subjected to a residual operation to determine the check matrix.

230. Encode the information sequence using a check matrix.

Step 240 can be seen in the prior art and will not be described in detail herein.

Subsequently, the transmitting end may send the encoded codeword to the receiving end.

The receiving end receives the sequence to be decoded, and determines the check matrix H in the same manner as the transmitting end. Finally, the receiving end decodes the sequence to be decoded using the check matrix to obtain a decoded sequence.

In the encoding method of the embodiment of the present application, when the spreading factor Z of the check matrix is determined, the position of the erroneous leveling layer is skipped, thereby improving the decoding performance.

It should be noted that skipping the position with the wrong leveling layer only increases the number of puncturing bits in the check matrix without any other influence, so there is no other performance loss. .

The coding method of the embodiment of the present application has been described in detail above. The coding apparatus of the embodiment of the present application will be described below with reference to FIG. 12 and FIG.

FIG. 12 is a schematic block diagram of an apparatus 600 for processing information according to an embodiment of the present application. The device 600 mainly includes a processing unit 610 and a transmitting unit 620. The processing unit 610 is configured to:

Determining a correction value of the first expansion factor and the first expansion factor;

Determining a check matrix according to the first spreading factor and the correction value of the first spreading factor;

The information sequence of length K is encoded using a check matrix, and K is a positive integer.

Further, the sending unit 620 is configured to send the encoded codeword.

It should be understood that when the processing unit 610 is used for encoding, it may also be referred to as a coding unit.

Each unit in the apparatus 600 of the embodiment of the present application and the other operations or functions described above are respectively for implementing the method for processing information in the embodiment of the present application. For the sake of brevity, it will not be repeated here.

In one possible design, when part or all of the functions of the apparatus 600 are implemented by hardware, the apparatus 600 includes: an input interface circuit for acquiring a sequence of information; and logic circuitry for determining the first spreading factor and the first extension The correction value of the factor, the check matrix is determined according to the first spreading factor and the correction value, and the information sequence of length K is encoded according to the check matrix, K is a positive integer; and the output interface circuit is configured to output the encoded codeword.

In one possible design, when the above functions of the device 600 are all implemented by hardware, the device 600 includes: a memory for storing a program; a processor for executing the program stored by the memory when the program is executed Apparatus 600 may implement the method of processing information as described in any of the possible designs above.

Alternatively, device 600 can be a chip or an integrated circuit.

In one possible design, when some or all of the above functions of device 600 are implemented by software, device 600 includes a processor and a memory. The processor implements the above described functions of device 800 by reading stored software code in memory. The above described memory and memory may be physically separate units, or the memory may be integrated with the processor.

FIG. 13 is a schematic structural diagram of an apparatus 700 for processing information according to an embodiment of the present application. As shown in FIG. 13, device 700 includes one or more processors 701, one or more memories 702. Optionally, device 700 may also include one or more transceivers 703. The processor 701 is configured to control the transceiver 703 to send and receive signals, the memory 702 is used to store a computer program, and the processor 701 is configured to call and run the computer program from the memory 702, so that the device 700 performs the corresponding process of processing information of the embodiment of the present application. And / or operation. I will not repeat them here.

It should be noted that the apparatus 600 shown in FIG. 12 can be implemented by the apparatus 700 shown in FIG. For example, processing unit 610 can be implemented by processor 701, and transmitting unit 620 can be implemented by transceiver 703, and the like.

Furthermore, the present application provides a computer readable storage medium having stored therein computer instructions that, when executed on a computer, cause the computer to perform processing information as described in any one of the embodiments herein method.

The present application also provides a computer program product comprising computer program code for causing a computer to perform a method of processing information as described in any one of the embodiments of the present application when the computer program code is run on a computer.

The present application also provides a chip (or a chip system) including a memory and a processor for storing a computer program, the processor for calling and running the computer program from the memory, such that the communication device on which the chip is mounted executes the program A method of processing information of an embodiment is applied.

The communication device described herein may be the transmitting end or the encoding end of the information. For example, in uplink transmission, the terminal device is equipped with the chip to encode the information sequence, such as the terminal device 102 shown in FIG. At the time of downlink transmission, the network device 101 is equipped with the chip to encode the information sequence.

In addition, the present application also provides an apparatus 800 for processing information. Referring to FIG. 14, FIG. 14 is a schematic block diagram of an apparatus 800 for processing information according to an embodiment of the present application. The device 800 mainly includes a receiving unit 810 and a processing unit 820. The receiving unit 810 is configured to receive a sequence to be decoded. The processing unit 820 is configured to determine a correction value of the first spreading factor and the first spreading factor; determine a check matrix according to the first spreading factor and the modified value of the first spreading factor; and decode the sequence to be decoded using the check matrix.

Wherein, when the processing unit 820 is used for decoding, it may also be referred to as a decoding unit (or a decoding unit).

The device 800 referred to herein may be the receiving end or the decoding end of the information. Taking FIG. 1 as an example, when uplinking, the device 800 may be the network device 101, and decode the received information (or the sequence to be decoded) from the terminal device 102. In the downlink transmission, the device 800 may be the terminal device 103, which decodes the received information from the network device 101.

In one possible design, when some or all of the described functions of device 800 are implemented in hardware, device 800 may be a logic circuit, an integrated circuit, or the like. For example, the apparatus 800 includes: an input interface circuit, configured to acquire a sequence to be decoded; a logic circuit, configured to determine a first spreading factor and a correction value of the first spreading factor, and determine a check matrix according to the first spreading factor and the modified value, And decoding the sequence to be decoded according to the check matrix; and outputting an interface circuit for outputting the decoded sequence.

In one possible design, when the above-described functions of the device 800 are all implemented by hardware, the device 800 includes: a memory for storing a program; a processor for executing the program stored by the memory when the program is executed Apparatus 800 can implement a process for decoding a sequence to be decoded.

Alternatively, device 800 can be a chip or an integrated circuit.

In one possible design, when some or all of the above described functions of device 800 are implemented in software, device 800 includes a processor and a memory. The processor implements the above described functions of device 800 by reading stored software code in memory. The memory can be integrated in the processor or external to the processor.

FIG. 15 is a schematic structural diagram of an apparatus 900 for processing information according to an embodiment of the present application. As shown in FIG. 15, device 900 includes one or more processors 901, one or more memories 902. Optionally, device 900 may also include one or more transceivers 903. The processor 901 is configured to control the transceiver 903 to send and receive signals, the memory 902 is used to store a computer program, and the processor 901 is configured to call and run the computer program from the memory 902, such that the device 900 performs a corresponding process of decoding the sequence to be coded. And / or operation. I will not repeat them here.

It should be noted that the device 800 shown in FIG. 14 can be implemented by the device 900 shown in FIG. For example, receiving unit 810 can be implemented by transceiver 903, and processing unit 820 can be implemented by processor 901, and the like.

In addition, the present application provides a computer readable storage medium having stored therein computer instructions for causing a computer to perform decoding of a sequence to be decoded in an embodiment of the present application when the computer instruction is run on a computer Corresponding processes and/or operations.

The present application also provides a computer program product, comprising: computer program code, when the computer program code is run on a computer, causing the computer to perform a corresponding process of decoding the sequence to be decoded in the embodiment of the present application and/or Or operation.

The present application also provides a chip (or a chip system) including a memory and a processor for storing a computer program, the processor for calling and running the computer program from the memory, such that the communication device on which the chip is mounted executes the program The corresponding flow and/or operation of decoding the sequence to be decoded in the application embodiment.

The communication device described herein may be the receiving end or the decoding end of the information. For example, at the time of uplink transmission, the network device 101 is installed with the chip. At the time of downlink transmission, the terminal device 103 is mounted with the chip.

In the above embodiments, the processor may be a central processing unit (CPU), a microprocessor, an application-specific integrated circuit (ASIC), or one or more programs for controlling the program of the present application. Execution of integrated circuits, etc. For example, the processor can include a digital signal processor device, a microprocessor device, an analog to digital converter, a digital to analog converter, and the like. The processor can distribute the control and signal processing functions of the mobile device among the devices according to their respective functions. Additionally, the processor can include functionality to operate one or more software programs, which can be stored in memory. The functions of the processor may be implemented by hardware or by software executing corresponding software. The hardware or software includes one or more units corresponding to the functions described above.

The memory can be a read-only memory (ROM) or other type of static storage device that can store static information and instructions, a random access memory (RAM) or other type of information and instructions that can be stored. Dynamic storage device. It can also be an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, and a disc storage (including a compact disc, a laser disc, a compact disc, a digital versatile disc, a Blu-ray disc, etc.), a disk storage medium or other magnetic storage device, or any other device that can be used to carry or store desired program code in the form of an instruction or data structure and accessible by a computer. Medium, but not limited to this.

The functions may be stored in a computer readable storage medium if implemented in the form of a software functional unit and sold or used as a standalone product. Based on such understanding, the technical solution of the present application, which is essential or contributes to the prior art, or a part of the technical solution, may be embodied in the form of a software product, which is stored in a storage medium, including The instructions are used to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present application. The foregoing storage medium includes various media that can store program codes, such as a USB flash drive, a mobile hard disk, a ROM, a RAM, a magnetic disk, or an optical disk.

The foregoing is only a specific embodiment of the present application, but the scope of protection of the present application is not limited thereto, and any person skilled in the art can easily think of changes or substitutions within the technical scope disclosed in the present application. It should be covered by the scope of protection of this application. Therefore, the scope of protection of the present application should be determined by the scope of the claims.

Claims (15)

A method of processing information, comprising: Determining a first expansion factor and a correction value of the first expansion factor; Determining a check matrix according to the first spreading factor and the correction value; A sequence of information of length K is encoded using the check matrix, the K being a positive integer. The method according to claim 1, wherein the correction value of the K and the first spreading factor satisfies at least one of the following tables: Length of information sequence K Correction value of the first expansion factor 96 1 152 1 176 1 272 2 304 2 368 2 400 3 The method according to claim 1, wherein the correction value of the K and the first spreading factor satisfies at least one of the following tables: Length of information sequence K Correction value of the first expansion factor 96 1 152 1 176 1 272 2 368 2 400 6 The method according to any one of claims 1 to 3, wherein determining the correction value of the first expansion factor comprises: A correction value of the first spreading factor is determined according to the K and the code rate R. The method according to claim 4, wherein said K, the correction value of said first spreading factor and said code rate R satisfy at least one of the following tables:

An apparatus for processing information, comprising: a processing unit, configured to determine a first expansion factor and a correction value of the first expansion factor; The processing unit is further configured to determine a check matrix according to the first expansion factor and the correction value; The processing unit is further configured to encode a sequence of information of length K using the check matrix, the K being a positive integer. The apparatus according to claim 6, wherein the correction value of said K and said first spreading factor satisfies at least one of the following tables: Length of information sequence K Correction value of the first expansion factor 96 1 152 1 176 1 272 2 304 2 368 2 400 3 The apparatus according to claim 6, wherein the correction value of the K and the first spreading factor satisfies at least one of the following tables: Length of information sequence K Correction value of the first expansion factor 96 1 152 1 176 1 272 2 368 2 400 6 The apparatus according to claim 6, wherein the processing unit is specifically configured to determine a correction value of the first spreading factor according to the K and a code rate R. The apparatus according to claim 9, wherein said K, said correction value of said first spreading factor and said code rate R satisfy at least one of the following tables:

A terminal characterized by comprising the apparatus according to any one of claims 6 to 10. A base station, comprising the apparatus of any one of claims 6 to 10. A communication system comprising the terminal of claim 11 and the base station of claim 12. A computer readable storage medium comprising instructions which, when executed on a computer, cause the computer to perform the method of any one of claims 1 to 5. A computer program product, when run on a computer, causes the computer to perform the method of any one of claims 1 to 5.

Images