CN114499758B - Channel coding method, device, equipment and computer readable storage medium - Google Patents

Abstract

This application relates to a channel coding method, device, equipment and computer-readable storage medium. The sending device processes the transmission blocks to be encoded in blocks to obtain at least one code block; then, the coding base map is used to perform low-density parity and parity processing on each code block. Check code encoding, wherein each code block includes information bits and padding bits, and the padding position of the padding bits is related to the column weight of the coding base diagram corresponding to the transport block. Using the above method can improve the decoding performance of the receiving device.

Description

Channel coding method, device, equipment and computer-readable storage medium

Technical field

The present application relates to the field of signal processing technology, and in particular to a channel coding method, device, equipment and computer-readable storage medium.

Background technique

With the development of communication technology, higher demands have been placed on encoding methods in communication equipment. In a New Radio (NR for short) system, it may include user equipment and access network equipment, and the above user equipment and access network equipment may be used as transmitting equipment to send signals. The above-mentioned sending device can encode a set of information bits based on a Low Density Parity Check Code (LDPC) code to generate a codeword to support a wide range of code rates, block lengths and granularities.

In the process of encoding information bits, the sending device can divide the Transport Block (TB) into several Code Blocks (CB) of equal length. Each CB may include information bits and padding bits. The position of the above-mentioned padding bits is generally located after the information bits, resulting in poor decoding performance in some scenarios after the receiving device performs decoding based on the above-mentioned codewords.

Contents of the invention

The embodiments of the present application provide a channel coding method, device, equipment and computer-readable storage medium, which can improve the decoding performance of the equipment.

In the first aspect, a channel coding method is applied to the sending device, including:

Process the transport block to be encoded in blocks to obtain at least one code block; each code block includes information bits and padding bits; the padding position of the padding bits is related to the column weight of the coding base map corresponding to the transport block;

The coding base map is used to encode each code block with a low-density parity check code.

In the second aspect, a channel decoding method is applied to receiving equipment, including:

Add padding bits to the padding position in the transmission codeword to be decoded; the padding position is related to the column weight of the coding base map corresponding to the transmission codeword;

The coding base map is used to decode the low-density parity check code of the filled transmission codeword.

In the third aspect, a channel coding device is applied to sending equipment, including:

The blocking module is used to process the transport block to be encoded in blocks to obtain at least one code block; each code block includes information bits and padding bits; the padding position of the padding bits is related to the column weight of the coding base map corresponding to the transport block ;

The encoding module is used to encode low-density parity check codes for each code block using the encoding base map.

In the fourth aspect, a channel decoding device is applied to receiving equipment, including:

A padding module, used to add padding bits at padding positions in the transmission codeword to be decoded; the padding position is related to the column weight of the coding base diagram used when encoding the transmission block corresponding to the transmission codeword;

The decoding module is used to decode the low-density parity check code of the filled transmission codeword using the encoding base map.

In a fifth aspect, a sending device includes a memory and a processor. A computer program is stored in the memory. When the computer program is executed by the processor, it causes the processor to perform the steps of the channel coding method in the first aspect.

In a sixth aspect, a receiving device includes a memory and a processor. A computer program is stored in the memory. When the computer program is executed by the processor, it causes the processor to perform the steps of the channel decoding method in the second aspect.

A computer-readable storage medium on which a computer program is stored, characterized in that when the computer program is executed by a processor, the steps of the method in the first and second aspects are implemented.

According to the above channel coding method, device, equipment and computer-readable storage medium, the sending device divides the transmission block to be encoded into blocks to obtain at least one code block; then, uses the coding base map to perform low-density parity check code on each code block Encoding, wherein each code block includes information bits and padding bits, and the padding position of the padding bits is related to the column weight of the coding base diagram corresponding to the transport block. Since the greater the column weight of the column in the coding base diagram, the more check equations are associated when encoding using the coding base diagram; in the embodiment of the present application, the sending device determines the stuffing bits based on the column weight of the column in the coding base diagram. Compared with adding padding bits directly at the end of the information bits, the padding bits can participate in more parity check equations, so that when the receiving device iteratively decodes the received transmission codeword, more errors can be eliminated. More uncertainty factors can bring better decoding performance.

Description of the drawings

In order to explain the embodiments of the present application or the technical solutions in the prior art more clearly, the drawings needed to be used in the description of the embodiments or the prior art will be briefly introduced below. Obviously, the drawings in the following description are only These are some embodiments of the present application. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without exerting creative efforts.

Figure 1 is an application environment diagram of the channel coding method in one embodiment of the present application;

Figure 2 is a flow chart of a channel coding method in an embodiment of the present application;

Figure 3 is a schematic diagram of the filling position in one embodiment of the present application;

Figure 4 is a schematic diagram of the number of columns corresponding to filling positions in an embodiment of the present application;

Figure 5 is a schematic diagram of the number of columns corresponding to filling positions in an embodiment of the present application;

Figure 6 is a schematic diagram of the filling position in one embodiment of the present application;

Figure 7 is a schematic diagram of the filling position in one embodiment of the present application;

Figure 8 is a schematic diagram comparing decoding performance in an embodiment of the present application;

