CN114499758A

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

Info

Publication number: CN114499758A
Application number: CN202210020690.1A
Authority: CN
Inventors: 柏青
Original assignee: Zeku Technology Beijing Corp Ltd
Current assignee: Zeku Technology Beijing Corp Ltd
Priority date: 2022-01-10
Filing date: 2022-01-10
Publication date: 2022-05-13
Anticipated expiration: 2042-01-10
Also published as: CN114499758B

Abstract

The application relates to a channel coding method, a device, equipment and a computer readable storage medium, wherein a sending device processes a transmission block to be coded in a blocking way to obtain at least one code block; and then, carrying out low-density parity check code coding on each code block by adopting a coding base map, wherein each code block comprises information bits and filling bits, and the filling positions of the filling bits are related to the column weight of the coding base map corresponding to the transmission block. The method can improve the decoding performance of the receiving equipment.

Description

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

Technical Field

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

Background

With the development of communication technology, higher requirements are put on the encoding mode in the communication equipment. In a New Radio (NR) system, a user equipment and an access network equipment may be included, and both the user equipment and the access network equipment may be used as a sending device to send a signal. The transmitting apparatus may encode a set of information bits based on a Low Density Parity Check (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, a transmitting device may divide a Transport Block (TB) into a plurality of Code Blocks (CBs) with equal lengths. Each CB may include information bits and padding bits therein. The position of the padding bits is generally located behind the information bits, which results in poor decoding performance obtained in some scenarios after the receiving device performs decoding based on the codeword.

Disclosure of Invention

The embodiment of the application provides a channel coding method, a channel coding device, channel coding equipment and a computer readable storage medium, which can accept the improvement of decoding performance of the equipment.

In a first aspect, a channel coding method applied to a transmitting device includes:

the method comprises the steps of processing a transmission block to be coded in a blocking mode to obtain at least one code block; each code block comprises information bits and padding bits; filling positions of the filling bits are related to column weights of the coding base map corresponding to the transmission block;

and carrying out low-density parity check code coding on each code block by adopting the coding base map.

In a second aspect, a channel decoding method applied to a receiving device includes:

filling bits are added at filling positions in a transmission code word to be decoded; the filling position is related to the column weight of the coding base map corresponding to the transmission code word;

and decoding the filled transmission code words by using the coding base map.

In a third aspect, a channel coding apparatus applied to a transmitting device includes:

the block division module is used for processing the transmission block to be coded in a block division mode to obtain at least one code block; each code block comprises information bits and padding bits; filling positions of the filling bits are related to column weights of the coding base map corresponding to the transmission block;

and the coding module is used for carrying out low-density parity check code coding on each code block by adopting the coding base map.

In a fourth aspect, a channel decoding apparatus applied to a receiving device includes:

the filling module is used for adding filling bits at filling positions in the transmission code words to be decoded; the filling position is related to the column weight of a coding base map adopted when a transmission block corresponding to the transmission code word is coded;

and the decoding module is used for decoding the filled transmission code words by adopting the coding base map.

In a fifth aspect, a transmitting device comprises a memory and a processor, wherein the memory stores a computer program, and the computer program, when executed by the processor, 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, the memory stores a computer program, and the computer program, when executed by the processor, causes the processor to execute 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 the computer program, when being executed by a processor, carries out the steps of the method of the first and second aspects.

According to the channel coding method, the device, the equipment and the computer readable storage medium, the sending equipment performs block processing on a transmission block to be coded to obtain at least one code block; and then, carrying out low-density parity check code coding on each code block by adopting a coding base map, wherein each code block comprises information bits and filling bits, and the filling positions of the filling bits are related to the column weight of the coding base map corresponding to the transmission block. The larger the column weight of the column in the coding base map is, the more check equations are associated when the coding base map is adopted for coding; in the embodiment of the present application, the sending device determines the filling positions of the padding bits based on the column weights of the columns in the coding base map, and compared with directly adding the padding bits at the end of the information bits, the padding bits can participate in more parity check equations, so that when the receiving device performs iterative decoding on the received transmission code word, more uncertainty factors can be eliminated, and better decoding performance can be brought.

Drawings

In order to more clearly illustrate the embodiments of the present application or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below, it is obvious that the drawings in the following description are only some embodiments of the present application, and for those skilled in the art, other drawings can be obtained according to the drawings without creative efforts.

Fig. 1 is a diagram of an application environment of a channel coding method according to an embodiment of the present application;

FIG. 2 is a flow chart of a channel coding method according to an embodiment of the present application;

FIG. 3 is a schematic illustration of a fill position in one embodiment of the present application;

FIG. 4 is a diagram illustrating the number of columns corresponding to filling locations in an embodiment of the present application;

FIG. 5 is a diagram illustrating the number of columns corresponding to the filling positions in an embodiment of the present application;

FIG. 6 is a schematic illustration of a fill position in one embodiment of the present application;

FIG. 7 is a schematic illustration of a fill position in one embodiment of the present application;

FIG. 8 is a comparison of decoding performance in one embodiment of the present application;

FIG. 9 is a comparison of decoding performance in one embodiment of the present application;

FIG. 10 is a comparison of decoding performance in one embodiment of the present application;

FIG. 11 is a flowchart of a channel decoding method according to an embodiment of the present application;

fig. 12 is a block diagram of a channel coding apparatus according to an embodiment of the present application;

fig. 13 is a block diagram of a channel coding apparatus according to an embodiment of the present application;

FIG. 14 is a block diagram of a channel decoding apparatus according to an embodiment of the present application;

FIG. 15 is a schematic diagram of a transmitting device according to an embodiment of the present application;

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

Detailed Description

In order to make the objects, technical solutions and advantages of the present application more apparent, the present application is described in further detail below with reference to the accompanying drawings and embodiments. It should be understood that the specific embodiments described herein are merely illustrative of the present application and are not intended to limit the present application.

Fig. 1 is a schematic diagram of an application environment of a channel coding method in an embodiment. As shown in fig. 1, the application environment includes a transmitting 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, and may also be a network device, which is not limited herein. The network device may be any device having a wireless transceiving function. Including but not limited to: a base station NodeB, an evolved node b, a base station in the fifth generation (5G) communication system, a base station or network device in a future communication system, an access node in a WiFi system, a wireless relay node, a wireless backhaul node, and the like. The network device may also be a wireless controller in a Cloud Radio Access Network (CRAN) scenario. The network device may also be a small station, a transmission node (TRP), a Road Side Unit (RSU), or the like. The embodiments of the present application do not limit the specific technologies and the specific device forms adopted by the network devices. The user equipment may be a device with a wireless transceiving function, and may be, but is not limited to, a handheld, wearable, or vehicle-mounted device. The user equipment may be a mobile phone, a tablet computer, a computer with a wireless transceiving function, a Virtual Reality (VR) terminal device, an Augmented Reality (AR) terminal device, a wireless terminal in industrial control (industrial control), a wireless terminal in self-driving (self-driving), a wireless terminal in remote medical (remote medical), a wireless terminal in smart grid (smart grid), a wireless terminal in transportation safety (transportation safety), a wireless terminal in smart city (smart city), a wireless terminal in smart home (smart home), and the like. The embodiments of the present application do not limit the application scenarios.

Fig. 2 is a flow chart of a channel coding method in one embodiment. The channel coding method in this embodiment is described by taking the transmitting device in fig. 1 as an example. As shown in fig. 2, the method includes:

s101, processing a transmission block to be coded in a blocking mode to obtain at least one code block; each code block comprises information bits and padding bits; and the filling positions of the filling bits are related to the column weight of the coding base map corresponding to the transmission block.

The transport block to be coded may be a message that is processed by a multimedia Control (MAC) layer in the sending device and then transmitted to a physical layer. The transport block may be a message transferred by a data channel in a physical layer. When the sending device is a network device, the data Channel may be a Physical Downlink Shared Channel (PDSCH), and the transport block may carry Downlink unicast data, may also be a paging message, and may also be a system message. When the sending device is a user equipment, the data Channel may be a Physical Uplink Shared Channel (PUSCH), and the transport block may carry uplink service data.

The transmitting device may LDPC encode the transport block to convert the transport block into a series of bit stream data to be transmitted. The LDPC coding is a linear coding mode close to the shannon limit, and a transmission block may be coded using a linear block code having a sparse check matrix.

Before LDPC coding is performed on a transport block, a corresponding coding base map needs to be selected by a transmitting device. The base coding graph may include 2 types, which are base graph 1(BG1) and base graph 2(BG2), where the BG1 is mainly used when a transport block is long or a code rate is high, and the BG2 may be used when a transport block is short and a first-level code rate is low. BG1 described above supports a maximum value of K_cbFor a code block length of 8448, BG1 is formed by a 46 × 68 matrix of 0 and 1, corresponding to the maximum number of columns K for information bits_bmaxIs 22. BG2 described above supports a maximum value of K_cbFor a code block length of 3840, BG1 is a 42 × 52 matrix of 0 and 1, corresponding to the maximum number of columns K for information bits_bmaxIs 10.

Since the code block size that the coded base map can transmit at a single time is limited, the transport block needs to be subjected to a blocking process. The transmitting device may add a CRC check code to the transport block and then perform segmentation processing on the transport block to which the CRC check code is added. A transmitting device may segment a transport block into several code blocks of equal length. The number of information bits in the code block may be K', and the sending device may add padding bits in the code block, so that the length of the code block is an integer multiple of the lifting value Z.

The length of the transport block to which the CRC check code is added may be B, and the sending device may select, according to the length of the transport block, the number of columns K occupied by the corresponding information bits in the coding base map_b. K above_bThe selection method of (c) may be as follows: in the case of BG1 as the encoding base map, K is taken_b22; in the case of a coded base map BG2, if B>640, then K _b10; if 640 is more than or equal to B>560, then K _b9; if 560 is not less than B>192, then K _b8; if B is less than or equal to 192, then K _b6. In determining K_bOn the basis, the sending device may select the lifting value Z that satisfies the condition from a preset lifting value list.

The above-mentioned lifting value Z satisfies the relation K_bZ.gtoreq.the minimum value of K'. When K is_bmax·Z>K', padding bits need to be added to the code block to satisfy the coding format requirement of LDPC. After the padding is completed, each code block has a length K ═ K_bmaxZ, i.e., the number of padding bits is F ═ K' -K.

The filling positions of the filling bits are related to the column weight of the coding base map corresponding to the transmission block. Wherein, the column weights are the number of 1 contained in one column in the coding base map. The filling position may be located in a column with the largest column weight, or may be located in a column with the largest column weight, which is not limited herein. When the number of padding bits is large, the padding positions may occupy a plurality of columns, and the plurality of columns may include a column with the largest column weight or a plurality of columns with the equivalent column weight. As shown in fig. 3, the above-mentioned padding bits may correspond to

columns

3 and 5 in the coding base map.

The padding bit may be a0 element or a1 element, and optionally, the padding bit may be a bit combination formed by alternating 0 and 1. The alternating pattern of 1 and 1 in the bit combination may be 0, 1, 0, 1 … …, or 0, 0, 1, 0, 0, 1, … …, and the alternating pattern is not limited herein. Compared with a filling mode of filling 0 completely, the bit filling mode has better robustness, and the probability of missing detection of Check and Cyclic Redundancy Check (CRC) Check can be reduced.

And S102, carrying out low-density parity check code coding on each code block by adopting the coding base diagram.

After the transmission block is segmented, the transmitting device may perform LDPC encoding on each segmented code block by using the encoding base map.

The transmitting device may generate a parity check matrix based on the coding base map. The transmitting device may expand 0 elements in the coded base map into a zxz matrix of all zeros and expand 1 element in the base map into a zxz permutation matrix. The permutation matrix can be obtained by right cyclic shift of the unit matrix.

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

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

In the channel coding method, the sending equipment performs block processing on a transmission block to be coded to obtain at least one code block; and then, carrying out low-density parity check code coding on each code block by adopting a coding base map, wherein each code block comprises information bits and filling bits, and the filling positions of the filling bits are related to the column weight of the coding base map corresponding to the transmission block. The larger the column weight of the column in the coding base graph is, the more check equations are associated when the coding base graph is adopted to carry out LDPC coding; in the embodiment of the present application, the sending device determines the filling positions of the padding bits based on the column weights of the columns in the coding base map, and compared with directly adding the padding bits at the end of the information bits, the padding bits can participate in more parity check equations, so that when the receiving device performs iterative decoding on the received transmission code word, more uncertainty factors can be eliminated, and better decoding performance can be brought.

In one embodiment, the present invention relates to a method for determining filling positions of padding bits during a process of blocking a transport block to be encoded by a transmitting device. The transmitting device may have the number of columns K in the coded base map that the information bits in the code block occupy_bMaximum number of columns K for information bits with the coding base_bmaxAnd comparing, and determining the filling position of the filling bit in the code block according to the comparison result.

If K_bIs equal to K_bmaxThe padding positions of the padding bits of the code block correspond to 1 column in the coded base pattern. If K_bLess than K_bmaxThe padding positions of the padding bits of the code block correspond to at least 2 columns in the coded base pattern. Taking the coded base map as BG2, the maximum number of columns used for information bits in BG2 is 10, and if the number of bits occupied by the information bits in the code block in the coded base map is K_bAlso 10, it means that the number of padding bits that need to be added is less than the boost value Z. If K_bLess than 10, which means that the number of padding bits to be added is greater than the lifting value Z, padding bits need to be added in at least two columns. Taking the coding base map as BG2 and the lifting value Z as 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 may include a0 through a29, and the number of columns occupied in the coding base map is 8, the number of padding bits to be added is 10, that is, bit padding needs to be completed in 3 columns, as shown in fig. 4. If the number K' of information bits in the code block is 38, the information bits in the code block may include a0 through a37, and the number of columns occupied in the coding base map is 10, the number of padding bits to be added is 2, and bit padding may be completed in 1 column, as shown in fig. 5.

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

The correspondence may be determined based on simulation results; the simulation result may include decoding performances corresponding to different column weight combinations. And analyzing the obtained decoding performance by arranging the filling positions in the columns corresponding to different column weight combinations, and determining the column weight combination with the best decoding performance.

In one implementation, if K_bIs equal to K_bmaxThat is, the sending device may select 1 column in the coding base map for bit stuffing, and the stuffing position of the stuffing bits may correspond to a preset column in the coding base map. The preset columns may be columns for information bits in the coding base map, and the column weight of the preset columns may be greater than a preset threshold. The column with the column weight greater than the preset threshold may be the column with the largest column weight, or may be another column with a larger column weight, for example, one of the columns with the column weight greater than 13 in the coding base map.

The sending device may determine the starting position of the padding positions according to the preset column, and then determine the bits occupied by each padding position according to the number of the padding bits. Taking the column with the column weight larger than the preset threshold as an example of the ith column, the initial position of the filling position is the Z & i th bit in the code block, and F elements are filled in sequence to obtain filling bits.

By coding K of the base map_bmaxFor column 10, the lifting value Z is 2 for example. If the number K' of information bits in the code block is 18, K_bInformation bits in a code block may include a0 through a 17; if the column in the coding base map that is more significant than the preset threshold is the 3 rd column, it may be determined that the filling position corresponds to the 3 rd column of the coding base map, and the start position of the corresponding filling position is the 3 rd Z-12 th bit. The number of the padding bits is 20-18 ═ 2, that is, the padding positions are determined to be 12 th and 13 th, and accordingly, the information bit a12 can be located at 14 th. The filling result can be as shown in fig. 6, where the filling positions are filled with 0 elements.

In one implementation, if K_bLess than K_bmaxThen, the sending device may determine the filling position of the filling bit according to the preset corresponding relation of the filling position(ii) a Wherein, the filling position corresponding relation includes different K_bThe fill position of the value is in the corresponding column in the coding base.

For different K_bValue, K in the above filling position correspondence_bThe number of columns to which the values correspond may be different. In the above filling position correspondence, K_bThe number of columns to which the value corresponds may be K_bmax-K_b+1, and may be greater than K_bmax-K_b+1, which is not limiting herein. For example, K_bmaxIs 10, K_bIf the number of columns is 8, the number of columns corresponding to the padding position may be 3 columns, or may be 4 columns, and the transmitting device may randomly select 3 columns from the 4 columns for padding.

The filling position corresponding relation can be determined based on a simulation result. For each K_bThe decoding performance of the filling bits corresponding to different columns in the coding base map can be analyzed in a simulation mode; then K is selected according to the decoding performance_bmax-K_b+1 columns being defined as K_bThe fill position of the value is in the corresponding column in the coding base. At the acquisition of each K_bThe fill-position correspondence may be formed after the corresponding columns in the base map are encoded. It should be noted that K is determined according to a plurality of decoding performances_bWhen the filling position of the value is in the corresponding column of the coding base map, the K with the best decoding performance can be obtained_bmax-K_b+1 columns being defined as K_bThe filling position of the value in the corresponding column of the coding base map can also be combined with various parameters such as decoding performance, coding complexity and the like to jointly determine the K_bThe fill position of the value is in the corresponding column in the coding base.

The transmitting device may be according to K_bAnd determining the filling position of each filling bit according to at least one column corresponding to the value. For example, the at least one column includes column b1, column b2, and column … bi, and a plurality of filling start positions including column Z · b1, column Z · b2, and column … Z · bi can be determined from the at least one column.

Determining continuous Z filling positions by taking i-1 filling starting positions in the filling starting positions as starting points; filling the starting position with the remaining oneAs a starting point, M consecutive fill positions are determined, where (i-1) Z + M ═ F. The remaining column corresponding to the filling start position may be K_bThe last column of the at least one column corresponding to the value may also be K_bThe column with the smallest column weight in at least one column corresponding to the value can also be K_bAny one of the at least one column to which the value corresponds is not limited herein.

By coding K of the base map_bmaxFor column 10, the lifting value Z is 4 for example. If the number K' of information bits in the code block is 30, K_bInformation bits in a code block may include a0 through a 29. In the fill position correspondence, K_bThe fill position of 8 corresponds to column 3, column 5 and column 7 in the coding base. The starting padding position comprises 12 th bit, 20 th bit and 28 th bit; the filling position may include: 12 th, 13 th, 14 th, 15 th, 20 th, 21 st, 22 nd, 23 th, and 28 th, 29 th bits. The filling result can be as shown in fig. 7, where the filling positions are filled with 0 elements.

The channel coding method is based on K_bValue sum K_bmaxDetermining the filling position of the filling bit to obtain the comparison result with K_bThe filling position with matched value can eliminate more uncertain factors and bring better decoding performance when the receiving equipment carries out iterative decoding on the received transmission code word after carrying out bit filling on the filling position and carrying out LDPC coding on the code block.

In one embodiment, a filling position corresponding relation corresponding to a specific coding base map is provided. The coding base map may be a base map used for a transport block with a coding rate smaller than a preset code rate threshold and/or a transport block length smaller than a preset length threshold, and the coding base map may be BG2 in an NR system.

When the information bits are the same in length but different in code rate, 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 sequence in the coding base map changes, and the position of the optimal padding bit sequence also differs. When the transport block length is short, the influence of the filling position of the filling bit on the coding performance is large. For a code block with a coding base map of BG2, especially a transport block length smaller than 640, the coding method in the present application can significantly improve the coding performance.

The filling position corresponding relation corresponding to the coding base map may include K_bThe padding positions with values of 8, 9 are in the corresponding columns in the coding base. Wherein, K_bThe padding positions with a value of 8 correspond to column 5, column 8 and column 9 in the coding base map. K_bThe padding positions with a value of 9 correspond to column 5 and column 7 in the coding base map.

Optionally, the filling position correspondence further includes K_bA padding position of value 10 is in the corresponding column of the coding base. K above_bA value of 10, with K_bmaxAnd the filling positions can correspond to one column in the coding base map, wherein the column weight is greater than a preset threshold value. Alternatively, K_bWith a value of 10, the padding position may correspond to column 7 in the coding base map. The filling position correspondence relationship corresponding to the above-described code base map can be shown in the following table.

K_bValue of	Filling at least one column corresponding to the position
		8	5，8，9
9	5，7
		10	7

According to the channel coding method, the sending equipment determines the filling position corresponding relation based on the simulation result, so that the filling position in the code block can be quickly and accurately determined through the filling position corresponding relation; after bit-stuffing the code block, a decoding performance matching the simulation result can be obtained.

In one embodiment, on the basis of the above embodiment, when the filling positions correspond to a plurality of columns, there is a case where the filling position corresponding to one column is smaller than the lift value Z, and the filling position corresponding to the other column is equal to the lift value Z, and the column having the filling position smaller than the lift value Z may be referred to as a partially filled column. When the filling position corresponds to a plurality of columns, different columns are determined as partially filled columns, and after bit filling is performed by using the partially filled columns, the corresponding decoding performance may be different. Through simulation analysis, decoding performances of different columns as partially filled columns are compared, and one column is selected to be marked as the partially filled column in the filling position corresponding relation.

Each K_bThe fill positions of the values are in corresponding columns in the coding base, including columns for partial fills. The fill position correspondence may include an identifier of a partially filled column, and the K is_bWhen the value is 8, the column for partial filling is the 9 th column in the coding base map; k_bWhen the value is 9, the column for partial filling is the 5 th column in the coding base map; k_bAt a value of 10, the column used for partial fill is column 7 in the coding base.

The partially filled columns are identified by brackets as shown in the following table.

K_bValue of	Filling at least one column corresponding to the position
		8	5，8，(9)
9	(5)，7
		10	(7)

The effect of improving the decoding performance of the channel coding method in the embodiment of the present application is described below with specific examples. Take the transmission block length of 184, the coding rate of one fifth, and the modulation method of QPSK as an example. The one-code algorithm adopted by the receiving device is a normalized minimum sum algorithm, and the normalization factor can be 0.75. FIG. 8 is K_bFigure 8 corresponds to a decoding performance comparison. In fig. 8, the curve of the circular mark is a decoding result obtained by padding at the end of information bits in the code block; the curve marked by the triangle is the decoding performance obtained after bit filling is carried out on the filling positions corresponding to the 5 th, 8 th and 9 th columns in the coding base map. The horizontal axis represents the SNR of the signal received by the receiving device and the vertical axis represents the BLER corresponding to different SNRs. Similarly, FIG. 9 is K_bThe decoding performance comparison graph corresponding to 9; FIG. 10 is K_bThe figure corresponds to 10 for decoding performance comparison. As can be seen from the comparison results in fig. 8 to fig. 10, the decoding performance of the receiving device can be significantly improved by using the channel coding method in the present application.

According to the channel coding method, the partially filled columns are identified in the corresponding relation of the filling positions, so that when the sending equipment carries out bit filling, the filling positions corresponding to the partially filled columns and the filling positions corresponding to the completely filled columns can be more accurately determined, and after the bit filling value is carried out by adopting the method, the decoding performance matched with the simulation result is obtained.

In one embodiment, as shown in fig. 11, there is provided a channel decoding method applied to the receiving device in fig. 1, the method including:

s201, adding filling bits at filling positions in transmission code words to be decoded; the filling position is related to the column weight of the coding base map corresponding to the transmission code word;

s202, decoding the filled transmission code words by adopting the coding base map through low-density parity check codes.

The transmission codeword received by the receiving device may be obtained by the sending device performing LDPC encoding based on the channel encoding method in the foregoing embodiment, and deleting the padding bits after rate matching. The receiving device may perform bit filling on the transmission codeword, and when the receiving device performs bit filling on the transmission codeword, a filling position corresponding to the filling bit is consistent with a position at which the transmitting device performs bit filling on the code block to be encoded. The receiving device may determine the filling position of the filling bit by using the method in the above embodiment, and then perform bit filling on the transmission codeword. Further, the receiving device may LDPC decode the padded transmitted codeword with the encoded base map.

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

The implementation principle and technical effect of the channel decoding method correspond to those of the channel coding method, and are not described herein again.

It should be understood that, although the steps in the flowcharts of fig. 2 and 11 are shown in sequence as indicated by the arrows, the steps are not necessarily performed in sequence as indicated by the arrows. The steps are not performed in the exact order shown and described, and may be performed in other orders, unless explicitly stated otherwise. Moreover, at least some of the steps in fig. 2 and 11 may include multiple sub-steps or multiple stages, which are not necessarily performed at the same time, but may be performed at different times, and the order of performing the sub-steps or stages is not necessarily sequential, but may be performed alternately or alternately with other steps or at least some of the sub-steps or stages of other steps.

Fig. 12 is a block diagram of a channel coding apparatus according to an embodiment. As shown in fig. 13, the above apparatus is applied to a transmitting device, and includes:

a blocking module 110, configured to block a transmission block to be encoded to obtain at least one code block; each code block comprises information bits and padding bits; filling positions of the filling bits are related to column weights of the coding base map corresponding to the transmission block;

and an encoding module 120, configured to perform low density parity check code encoding on each code block by using the encoding base map.

In an embodiment, on the basis of the above embodiment, as shown in fig. 13, the apparatus further includes a determining module 130, configured to: the number of columns K occupied by the information bits in the code block in the coding base map_bMaximum number of columns K for information bits with said coding base pattern_bmaxAnd comparing, and determining the filling position of the filling bit in the code block according to the comparison result.

In an embodiment, on the basis of the foregoing embodiment, the determining module 130 is specifically configured to: if K_bIs equal to K_bmaxDetermining that the filling positions of the filling bits correspond to a preset column in the coding base map; the column weight of the preset column is larger than a preset threshold value.

In an embodiment, on the basis of the foregoing embodiment, the determining module 130 is specifically configured to: if K_bLess than K_bmaxDetermining the filling position of the filling bit according to a preset corresponding relation of the filling position; wherein, the filling position corresponding relation includes different K_bThe fill position of the value is in the corresponding column in the coding base.

In an embodiment, on the basis of the above embodiment, the coding base map is a base map used for a transport block whose coding rate is smaller than a preset code rate threshold and/or whose transport block length is smaller than a preset length threshold; the filling position corresponding relation comprises K_bThe padding positions with values of 8, 9 are in the corresponding columns in the coding base.

In one embodiment, K is based on the above embodiments_bThe padding positions with a value of 8 correspond to

columns

5, 8 and 9 in the coding base map.

In one embodiment, K is based on the above embodiments_bThe padding positions with a value of 9 correspond to column 5 and column 7 in the coding base map.

In an embodiment, on the basis of the above embodiment, the filling position corresponding relationship further includes K_bThe padding positions with a value of 10 are in the corresponding columns in the coding base map.

In one embodiment, on the basis of the above-mentioned embodiments, the K_bThe padding position with a value of 10 corresponds to column 7 in the coding base map.

In one embodiment, on the basis of the above-mentioned embodiments, each K is_bThe fill positions of values comprise columns for partial fill in corresponding columns in the coding base map.

In one embodiment, the K_bWhen the value is 8, the column for partial filling is the 9 th column in the coding base map.

In one embodiment, the K_bAnd when the value is 9, the column for partial filling is the 5 th column in the coding base map.

In one embodiment, the K_bAt a value of 10, the column used for partial filling is column 7 in the encoded base map.

In one embodiment, on the basis of the above embodiment, the padding bits are bit combinations formed by alternating 0 and 1.

The implementation principle and technical effect of the channel coding device are referred to the method embodiments, and are not described herein again.

The division of the modules in the channel coding apparatus is merely for illustration, and in other embodiments, the channel coding apparatus may be divided into different modules as needed to complete all or part of the functions of the channel coding apparatus.

For the specific limitations of the channel coding apparatus, reference may be made to the above limitations of the channel coding method, which are not described herein again. The modules in the channel coding device can be wholly or partially implemented by software, hardware and a combination thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.

Fig. 14 is a block diagram of a channel decoding apparatus according to an embodiment. As shown in fig. 14, the above apparatus is applied to a receiving device, and includes:

a padding module 210, 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 map adopted when a transmission block corresponding to the transmission code word is coded;

and a decoding module 220, configured to perform low density parity check code decoding on the filled transmission code word by using the coding base map.

The division of each module in the channel decoding apparatus is merely for illustration, and in other embodiments, the channel decoding apparatus may be divided into different modules as needed to complete all or part of the functions of the channel decoding apparatus.

For the specific limitations of the channel decoding apparatus, reference may be made to the limitations of the channel decoding method in the foregoing, and details are not repeated here. The various modules in the channel decoding device described above may be implemented in whole or in part by software, hardware, and combinations thereof. The modules can be embedded in a hardware form or independent from a processor in the computer device, and can also be stored in a memory in the computer device in a software form, so that the processor can call and execute operations corresponding to the modules.

Fig. 15 is a schematic diagram of the internal structure of the transmission device in one embodiment. The sending device may be any terminal device such as a mobile phone, a tablet computer, a notebook computer, a desktop computer, a PDA (Personal Digital Assistant), a POS (Point of Sales), a vehicle-mounted computer, and a wearable device. The transmitting device includes a processor and a memory connected by a system bus. The processor may include one or more processing units, among others. The processor may be a CPU (Central Processing Unit), a DSP (Digital Signal processor), or the like. The memory may include a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The computer program is executable by a processor for implementing a channel coding method provided in the following embodiments. The internal memory provides a cached execution environment for the operating system computer programs in the non-volatile storage medium.

Fig. 16 is a schematic diagram of the internal structure of the receiving apparatus in one embodiment. The receiving device includes a processor and a memory connected by a system bus. The processor may be a CPU (Central Processing Unit), a DSP (Digital Signal processor), or the like. The memory may include a non-volatile storage medium and an internal memory. The non-volatile storage medium stores an operating system and a computer program. The computer program can be executed by a processor for implementing a channel decoding method provided in the following embodiments. The internal memory provides a cached execution environment for the operating system computer programs in the non-volatile storage medium. The server may be implemented as a stand-alone server or as a server cluster consisting of a plurality of servers. It will be appreciated by those skilled in the art that the configurations shown in the figures are block diagrams of only some of the configurations relevant to the present application, and do not constitute a limitation on the servers to which the present application applies, and that a particular server may include more or fewer components than shown, or some components may be combined, or have a different arrangement of components.

The implementation of the respective modules in the apparatus provided in the embodiments of the present application may be in the form of a computer program. The computer program may be run on a terminal or a server. Program modules constituted by such computer programs may be stored on the memory of the electronic device. Which when executed by a processor, performs the steps of the method described in the embodiments of the present application.

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

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

Any reference to memory, storage, database, or other medium used herein may include non-volatile and/or volatile memory. The nonvolatile Memory may include a ROM (Read-Only Memory), a PROM (Programmable Read-Only Memory), an EPROM (Erasable Programmable Read-Only Memory), an EEPROM (Electrically Erasable Programmable Read-Only Memory), or a flash Memory. Volatile Memory can include RAM (Random Access Memory), which acts as external cache Memory. By way of illustration and not limitation, RAM is available in many forms, such as SRAM (Static Random Access Memory), DRAM (Dynamic Random Access Memory), SDRAM (Synchronous Dynamic Random Access Memory), Double Data Rate DDR SDRAM (Double Data Rate Synchronous Random Access Memory), ESDRAM (Enhanced Synchronous Dynamic Random Access Memory), SLDRAM (Synchronous Link Dynamic Random Access Memory), RDRAM (Random Dynamic Random Access Memory), and DRmb DRAM (Dynamic Random Access Memory).

The above-mentioned embodiments only express several embodiments of the present application, and the description thereof is more specific and detailed, but not construed as limiting the scope of the present application. It should be noted that, for a person skilled in the art, several variations and modifications can be made without departing from the concept of the present application, which falls within the scope of protection of the present application. Therefore, the protection scope of the present patent shall be subject to the appended claims.

Claims

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

the method comprises the steps of processing a transmission block to be coded in a blocking mode to obtain at least one code block; each code block comprises information bits and padding bits; filling positions of the filling bits are related to column weights of the coding base maps corresponding to the transmission blocks;

2. The method of claim 1, further comprising:

the number of columns K occupied by the information bits in the code block in the coding base map_bMaximum number of columns K for information bits with said coding base pattern_bmaxAnd comparing, and determining the filling position of the filling bit in the code block according to the comparison result.

3. The method of claim 2, wherein the determining the filling positions of the filling bits in the code block according to the comparison result comprises:

if K_bIs equal to K_bmaxDetermining that the filling positions of the filling bits correspond to a preset column in the coding base map; the column weight of the preset column is larger than a preset threshold value.

4. The method of claim 2, wherein the determining the filling positions of the filling bits in the code block according to the comparison result comprises:

if K_bLess than K_bmaxDetermining the filling position of the filling bit according to a preset corresponding relation of the filling position; wherein, the filling position corresponding relation comprises different K_bThe fill positions of the values are in corresponding columns in the coding base.

5. The method according to claim 4, wherein the coding base map is a base map used for a transport block with a coding rate less than a preset code rate threshold and/or a transport block length less than a preset length threshold; the filling position corresponding relation comprises K_bThe padding positions with values of 8, 9 are in the corresponding columns in the coding base map.

6. The method of claim 5, wherein K is_bThe padding positions with a value of 8 correspond to columns 5, 8 and 9 in the coding base map.

7. The method of claim 5, wherein K is_bThe padding positions with a value of 9 correspond to column 5 and column 7 in the coding base map.

8. The method according to claim 4, wherein the fill-position correspondence further comprises K_bThe padding positions with a value of 10 are in the corresponding columns in the coding base map.

9. The method of claim 8, wherein K is_bThe padding position with a value of 10 corresponds to column 7 in the coding base map.

10. The method of claim 4, wherein each K is_bThe fill positions of values comprise columns for partial fill in corresponding columns in the coding base map.

11. The method of claim 10, wherein K is_bThe column for partial fill at a value of 8Is column 9 of the coding base map.

12. The method of claim 10, wherein K is_bWhen the value is 9, the column for partial filling is the 5 th column in the coding base map.

13. The method of claim 10, wherein K is_bWhen the value is 10, the column for partial filling is the 7 th column in the coding base map.

14. The method according to any of claims 1-13, wherein the padding bits are bit combinations of alternating 0 and 1.

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

filling bits are added at filling positions in transmission code words to be decoded; the filling position is related to the column weight of the coding base map corresponding to the transmission code word;

and decoding the filled transmission code words by adopting the coding base map.

16. A channel coding apparatus applied to a transmission device, comprising:

the block division module is used for processing the transmission block to be coded in a block division mode to obtain at least one code block; each code block comprises information bits and padding bits; filling positions of the filling bits are related to column weights of the coding base maps corresponding to the transmission blocks;

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

and the decoding module is used for decoding the low-density parity check codes of the filled transmission code words by adopting the coding base map.

18. A transmitting device comprising a memory and a processor, the memory having stored thereon a computer program, characterized in that the computer program, when being executed by the processor, causes the processor to carry out the steps of the channel coding method according to any one of claims 1 to 15.

19. A receiving device comprising a memory and a processor, the memory having stored thereon a computer program, wherein the computer program, when executed by the processor, causes the processor to perform the steps of the channel decoding method as claimed in claim 15.

20. A computer-readable storage medium, on which a computer program is stored which, when being executed by a processor, carries out the steps of the method according to any one of claims 1 to 15.