Figure 9 is a schematic diagram comparing decoding performance in an embodiment of the present application;

Figure 10 is a schematic diagram comparing decoding performance in an embodiment of the present application;

Figure 11 is a flow chart of a channel decoding method in an embodiment of the present application;

Figure 12 is a structural block diagram of a channel coding device in an embodiment of the present application;

Figure 13 is a structural block diagram of a channel coding device in an embodiment of the present application;

Figure 14 is a structural block diagram of a channel decoding device in an embodiment of the present application;

Figure 15 is a schematic structural diagram of a sending device in an embodiment of the present application;

Figure 16 is a schematic structural diagram of a receiving device in an embodiment of the present application.

Detailed ways

In order to make the purpose, technical solutions and advantages of the present application more clear, the present application will be further described in detail below with reference to the drawings and embodiments. It should be understood that the specific embodiments described here are only used to explain the present application and are not used to limit the present application.

Figure 1 is a schematic diagram of the application environment of the channel coding method in one embodiment. As shown in Figure 1, the application environment includes a sending device 102 and a receiving device 104 that communicate with each other. The sending device 102 may be a network device or a user device; accordingly, the receiving device 104 may be a user device or a network device, which is not limited here. The above network device can be any device with wireless transceiver function. Including but not limited to: base station NodeB, evolved base station eNodeB, base station in the fifth generation (5G) communication system, base station or network equipment in future communication system, access node in WiFi system, wireless relay nodes, wireless backhaul nodes, etc. The network device may also be a wireless controller in a cloud radio access network (CRAN) scenario. The network equipment can also be a small station, a transmission reference point (TRP), a road side unit (RSU), etc. The embodiments of this application do not limit the specific technologies and specific equipment forms used by the above network equipment. The above-mentioned user equipment may be a device with a wireless transceiver function, and may be, but is not limited to, a handheld, wearable, or vehicle-mounted device. User equipment can be mobile phones, tablets, computers with wireless transceiver functions, virtual reality (VR) terminal equipment, augmented reality (AR) terminal equipment, wireless terminals in industrial control (industrial control), unmanned Wireless terminals in self-driving, wireless terminals in remote medical, wireless terminals in smart grid, wireless terminals in transportation safety, smart city Wireless terminals in smart homes, wireless terminals in smart homes, etc. The embodiments of this application do not limit application scenarios.

Figure 2 is a flow chart of a channel coding method in an embodiment. The channel coding method in this embodiment is described by taking it running on the sending device in Figure 1 as an example. As shown in Figure 2, the above methods include:

S101. Process the transport block to be encoded in blocks to obtain at least one code block; each code block includes information bits and padding bits; the padding position of the padding bits is related to the column weight of the coding base diagram corresponding to the transport block. .

Wherein, the above-mentioned transport block to be encoded may be a message that is processed by a multimedia control layer (Medium AcdessControl, referred to as MAC layer) in the sending device and then transferred to the physical layer. The above-mentioned transport block may be a message transmitted by a data channel in the physical layer. When the above-mentioned sending device is a network device, the above-mentioned data channel may be a Physical Downlink Shared Channel (PDSCH), and the above-mentioned transmission block may carry downlink unicast data, a paging message, or a system message. When the above-mentioned sending device is user equipment, the above-mentioned data channel may be a Physical Uplink Shared Channel (PUSCH for short), and the above-mentioned transmission block may carry uplink service data.

The sending device can perform LDPC encoding on the transport block and convert the transport block into a series of bit stream data to be transmitted. The above-mentioned LDPC coding is a linear coding method close to the Shannon limit, and a linear block code with a sparse check matrix can be used to encode the transmission block.

Before the sending device performs LDPC encoding on the transmission block, it needs to select the corresponding encoding base image. The above-mentioned coding base pictures can include two types, namely base picture 1 (BG1) and base picture 2 (BG2). The above-mentioned BG1 is mainly used when the transmission block is long or the code rate is high, and the above-mentioned BG2 can be used when the transmission block is relatively long. Short, the first-level code rate is low. The above-mentioned BG1 supports a code block length with a maximum value of K _cb =8448. BG1 consists of 0 and 1 to form a 46×68 matrix, and the corresponding maximum number of columns K _bmax for information bits is 22. The above-mentioned BG2 supports a code block length with a maximum value of K _cb =3840. BG1 consists of 0 and 1 to form a 42×52 matrix, and the corresponding maximum number of columns K _bmax for information bits is 10.

Since the code block size that can be transmitted in a single transmission of the coding base map is limited, the transmission blocks need to be divided into blocks. The sending device can add a CRC check code to the transmission block, and then segment the transmission block with the CRC check code added. The sending device can divide the transmission block into several code blocks of equal length. The number of information bits in the above code block may be K′, and the sending device may add padding bits to the code block so that the length of the code block is an integer multiple of the boost value Z.

The length of the above-mentioned transport block with added CRC check code can be B, and the sending device can select the number of columns K _b occupied by the corresponding information bits in the coding base diagram according to the transport block length B. The selection method of the above K _b can be as follows: when the coding base picture is BG1, take K _b =22; when the coding base picture is BG2, if B>640, then K _b =10; if 640≥B >560, then K _b =9; if 560≥B>192, then K _b =8; if B≤192, then K _b =6. On the basis of determining K _b , the sending device can select the promotion value Z that meets the conditions from the preset promotion value list.

The above-mentioned improvement value Z is the minimum value satisfying the relational expression K _b ·Z≥K′. When K _bmax ·Z>K′, padding bits need to be added to the code block to meet the coding format requirements of LDPC. After the filling is completed, the length of each code block is K=K _bmax ·Z, that is, the number of filling bits is F=K'-K.

The padding position of the padding bits is related to the column weight of the encoding base picture corresponding to the transport block. Among them, the above-mentioned column weight is the number of 1 contained in a column in the encoding base map. The above filling position may be located in the column with the largest column weight, or may be located in the column with the second largest column weight, which is not limited here. When the number of padding bits is large, the padding positions may occupy multiple columns, and the multiple columns may include the column with the largest column weight, or may be multiple columns with similar column weights. As shown in Figure 3, the above-mentioned padding bits may correspond to the 3rd column and the 5th column in the encoding base image.

The above-mentioned stuffing bits may be 0 elements or 1 elements. Optionally, the above-mentioned stuffing bits may be a bit combination formed by alternating 0s and 1s. The alternation pattern of 1 and 1 in the above bit combination may be 0, 1, 0, 1..., or 0, 0, 1, 0, 0, 1, . . . The above alternation pattern is not limited here. Compared with the filling method of filling all zeros, the above-mentioned bit filling method is more robust and can reduce the probability of missed detection in the checksum and cyclic redundancy check (Cyclic Redundancy Check, referred to as CRC).

S102. Use the encoding base map to perform low-density parity check code encoding on each of the code blocks.

After segmenting the transport block, the sending device can use the coding base map to perform LDPC encoding on each segmented code block.

The sending device may generate a parity check matrix based on the above encoding base map. The sending device can expand the 0 elements in the encoding base map into a Z×Z matrix of all zeros, and expand the 1 elements in the base map into a Z×Z permutation matrix. Among them, the above permutation matrix can be obtained by circularly shifting the unit matrix to the right.

Further, the sending device can use the above parity check matrix to encode each code block separately to obtain the coded bit sequence corresponding to each code block. The sending device can perform rate matching on the coded bit sequence, and discard the padding sequence in the coded coded bit sequence according to the allocated physical resources and the selected modulation and coding methods.

It should be noted that the channel coding method in the embodiment of the present application can be applied to LDPC coding in NR systems; it can also be applied to LDPC coding in other systems, and is not limited here.

In the above channel coding method, the sending device divides the transmission block to be encoded into blocks to obtain at least one code block; then, uses the coding base map to perform low-density parity check code encoding on each code block, where each code block includes Information bits and padding bits. The padding positions of the padding bits are related to the column weight of the coding base image corresponding to the transport block. Since the greater the column weight of the column in the coding base map, the more check equations are associated when using the coding base map for LDPC encoding; in the embodiment of the present application, the sending device determines the padding based on the column weight of the column in the coding base map. The padding position of the bits, compared to adding padding bits directly at the end of the information bits, can make the padding bits participate in more parity check equations, so that when the receiving device iteratively decodes the received transmission codeword, it can eliminate More uncertainty factors can bring better decoding performance.

In one embodiment, it relates to a way for a sending device to determine the filling position of filling bits during the block processing of a transport block to be encoded. The sending device can compare the number of columns K _b occupied by the information bits in the code block in the coding base diagram with the maximum number of columns K _bmax used for information bits in the coding base diagram, and determine the filling of the stuffing bits in the code block based on the comparison result. Location.

If K _b is equal to K _bmax , then the padding position of the padding bits of the code block corresponds to column 1 in the coding base image. If K _b is less than K _bmax , then the padding positions of the padding bits of the code block correspond to at least 2 columns in the coding base image. Taking the coding base picture as BG2 as the center, the maximum number of columns used for information bits in BG2 is 10. If the number of bits K _b occupied by the information bits in the code block in the coding base picture is also 10, it means that the padding bits need to be added. The number is less than the promotion value Z. If K _b is less than 10, it means that the number of padding bits that need to be added is greater than the improvement value Z, and padding bits need to be added to at least two columns. Taking the coding base picture as BG2 and the boost value Z=4 as an example, the length of each code block is 40. If the number K' of information bits in the code block is 30, the information bits in the code block can include a0 to a29, and the number of columns occupied in the coding base diagram is 8, then the number of padding bits that need to be added is 10, also It is necessary to complete bit filling in 3 columns, as shown in Figure 4. If the number K' of information bits in the code block is 38, the information bits in the code block can include a0 to a37, and the number of columns occupied in the coding base diagram is 10, then the number of padding bits that need to be added is 2, which can be Bit stuffing is done in column 1, as shown in Figure 5.

The sending device can determine the padding position of the padding bits based on the number of columns that need to be padded. The sending device can determine the filling position of the filling bits based on the correspondence between the preset number of filling columns and the columns of the encoding base map. For example, if the number of columns that need to be filled is 1, the above filling position can correspond to the 0th column in the encoding base map; if the number of columns that need to be filled is 2, the above filling positions can be located in the 3rd and 3rd columns in the encoding base map. 5 columns.

The above correspondence relationship can be determined based on simulation results; the above simulation results can include decoding performance corresponding to different column recombinations. By setting the padding positions in columns corresponding to different column recombinations, the obtained decoding performance is analyzed to determine the column recombination with the best decoding performance.

In one implementation, if K _b is equal to K _bmax , that is, the sending device can select 1 column in the coding base picture for bit filling, and the filling position of the above filling bits can correspond to a preset column in the coding base picture. The above-mentioned preset columns may be columns used for information bits in the coding base image, and the column weight of the above-mentioned preset columns may be greater than the preset threshold. The column whose column weight is greater than the preset threshold may be the column with the largest column weight, or may be another column with a larger column weight, such as one of the columns in the encoding base map with a column weight greater than 13.

The sending device can determine the starting position of the filling position based on the above-mentioned preset column, and then determine the bits occupied by each filling position based on the number of filling bits. Taking the column whose column weight is greater than the preset threshold as the i-th column as an example, the starting position of the filling position is the Z·i-th bit in the code block, and F elements are filled in sequence to obtain the filling bits.

Take the K _bmax of the encoding base image as 10 columns and the lifting value Z=2 as an example. If the number K′ of information bits in the code block is 18, K _b =9, the information bits in the code block may include a0 to a17; if the column in the above coding base diagram is greater than the preset threshold, the third column, Then it can be determined that the filling position corresponds to the third column of the encoding base image, and the starting position of the corresponding filling position is bit 3Z=12. The number of padding bits is 20-18=2, that is, the padding positions are determined to be the 12th and 13th bits. Correspondingly, the information bit a12 can be located at the 14th bit. The filling result can be shown in Figure 6. The filling position in the figure is filled with 0 elements.

In one implementation, if K _b is less than K _bmax , the sending device can determine the filling position of the filling bits according to the preset filling position correspondence; wherein the filling position correspondence includes filling positions with different K _b values in Encode the corresponding column in the base graph.

For different K _b values, the number of columns corresponding to the K _b value in the above filling position correspondence relationship may be different. In the above filling position correspondence relationship, the number of columns corresponding to the K _b value may be K _bmax -K _b +1, or may be greater than K _bmax -K _b +1, and is not limited here. For example, if K _bmax is 10 and K _b is 8, the number of columns corresponding to the filling position can be 3 columns or 4 columns. The sending device can randomly select 3 columns among the above 4 columns for filling.

Wherein, the above filling position correspondence relationship can be determined based on the simulation results. For each K _b value, the decoding performance when the filling bits correspond to different columns in the encoding base map can be simulated and analyzed; then K _bmax -K _b +1 columns are selected according to the decoding performance to determine the filling position of the K _b value. The corresponding column in the encoding base graph. After obtaining the corresponding column of the filling position of each K _b value in the encoding base map, the above filling position correspondence relationship can be formed. It should be noted that when determining the filling position of the K _b value in the corresponding column in the encoding base picture based on multiple decoding performances, the K _bmax -K _b +1 columns with the best decoding performance can be determined as K The filling position of the _b value is in the corresponding column in the coding base map. The filling position of the K _b value in the corresponding column in the coding base map can also be determined in combination with various parameters such as decoding performance and coding complexity.

The sending device can determine the filling position of each filling bit according to at least one column corresponding to the K _b value. For example, the above-mentioned at least one column includes the b1-th column, the b2-th column,...bi-th column, and multiple filling starting positions can be determined based on the above-mentioned at least one column, including the Z·b1-th position, the Z·b2-th position,...the Z·bi-th Bit.

Taking the i-1 filling starting positions among the above filling starting positions as the starting point, determine the consecutive Z filling positions; taking the remaining filling starting position as the starting point, determine the consecutive M filling positions, where (i- 1)Z+M=F. The remaining column corresponding to the starting position of the filling above can be the last column in at least one column corresponding to the K _b value, or it can be the column with the smallest column weight in at least one column corresponding to the K _b value, or it can be K Any column in at least one column corresponding to _{the b} value is not limited here.

Take the K _bmax of the encoding base image as 10 columns and the lifting value Z=4 as an example. If the number K′ of information bits in the code block is 30 and K _b =8, the information bits in the code block may include a0 to a29. In the filling position correspondence relationship, the filling position of K _b =8 corresponds to the 3rd column, the 5th column and the 7th column in the encoding base image. The starting filling positions include the 12th, 20th and 28th positions; the filling positions can include: the 12th, 13th, 14th, 15th, 20th, 21st, 22nd, 23rd and 28th and 29th. The filling result can be shown in Figure 7. The filling position in the figure is filled with 0 elements.

The above channel coding method determines the filling position of the filling bit based on the comparison result of K _b value and K _bmax , and can obtain the filling position matching the K _b value, so that after bit filling is performed at the filling position and the code block is LDPC encoded , when the receiving device iteratively decodes the received transmission codeword, it can eliminate more uncertainty factors and bring better decoding performance.

In one embodiment, a specific filling position correspondence relationship corresponding to the encoding base image is provided. The above-mentioned coding base map may be a base map used for transport blocks whose coding rate is less than a preset code rate threshold, and/or the transport block length is less than a preset length threshold. The above-mentioned coding base map may be BG2 in the NR system.

When the information bit length is the same but the code rate is different, the actual effective parity check matrix is a part of the upper left corner of the complete parity check matrix. This means that the column weight of the information bit string in the encoding base map has changed, and the position of the optimal padding bit string is also different. When the transport block length is short, the padding position of the padding bits has a greater impact on the coding performance. For the coding base picture BG2, especially the code blocks whose transport block length is less than 640, the coding method in this application can significantly improve the decoding performance.

The padding position correspondence relationship corresponding to the above encoding base map may include the columns corresponding to the padding positions with K _b values of 8 and 9 in the encoding base map. Among them, the filling positions with a K _b value of 8 correspond to the 5th column, the 8th column, and the 9th column in the encoding base image. The padding positions with a K _b value of 9 correspond to the 5th and 7th columns in the encoding base image.

Optionally, the above filling position correspondence also includes the column corresponding to the filling position in the encoding base map with a K _b value of 10. When the above K _b value is 10, it is equal to K _bmax , and the filling position can correspond to one of the columns in the encoding base image whose column weight is greater than the preset threshold. Optionally, when the K _b value is 10, the padding position may correspond to the 7th column in the encoding base map. The corresponding relationship between the filling positions corresponding to the above encoding base map can be shown in the following table.

K _b value Fill at least one column corresponding to the position 8 5, 8, 9 9 5,7 10 7

With the above channel coding method, the sending device determines the filling position correspondence relationship based on the simulation results, so that the filling position correspondence relationship can be used to quickly and accurately determine the filling position in the code block; after bit filling the code block, it can be obtained Decoding performance that matches simulation results.

In one embodiment, based on the above embodiment, when the filling position corresponds to multiple columns, there is a filling position corresponding to one column that is less than the lifting value Z, while the filling position in other columns is equal to the lifting value Z. The above-mentioned filling Columns whose positions are smaller than the boost value Z can be called partially filled columns. When the filling positions correspond to multiple columns, different columns are determined as partially filled columns. After bit filling is performed using the partially filled columns, the corresponding decoding performance may be different. Through simulation analysis, the decoding performance when different columns are used as partially filled columns is compared, and one of the columns is selected as a partially filled column in the filling position correspondence relationship.

The filling position of each K _b value is in the corresponding column in the encoding base map, including the column used for partial filling. The above-mentioned filling position correspondence may include the identification of partially filled columns. When the above K _b value is 8, the column used for partial filling is the 9th column in the encoding base map; when the K _b value is 9, the column used for partial filling is 9. The column is the 5th column in the encoding base map; when the K _b value is 10, the column used for partial filling is the 7th column in the encoding base map.

As shown in the following table, the partially populated columns above are identified by parentheses.

K _b value Fill at least one column corresponding to the position 8 5, 8, (9) 9 (5),7 10 (7)

The following uses specific examples to illustrate the decoding performance improvement effect of the channel coding method in the embodiment of the present application. Take the transport block length as 184, the encoding code rate as one-fifth, and the modulation method as QPSK as an example. The one-code algorithm used by the receiving device is the normalized minimum sum algorithm, and the normalization factor can be 0.75. Figure 8 is a comparison chart of decoding performance corresponding to K _b =8. In Figure 8, the curve marked with a circle is the decoding result obtained by padding at the end of the information bits in the code block; the curve marked with a triangle is the decoding result obtained by padding the bits at the filling positions corresponding to the 5th, 8th, and 9th columns in the coding base diagram. After padding, the decoding performance obtained. The horizontal axis represents the noise ratio SNR of the signal received by the receiving device, and the vertical axis represents the block error rate BLER corresponding to different signal-to-noise ratios. Similarly, Figure 9 is a comparison chart of decoding performance corresponding to K _b =9; Figure 10 is a comparison chart of decoding performance corresponding to K _b =10. It can be seen from the comparison results in Figures 8 to 10 that using the channel coding method in this application can significantly improve the decoding performance of the receiving device.

The above channel coding method identifies the partially filled columns in the filling position correspondence, so that the sending device can more accurately determine the filling positions corresponding to the partially filled columns and the filling positions corresponding to the completely filled columns when performing bit filling. , after using the above method to fill the bit values, the decoding performance matching the simulation results is obtained.

In one embodiment, as shown in Figure 11, a channel decoding method is provided and applied to the receiving device in Figure 1. The above method includes:

S201. Add padding bits to the padding position in the transmission codeword to be decoded; the padding position is related to the column weight of the coding base diagram corresponding to the transmission codeword;

S202. Use the encoding base map to decode the filled transmission codeword with a low-density parity check code.

The transmission codeword received by the receiving device may be obtained by the sending device performing LDPC coding based on the channel coding method in the above embodiment, and by deleting the stuffing bits after rate matching. The receiving device can perform bit filling on the transmission codeword. When the receiving device performs bit filling on the transmission codeword, the filling position corresponding to the filling bits is consistent with the position where the sending device performs bit filling on the code block to be encoded. The receiving device can use the method in the above embodiment to determine the filling position of the filling bits, and then perform bit filling on the transmission codeword. Further, the receiving device can perform LDPC decoding on the filled transmission codeword using the coding base map.

The decoding algorithm used by the receiving device may be a normalized minimum sum algorithm or a sum-product algorithm, which is not limited here. It should be noted that for different decoding algorithms, the degree of improvement in decoding performance can be different.

The implementation principles and technical effects of the above channel decoding method correspond to the above channel coding method, and will not be described in detail here.

It should be understood that although the steps in the flowcharts of Figures 2 and 11 are shown in sequence as indicated by arrows, these steps are not necessarily executed in the order indicated by arrows. Unless explicitly stated in this article, there is no strict order restriction on the execution of these steps, and these steps can be executed in other orders. Moreover, at least some of the steps in Figure 2 and Figure 11 may include multiple sub-steps or multiple stages. These sub-steps or stages are not necessarily executed at the same time, but can be executed at different times. These sub-steps or The execution order of the stages is not necessarily sequential, but may be performed in turn or alternately with other steps or sub-steps of other steps or at least part of the stages.

Figure 12 is a structural block diagram of a channel coding device according to an embodiment. As shown in Figure 13, the above device is applied to sending equipment, including:

The blocking module 110 is used to divide the transport block to be encoded into blocks to obtain at least one code block; each code block includes information bits and stuffing bits; the stuffing position of the stuffing bits is related to the column weight of the coding base diagram corresponding to the transport block. ;

The encoding module 120 is used to encode each code block with a low-density parity check code using the encoding base map.

In one embodiment, on the basis of the above embodiment, as shown in Figure 13, the above device further includes a determining module 130, configured to: determine the column occupied by the information bits in the code block in the coding base diagram. The number K _b is compared with the maximum column number K _bmax of the coding base diagram for information bits, and the filling position of the filling bits in the code block is determined according to the comparison result.

In one embodiment, based on the above embodiment, the determination module 130 is specifically configured to: if K _b is equal to K _bmax , determine that the filling position of the filling bit corresponds to the preset column in the encoding base image; The column weight of the preset column is greater than the preset threshold.

In one embodiment, based on the above embodiment, the determination module 130 is specifically configured to: if K _b is less than K _bmax , determine the filling position of the filling bit according to the preset filling position correspondence relationship; wherein, the filling position The position correspondence includes the columns corresponding to the filling positions of different K _b values in the encoding base map.

In one embodiment, based on the above embodiment, the coding base map is a base map used for transport blocks whose coding code rate is less than a preset code rate threshold, and/or the transport block length is less than a preset length threshold. ; The filling position correspondence includes the corresponding columns in the encoding base map of the filling positions with K _b values of 8 and 9.

In one embodiment, based on the above embodiment, the filling position with a K _b value of 8 corresponds to the 5th column, the 8th column and the 9th column in the encoding base image.

In one embodiment, based on the above embodiment, the padding position with a K _b value of 9 corresponds to the 5th column and the 7th column in the encoding base image.

In one embodiment, based on the above embodiment, the filling position correspondence relationship further includes the column corresponding to the filling position with a K _b value of 10 in the encoding base map.

In one embodiment, based on the above embodiment, the padding position with a K _b value of 10 corresponds to the 7th column in the encoding base map.

In one embodiment, based on the above embodiment, the filling position of each K _b value includes a column for partial filling in the corresponding column in the encoding base map.

In one embodiment, when the K _b value is 8, the column used for partial filling is the 9th column in the encoding base image.

In one embodiment, when the K _b value is 9, the column used for partial filling is the 5th column in the encoding base image.

In one embodiment, when the K _b value is 10, the column used for partial filling is the 7th column in the encoding base image.

In one embodiment, based on the above embodiment, the padding bits are a bit combination formed by alternating 0 and 1.

For the implementation principles and technical effects of the above-mentioned channel coding device, please refer to the above-mentioned method embodiments and will not be described in detail here.

The division of various modules in the above channel coding device is only for illustration. In other embodiments, the channel coding device can be divided into different modules as needed to complete all or part of the functions of the above channel coding device.

For specific limitations on the channel coding device, please refer to the above limitations on the channel coding method, which will not be described again here. Each module in the above channel coding device can be implemented in whole or in part by software, hardware, and combinations thereof. Each of the above modules may be embedded in or independent of the processor of the computer device in the form of hardware, or may be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.

Figure 14 is a structural block diagram of a channel decoding device according to an embodiment. As shown in Figure 14, the above device is applied to receiving equipment, including:

The padding module 210 is configured to add padding bits to the padding position in the transmission codeword to be decoded; the padding position is related to the column weight of the coding base diagram used when encoding the transmission block corresponding to the transmission codeword;

The decoding module 220 is used to decode the low-density parity check code of the filled transmission codeword using the coding base map.

The division of each module in the above channel decoding device is only for illustration. In other embodiments, the channel decoding device can be divided into different modules as needed to complete all or part of the functions of the above channel decoding device.

For specific limitations on the channel decoding device, please refer to the above limitations on the channel decoding method, which will not be described again here. Each module in the above-mentioned channel decoding device can be implemented in whole or in part by software, hardware, or combinations thereof. Each of the above modules may be embedded in or independent of the processor of the computer device in the form of hardware, or may be stored in the memory of the computer device in the form of software, so that the processor can call and execute the operations corresponding to the above modules.

Figure 15 is a schematic diagram of the internal structure of a sending device in an embodiment. The sending device can be any terminal device such as a mobile phone, tablet computer, notebook computer, desktop computer, PDA (Personal Digital Assistant, Personal Digital Assistant), POS (Point of Sales, sales terminal), vehicle-mounted computer, wearable device, etc. The sending device includes a processor and memory connected via a system bus. The processor may include one or more processing units. The processor may be a CPU (Central Processing Unit, central processing unit) or a DSP (Digital Signal Processing, digital signal processor), etc. Memory may include non-volatile storage media and internal memory. Non-volatile storage media stores operating systems and computer programs. The computer program can be executed by a processor to implement a channel coding method provided in the following embodiments. The internal memory provides a cached execution environment for operating system computer programs in non-volatile storage media.

Figure 16 is a schematic diagram of the internal structure of a receiving device in an embodiment. The receiving device includes a processor and memory connected through a system bus. The processor may be a CPU (Central Processing Unit, central processing unit) or a DSP (Digital Signal Processing, digital signal processor), etc. Memory may include non-volatile storage media and internal memory. Non-volatile storage media stores operating systems and computer programs. The computer program can be executed by a processor to implement a channel decoding method provided in the following embodiments. The internal memory provides a cached execution environment for operating system computer programs in non-volatile storage media. The server can be implemented as an independent server or a server cluster composed of multiple servers. Those skilled in the art can understand that the structure shown in the figure is only a block diagram of a part of the structure related to the solution of the present application, and does not constitute a limitation on the server on which the solution of the present application is applied. The specific server may include: More or fewer parts are shown in, or certain parts are combined, or have different parts arrangements.

The implementation of each module in the device provided in the embodiment of the present application may be in the form of a computer program. The computer program can be run on a terminal or on a server. The program modules formed by the computer program can be stored in the memory of the electronic device. When the computer program is executed by the processor, the steps of the methods described in the embodiments of the present application are implemented.

An embodiment of the present application also provides a computer-readable storage medium. One or more non-volatile computer-readable storage media containing computer-executable instructions that, when executed by one or more processors, cause the processors to perform a channel encoding method or channel decoding Method steps.

Embodiments of the present application also provide a computer program product containing instructions that, when run on a computer, cause the computer to execute a channel encoding method or a channel decoding method.

Any reference to memory, storage, database or other media used herein may include non-volatile and/or volatile memory. Non-volatile memory can include ROM (Read-Only Memory, read-only memory), PROM (Programmable Read-only Memory, programmable read-only memory), EPROM (Erasable ProgrammableRead-Only Memory, erasable programmable read-only memory) ), EEPROM (Electrically Erasable Programmable Read-only Memory, electrically erasable programmable read-only memory) or flash memory. Volatile memory may include RAM (Random Access Memory), which is used as an external cache memory. By way of illustration and not limitation, RAM is available in many forms, such as SRAM (Static Random Access Memory, static random access memory), DRAM (Dynamic Random Access Memory, dynamic random access memory), SDRAM (Synchronous Dynamic Random Access Memory) , synchronous dynamic random access memory), double data rate DDRSDRAM (Double Data Rate Synchronous Dynamic Random Access memory, double data rate synchronous dynamic random access memory), ESDRAM (Enhanced Synchronous Dynamic Random Access memory, enhanced synchronous dynamic random access memory) memory), SLDRAM (Sync Link Dynamic Random Access Memory, synchronous link dynamic random access memory), RDRAM (Rambus Dynamic Random Access Memory, bus dynamic random access memory), DRDRAM (Direct Rambus Dynamic Random Access Memory, interface dynamic random access memory) ).

The above-described embodiments only express several implementation modes of the present application, and their descriptions are relatively specific and detailed, but should not be construed as limiting the patent scope of the present application. It should be noted that, for those of ordinary skill in the art, several modifications and improvements can be made without departing from the concept of the present application, and these all fall within the protection scope of the present application. Therefore, the protection scope of this patent application should be determined by the appended claims.

Claims (17)

1. A channel coding method, applied to a transmitting device, comprising:

partitioning a transmission block to be coded to obtain at least one code block; each code block comprises information bits and filling bits; the filling position of the filling bit is related to the column weight of the coding base diagram corresponding to the transmission block;

using the coding base diagram to code each code block with low density parity check code;

the number of columns occupied by the information bits in the code block in the code base mapMaximum number of columns for information bits with the coding base map +.>Comparing, and determining filling positions of filling bits in the code block according to a comparison result;

the determining the filling position of the filling bit in the code block according to the comparison result comprises the following steps:

If it isEqual to->Determining that the filling positions of the filling bits correspond to preset columns in the coding base map; the column weight of the preset column is greater than a preset threshold;

if it isLess than->Determining the filling position of the filling bit according to a preset corresponding relation of the filling position; wherein the filling position correspondence relation comprises different +.>The filling position of the value is in the corresponding column in the coding base map.

2. The method according to claim 1, wherein the coding base map is a base map used for transmission blocks having a coding rate smaller than a preset rate threshold and/or a transmission block length smaller than a preset length threshold; the filling position correspondence relation comprisesFilling positions with values of 8 and 9 are in corresponding columns in the coding base map.

3. The method of claim 2, wherein the step of determining the position of the substrate comprises,the filling position with a value of 8 corresponds to the 5 th, 8 th and 9 th columns in the coding base map.

4. The method of claim 2, wherein the step of determining the position of the substrate comprises,the filling position with a value of 9 corresponds to column 5 and column 7 in the coding base map.

5. The method according to claim 1, wherein the filling position correspondence relationship further includes A padding position with a value of 10 is in the corresponding column in the coding base map.

6. According to claimThe method according to 5, wherein theThe padding position with a value of 10 corresponds to column 7 in the coding base map.

7. The method of claim 1, wherein each of saidThe filling locations of the values include columns for partial filling in corresponding columns in the coding base map.

8. The method of claim 7, wherein theAt a value of 8, the column for partial padding is column 9 in the coding base map.

9. The method of claim 7, wherein theAt a value of 9, the column for partial padding is column 5 in the coding base map.

10. The method of claim 7, wherein theAt a value of 10, the column for partial padding is column 7 in the coding base map.

11. The method according to any of claims 1-10, wherein the padding bits are bit combinations formed alternately of 0 and 1.

12. A channel decoding method, applied to a receiving device, comprising:

adding padding bits at padding positions in a transmission codeword to be decoded; the filling position is related to the column weight of the coding base diagram corresponding to the transmission code word; the transmission code word is obtained by the transmission equipment performing low-density parity check code coding on the code block and deleting the filling bits after rate matching;

Decoding the filled transmission code word by adopting the coding base diagram;

the filling position of the filling bit in the code block is the number of columns occupied in the coding base diagram according to the information bits of the code blockMaximum number of columns for information bits with the coding base map +.>Comparing and determining; comprising the following steps:

if it isEqual to->Determining that the filling positions of the filling bits correspond to preset columns in the coding base map; the column weight of the preset column is greater than a preset threshold;

if it isLess than->Determining the filling position of the filling bit according to a preset corresponding relation of the filling position; wherein the filling position correspondence relation comprises different +.>The filling position of the value is in the braidingCorresponding columns in the code base map.

13. A channel coding apparatus, applied to a transmitting device, comprising:

the block dividing module is used for dividing the transmission block to be encoded to obtain at least one code block; each code block comprises information bits and filling bits; the filling position of the filling bit is related to the column weight of the coding base diagram corresponding to the transmission block;

the coding module is used for coding the low-density parity check codes of the code blocks by adopting the coding base diagram;

A comparison module for comparing the number of columns occupied by the information bits in the code block in the code base mapMaximum number of columns for information bits with the coding base map +.>Comparing, and determining filling positions of filling bits in the code block according to a comparison result;

the determining the filling position of the filling bit in the code block according to the comparison result comprises the following steps:

if it isEqual to->Determining that the filling positions of the filling bits correspond to preset columns in the coding base map; the column weight of the preset column is greater than a preset threshold;

if it isLess than->According to the preset corresponding relation of filling positions,determining a filling position of the filling bit; wherein the filling position correspondence relation comprises different +.>The filling position of the value is in the corresponding column in the coding base map.

14. A channel decoding apparatus, applied to a receiving device, comprising:

a padding module, configured to add padding bits at padding positions in a transmission codeword to be decoded; the filling position is related to the column weight of a coding base diagram adopted when the transmission block corresponding to the transmission codeword is coded; the transmission code word is obtained by the transmission equipment performing low-density parity check code coding on the code block and deleting the filling bits after rate matching;

The decoding module is used for decoding the low-density parity check code of the filled transmission code word by adopting the coding base diagram;

a comparison module for comparing the number of columns occupied by the information bits in the code block in the code base mapMaximum number of columns for information bits with the coding base map +.>Comparing, wherein the filling position of filling bits in the code block is determined according to the comparison result; comprising the following steps:

if it isEqual to->Determining that the filling positions of the filling bits correspond to preset columns in the coding base map; the column weight of the preset column is greater than a preset threshold;

if it isLess than->Determining the filling position of the filling bit according to a preset corresponding relation of the filling position; wherein the filling position correspondence relation comprises different +.>The filling position of the value is in the corresponding column in the coding base map.

15. A transmitting device comprising a memory and a processor, the memory having stored therein a computer program which, when executed by the processor, causes the processor to perform the steps of the channel coding method according to any of claims 1 to 12.

16. A receiving device comprising a memory and a processor, the memory having stored therein a computer program which, when executed by the processor, causes the processor to perform the steps of the channel decoding method of claim 12.

17. A computer readable storage medium, on which a computer program is stored, characterized in that the computer program, when being executed by a processor, implements the steps of the method according to any one of claims 1 to 12.