Communication method and apparatus

Abstract

A communication method and apparatus, relating to the technical field of communications, and capable of reducing the transmission power of a sending end device when the sending end device communicates with a receiving end device on the basis of an LDPC encoding mode, thereby improving transmission performance. The method comprises: grouping an information bit sequence of length K to obtain a first sequence of length K1, a second sequence of length K2, and a third sequence of length K3; on the basis of the second sequence, transforming the first sequence to obtain a fourth sequence of length M; on the basis of the fourth sequence, the second sequence, and the third sequence, determining a fifth sequence of length K4, and performing LDPC encoding on the fifth sequence to obtain a sixth sequence of length E; on the basis of a first interleaving pattern, performing interleaving on the sixth sequence to obtain a seventh sequence; and modulating the seventh sequence to obtain a modulated symbol sequence, and outputting the modulated symbol sequence. The first interleaving pattern is related to the modulation order, E, M, and L.

Description

Communication method and apparatus

[0001] The present application claims priority from the Chinese patent application No. 202411277073.5 filed on September 11, 2024, and entitled "Communication method and apparatus", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

[0002] The present application relates to the field of communication technology, in particular to a communication method and apparatus. BACKGROUND

[0003] In a communication system, a sending device can encode an information bit sequence by using a low density parity check code (LDPC) method, modulate the encoded sequence, and send the modulated sequence to a receiving device.

[0004] In the modulation, the information bits can be mapped to symbol bits first, and the parity bits can be mapped to the most unreliable amplitude bits first, so as to improve the transmission performance. Considering the above design, the transmission performance can be further improved by transforming the bit sequence before encoding, for example, by using a probability shaping technique.

[0005] Therefore, how to achieve efficient transmission when the sending device encodes based on the LDPC method is a technical problem to be solved. SUMMARY

[0006] The present application provides a communication method and apparatus, which can reduce the transmission power of the sending device and improve the transmission performance when the sending device communicates with the receiving device based on the LDPC encoding method.

[0007] In a first aspect, the present application provides a communication method, which can be executed by a sending device. In the present application, the "sending device" can refer to the sending device itself, a component (e.g., a processor, a chip, or a chip system) in the sending device, or a logic module or software capable of realizing all or part of the functions of the sending device. The method comprises: grouping a sequence of information bits with a length of K to obtain a first sequence with a length of K1, a second sequence with a length of K2, and a third sequence with a length of K3; transforming the first sequence according to the second sequence to obtain a fourth sequence with a length of M; determining a fifth sequence with a length of K4 according to the fourth sequence, the second sequence, and the third sequence, and performing LDPC encoding on the fifth sequence to obtain a sixth sequence with a length of E; interleaving the sixth sequence according to a first interleaving pattern to obtain a seventh sequence; modulating the seventh sequence to obtain a sequence of modulation symbols, and outputting the sequence of modulation symbols. Wherein, K1 is a positive integer less than K, K2 is equal to L*Y, Y is the number of modulation symbols corresponding to a transmission resource, L is greater than or equal to 0, K3 is equal to K-K1-K2; M is greater than or equal to K1; K4 is equal to M+K2+K3; the first interleaving pattern is related to the modulation order, E, M, and L.

[0008] Based on the first aspect, the sending device can transform the first sequence after grouping to obtain a "shaping gain", reduce the sending energy, and reduce the sending power. At the same time, the sending device can also interleave the sixth sequence according to the first interleaving pattern, which is related to the modulation order, E, and M, so as to make the information bits be mapped to the symbol bit first, and the check bits be mapped to the most unreliable amplitude bit first, thereby improving the performance of the coding system and the error correction performance. That is, the communication method provided by the present application can combine the transformation process of probability shaping with LDPC encoding, obtain a shaping gain while reducing the sending power, adapt to NR-LDPC, improve the transmission performance, and improve the error correction performance.

[0009] In a possible design, the transforming the first sequence according to the second sequence to obtain the fourth sequence with the length of M comprises: performing distribution matching transformation on the first sequence according to the second sequence to obtain the fourth sequence.

[0010] Based on the possible design, the distribution matching transformation can be performed on the first sequence to obtain a shaping gain.

[0011] In a possible design, the transforming the first sequence according to the second sequence to obtain the fourth sequence with the length of M comprises: performing distribution matching transformation on the first sequence according to the second sequence to obtain the fourth sequence.

[0012] Based on the possible design, the first sequence is subjected to a distribution matching transformation based on the first encoding mode to obtain a shaping gain.

[0013] In a possible design, the first sequence is transformed according to the second sequence to obtain a fourth sequence with a length of M, including: the first sequence is subjected to a distribution matching transformation based on a decoding mode of the first encoding mode according to the second sequence to obtain the fourth sequence.

[0014] In a possible design, the value of M is determined according to Y.

[0015] In a possible design, M is equal to a product of P and Y; and P is an even number.

[0016] Based on the above two possible designs, the value of M can be an even multiple of Y, to ensure that the M transformed bits of the fourth sequence can be uniformly distributed in the real part and the imaginary part of the Y modulation symbols.

[0017] In a possible design, the value of M is 2Y.

[0018] Based on the possible design, in the case where the value of M is equal to 2Y, the fourth sequence corresponds to 1 bit with a determined amplitude in the real part and the imaginary part of the Y modulation symbols.

[0019] In a possible design, a fifth sequence with a length of K4 is determined according to the fourth sequence, the second sequence and the third sequence, including: the fifth sequence is determined according to the fourth sequence, the second sequence and the third sequence based on the first interleaving sequence.

[0020] Based on the possible design, the fourth sequence, the second sequence and the third sequence can be processed based on the first interleaving sequence to obtain the fifth sequence.

[0021] In a possible design, the first interleaving sequence includes M elements, K2 elements and K3 elements, the M elements are located before the K2 elements, and the M elements and the K2 elements are located before part or all of the K3 elements.

[0022] Based on the possible design, by arranging the M elements before part or all of the K2 elements and the K3 elements, the M transformed bits can be interleaved to the most reliable amplitude bits when subsequent interleaving is performed according to the first interleaving pattern, to improve the performance of the encoding system.

[0023] In a possible design, in the case where the M elements and the K2 elements are located before part of the K3 elements, the remaining part of the K3 elements is located before the M elements.

[0024] In one possible design, the number of the remaining elements of the K3 elements is X, X is related to Zc, and Zc is a spreading factor of the LDPC code.

[0025] Based on the above two possible designs, by setting the X elements of the third sequence before the M elements, the X elements can be punctured when rate matching is performed later, and thus the M transformed bits can be interleaved to the most reliable amplitude bits when interleaving is performed according to the first interleaving pattern, improving the performance of the coding system.

[0026] In one possible design, the first interleaving sequence is related to one or more of the following parameters: a modulation order, a length of the third sequence, M, a column weight of a base matrix of the LDPC code, a row weight of the base matrix of the LDPC code, a column weight of a check matrix of the LDPC code, a row weight of the check matrix of the LDPC code, the first interleaving pattern, or E.

[0027] Based on this possible design, multiple feasible schemes are provided for the design of the first interleaving sequence.

[0028] In one possible design, the fifth sequence includes, in ascending order of the numbers, the fourth sequence, the second sequence, and the third sequence, or the fifth sequence includes, in ascending order of the numbers, the X bits of the third sequence, the fourth sequence, the second sequence, and the K3-X bits of the third sequence.

[0029] In one possible design, X is related to Zc, and Zc is a spreading factor of the LDPC code.

[0030] Based on the above two possible designs, by setting the fourth sequence before part or all of the elements of the second sequence and the third sequence, the fourth sequence can be interleaved to the most reliable amplitude bits when interleaving is performed according to the first interleaving pattern, improving the performance of the coding system. In one possible design, a length of the first interleaving pattern is equal to a modulation order Q, and values of the second element to the P+L+1th element of the first interleaving pattern are 0 to P+L-1; P is equal to M / Y, and P is an even number.

[0031] Based on this possible design, by setting the values of the second element to the P+L+1th element of the first interleaving pattern to be 0 to P+L-1, the fourth sequence can be interleaved to the most reliable amplitude bits when interleaving is performed according to the first interleaving pattern, improving the performance of the coding system.

[0032] In one possible design, values of the other Q-P elements of the first interleaving pattern, except the second element to the P+L+1th element, are P+L, P+L+1, P+L+2 to Q-1.

[0033] In a possible design, values of the 0th element to the 1st element of the first interleaving pattern are P+L to P+L+1; and values of the P+L+2th element to the Q-1th element of the first interleaving pattern are P+L+2 to Q-1.

[0034] Based on the above two possible designs, values of the Q-P-L elements of the first interleaving pattern other than the 2nd element to the P+L+1th element can be interleaved without limitation to simplify decoding implementation.

[0035] In a possible design, the sixth sequence is interleaved according to the first interleaving pattern to obtain a seventh sequence, including: mapping a Uth bit in the sixth sequence to a Vth position of the seventh sequence according to the first interleaving pattern; where U is related to the first interleaving pattern, E, and a modulation order; V is related to the modulation order and E, U=0, 1, 2, …, E-1; e2=0, 1, 2, …, E-1.

[0036] In a possible design, U is equal to W(i)*E / Q+j; where W(i) represents an i th element in the first interleaving pattern, i=0, 1, 2, …, Q-1; Q is a modulation order, and j=0, 1, 2, …, E / Q-1.

[0037] In a possible design, V is equal to i+j*Q; where i=0, 1, 2, …, Q-1; j=0, 1, 2, …, E / Q-1; and Q is a modulation order.

[0038] Based on the above three possible designs, the sending end device can perform interleaving in the above manner to improve the performance of the encoding system.

[0039] In a possible design, the 2nd element to the P+L+1th element of the first interleaving pattern correspond to positions of the transformed bits in the sixth sequence and the second sequence in the seventh sequence, and P is equal to M / Y, where P is an even number.

[0040] In a possible design, the last A elements of the first interleaving pattern other than the 2nd element to the P+L+1th element correspond to positions of the check bits in the sixth sequence in the seventh sequence, and P is equal to M / Y, where P is an even number.

[0041] In a possible design, the first B elements of the first interleaving pattern other than the 2nd element to the P+L+1th element correspond to positions of the non-transformed bits in the sixth sequence in the seventh sequence, and B is equal to E / Y-A-L-P.

[0042] Based on the above three possible designs, interleaving can be performed as described above to place the transformed M bits in the modulation bit positions, the check bits in the least reliable bit positions other than the positions corresponding to the M bits, and the non-transformed bits in the most reliable positions other than the positions corresponding to the M bits, to simplify the decoding implementation.

[0043] In a possible design, in the case of the same modulation order, L corresponding to a first modulation and coding strategy (MCS) is less than or equal to L corresponding to a second MCS; and the serial number of the first MCS is less than the serial number of the second MCS.

[0044] In a possible design, L is less than or equal to a difference between the modulation order and 4.

[0045] In a possible design, in the case of a modulation order of 10 and P+L equal to 6, the first interleaving pattern is [6 7 0 1 2 3 4 5 8 9]; or in the case of a modulation order of 10 and P+L equal to 4, the first interleaving pattern is [4 5 0 1 2 3 6 7 8 9]; or in the case of a modulation order of 10 and P+L equal to 2, the first interleaving pattern is [2 3 0 1 4 5 6 7 8 9]; where P is equal to M / Y.

[0046] In a possible design, in the case of a modulation order of 8 and P+L equal to 4, the first interleaving pattern is [4 5 0 1 2 3 6 7]; or in the case of a modulation order of 8 and P+L equal to 2, the first interleaving pattern is [2 3 0 1 4 5 6 7]; where P is equal to M / Y.

[0047] In a possible design, in the case of a modulation order of 6 and P+L equal to 2, the first interleaving pattern is [2 3 0 1 4 5]; where P is equal to M / Y.

[0048] In a possible design, in the case of a modulation order of 4 and P+L equal to 2, the first interleaving pattern is [2 3 0 1]; where P is equal to M / Y.

[0049] Based on the above four possible designs, multiple feasible schemes are provided for the first interleaving pattern.

[0050] In a possible design, the fifth sequence is LDPC encoded to obtain a sixth sequence with a length of E, including: performing LDPC encoding and rate matching on the fifth sequence to obtain the sixth sequence.

[0051] In a possible design, the modulation symbol sequence includes Y modulation symbols, and each modulation symbol corresponds to Q bits of the seventh sequence after interleaving based on the first interleaving pattern.

[0052] In a possible design, K1 is determined according to Y.

[0053] Based on the possible design, for a modulation order Q, a real part of each modulation symbol corresponds to Q / 2 bits, and an imaginary part also corresponds to Q / 2 bits, and the Q / 2 bits include one symbol bit and Q / 2-1 modulation bits. For a modulation mode with a modulation order Q greater than or equal to 6 (for example, 64QAM, 256QAM, or 1024QAM), all amplitude bits in the Q / 2 bits corresponding to the real part and the imaginary part of each modulation symbol cannot be transformed or subjected to auxiliary transformation. If the last amplitude bit in the Q / 2 bits is transformed or used as auxiliary transformation, a check bit has to be carried in the symbol bit, thereby affecting performance, and therefore the last amplitude bit can be kept from being transformed or subjected to auxiliary transformation, and a check bit can be subsequently mapped to the last amplitude bit, to avoid mapping an information bit to the most unreliable subchannel (that is, the last amplitude bit) and to improve performance of the coding system. Based on this, on a condition that the number of amplitude bits that are subjected to transformation is determined, K1, a length of a first sequence, and K2, a length of a second sequence, can be determined according to Y.

[0054] In a possible design, K1 is equal to a product of r and Y, where r is a positive number.

[0055] In a possible design, r is predefined; or r is related to a modulation order; or r is related to a modulation order and a modulation and coding strategy (MCS).

[0056] In a possible design, r is related to a modulation order, including that r is greater than 0 and less than or equal to 2.

[0057] In a possible design, r is related to a modulation order and an MCS, including that r is greater than 0 and less than or equal to 2, a first MCS corresponds to r that is less than or equal to r corresponding to a second MCS in a case that the modulation orders are the same, and a serial number of the first MCS is less than a serial number of the second MCS.

[0058] In a possible design, r is in a range of (0, 2].

[0059] Based on the possible design, multiple feasible schemes are provided for a value of r.

[0060] In a possible design, a specific value of one or more of the following parameters is received from a receiving end device or a network device: L, Y, r, a modulation order, P, M, or E, where r is an integer greater than 0, and P is an even number.

[0061] In a second aspect, the present application provides a communication method, which can be performed by a receiving end device. In the present application, the receiving end device can refer to the receiving end device itself, a component (e.g., a processor, a chip, or a chip system) in the receiving end device, or a logic module or software capable of realizing all or part of the functions of the receiving end device. The method comprises: receiving to-be-decoded information from a sending end device; wherein the to-be-decoded information corresponds to an information bit sequence with a length of K; demodulating the to-be-decoded information to obtain a first symbol sequence with a length of E; deinterleaving the first symbol sequence according to a first interleaving pattern to obtain a second symbol sequence; wherein the first interleaving pattern is related to a modulation order, E, M, and L; M is a sequence inverse transform length, and L is greater than or equal to 0; decoding the second symbol sequence to obtain an eighth sequence with a length of K4; determining a ninth sequence with a length of M, a tenth sequence with a length of K2, and an eleventh sequence with a length of K3 according to the eighth sequence; K2 is equal to L*Y, Y is a number of modulation symbols corresponding to a transmission resource, and K3 is equal to K4-M-K2; inversely transforming the ninth sequence according to the tenth sequence to obtain a twelfth sequence with a length of K1; M is greater than or equal to K1; K1 is equal to K-K2-K3; and determining a decoding result of the information bit sequence according to the twelfth sequence, the tenth sequence, and the eleventh sequence.

[0062] Based on the second aspect, the receiving end device can perform a corresponding decoding process based on the encoding process to obtain a decoding result, obtain a shaping gain, adapt to NR-LDPC, and simplify decoding implementation, corresponding to the sending end device performing transformation on the first sequence after grouping to obtain a shaping gain, reduce a sending energy, and reduce a sending power, and the sending end device also performing interleaving on the sixth sequence according to the first interleaving pattern, which is related to a modulation order, E, and M, so that information bits are preferentially mapped to symbol bit positions, check bits are preferentially mapped to the most unreliable amplitude bit positions, the performance of the encoding system is improved, NR-LDPC is adapted, and the error correction performance is improved.

[0063] In a third aspect, the present application provides a communication method, which can be executed by a sending device. In the present application, the "sending device" can refer to the sending device itself, a component (e.g., a processor, a chip, or a chip system) in the sending device, or a logic module or software capable of realizing all or part of the functions of the sending device. The method comprises: grouping a sequence of information bits with a length of K to obtain a first sequence with a length of K1, a second sequence with a length of K2, a third sequence with a length of K3, and a fourth sequence with a length of K4; transforming the first sequence according to the third sequence to obtain a fifth sequence with a length of M; determining a sixth sequence with a length of K5 according to the fifth sequence, the second sequence, the third sequence, and the fourth sequence; performing LDPC encoding on the sixth sequence to obtain a seventh sequence with a length of E; performing row-column interleaving on the seventh sequence according to a second interleaving pattern to obtain an eighth sequence; modulating the eighth sequence to obtain a sequence of modulation symbols; and outputting the sequence of modulation symbols. In the present application, K1 is a positive integer less than K, K2 is equal to 2Y, K3 is equal to L*Y, K4 is equal to K-K1-K2-K3, Y is the number of modulation symbols corresponding to a transmission resource, L is greater than or equal to 0, M is greater than or equal to K1, and K5 is equal to M+K2+K3+K4.

[0064] Based on the third aspect, the sending device can transform the first sequence after grouping to obtain a "shaping gain", reduce the sending energy, and reduce the sending power. Meanwhile, the sending device can also perform row-column interleaving on the seventh sequence according to the second interleaving pattern, which can cause the information bits to be preferentially mapped to the symbol bit positions and the check bits to be preferentially mapped to the most unreliable amplitude bit positions, thereby improving the performance of the coding system and the error correction performance. That is, the communication method provided by the present application can combine the transformation process of probability shaping with LDPC encoding, obtain a shaping gain while reducing the sending power, adapt to NR-LDPC, improve the transmission performance, and improve the error correction performance.

[0065] In a possible design, the transformation of the first sequence according to the third sequence to obtain the fifth sequence with a length of M comprises: performing distribution matching transformation on the first sequence according to the third sequence to obtain the fifth sequence.

[0066] Based on the possible design, the distribution matching transformation can be performed on the first sequence to obtain a shaping gain.

[0067] In a possible design, the transformation of the first sequence according to the third sequence to obtain the fifth sequence with a length of M comprises: performing distribution matching transformation on the first sequence according to the third sequence to obtain the fifth sequence.

[0068] Based on the possible design, the first sequence is subjected to a distribution matching transformation based on the first encoding mode to obtain a shaping gain.

[0069] In a possible design, the first sequence is transformed according to the third sequence to obtain a fifth sequence with a length of M, including: the first sequence is subjected to a distribution matching transformation based on a decoding mode of the first encoding mode according to the third sequence to obtain the fifth sequence.

[0070] In a possible design, the value of M is determined according to Y.

[0071] In a possible design, M is equal to a product of P and Y; wherein P is an even number.

[0072] Based on the above two possible designs, the value of M can be an even multiple of Y, to ensure that the M transformed bits of the fifth sequence can be uniformly distributed in the real part and the imaginary part of the Y modulation symbols.

[0073] In a possible design, the value of M is 2Y.

[0074] Based on the possible design, in the case where the value of M is equal to 2Y, the fifth sequence corresponds to 1 bit with a determined amplitude in the real part and the imaginary part of the Y modulation symbols.

[0075] In a possible design, a sixth sequence with a length of K5 is determined according to the fifth sequence, the second sequence, the third sequence and the fourth sequence, including: the sixth sequence is determined according to the fifth sequence, the second sequence, the third sequence and the fourth sequence based on a second interleaving sequence.

[0076] Based on the possible design, the fifth sequence, the second sequence, the third sequence and the fourth sequence can be processed based on the second interleaving sequence to obtain the sixth sequence.

[0077] In a possible design, the second interleaving sequence includes K2 elements, M elements, K3 elements and K4 elements, the K2 elements are located before the M elements, the M elements are located before the K3 elements, and the K2 elements, the M elements and the K3 elements are located before part or all of the K4 elements.

[0078] Based on the possible design, by setting the K2 elements and the M elements before part or all of the K3 elements and the K4 elements, the K2 elements can be interleaved to the symbol bit in subsequent interleaving according to the second interleaving pattern, the M transformed bits can be interleaved to the most reliable amplitude bit, and the performance of the encoding system is improved.

[0079] In a possible design, in a case where the K2 elements, the M elements and the K3 elements are located before part of the K4 elements, the rest of the K4 elements are located before the K2 elements, the M elements and the K3 elements.

[0080] In a possible design, the number of the rest of the K4 elements is X, and X is related to Zc, where Zc is a spreading factor of LDPC coding.

[0081] Based on the two possible designs, by arranging the X elements of the fourth sequence before the M elements, the X elements can be punctured when rate matching is performed subsequently, and thus the K2 elements can be interleaved to the symbol bit positions and the M transformed bits can be interleaved to the most reliable amplitude bit positions when interleaving is performed according to the second interleaving pattern, thereby improving the performance of the coding system.

[0082] In a possible design, the second interleaving sequence is related to one or more of the following parameters: a modulation order, a length of the fourth sequence, M, a column weight of an LDPC base matrix, a row weight of the LDPC base matrix, a column weight of an LDPC check matrix, a row weight of the LDPC check matrix, the second interleaving pattern, or E.

[0083] Based on the possible design, multiple feasible schemes are provided for the design of the second interleaving sequence.

[0084] In a possible design, the sixth sequence includes, in ascending order of numbers, the second sequence, the fifth sequence, the third sequence, and the fourth sequence; or the sixth sequence includes, in ascending order of numbers, the X bits of the fourth sequence, the second sequence, the fifth sequence, the third sequence, and the K-K1-2Y-L*Y-X bits of the fourth sequence.

[0085] In a possible design, X is related to Zc, where Zc is a spreading factor of LDPC coding.

[0086] Based on the two possible designs, by arranging the second sequence and the fifth sequence before part or all of the elements of the third sequence and the fourth sequence, the second sequence can be interleaved to the symbol bit positions and the fifth sequence can be interleaved to the most reliable amplitude bit positions when interleaving is performed according to the second interleaving pattern, thereby improving the performance of the coding system.

[0087] In a possible design, the seventh sequence is interleaved according to the second interleaving pattern to obtain an eighth sequence, including: mapping a U th bit in the seventh sequence to a V th position in the eighth sequence according to the second interleaving pattern; where U is related to E and a modulation order, V is related to the modulation order and E, U = 0, 1, 2, …, E-1, and V = 0, 1, 2, …, E-1.

[0088] In a possible design, U is equal to i*E / Q+j, where i=0, 1, 2, …, Q-1, Q is the modulation order, and j=0, 1, 2, …, E / Q-1.

[0089] In a possible design, V is equal to i+j*Q, where i=0, 1, 2, …, Q-1, j=0, 1, 2, …, E / Q-1, and Q is the modulation order.

[0090] Based on the above three possible designs, the sending end device can perform interleaving in the above manner to improve the performance of the encoding system.

[0091] In a possible design, the last A elements in the second interleaving pattern, except for the 2nd element to the (P+L+1)th element, correspond to the positions of the check bits in the eighth sequence, P is equal to M / Y, and P is an even number.

[0092] In a possible design, the last A elements in the second interleaving pattern, except for the 2nd element to the (P+L+1)th element, correspond to the positions of the check bits in the eighth sequence, P is equal to M / Y, and P is an even number.

[0093] In a possible design, the first 2 elements in the second interleaving pattern correspond to the positions of the information bits (i.e., the second sequence) in the eighth sequence, which are not transformed in the seventh sequence.

[0094] In a possible design, the first C elements in the second interleaving pattern, except for the 0th element to the (P+L+1)th element, correspond to the positions of the information bits in the eighth sequence, which are not transformed in the seventh sequence, C is equal to E / Y-2-L-P-A.

[0095] Based on the above four possible designs, the sending end device can perform interleaving in the above manner to improve the performance of the encoding system.

[0096] In a possible design, in the case of the same modulation order, L corresponding to a first modulation and coding strategy (MCS) is less than or equal to L corresponding to a second MCS, where the serial number of the first MCS is less than the serial number of the second MCS.

[0097] In a possible design, L is less than or equal to the difference between the modulation order and 4.

[0098] In a possible design, the sixth sequence is subjected to LDPC encoding to obtain the seventh sequence with a length of E, including: performing LDPC encoding and rate matching on the sixth sequence to obtain the seventh sequence.

[0099] In a possible design, the sequence of modulation symbols includes Y modulation symbols, and each modulation symbol corresponds to Q bits after being interleaved based on the second interleaving pattern in the eighth sequence.

[0100] In a possible design, K1 is determined according to Y.

[0101] In a possible design, K1 is equal to a product of r and Y, where r is an integer greater than 0.

[0102] In a possible design, r is predefined, or r is related to a modulation order, or r is related to a modulation order and a modulation and coding strategy (MCS).

[0103] In a possible design, r is related to a modulation order, including that r is greater than 0 and less than or equal to 2.

[0104] In a possible design, r is related to a modulation order and an MCS, including that r is greater than 0 and less than or equal to 2, a first MCS corresponds to a smaller r than a second MCS in a case that the modulation orders are the same, and a sequence number of the first MCS is smaller than a sequence number of the second MCS.

[0105] In a possible design, r is in a range of (0, 2].

[0106] Based on the possible design, multiple feasible schemes are provided for the value of r.

[0107] In a possible design, a specific value of one or more of the following parameters is received from a sending-end device or a network device: L, Y, r, a modulation order, P, M, or E, where r is an integer greater than 0, and P is an even number.

[0108] In a fourth aspect, the present application provides a communication method, which can be executed by a receiving end device. In the present application, the receiving end device can refer to the receiving end device itself, a component (e.g., a processor, a chip, or a chip system, etc.) in the receiving end device, or a logic module or software capable of realizing all or part of the functions of the receiving end device. The method comprises: receiving to-be-decoded information from a sending end device; wherein the to-be-decoded information corresponds to an information bit sequence with a length of K; demodulating the to-be-decoded information to obtain a first symbol sequence with a length of E; performing de-row-column interleaving on the first symbol sequence according to a second interleaving pattern to obtain a second symbol sequence; decoding the second symbol sequence to obtain a ninth sequence with a length of K5; determining a tenth sequence with a length of M, an eleventh sequence with a length of K2, a twelfth sequence with a length of K3, and a thirteenth sequence with a length of K4 according to the ninth sequence; wherein M is a sequence inverse transform length; K2 is equal to 2Y, K3 is equal to L*Y, K4 is equal to K5-M-K2-K3, and Y is a number of modulation symbols corresponding to a transmission resource; performing inverse transform on the tenth sequence according to the twelfth sequence to obtain a fourteenth sequence with a length of K1; M is greater than or equal to K1; K1 is equal to K-K2-K3-K4; and determining a decoding result of the information bit sequence according to the fourteenth sequence, the eleventh sequence, the twelfth sequence, and the thirteenth sequence.

[0109] Based on the fourth aspect, corresponding to the sending end device performing transform on the first sequence after grouping to obtain a shaping gain, reduce the sending energy, and reduce the sending power, and the sending end device also performing interleaving on the seventh sequence according to the second interleaving pattern, which can make the information bits be preferentially mapped to the symbol bit, the check bits be preferentially mapped to the most unreliable amplitude bit, improve the coding system performance, adapt to the NR-LDPC, and improve the error correction performance, the receiving end device can perform a corresponding decoding process based on the coding process to obtain a decoding result, obtain a shaping gain, adapt to the NR-LDPC, and simplify the decoding implementation.

[0110] In a fifth aspect, the present application provides a communication device, which can be applied to the sending end device in the first aspect or the third aspect to realize the functions performed by the sending end device. The communication device can be the sending end device, a chip or a chip system or a system on chip, etc. of the sending end device. The communication device can perform the functions performed by the sending end device through hardware or perform the functions through corresponding software. The hardware or software comprises one or more modules corresponding to the functions. For example, a transceiving module and a processing module. The transceiving module can independently complete the transceiving operations described below, or can cooperate with the processing module to complete the transceiving operations. Correspondingly, the processing module can also independently complete the processing operations described below, or can cooperate with the transceiving module to complete the processing operations.

[0111] In an example, the processing module is configured to group the information bit sequence of length K to obtain a first sequence of length K1, a second sequence of length K2, and a third sequence of length K3; transform the first sequence according to the second sequence to obtain a fourth sequence of length M; determine a fifth sequence of length K4 according to the fourth sequence, the second sequence, and the third sequence, and perform LDPC encoding on the fifth sequence to obtain a sixth sequence of length E; perform interleaving on the sixth sequence according to a first interleaving pattern to obtain a seventh sequence; and perform modulation on the seventh sequence to obtain a sequence of modulation symbols. The transceiver is configured to output the sequence of modulation symbols. K1 is a positive integer less than K, K2 is equal to L*Y, Y is a number of modulation symbols corresponding to a transmission resource, L is greater than or equal to 0, K3 is equal to K-K1-K2, M is greater than or equal to K1, and the first interleaving pattern is related to a modulation order, E, M, and L.

[0112] In another example, the processing module is configured to group the information bit sequence of length K to obtain a first sequence of length K1, a second sequence of length K2, a third sequence of length K3, and a fourth sequence of length K4; transform the first sequence according to the third sequence to obtain a fifth sequence of length M; determine a sixth sequence of length K5 according to the fifth sequence, the second sequence, the third sequence, and the fourth sequence, and perform LDPC encoding on the sixth sequence to obtain a seventh sequence of length E; perform row-column interleaving on the seventh sequence according to a second interleaving pattern to obtain an eighth sequence; and perform modulation on the eighth sequence to obtain a sequence of modulation symbols. The transceiver is configured to output the sequence of modulation symbols. K1 is a positive integer less than K, K2 is equal to 2Y, K3 is equal to L*Y, K4 is equal to K-K1-K2-K3, Y is a number of modulation symbols corresponding to a transmission resource, L is greater than or equal to 0, M is greater than or equal to K1, and K5 is equal to M+K2+K3+K4.

[0113] Optionally, the transceiver and the processing module of the communication apparatus in the fifth aspect can further perform the corresponding functions in the first aspect or any possible design of the first aspect, or perform the corresponding functions in the third aspect or any possible design of the third aspect. For more details, refer to the detailed description in the method examples, and the beneficial effects achievable can also be referred to the related descriptions.

[0114] In a sixth aspect, the present application provides a communication apparatus, which can be applied to the receiving end device of the second aspect or the fourth aspect to implement the functions performed by the receiving end device. The communication apparatus can be the receiving end device, a chip or a chip system or a system on chip, etc. The communication apparatus can perform the functions of the receiving end device through hardware or corresponding software. The hardware or software includes one or more modules corresponding to the functions. For example, a transceiver module and a processing module. The transceiver module can perform the following transceiving operations independently or in cooperation with the processing module. Similarly, the processing module can perform the following processing operations independently or in cooperation with the transceiver module. No limitation is imposed.

[0115] For example, the transceiver module is configured to receive the to-be-decoded information from the sending end device. The to-be-decoded information corresponds to an information bit sequence with a length of K. The processing module is configured to demodulate the to-be-decoded information to obtain a first symbol sequence with a length of E, deinterleave the first symbol sequence according to a first interleaving pattern to obtain a second symbol sequence, wherein the first interleaving pattern is related to a modulation order, E, M and L, M is a sequence inverse transform length, and L is greater than or equal to 0, decode the second symbol sequence to obtain an eighth sequence with a length of K4, determine a ninth sequence with a length of M, a tenth sequence with a length of K2 and an eleventh sequence with a length of K3 according to the eighth sequence, K2 is equal to L*Y, Y is a number of modulation symbols corresponding to a transmission resource, K3 is equal to K4-M-K2, perform inverse transform on the ninth sequence according to the tenth sequence to obtain a twelfth sequence with a length of K1, M is greater than or equal to K1, K1 is equal to K-K2-K3, and determine a decoding result of the information bit sequence according to the twelfth sequence, the tenth sequence and the eleventh sequence.

[0116] In yet another example, the transceiver module is configured to receive the to-be-decoded information from the transmitting device; the to-be-decoded information corresponds to an information bit sequence with a length of K; the processing module is configured to demodulate the to-be-decoded information to obtain a first symbol sequence with a length of E; perform de-row-column interleaving on the first symbol sequence according to a second interleaving pattern to obtain a second symbol sequence; perform decoding on the second symbol sequence to obtain a ninth sequence with a length of K5; determine a tenth sequence with a length of M, an eleventh sequence with a length of K2, a twelfth sequence with a length of K3, and a thirteenth sequence with a length of K4 according to the ninth sequence; M is a sequence inverse transform length; K2 is equal to 2Y, K3 is equal to L*Y, K4 is equal to K5-M-K2-K3, and Y is a quantity of modulation symbols corresponding to a transmission resource; perform inverse transform on the tenth sequence according to the twelfth sequence to obtain a fourteenth sequence with a length of K1; M is greater than or equal to K1; K1 is equal to K-K2-K3-K4; and determine a decoding result of the information bit sequence according to the fourteenth sequence, the eleventh sequence, the twelfth sequence, and the thirteenth sequence.

[0117] Optionally, the transceiver module and the processing module of the communication apparatus in the sixth aspect can further perform the corresponding functions in the second aspect or any possible design of the second aspect, or perform the corresponding functions in the fourth aspect or any possible design of the fourth aspect. For more details, refer to the detailed description in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content.

[0118] In the seventh aspect, the present application provides a communication apparatus, which comprises one or more processors; and the one or more processors are configured to execute computer programs or instructions, and when the one or more processors execute the computer programs or instructions, the communication method in any one of the first aspect to the fourth aspect is executed.

[0119] In a possible design, the communication apparatus further comprises one or more memories coupled to the one or more processors, and the one or more memories are configured to store the computer programs or instructions. In a possible implementation, the memory is located outside the communication apparatus. In another possible implementation, the memory is located inside the communication apparatus. In the embodiments of the present application, the processor and the memory can also be integrated into one device, i.e., the processor and the memory can also be integrated together. In a possible implementation, the communication apparatus further comprises a transceiver, and the transceiver is configured to receive information and / or send information.

[0120] In a possible design, the communication apparatus further comprises one or more communication interfaces coupled to the one or more processors, and the one or more communication interfaces are configured to communicate with other modules outside the communication apparatus.

[0121] In an eighth aspect, the present application provides a communication apparatus, comprising an interface circuit and a logic circuit; the interface circuit is configured to input and / or output information; the logic circuit is configured to perform the communication method according to any one of the first aspect to the fourth aspect, process and / or generate information according to the information.

[0122] In a ninth aspect, the present application provides a computer readable storage medium, which stores computer instructions or programs, when the computer instructions or programs are run on a computer, the communication method according to any one of the first aspect to the fourth aspect is performed.

[0123] In a tenth aspect, the present application provides a computer program product comprising computer instructions, when the computer instructions are run on a computer, the communication method according to any one of the first aspect to the fourth aspect is performed.

[0124] In an eleventh aspect, the present application provides a computer program, when the computer program is run on a computer, the communication method according to any one of the first aspect to the fourth aspect is performed.

[0125] In a twelfth aspect, the present application provides a chip, comprising: a processor coupled with a memory, the memory is configured to store programs or instructions, when the programs or instructions are executed by the processor, the communication method according to any one of the first aspect to the fourth aspect is performed.

[0126] The technical effects brought by any one of the seventh aspect to the twelfth aspect can refer to the technical effects brought by any one of the first aspect to the fourth aspect, and will not be repeated here.

[0127] In a thirteenth aspect, the present application provides a communication system, which can comprise a communication apparatus for performing the communication method according to the first aspect or any possible design of the first aspect, and a communication apparatus for performing the communication method according to the second aspect or any possible design of the second aspect; or, comprise a communication apparatus for performing the communication method according to the third aspect or any possible design of the third aspect, and a communication apparatus for performing the communication method according to the fourth aspect or any possible design of the fourth aspect. BRIEF DESCRIPTION OF DRAWINGS

[0128] FIG. 1 is a BG schematic diagram provided by an embodiment of the present application;

[0129] FIG. 2 is a flow chart of a probability shaping provided by an embodiment of the present application;

[0130] FIG. 3 is a constellation distribution diagram provided by an embodiment of the present application;

[0131] FIG. 4 is a polar code encoding diagram provided by an embodiment of the present application;

[0132] FIG. 5 is a schematic diagram of SC decoding provided by an embodiment of the present application;

[0133] FIG. 6 is a schematic diagram of probability shaping provided by an embodiment of the present application;

[0134] FIG. 7 is a schematic diagram of a communication system provided by an embodiment of the present application;

[0135] FIG. 8 is a flowchart of encoding and decoding provided by an embodiment of the present application;

[0136] FIG. 9 is a schematic diagram of a composition of a communication apparatus provided by an embodiment of the present application;

[0137] FIG. 10 is a flowchart of a communication method provided by an embodiment of the present application;

[0138] FIG. 11 is a schematic diagram of an encoding process provided by an embodiment of the present application;

[0139] FIG. 12 is a schematic diagram of a fifth sequence provided by an embodiment of the present application;

[0140] FIG. 13 is a flowchart of a communication method provided by an embodiment of the present application;

[0141] FIG. 14 is a schematic diagram of an encoding process provided by an embodiment of the present application;

[0142] FIG. 15 is a schematic diagram of a sixth sequence provided by an embodiment of the present application;

[0143] FIG. 16 is a schematic diagram of a transmitting end device provided by an embodiment of the present application;

[0144] FIG. 17 is a schematic diagram of a receiving end device provided by an embodiment of the present application;

[0145] FIG. 18 is a schematic diagram of a communication apparatus provided by an embodiment of the present application;

[0146] FIG. 19 is a schematic diagram of a communication apparatus provided by an embodiment of the present application. DETAILED DESCRIPTION

[0147] Before describing embodiments of the present application, technical terms related to embodiments of the present application are described.

[0148] Low density parity check code (LDPC) code: first proposed by Gallager in his doctoral thesis in the 1960s, around 1995, MacKay and Neal and others re-studied LDPC codes, further found that LDPC codes have good performance, and quickly caused strong response and great attention.

[0149] One typical feature of LDPC codes is that the parity check matrix usually has sparsity. In a new radio (NR) communication system, a data channel can adopt an LDPC coding scheme. Specifically, a sending end device can encode an information bit sequence using an LDPC coding manner, modulate the encoded sequence, and send the modulated sequence to a receiving end device.

[0150] A commonly used LDPC code usually has a quasi-cyclic (QC) structure, which is also called a QC-LDPC code. The LDPC code in the NR communication system (i.e., an NR-LDPC code) is also a QC-LDPC code.

[0151] The QC-LDPC code is represented using a base graph (BG). When used, QC expansion is performed according to a lifting size and a corresponding shifting value parameter, to obtain a final parity check matrix. The elements in the BG are 0 or 1. QC expansion is to expand the element 1 in the BG into a unit matrix of the lifting size, and perform cyclic shifting according to the shifting value parameter; and to expand the element 0 in the BG into a 0 matrix of the corresponding size (i.e., a full 0 matrix of the lifting size * the lifting size). Compared with directly storing the parity check matrix, this method can reduce storage overhead, and facilitate decoding implementation.

[0152] It can be understood that the BG describes the relationship among X, Y, and F: BG=(X, Y, F), where X corresponds to variables, Y corresponds to check equations, and F is the edge relationship therebetween. The parity check matrix obtained after QC expansion describes the relationship among V, C, and E, where V is a variable node, C is a check node, and E is the edge relationship therebetween. Based on the QC expansion process described above, it can be known that N=|V|=Z c |X|, the number of rows of the parity check matrix M=|C|=Z c |Y|, and the number of edges of the parity check matrix |E|=Z|F|.

[0153] For example, the BG adopted in the NR communication system can be as shown in FIG. 1. In the BG, part A corresponds to a high-rate information column region, part B corresponds to a high-rate core check region. Part C is a 0 matrix, and part D is an incremental redundancy region of the matrix, corresponding to a low-rate matrix. Part E is an incremental redundancy region, and has a unit matrix structure.

[0154] The sending device can perform encoding based on the BG, and can obtain a check matrix H according to extension of the BG (it can be understood that the check matrix also satisfies the partition characteristic in FIG. 1). The sending device can place the information bit sequence in the information bits corresponding to the A part, obtain the check bit sequence corresponding to the B part and the C part by encoding, and output the information bit sequence (X A ) corresponding to the A part and the check bit sequence [X B , X C ] corresponding to the B part and the C part as an encoded code word X = [X A , X B , X C ]. The [X A , X B , X C ] satisfies the constraint of the check matrix H, that is, [X A , X B , X C ]*H' = 0.

[0155] Generally, the sending device can perform LDPC encoding, rate matching, interleaving, and modulation on the information bit sequence according to the following steps 1 to 4 (some steps can be optional, for example, interleaving is not needed in some designs), to obtain a modulation symbol sequence, and send the modulation symbol sequence to the receiving device:

[0156] Step 1: The sending device performs LDPC encoding on the information bit sequence to obtain an encoded bit sequence.

[0157] The sending device can encode the information bit sequence c0, c1, c2, c3, …, c K-1 of length K to obtain an encoded bit sequence d0, d1, d2, …, d N-1 of length N, so that the check relationship

[0158] For the LDPC BG 1, N is equal to 66Zc. For the LDPC BG 2, N is equal to 50Zc. Zc is the extension factor of the LDPC encoding.

[0159] The check relationship implies a one-to-one correspondence between an information bit and a column in the check matrix, that is, c0 corresponds to the first column of H, c1 corresponds to the second column of H, and so on. In addition, the first 2Zc bits of c0, c1, c2, c3, …, c K-1 are punctured, that is, the first 2Zc bits of c0, c1, c2, c3, …, c N-1 are not included in d0, d1, d2, …, d K-1 .

[0160] Exemplarily, the sending end device can encode the information bit sequence by referring to the following steps a to d:

[0161] Step a, find the set containing Zc with index i in the following table 1. LS .

[0162] Table 1

[0163] Step b, determine the value of d according to the following description. k-2Zc .

[0164] Step c, generate N+2Zc-K check bits w = [w0, w1, w2, …, w N+2Zc-K-1 ,] T , so that wherein c = c0, c1, c2, c3, …, c K-1 T , 0 represents a column vector with all elements equal to 0.

[0165] For LDPC BG 1, the H BG matrix has 46 rows and 68 columns, the row index i = 0, 1, 2, …, 45, and the column index j = 0, 1, 2, …, 67. For LDPC BG 2, the H BG matrix has 42 rows and 52 columns, the row index i = 0, 1, 2, …, 41, and the column index j = 0, 1, 2, …, 41.

[0166] Each element of the H BG matrix can be replaced by a Zc*Zc matrix to obtain a matrix H, as follows: each element with a value of 0 in the H BG matrix is replaced by a zero matrix of size Zc*Zc. Each element with a value of 1 in the H BG matrix is replaced by a circulant matrix I(P i,j ) of size Zc*Zc, where i and j are the row index and column index of the element, and I(P i,j ) is obtained by cyclically shifting a unit matrix I to the right by P i,j times. The value of P i,j is given by P i,j = mod(V i,j , Z c ). The value of V i,j is given according to the set index i LS and the LDPC BG.

[0167] Step d, determine the value of d according to the following description. k-2Zc

[0168] ​for k = K to N+2Zc-1

[0169] d k-2Zc = w k-K ;

[0170] end for

[0171] Step 2, the sending end device rate-matches the bit sequence after LDPC encoding to obtain a rate-matched bit sequence with a length of E.

[0172] Wherein, the sending end device can place the encoded bit sequence in a circular buffer, and read out a bit sequence with a corresponding length from the starting point configured as the bit sequence after rate matching.

[0173] Specifically, the encoded bit sequence d is written into a circular buffer with a length of N cb of the rth encoding block.

[0174] Wherein, rv id represents the redundancy version number (rv id = 0, 1, 2 or 3) of the current transmission, and the rate-matched output bit sequence e k can be generated as shown below, k is determined according to the rv id value and the LDPC BG:

[0175] Step 3, the sending end device interleaves the rate-matched bit sequence to obtain an interleaved bit sequence.

[0176] Wherein, as can be seen from the above step 2, the rate-matched information bit sequence e0, e1, e2, …, e E-1 is arranged in the order of front information bits and rear check bits, and the sending end device can perform row-column interleaving on the rate-matched bit sequence to preferentially map the information bits to symbol bit positions and preferentially map the check bits to the most unreliable amplitude bit positions, thereby improving the performance of the encoding system.

[0177] Specifically, the sending end device can interleave the rate-matched bit sequence e0, e1, e2, …, e E-1 according to the following description to obtain an interleaved bit sequence f0, f1, f2, …, f E-1 , wherein Q m is the modulation order:

[0178] Step 4, the sending end device modulates the interleaved bit sequence to obtain a modulation symbol sequence.

[0179] The interleaved bit sequence f0, f1, f2, …, fN-1 is sent by the sending device. E-1 The corresponding modulation symbol sequence is obtained by modulation based on the following formula:

[0180] For 1024QAM:

[0181] For 256QAM:

[0182] For 64QAM:

[0183] For 16QAM:

[0184] Based on the above description, when the sending device encodes based on the LDPC method, the information bits can be preferentially mapped to the symbol bit, and the check bits can be preferentially mapped to the most unreliable amplitude bit, so as to improve the transmission performance.

[0185] In addition, in the communication system, the transmission performance can be further improved by the probability shaping method. Since the energies of different modulation symbols are different in high-order modulation, by sending more low-energy symbols and fewer high-energy symbols, the average energy can be saved, the transmission power of the sending device can be reduced, and the transmission performance can be improved.

[0186] The high-order modulation refers to mapping multiple bits to the same channel symbol, so as to further improve the spectral efficiency. Common high-order modulation schemes include 16QAM, 64QAM, 256QAM, etc. As shown in Table 2, it is a bit mapping relationship of 16ASK. In the modulation process, the modulation symbol x can be determined according to the bits b0, b1, b2, b3 as the modulation symbol to be sent. Among them, b0 is a symbol bit, b1, b2, and b3 are amplitude bits, and b0, b1, b2, and b3 are sorted in descending order of reliability as follows: b0, b1, b2, and b3. The amplitude bits are sorted in descending order of reliability as follows: b1, b2, and b3.

[0187] Table 2

[0188] Theoretical analysis shows that, for a Gaussian white noise channel, the most energy can be saved when the distribution of the transmitted symbols obeys a Gaussian distribution. Compared with a uniform distribution, the maximum transmission power can be saved by 1.53 dB. Probability shaping is a common "shaping" technique. Its typical flowchart can be shown in FIG. 2. By cascading a precoder (also known as a distribution matcher or a certain transformation, etc.) before the encoder, the information bits are mapped ("shaped") to a sequence obeying a certain distribution. In the encoding process, the system code is used for coding, so that the above-mentioned bit sequence obeying a certain distribution is directly present in the coded sequence, thereby shaping the final modulation symbol, saving the average energy, and reducing the transmission power.

[0189] Exemplarily, the constellation distribution after "shaping" can be shown in FIG. 3, where the horizontal axis represents the symbol, the vertical axis represents the probability, and the square of the symbol represents the energy level. The smaller the square of the symbol, the lower the energy. The larger the square of the symbol, the higher the energy. As can be seen from FIG. 3, the probability of the occurrence of low-energy symbols is higher than that of high-energy symbols.

[0190] Polar code is the first coding scheme that can be strictly proved to "reach" the Shannon channel capacity, has the advantages of good decoding performance and low complexity, and has been determined by 3GPP as the control channel coding scheme for 5G eMBB scenarios.

[0191] With the continuous development of polar codes, polar codes can be used as a distribution matcher to implement probability shaping. The role of the distribution matcher can be understood as follows: K information bits are mapped to M shaped bits, where the K information bits obey a uniform distribution, and the M shaped bits obey a certain distribution (generally not a uniform distribution).

[0192] Exemplarily, as shown in FIG. 4, it is an encoding diagram of a polar code with a length of 8. The encoding process includes a plurality of polarization kernel operations (the polarization kernel is shown in a dashed box). The polarization kernel multiplies two input bits to obtain two output bits. As can be seen, the recursive construction of the polar code, the polar code with a length of 8 can be obtained by coupling two polar codes with a length of 4, and the polar code with a length of 4 can be obtained by coupling two polar codes with a length of 2.

[0193] The construction process of the polar code is used to determine the information bit positions and the frozen bit positions of the polar code. Generally, the reliability of each subchannel is sorted, the K positions with the highest reliability are set as information bits, and the remaining N-K positions are set as frozen bits. As shown in FIG. 4, the polar code with N=8 and K=4 is constructed. Generally, u3, u5, u6, and u7 are information bits, and the remaining positions are frozen bits.​

[0194] The decoding is performed by successive cancellation decoding (SC). In SC, the LLRs of the information bits are calculated step by step, and for an information bit, if the LLR > 0, the bit is decided to be 0, and if the LLR < 0, the bit is decided to be 1. For a frozen bit, the bit is set to 0 regardless of the LLR. A simple SC decoding is shown in Fig. 5, which has 8 nodes in total, 4 f nodes and 4 g nodes. The calculation of an f node requires 2 LLR inputs from its right side, and the calculation of a g node requires 2 LLR inputs from its right side and 1 “partial sum” input from above. Note that the output can only be calculated after the input is calculated. According to the above rules, the 8 nodes in Fig. 5 are calculated in order from right to left, and the decoding order is ①→②→③→④, which is the SC decoding process.

[0195] Based on the above description of the polar code, the following describes the process of using the polar code as a distribution matcher to achieve probability shaping:

[0196] For example, as shown in Fig. 6, K positions with low reliability are selected as information bit positions (e.g., the bits filled with pattern 1 in Fig. 6), and the remaining N-K positions are selected as auxiliary bit positions (e.g., the bits filled with pattern 2 in Fig. 6).

[0197] When performing distribution matching, the K original information bits to be transformed are placed in the information bit positions, and the decoder takes the LLR values corresponding to the target distribution as the sequence of symbols to be decoded (the LLR inputs on the right side of the trellis in Fig. 6), and obtains the auxiliary bits by decoding. Further, the encoding bit sequence (the bits filled with pattern 3 in Fig. 6) is obtained from the original information bits to be transformed and the auxiliary bits obtained by decoding, as the bit sequence after shaping.

[0198] By controlling the sequence of LLR values of the right-side decoder, the shaping effect of the polar code-based distribution matcher can be controlled, thereby further improving the shaping gain. Specifically, when the decoder inputs the same sequence of LLR values, the bit sequence after shaping also obeys the same distribution. Alternatively, the decoder can input different sequences to achieve more precise shaping, and generally, the larger the corresponding LLR value, the greater the distribution bias of the bit (i.e., the more uneven the distribution).

[0199] By taking the polar code as a distribution matcher, the existing polar code decoder in the sending device can be reused for transformation, without additional chip area. With the fast decoding algorithm of the polar code decoder, the complexity of the shaping process can be reduced. By introducing joint design with different LLR sequences input to the decoder, the performance of the transformation can be improved without increasing the complexity.

[0200] However, the existing LDPC encoding (e.g., NR-LDPC) does not support probability shaping, that is, the sending device cannot improve the transmission performance by probability shaping while using LDPC encoding.

[0201] Specifically, there is a contradiction between the "shaping gain" obtained by the above probability shaping and the "row-column interleaving-based improvement of the performance of the encoding system" of the NR LDPC code: in order to obtain the "shaping gain", the probability shaping scheme usually shapes all amplitude bits, and the check bits are used as the sign bits of the quadrants of the modulation symbols (such as the b0 bits in Table 2). In order to improve the performance of the encoding system, the NR LDPC code usually gives priority to the systematic bits as the sign bits (because the reliability of the sign bits is higher), and tries to map the check bits to the most unreliable amplitude bits. Based on this method, the systematic bits are on the high-reliability bits, achieving the purpose of performance improvement.

[0202] In summary, when the sending device encodes based on the LDPC mode, how to achieve efficient transmission becomes a technical problem to be solved.

[0203] To solve the technical problem, an embodiment of the present application provides a communication method, in which a sending device can group an information bit sequence with a length of K to obtain a first sequence with a length of K1, a second sequence with a length of K2, and a third sequence with a length of K3; transform the first sequence according to the second sequence to obtain a fourth sequence with a length of M; determine a fifth sequence with a length of K4 according to the fourth sequence, the second sequence, and the third sequence, and perform LDPC encoding on the fifth sequence to obtain a sixth sequence with a length of E; interleave the sixth sequence according to a first interleaving pattern to obtain a seventh sequence; modulate the seventh sequence to obtain a modulation symbol sequence, and output the modulation symbol sequence. Wherein K1 is a positive integer less than K, K2 is equal to L*Y, Y is the number of modulation symbols corresponding to the transmission resource, L is greater than or equal to 0, K3 is equal to K-K1-K2; M is greater than or equal to K1; K4 is equal to M+K2+K3; the first interleaving pattern is related to the modulation order, E, M, and L.

[0204] In the embodiments of the present application, the sending end device can transform the grouped first sequence to obtain a "shaping gain", reduce the sending energy, and reduce the sending power. Meanwhile, the sending end device can also interleave the sixth sequence according to a first interleaving pattern, which is related to the modulation order, E, and M, so as to make the information bits be preferentially mapped to the symbol bit, the check bits be preferentially mapped to the most unreliable amplitude bit, improve the performance of the coding system, and improve the error correction performance. That is, the communication method provided by the present application can combine the transformation process of probability shaping with the LDPC coding, reduce the sending power while obtaining the shaping gain, improve the transmission performance, adapt to the NR-LDPC, and improve the error correction performance at the same time.

[0205] The implementation manners of the embodiments of the present application are described in detail below in combination with the drawings of the specification.

[0206] The communication method provided by the embodiments of the present application can be applied to any communication system, which can be a third generation partnership project (3GPP) communication system, for example, a long term evolution (LTE) system, and can also be a fifth generation (5G) mobile communication system, a system of mixed networking of LTE and 5G, an NR system, an NR vehicle to everything (V2X) system, a device-to-device (D2D) communication system, a machine to machine (M2M) communication system, an internet of things (IoT), a narrow band-internet of things (NB-IoT) system, a global system for mobile communications (GSM) system, an enhanced data rate for GSM evolution (EDGE) system, a wideband code division multiple access (WCDMA) system, a code division multiple access (CDMA) 2000 system, a time division-synchronization code division multiple access (TD-SCDMA) system, an enhanced mobile broadband (eMBB) system, an ultra-reliable and low-latency communication (URLLC) system, an enhanced machine-type communication (eMTC) system, and various types of future communication systems, and can also be a non-terrestrial network (NTN) system (such as a satellite communication system), a non-3GPP communication system, and the like, without limitation.

[0207] The communication method provided by the embodiments of the present application can be applied to various communication scenarios, for example, can be applied to one or more of the following communication scenarios: encoding of a control channel, encoding of a data channel, and the like, without limitation.

[0208] The communication system provided by the embodiments of the present application is described below taking FIG. 7 as an example.

[0209] FIG. 7 is a schematic diagram of a communication system provided by an embodiment of the present application. As shown in FIG. 7, the communication system can include at least one terminal device and at least one network device.

[0210] In FIG. 7, the terminal device can be located in the beam / cell coverage of the network device, and the network device can provide communication services for the terminal device. For example, the network device can encode downlink data by using channel coding, modulate the data by using constellation modulation, and then transmit the data to the terminal device through the air interface (i.e., the network device is the sending terminal device, and the terminal device is the receiving terminal device); the terminal device can also encode uplink data by using channel coding, modulate the data by using constellation modulation, and then transmit the data to the network device through the air interface (i.e., the terminal device is the sending terminal device, and the network device is the receiving terminal device). It can be understood that when the network device communicates with the network device, or the terminal device communicates with the terminal device, the communication can also be based on channel coding, i.e., the sending terminal device and the receiving terminal device can both be network devices, or both be terminal devices, which is not limited.

[0211] The terminal device in FIG. 7 can be a device with wireless transceiving function or a chip or chip system that can be arranged in the device, and can allow a user to access a network, which is a device used to provide voice and / or data connectivity to a user. The terminal device can also be referred to as a user equipment (UE), a subscriber unit, a terminal, a mobile station (MS), or a mobile terminal (MT), etc.

[0212] Exemplarily, the terminal device in FIG. 7 can be a mobile phone, a tablet computer, or a computer with wireless transceiver function. The terminal device can also be a user station, a mobile station, a remote station, a remote terminal device, a mobile terminal device, a user terminal device, a wireless communication device, a user agent, a user equipment, a cellular phone, a cordless phone, a session initiation protocol (SIP) phone, a wireless local loop (WLL) station, a personal digital assistant (PDA), a handheld device with wireless communication function, a computing device, a processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal device in Internet of Things, a household appliance, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in remote medical treatment, a wireless terminal in smart power grid, a wireless terminal in smart city, a wireless terminal in smart home, a vehicle with vehicle-to-vehicle (V2V) communication capability, a smart connected vehicle, a drone with unmanned aerial vehicle to unmanned aerial vehicle (UAV to UAV, U2U) communication capability, a terminal device in future network, or a terminal device in future evolved public land mobile network (PLMN), etc., without limitation.

[0213] The network device in FIG. 7 can be any device deployed in an access network and capable of wireless communication with a terminal device, can also be a chip or chip system that can be provided in the above device, can also be a logic node or a logic module or a function implemented in software, and is mainly responsible for functions such as wireless physical control function, resource scheduling, wireless resource management, quality of service management, data compression and encryption, wireless access control, and mobility management. Specifically, the network device can be a device supporting wired access or a device supporting wireless access.

[0214] Exemplary network devices can be composed of one or more access network (AN) / radio access network (RAN) nodes. AN / RAN nodes can be various types of base stations such as satellite base stations, continue evolution NodeBs (gNBs), transmission reception points (TRPs), evolved NodeBs (eNBs), radio network controllers (RNCs), NodeBs (NBs), base station controllers (BSCs), base transceiver stations (BTSs), home base stations (e.g., home eNBs or home NBs, HNB), macro base stations, micro base stations, pico base stations, femto base stations, relay stations, balloon stations, drone stations, wireless backhaul nodes, base band units (BBUs), or wireless fidelity (Wi-Fi) access points (APs), etc. It can be understood that network devices can be ground-based devices or non-ground-based devices (e.g., satellites, drones, high-altitude communication devices, etc.). In addition, in communication systems using different wireless access technologies, the names of network devices with base station functions can be different, which is not limited in the present application.

[0215] In yet another example, network devices can include a BBU and a remote radio unit (RRU). The BBU and the RRU can be placed in different locations, for example, the RRU is pulled away and placed in a high traffic area, and the BBU is placed in a central machine room. The BBU and the RRU can also be placed in the same machine room. The BBU and the RRU can also be different components under the same rack.

[0216] In still another example, network devices can also be devices including a centralized unit (CU) node, or including a distributed unit (DU) node, or including a CU node and a DU node. For example, network devices can be divided into a CU and a DU from a logical function perspective, and the functions of part of the protocol layers are controlled by the CU, and the rest or all of the protocol layers are distributed in the DU and controlled by the CU. The CU and the DU can be separately arranged or can be included in the same network element, such as a BBU. Furthermore, the centralized unit CU can also be divided into a control plane (CU-CP) and a user plane (CU-UP).

[0217] In yet another example, the network device can also be a device comprising a radio unit (RU), or a device comprising a CU, a DU and a RU. The RU can be comprised in a radio frequency device or radio frequency unit, e.g., in a RRU, an active antenna unit (AAU) or a remote radio head (RRH).

[0218] It can be appreciated that the CU (or CU-CP and CU-UP), DU or RU can also have different names in different systems, but those skilled in the art can understand their meanings. For example, in an open radio access network (O-RAN) system, the CU can also be referred to as an O-CU (open CU), the DU can also be referred to as an O-DU, the CU-CP can also be referred to as an O-CU-CP, the CU-UP can also be referred to as an O-CU-UP, and the RU can also be referred to as an O-RU. For the convenience of description, the CU, CU-CP, CU-UP, DU and RU are taken as examples for description in this application. Any of the CU (or CU-CP, CU-UP), DU and RU in this application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

[0219] Based on the above description of the terminal device and the network device, optionally, the communication method provided by the embodiments of the present application can be implemented by the terminal device or the network device, or by components of the terminal device or the network device, etc., such as by an application specific integrated circuit (ASIC), a field programmable gate array (FPGA), or software (such as program code in a memory), etc., without limitation.

[0220] Optionally, in the embodiments of the present application, the sending end device (also referred to as a signal source) and the receiving end device (also referred to as a signal sink) can use the flow shown in FIG. 8 for encoding and decoding. The sending end device can be any terminal device or network device in the communication system shown in FIG. 7, and the receiving end device can also be any terminal device or network device in the communication system shown in FIG. 7.

[0221] The sending end device can source encode the bits generated by the sending end device to obtain a source bit stream, channel encode the source bit stream, modulate the source bit stream, and send the modulated symbols to the receiving end device through a noisy channel. When the receiving end device receives the modulated symbols through the noisy channel, the receiving end device can demodulate the modulated symbols, channel decode the demodulated symbols, recover the source bit stream, and obtain the decoding result through source recovery.

[0222] In a specific implementation, each of the terminal devices and the network device shown in FIG. 7 can have the component structure shown in FIG. 9, or include the components shown in FIG. 9. FIG. 9 is a component structure diagram of a communication apparatus 900 provided by an embodiment of the present application. The communication apparatus 900 can be a terminal device or a chip or system on chip in the terminal device, or a network device or a chip or system on chip in the network device. As shown in FIG. 9, the communication apparatus 900 includes a processor 901, a transceiver 902, and a communication line 903.

[0223] Further, the communication apparatus 900 can further include a memory 904. The processor 901, the memory 904, and the transceiver 902 can be connected through the communication line 903.

[0224] The processor 901 can be a central processing unit (CPU), a general processor network processor (NP), a digital signal processing (DSP), a microprocessor, a microcontroller, a programmable logic device (PLD), or any combination thereof. The processor 901 can also be another device with processing function, such as a circuit, a device, or a software module, without limitation.

[0225] The transceiver 902 is configured to communicate with other devices or other communication networks. The other communication networks can be an Ethernet, a radio access network (RAN), a wireless local area network (WLAN), or the like. The transceiver 902 can be a module, a circuit, a transceiver, or any device capable of implementing communication.

[0226] The communication line 903 is configured to transmit information between components included in the communication apparatus 900.

[0227] The memory 904 is configured to store instructions. The instructions can be a computer program.

[0228] The memory 904 can be a read-only memory (ROM) or other type of static storage device that can store static information and / or instructions, a random access memory (RAM), or other type of dynamic storage device that can store information and / or instructions, an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM), or other optical disk storage, a magneto-optical disk, a magnetic disk storage or other magnetic storage devices, and the like, without limitation.

[0229] It should be noted that the memory 904 can exist independently of the processor 901, or can be integrated with the processor 901. The memory 904 can be used to store instructions or program codes or some data, etc. The memory 904 can be located within the communication apparatus 900, or can be located outside the communication apparatus 900, without limitation. The processor 901 is configured to execute the instructions stored in the memory 904, so as to implement the communication method provided by the embodiments described below.

[0230] In an example, the processor 901 can include one or more CPUs, such as CPU0 and CPU1 in FIG. 9.

[0231] As an optional implementation, the communication apparatus 900 includes a plurality of processors, for example, in addition to the processor 901 in FIG. 9, the communication apparatus 900 can further include a processor 907.

[0232] As an optional implementation, the communication apparatus 900 further includes an output device 905 and an input device 906. For example, the input device 906 is a keyboard, a mouse, a microphone, a joystick, or the like, and the output device 905 is a display screen, a speaker, or the like.

[0233] It should be noted that the communication apparatus 900 can be a desktop computer, a laptop computer, a network server, a mobile phone, a tablet computer, a wireless terminal, an embedded device, a chip system, or a device having a similar structure to that in FIG. 9. In addition, the constituent structures shown in FIG. 9 do not constitute a limitation on the communication apparatus, and the communication apparatus can include more or fewer components than those shown in the figure, or combine certain components, or have a different arrangement of components.

[0234] In the embodiments of the present application, the chip system can be composed of a chip, or can include a chip and other discrete devices.

[0235] In addition, the actions, terms and the like involved between the embodiments of the present application can be mutually referenced and are not limited. The message names or parameter names in the messages exchanged between the devices in the embodiments of the present application are only examples, and other names can also be used in the specific implementation, which are not limited.

[0236] The communication method provided by the embodiments of the present application will be described below with reference to FIG. 10 in combination with the communication system shown in FIG. 7, where the sending end device can be any terminal device or network device in the communication system shown in FIG. 7, and the receiving end device can also be any terminal device or network device in the communication system shown in FIG. 7. The sending end device or the receiving end device described in the following embodiments can have the components shown in FIG. 9.

[0237] FIG. 10 is a flowchart of a communication method provided by an embodiment of the present application. As shown in FIG. 10, the method can include the following steps.

[0238] Step 1001: The sending end device groups a sequence of information bits with a length of K to obtain a first sequence with a length of K1, a second sequence with a length of K2 and a third sequence with a length of K3.

[0239] The sequence of information bits can include the information bits themselves, and K can be the number of information bits included in the sequence of information bits. Alternatively, the sequence of information bits can include the information bits and cyclic redundancy check (CRC) bits, that is, the sequence of information bits can be a sequence of information bits after CRC encoding, and K can be the sum of the number of information bits and the number of CRC bits included in the sequence of information bits.

[0240] The sending end device can refer to the encoding process shown in FIG. 11 to group the sequence of information bits to obtain the first sequence, the second sequence and the third sequence. There is no intersection between the first sequence, the second sequence and the third sequence.

[0241] The first sequence includes information bits in the sequence of information bits that are transformed (or shaped), and the bit sequence obtained after shaping is used as an amplitude bit when modulating, and passes through the transformation module shown in FIG. 11 in the encoding process.

[0242] The second sequence includes information bits that assist the first sequence in transformation, and is used as an amplitude bit when modulating, and passes through the transformation module shown in FIG. 11 and the bit mapping module shown in FIG. 11 in the encoding process.

[0243] The third sequence includes information bits in the information bit sequence other than the first sequence and the second sequence, and in the encoding process, the third sequence is directly subjected to bit mapping without being subjected to the transformation module shown in FIG. 11. In modulation, part of the information bits in the third sequence are used to determine the quadrant of the modulation symbol (i.e., the symbol bit), part of the information bits are used as information bits corresponding to a large column weight and will be punctured in rate matching (the set can be empty), and the rest of the information bits are used as amplitude bits (the set can be empty).

[0244] The length K1 of the first sequence can be determined according to Y, the length K2 of the second sequence is equal to L*Y, and the length K3 of the third sequence is equal to K-K1-K2. K1 is a positive integer less than K, and K, K1, K2, and K3 are all positive integers. L is greater than or equal to 0.

[0245] Y is the number of modulation symbols corresponding to the transmission resource. Optionally, in the case where the sending end device is a network device, the transmission resource of the sending end device can be determined by the network device itself. In the case where the sending end device is a terminal device, the transmission resource of the sending end device can be configured by the network device.

[0246] It can be understood that when the information bit sequence is divided into the first sequence, the second sequence, and the third sequence, the order of grouping is not limited.

[0247] For example, when the information bit sequence is divided into the first sequence, the second sequence, and the third sequence, grouping can be performed based on the following principle: for a modulation order Q, the real part of each modulation symbol corresponds to Q / 2 bits, and the imaginary part also corresponds to Q / 2 bits, and the Q / 2 bits include one symbol bit and Q / 2-1 amplitude bits. For a modulation mode with a modulation order Q greater than or equal to 8 (such as 256QAM or 1024QAM), K1 bits (i.e., the first sequence) are preferentially taken from the information bit sequence for transformation, K2 bits (i.e., the second sequence) are secondly taken for auxiliary transformation, and the remaining bits are taken as the third sequence.

[0248] In addition, if the last amplitude bit in the Q / 2 bits is subjected to transformation or auxiliary transformation, it will cause the check bits to be carried on the symbol bit, thereby affecting the performance. Therefore, the last amplitude bit can be kept from being subjected to transformation or auxiliary transformation, and the check bits can be subsequently mapped to the last amplitude bit, thereby avoiding mapping the information bits to the most unreliable subchannel (i.e., the last amplitude bit) and improving the performance of the encoding system. Based on this, the length K1 of the first sequence and the length K2 of the second sequence can be determined according to Y on the basis of determining the number of amplitude bits that are not subjected to transformation or auxiliary transformation.

[0249] Based on the grouping principle, exemplary, K1 is equal to the product of r and Y, r is a positive number. K2 is equal to L*Y, L is greater than or equal to 0.

[0250] In a first possible design, r is related to the modulation order.

[0251] Wherein, r is greater than 0, and less than or equal to 2;

[0252] Exemplary, taking the modulation order equal to 10 as an example, based on the grouping principle, 1 amplitude bit corresponding to the real part and the imaginary part of the modulation symbol can be transformed respectively, in this case, the value range of r can be (0, 2], for example, the value of r can be 1.5 (equivalent shaping overhead is 1.25) or 1.4 (equivalent shaping overhead is 0.3), etc., without limitation. Since the last amplitude bit does not perform transformation or auxiliary transformation, 1 or 2 amplitude bits can be selected from the remaining 2 amplitude bits to transform the amplitude bit that needs to be transformed, or 0 amplitude bit can also be selected to transform the amplitude bit that needs to be transformed, that is, the value of L can be 0, or 2, or 4, without limitation.

[0253] In another example, taking the modulation order equal to 8 as an example, based on the grouping principle, 1 amplitude bit corresponding to the real part and the imaginary part of the modulation symbol can be transformed respectively, in this case, the value range of r can be (0, 2], for example, the value of r can be 1.5 (equivalent shaping overhead is 1.25) or 1.4 (equivalent shaping overhead is 0.3), etc., without limitation. Since the last amplitude bit does not perform transformation or auxiliary transformation, 0 or 1 amplitude bit can be selected from the remaining 1 amplitude bit to transform the amplitude bit that needs to be transformed, that is, the value of L can be 0, or 2, without limitation.

[0254] In another example, taking the modulation order equal to 6 as an example, based on the grouping principle, 1 amplitude bit corresponding to the real part and the imaginary part of the modulation symbol can be transformed respectively, in this case, the value range of r can be (0, 2], for example, the value of r can be 1.5 (equivalent shaping overhead is 1.25) or 1.4 (equivalent shaping overhead is 0.3), etc., without limitation. Since the last amplitude bit does not perform transformation or auxiliary transformation, the number of remaining amplitude bits is 0, that is, the value of L can be 0.

[0255] In a second possible design, r is related to the modulation order and the modulation and coding scheme (MCS).

[0256] wherein r is greater than 0 and less than or equal to a difference between the modulation order and 4; the modulation order is greater than 4. In the case of the same modulation order, the r corresponding to the first MCS is less than or equal to the r corresponding to the second MCS; the sequence number of the first MCS is less than the sequence number of the second MCS.

[0257] Optionally, a corresponding r can be configured for each MCS.

[0258] For example, in the case of the modulation order equal to 10, based on the grouping principle, one amplitude bit corresponding to the real part and the imaginary part of the modulation symbol can be transformed respectively, in which case the value range of r can be (0, 2], a corresponding r can be configured for each MCS in the value range, the r corresponding to the MCS with a smaller sequence number (such as the first MCS) is less than or equal to the r corresponding to the MCS with a larger sequence number (such as the second MCS), for example, the value of r configured for the MCS with a sequence number of 20 can be 1.1, and the value of r configured for the MCS with a sequence number of 23 can be 1.5.

[0259] In another example, in the case of the modulation order equal to 8, based on the grouping principle, one amplitude bit corresponding to the real part and the imaginary part of the modulation symbol can be transformed respectively, in which case the value range of r can be (0, 2], a corresponding r can be configured for each MCS in the value range, the r corresponding to the MCS with a smaller sequence number is less than or equal to the r corresponding to the MCS with a larger sequence number.

[0260] In another example, in the case of the modulation order equal to 6, based on the grouping principle, one amplitude bit corresponding to the real part and the imaginary part of the modulation symbol can be transformed respectively, in which case the value range of r can be (0, 2], a corresponding r can be configured for each MCS in the value range, the r corresponding to the MCS with a smaller sequence number is less than or equal to the r corresponding to the MCS with a larger sequence number.

[0261] In a third possible design, r is predefined.

[0262] In which, after determining the specific value of r based on the grouping principle, the specific value of r can be predefined by using the communication protocol, so that the sending end device determines the specific value of r according to the communication protocol. The description of determining the specific value of r based on the grouping principle can refer to the related description in the foregoing first possible design to the second possible design, which will not be described here.

[0263] Based on the grouping principle, the length K2 of the second sequence is equal to L*Y, and L is greater than or equal to 0.

[0264] Exemplarily, when the modulation order is equal to 10, the value of L can be 4, 2, 0. When the modulation order is equal to 8, the value of L can be 2, 0.

[0265] In step 1002, the sending device transforms the first sequence according to the second sequence to obtain a fourth sequence with a length of M.

[0266] Here, M is greater than or equal to K1.

[0267] Here, the sending device can refer to the encoding process as shown in FIG. 11, transform the first sequence according to the second sequence to obtain a third sequence. The sending device transforms the first sequence according to the second sequence can also be described as the sending device performs distribution matching transformation on the first sequence according to the second sequence.

[0268] In a possible design, the sending device can perform distribution matching transformation on the first sequence according to the second sequence based on the first encoding mode to obtain a fourth sequence.

[0269] Optionally, the sending device can perform distribution matching transformation on the first sequence according to the second sequence based on a decoding mode of the first encoding mode to obtain a fourth sequence.

[0270] Exemplarily, the first encoding mode can be a polar code, an LDPC encoding, an RM code, a convolutional code, an RS code, an arithmetic encoding, etc., which is not limited herein.

[0271] For example, taking the first encoding mode as a polar code as an example, the sending device can refer to the foregoing description of the distribution matching process in FIG. 6, determine the LLR value of the decoder according to the second sequence, determine the auxiliary bit according to the first sequence and the LLR value of the decoder, and determine the fourth sequence with a length of M according to the first sequence and the auxiliary bit.

[0272] Based on the foregoing description, the fourth sequence obtained by transforming the first sequence according to the second sequence is a sequence subject to a specific distribution. For example, the fourth sequence is a sequence subject to a non-uniform distribution.

[0273] Here, the length M of the fourth sequence can be determined according to Y.

[0274] Exemplarily, the value of M is equal to the product of P and Y, and P is an even number.

[0275] For example, the value of M can be 2Y.

[0276] It can be understood that in the case where the value of M is equal to 2Y, the fourth sequence corresponds to 1 bit of a determined amplitude for each of the real part and the imaginary part in the Y modulation symbols.

[0277] In step 1003, the sending device determines a fifth sequence with a length of K4 according to the fourth sequence, the second sequence and the third sequence, and performs LDPC encoding on the fifth sequence to obtain a sixth sequence with a length of E.

[0278] K4 is equal to M+K2+K3.

[0279] The sending device can perform bit mapping on the fourth sequence, the second sequence and the third sequence to obtain the fifth sequence according to the encoding process shown in FIG. 11.

[0280] The sending device can determine the fifth sequence according to the fourth sequence, the second sequence and the third sequence based on the first interleaving sequence.

[0281] Optionally, the first interleaving sequence is related to one or more of the following parameters: a modulation order, a length K3 of the third sequence, M, a column weight of an LDPC base matrix, a row weight of the LDPC base matrix, a column weight of an LDPC check matrix, a row weight of the LDPC check matrix, a first interleaving pattern, or a length E after rate matching.

[0282] For example, the first interleaving sequence can include M elements, K2 elements and K3 elements, the M elements are located before the K2 elements, and the M elements and the K2 elements are located before part or all of the K3 elements. In the case where the M elements and the K2 elements are located before part of the K3 elements, the remaining part of the K3 elements is located before the M elements.

[0283] Optionally, the number of the remaining part of the K3 elements is X, and X is related to Zc, where Zc is an extension factor of the LDPC encoding.

[0284] For example, X is a positive integer multiple of Zc.

[0285] In a first possible implementation, in the case where the M elements and the K2 elements are located before all of the K3 elements, as shown in (a) of FIG. 12, the fifth sequence includes, in order from small to large, the fourth sequence, the second sequence and the third sequence.

[0286] In a second possible implementation, in the case where the M elements and the K2 elements are located before part of the K3 elements, as shown in (b) of FIG. 12, the fifth sequence includes, in order from small to large, X bits of the third sequence, the fourth sequence, the second sequence, and K3-X bits of the third sequence.

[0287] Based on the above description of the fifth sequence, the sending device can refer to the foregoing description of steps 1 and 2, refer to the encoding process as shown in FIG. 11, perform LDPC encoding on the fifth sequence to obtain a coded bit sequence, and perform rate matching on the coded bit sequence to remove puncturing bits or pre-frozen bits to obtain a sixth sequence with a length of E.

[0288] wherein E is equal to the product of the modulation order Q and the number Y of modulation symbols corresponding to the transmission resource.

[0289] Step 1004, the sending device interleaves the sixth sequence according to a first interleaving pattern to obtain a seventh sequence.

[0290] wherein the sending device can refer to the encoding process as shown in FIG. 11, and perform interleaving on the sixth sequence according to the first interleaving pattern to obtain the seventh sequence.

[0291] wherein the first interleaving pattern is related to the modulation order, E, M, and L.

[0292] wherein the length of the first interleaving pattern can be equal to the modulation order Q, the values of the 2nd element to the P+1th element of the first interleaving pattern are 0 to P-1; P is equal to M / Y, and P is an even number. The values of the P+2th bit to the P+L+1th element of the first interleaving pattern are P to P+L-1. Alternatively, it can also be described as the values of the 2nd element to the P+L+1th element of the first interleaving pattern are 0 to P+L-1.

[0293] For example, when M is equal to 2Y and L is equal to 2, P is equal to 2, the values of the 2nd element to the 3rd element of the first interleaving pattern are 0 to 1, and the values of the 4th element to the 5th element of the first interleaving pattern are 2 to 3. Alternatively, it can also be described as the values of the 2nd element to the 5th element of the first interleaving pattern are 0 to 3.

[0294] Optionally, the values of the other Q-P-L elements of the first interleaving pattern other than the 2nd element to the P+L+1th element are P+L, P+L+1, P+L+2 to Q-1. It can be understood that the values of the other Q-P-L elements of the first interleaving pattern other than the 2nd element to the P+L+1th element can be interleaved, which is not limited to simplify the decoding implementation.

[0295] For example, the values of the 0th element to the 1st element of the first interleaving pattern are P+L to P+L+1; and the values of the P+2th element to the Q-1th element of the first interleaving pattern are P+L+2 to Q-1.

[0296] In the first example, when the modulation order is 10, the first interleaving pattern is [8 9 0 1 2 3 4 5 6 7]; or, when the modulation order is 10 and P+L is equal to 6, the first interleaving pattern is [6 7 0 1 2 3 4 5 8 9]; or, when the modulation order is 10 and P+L is equal to 4, the first interleaving pattern is [4 5 0 1 2 3 6 7 8 9]; or, when the modulation order is 10 and P+L is equal to 2, the first interleaving pattern is [2 3 0 1 4 5 6 7 8 9].

[0297] In the second example, when the modulation order is 8, the first interleaving pattern is [6 7 0 1 2 3 4 5]; or, when the modulation order is 8 and P+L is equal to 4, the first interleaving pattern is [4 5 0 1 2 3 6 7]; or, when the modulation order is 8 and P+L is equal to 2, the first interleaving pattern is [2 3 0 1 4 5 6 7].

[0298] In the third example, when the modulation order is 6, the first interleaving pattern is [4 5 0 1 2 3]; or, when the modulation order is 6 and P+L is equal to 2, the first interleaving pattern is [2 3 0 1 4 5].

[0299] In the fourth example, when the modulation order is 4, the first interleaving pattern is [2 3 0 1].

[0300] Based on the above description of the first interleaving pattern, specifically, the sending end device can map the Uth bit in the sixth sequence to the Vth position of the seventh sequence according to the first interleaving pattern. The bit corresponding to the symbol bit is interleaved at the frontmost edge, and the amplitude bit is interleaved at the rear edge, thereby improving the performance of the coding system.

[0301] Wherein, U is related to the first interleaving pattern, E, and the modulation order; V is related to the modulation order and E, U=0, 1, 2, …, E-1; e2=0, 1, 2, …, E-1.

[0302] Illustratively, U is equal to W(i)*E / Q+j; wherein W(i) represents the i th element in the first interleaving pattern, i=0, 1, 2, …, Q-1; Q is the modulation order, and j=0, 1, 2, …, E / Q-1.

[0303] Illustratively, V is equal to i+j*Q; wherein i=0, 1, 2, …, Q-1; j=0, 1, 2, …, E / Q-1; Q is the modulation order.

[0304] Specifically, the sending device can map the fifth sequence e0, e1, e2, …, eE-1 after rate matching to a sixth sequence f0, f1, f2, …, fE-1. E-1 The sixth sequence f0, f1, f2, …, fE-1 is obtained by interleaving according to the following description. E-1 :

[0305] Based on the above description, it can be understood that the second element to the P+L+1th element in the first interleaving pattern correspond to the positions of the transformed bits in the sixth sequence and the second sequence in the seventh sequence.

[0306] The last A elements in the first interleaving pattern except the second element to the P+L+1th element correspond to the positions of the check bits in the sixth sequence in the seventh sequence. The check bits are the check bits determined when LDPC encoding is performed.

[0307] The first B elements in the first interleaving pattern except the second element to the P+L+1th element correspond to the positions of the untransformed bits in the sixth sequence in the seventh sequence; B is equal to E / Y-A-L-P.

[0308] In addition, in the case where the modulation orders are the same, the L corresponding to the first MCS is less than or equal to the L corresponding to the second MCS; wherein the serial number of the first MCS is less than the serial number of the second MCS. For a low-order MCS, L is less than or equal to the difference between the modulation order and 4. In this way, both the shaping gain and the performance gain of the lifting coding system are obtained.

[0309] Step 1005, the sending device modulates the seventh sequence to obtain a modulation symbol sequence.

[0310] The modulation symbol sequence can include Y modulation symbols, and each modulation symbol corresponds to Q bits in the seventh sequence that are interleaved based on the first interleaving pattern.

[0311] Step 1006, the sending device outputs the modulation symbol sequence; correspondingly, the receiving device receives the to-be-decoded information from the sending device.

[0312] The to-be-decoded information corresponds to an information bit sequence with a length of K.

[0313] The modulation symbol sequence output by the sending device may be affected by noise and other interference when transmitted through a channel, and the to-be-decoded information received by the receiving device is the modulation symbol sequence affected by noise and other interference.

[0314] Step 1007, the receiving device demodulates the to-be-decoded information to obtain a first symbol sequence with a length of E.

[0315] Step 1008, the receiving end device de-interleaves the first symbol sequence according to the first interleaving pattern to obtain a second symbol sequence.

[0316] The first interleaving pattern is related to the modulation order, E, M, and L; M is the sequence inverse transform length, and L is greater than or equal to 0. The description of the first interleaving pattern can refer to the related description in step 1004 described above, and will not be repeated here.

[0317] The length of the second symbol sequence is E.

[0318] Step 1009, the receiving end device decodes the second symbol sequence to obtain an eighth sequence with a length of K4; according to the eighth sequence, a ninth sequence with a length of M, a tenth sequence with a length of K2, and an eleventh sequence with a length of K3 are determined.

[0319] K2 is equal to L*Y, and K3 is equal to K4-M-K2.

[0320] The receiving end device can determine the first M bits of the eighth sequence as the ninth sequence, the middle L*Y bits as the tenth sequence, and the last K3 bits as the eleventh sequence.

[0321] Step 1010, the receiving end device inversely transforms the ninth sequence according to the tenth sequence to obtain a twelfth sequence with a length of K1.

[0322] M is greater than or equal to K1; K1 is equal to K-K2-K3.

[0323] The receiving end device can inversely transform the ninth sequence, or it can be described that the receiving end device inversely distributes and matches the ninth sequence to obtain the twelfth sequence.

[0324] Step 1011, the receiving end device determines the decoding result of the information bit sequence according to the twelfth sequence, the tenth sequence, and the eleventh sequence.

[0325] The receiving end device can take the twelfth sequence with a length of K1, the tenth sequence with a length of K2, and the eleventh sequence with a length of K3 as the decoding result with a length of K.

[0326] Based on the method shown in FIG. 10, the sending end device can transform the grouped first sequence to obtain a “reshaping gain”, reduce the sending energy, and reduce the sending power. At the same time, the sending end device can also interleave the sixth sequence according to the first interleaving pattern, which is related to the modulation order, E, M, and L, so that the information bits are preferentially mapped to the symbol bit, the check bits are preferentially mapped to the most unreliable amplitude bit, the coding system performance is improved, the NR-LDPC is adapted, and the error correction performance is improved.

[0327] The method shown in FIG. 10 can support, by controlling the number M of bits subjected to transformation and the parameters (such as r) of the corresponding information bit group, performing bit mapping based on the first interleaving sequence before LDPC encoding and performing interleaving according to the first interleaving pattern after LDPC encoding, while keeping the subsequent modulation process unchanged, by combining the transformation process of probability shaping with LDPC encoding, obtaining shaping gain while reducing transmission power, improving transmission performance, adapting to NR-LDPC, and improving error correction performance.

[0328] Optionally, the sending end device can also receive specific values of one or more of the following parameters from the receiving end device or the network device: L, Y, r, modulation order, P, M, or E, etc., for performing the method shown in FIG. 10.

[0329] Optionally, the receiving end device can receive specific values of one or more of the following parameters from the sending end device or the network device: L, Y, r, modulation order, P, M, or E, etc., for performing the method shown in FIG. 10.

[0330] As shown in FIG. 13, the information bit sequence can also be divided into four groups, which is different from the division of the information bit sequence into three groups in FIG. 10.

[0331] FIG. 13 is a communication method provided by an embodiment of the present application, as shown in FIG. 13, the method comprises:

[0332] Step 1301, the sending end device groups the information bit sequence with a length of K to obtain a first sequence with a length of K1, a second sequence with a length of K2, a third sequence with a length of K3, and a fourth sequence with a length of K4.

[0333] Wherein, the description of the information bit sequence can refer to the related description in the above-mentioned step 1001, which will not be described here.

[0334] Wherein, the sending end device can group the information bit sequence to obtain the first sequence, the second sequence, the third sequence, and the fourth sequence by referring to the encoding process shown in FIG. 14. There is no intersection between the first sequence, the second sequence, the third sequence, and the fourth sequence.

[0335] Wherein, the first sequence includes information bits subjected to transformation (or shaping) in the information bit sequence, and the bit sequence obtained by shaping is used as amplitude bits when modulating, and is subjected to the transformation module shown in FIG. 14 in the encoding process.

[0336] Wherein, the second sequence is used as symbol bits (i.e., determines the quadrant of the constellation point) when modulating, and is not subjected to the transformation module shown in FIG. 14 in the encoding process, but is directly subjected to bit mapping.

[0337] The third sequence includes information bits for assisting the first sequence in transformation, and is used as amplitude bits in modulation. In the encoding process, the third sequence passes through the transformation module shown in FIG. 14 and the bit mapping module shown in FIG. 14.

[0338] The fourth sequence represents information bits in the information bit sequence other than the first sequence, the second sequence, and the third sequence. In the encoding process, the fourth sequence does not pass through the transformation module shown in FIG. 14, but is directly subjected to bit mapping. In modulation, part of the information bits in the fourth sequence are used as amplitude bits (i.e., determine the amplitude of a constellation point), and the remaining information bits are used as information bits corresponding to a large column weight, which will be punctured in rate matching (the set can be empty).

[0339] The length K1 of the first sequence can be determined according to Y, the length K2 of the second sequence is equal to 2Y, the length K3 of the third sequence is equal to L*Y, and the length K4 of the fourth sequence is equal to K-K1-K2-K3. K1 is a positive integer less than K, and K, K1, K2, K3, and K4 are all positive integers. L is greater than or equal to 0.

[0340] Y is the number of modulation symbols corresponding to the transmission resource. The description of Y can refer to the related description in step 1001, which is not repeated here.

[0341] It can be understood that there is no limitation on the order of grouping when the information bit sequence is divided into the first sequence, the second sequence, the third sequence, and the fourth sequence.

[0342] For example, when the information bit sequence is divided into the first sequence, the second sequence, the third sequence, and the fourth sequence, grouping can be performed based on the following principles: for modulation order Q, the real part of each modulation symbol corresponds to Q / 2 bits, and the imaginary part also corresponds to Q / 2 bits, and the Q / 2 bits include 1 symbol bit and Q / 2-1 amplitude bits. For modulation with modulation order Q greater than or equal to 8 (such as 256QAM, 1024QAM), 2Y information bits (i.e., the second sequence) are first determined from the information bit sequence as symbol bits, K1 information bits (i.e., the first sequence) are then determined from the information bit sequence for transformation, K3 bits (i.e., the third sequence) are then taken out for assisting transformation, and the remaining K4 information bits in the information bit sequence are taken as the fourth sequence.

[0343] In addition, if the last amplitude bit in the Q / 2 bits is transformed or is subjected to the auxiliary transformation, it will result in that the check bit has to be carried on the symbol bit, thereby affecting the performance, so the last amplitude bit can be kept from being transformed or subjected to the auxiliary transformation, and the check bit can be subsequently mapped on the last amplitude bit, thereby avoiding mapping the information bit on the most unreliable subchannel (i.e., the last amplitude bit) and improving the performance of the encoding system. Based on this, the length K1 of the first sequence and the length K2 of the second sequence can be determined according to Y on the basis of the determined number of the amplitude bits that are not subjected to the transformation or the auxiliary transformation. Based on the grouping principle described above, the length K1 of the first sequence is equal to the product of r and Y, and r is a positive number. The description of r can refer to the description in the step 1001 described above, which will not be repeated here.

[0344] Based on the grouping principle described above, the length K2 of the second sequence is equal to L*Y, and L is greater than or equal to 0.

[0345] For example, when the modulation order is equal to 10, the value of L can be 4 or 2 or 0. When the modulation order is equal to 8, the value of L can be 2 or 0.

[0346] In step 1302, the sending device transforms the first sequence according to the third sequence to obtain a fifth sequence with a length of M.

[0347] In the formula, M is greater than or equal to K1.

[0348] In the formula, the sending device can refer to the encoding process shown in FIG. 14 to transform the first sequence according to the third sequence to obtain the fifth sequence. The sending device transforms the first sequence according to the third sequence, which can also be described as that the sending device performs the distribution matching transformation on the first sequence according to the third sequence.

[0349] In a possible design, the sending device can perform the distribution matching transformation on the first sequence according to the third sequence based on the first encoding mode to obtain the fifth sequence.

[0350] Optionally, the sending device can perform the distribution matching transformation on the first sequence according to the third sequence based on the decoding mode of the first encoding mode to obtain the fifth sequence.

[0351] For example, the first encoding mode can be a polar code, an LDPC encoding, an RM code, a convolutional code, an RS code, an arithmetic encoding, etc., which is not limited herein.

[0352] For example, taking the first encoding manner as the polar code, the sending device can refer to the foregoing description of the distribution matching process in FIG. 6, determine the LLR value of the decoder according to the third sequence, determine the auxiliary bit according to the first sequence and the LLR value of the decoder, and determine the fifth sequence with the length of M according to the first sequence and the auxiliary bit.

[0353] Based on the foregoing description, the fifth sequence obtained by transforming the first sequence according to the third sequence is a sequence subject to a specific distribution. For example, the fourth sequence is a sequence subject to a non-uniform distribution.

[0354] The length M of the fifth sequence can be determined according to Y.

[0355] For example, the value of M is equal to the product of P and Y, and P is an even number.

[0356] For example, the value of M can be 2Y.

[0357] It can be understood that in the case where the value of M is equal to 2Y, the fifth sequence corresponds to 1 bit of the real part and 1 bit of the imaginary part in each of the Y modulation symbols.

[0358] In step 1303, the sending device determines a sixth sequence with the length of K5 according to the fifth sequence, the second sequence, the third sequence and the fourth sequence, performs LDPC encoding on the sixth sequence, and obtains a seventh sequence with the length of E.

[0359] K5 is equal to M+K2+K3+K4.

[0360] The sending device can refer to the encoding process shown in FIG. 14 to perform bit mapping on the fifth sequence, the second sequence, the third sequence and the fourth sequence, and obtain the sixth sequence.

[0361] The sending device can determine the sixth sequence according to the fifth sequence, the second sequence, the third sequence and the fourth sequence based on the second interleaving sequence.

[0362] Optionally, the second interleaving sequence is related to one or more of the following parameters: the modulation order, the length K4 of the fourth sequence, M, the column weight of the LDPC base matrix, the row weight of the LDPC base matrix, the column weight of the LDPC check matrix, the row weight of the LDPC check matrix, the second interleaving pattern, or the length E after rate matching.

[0363] For example, the second interleaving sequence can include K2 elements, M elements, K3 elements and K4 elements, the K2 elements are located before the M elements, the M elements are located before the K3 elements, and the K2 elements, the M elements and the K3 elements are located before part or all of the K4 elements. In the case that the K2 elements, the M elements and the K3 elements are located before part of the K4 elements, the remaining part of the K4 elements is located before the K2 elements, the M elements and the K3 elements.

[0364] Optionally, the number of the remaining part of the K4 elements is X, and X is related to Zc, where Zc is an extension factor of the LDPC encoding.

[0365] For example, X is a positive integer multiple of Zc.

[0366] In a first possible implementation, in the case that the K2 elements, the M elements and the K3 elements are located before all of the K4 elements, as shown in (a) of FIG. 15, the sixth sequence includes, in order from small to large, the second sequence, the fifth sequence, the third sequence and the fourth sequence.

[0367] In a second possible implementation, in the case that the K2 elements, the M elements and the K3 elements are located before part of the K4 elements, as shown in (b) of FIG. 15, the sixth sequence includes, in order from small to large, X bits of the fourth sequence, the second sequence, the fifth sequence, the third sequence, K-K1-2Y-L*Y-X bits (i.e., K4-X bits) of the fourth sequence.

[0368] Based on the above description of the sixth sequence, the sending device can refer to the above description of steps 1 and 2, refer to the encoding process shown in FIG. 14, perform LDPC encoding on the sixth sequence to obtain a coded bit sequence, and perform rate matching on the coded bit sequence to remove puncturing bits or pre-frozen bits to obtain a seventh sequence with a length of E.

[0369] E is equal to the product of the modulation order Q and the number Y of modulation symbols corresponding to the transmission resource.

[0370] In step 1304, the sending device performs row-column interleaving on the seventh sequence according to a second interleaving pattern to obtain an eighth sequence.

[0371] For example, the sending device can refer to the encoding process shown in FIG. 14, perform interleaving on the seventh sequence according to the second interleaving pattern to obtain the eighth sequence.

[0372] For example, the second interleaving pattern is a row-column interleaving pattern.

[0373] Specifically, the sending end device can map the Uth bit in the seventh sequence to the Vth position of the eighth sequence according to the second interleaving pattern. In this way, the symbol bit is interleaved at the frontmost position, and the amplitude bit is interleaved at the rear position, so as to improve the performance of the coding system.

[0374] wherein U is related to E and the modulation order; V is related to the modulation order and E, U = 0, 1, 2, …, E-1; e2 = 0, 1, 2, …, E-1.

[0375] For example, U is equal to i*E / Q+j; wherein i = 0, 1, 2, …, Q-1; Q is the modulation order, and j = 0, 1, 2, …, E / Q-1.

[0376] For example, V is equal to i+j*Q; wherein i = 0, 1, 2, …, Q-1; j = 0, 1, 2, …, E / Q-1; and Q is the modulation order.

[0377] Specifically, the sending end device can map the Uth bit in the seventh sequence to the Vth position of the eighth sequence according to the second interleaving pattern. In this way, the symbol bit is interleaved at the frontmost position, and the amplitude bit is interleaved at the rear position, so as to improve the performance of the coding system. E-1 According to the following description, the eighth sequence f0, f1, f2, …, fE-1 after interleaving is obtained. E-1 :

[0378] Based on the above description, it can be understood that the 2nd element to the P+L+1th element in the second interleaving pattern correspond to the positions of the transformed bits in the seventh sequence and the third sequence in the eighth sequence, and P is equal to M / Y, and P is an even number.

[0379] The last A elements in the second interleaving pattern, except the 2nd element to the P+L+1th element, correspond to the positions of the check bits in the seventh sequence in the eighth sequence, and P is equal to M / Y, and P is an even number.

[0380] The first 2 elements in the second interleaving pattern correspond to the positions of the information bits in the seventh sequence (i.e., the second sequence) in the eighth sequence, and the information bits are the information bits in the second sequence.

[0381] The first C elements in the second interleaving pattern, except the 0th element to the P+L+1th element, correspond to the positions of the untransformed bits in the seventh sequence in the eighth sequence, and C is equal to E / Y-2-L-P-A.

[0382] In addition, in the case where the modulation orders are the same, the L corresponding to the first MCS is less than or equal to the L corresponding to the second MCS; wherein the serial number of the first MCS is less than the serial number of the second MCS. For a low-order MCS, L is less than or equal to the difference between the modulation order and 4. In this way, the shaping gain and the coding system performance gain are obtained at the same time.

[0383] Step 1305, the sending end device modulates the eighth sequence to obtain a modulated symbol sequence.

[0384] The modulated symbol sequence can include Y modulated symbols, and each modulated symbol corresponds to Q bits in the eighth sequence after being interleaved based on the second interleaving pattern.

[0385] Step 1306, the sending end device outputs the modulated symbol sequence; and correspondingly, the receiving end device receives the to-be-decoded information from the sending end device.

[0386] The to-be-decoded information corresponds to an information bit sequence with a length of K.

[0387] The modulated symbol sequence output by the sending end device can be affected by noise and other interference when being transmitted through a channel, and the to-be-decoded information received by the receiving end device is the modulated symbol sequence affected by noise and other interference.

[0388] Step 1307, the receiving end device demodulates the to-be-decoded information to obtain a first symbol sequence with a length of E.

[0389] Step 1308, the receiving end device deinterleaves the first symbol sequence according to the second interleaving pattern to obtain a second symbol sequence.

[0390] The second interleaving pattern is a row-column interleaving pattern, and M is a sequence inverse transform length. The description of the second interleaving pattern can refer to the related description in step 1304 described above, and will not be described here.

[0391] The length of the second symbol sequence is E.

[0392] Step 1309, the receiving end device decodes the second symbol sequence to obtain a ninth sequence with a length of K5; and according to the ninth sequence, determines a tenth sequence with a length of M, an eleventh sequence with a length of K2, a twelfth sequence with a length of K3, and a thirteenth sequence with a length of K4.

[0393] K2 is equal to 2Y, K3 is equal to L*Y, and K4 is equal to K5-M-K2-K3.

[0394] The receiving end device can determine the first 2Y bits of the ninth sequence as the eleventh sequence, the M bits after the first 2Y bits as the tenth sequence, the K3 bits after the M bits as the twelfth sequence, and the last K4 bits as the thirteenth sequence.

[0395] Step 1310, the receiving end device inversely transforms the tenth sequence according to the twelfth sequence to obtain a fourteenth sequence with a length of K1.

[0396] Wherein, M is greater than or equal to K1; K1 is equal to K-K2-K3-K4.

[0397] Wherein, the receiving end device can perform inverse transformation on the tenth sequence, or can be described as the receiving end device performs inverse distribution matching transformation on the tenth sequence to obtain the fourteenth sequence.

[0398] Step 1311, the receiving end device determines the decoding result of the information bit sequence according to the fourteenth sequence, the eleventh sequence, the twelfth sequence and the thirteenth sequence.

[0399] Wherein, the receiving end device can take the fourteenth sequence with a length of K1, the eleventh sequence with a length of K2, the twelfth sequence with a length of K3 and the thirteenth sequence with a length of K4 as the decoding result with a length of K.

[0400] Based on the method shown in the above Fig. 13, the sending end device can perform transformation on the grouped first sequence to obtain the shaping gain, reduce the sending energy and reduce the sending power. Meanwhile, the sending end device can also perform row-column interleaving on the seventh sequence according to the second interleaving pattern, so as to make the information bits be preferentially mapped to the symbol bit, the check bits be preferentially mapped to the most unreliable amplitude bit, improve the coding system performance, adapt to the NR-LDPC and improve the error correction performance.

[0401] The method shown in the above Fig. 12 can separately take out a group of information bit sequences (i.e. the second sequence) before LDPC encoding to determine the modulation constellation point quadrant, and redesign the bit mapping before LDPC encoding, so as to keep the subsequent interleaving and modulation process unchanged, use the transformation process of the probability shaping in combination with the LDPC encoding, reduce the sending power while obtaining the shaping gain, improve the transmission performance, adapt to the NR-LDPC and improve the error correction performance.

[0402] It should be noted that each embodiment of the present application can be independently implemented or combined for implementation, and is not limited. If there is no special description and no logical conflict, the terms and / or descriptions provided in different embodiments of the present application are consistent and can be mutually referenced. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0403] It can be understood that in the embodiments of the present application, the execution subject can execute part or all of the steps in the embodiments of the present application, and these steps or operations are only examples, and the embodiments of the present application can also execute other operations or various modifications of the operations. In addition, each step can be executed in a different order presented in the embodiments of the present application, and it is possible that not all the operations in the embodiments of the present application are executed.

[0404] The above describes the scheme provided by the embodiments of the present application mainly from the perspective of interaction between devices. It can be understood that each device comprises a hardware structure and / or software module for performing each function in order to implement the above functions. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed herein, the present application can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed in the form of hardware or computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0405] The embodiments of the present application can divide the functional modules of each device according to the above method examples. For example, each functional module can be divided according to each function, or two or more functions can be integrated in one processing module. The above integrated module can be realized in the form of hardware or software functional module. It should be noted that the division of modules in the embodiments of the present application is illustrative, and is only a logical functional division. Actual implementation can have another division manner.

[0406] In the case of dividing each functional module according to each function, FIG. 16 shows a sending end device 160 which can execute the actions performed by the sending end device in the methods shown in FIGS. 10 to 15. All related contents of each step involved in the above method embodiments can be referred to the function description of the corresponding functional module, and the technical effects that can be obtained can be referred to the above method embodiments, which will not be described here again.

[0407] The sending device 160 can include a transceiver module 1601 and a processing module 1602. The sending device 160 can be a communication device, a chip or other combination device or component having the functions of the sending device, and the like. When the sending device 160 is a communication device, the transceiver module 1601 can be a transceiver, which can include an antenna and a radio frequency circuit, and the like. The processing module 1602 can be a processor (or processing circuit), for example, a baseband processor, which can include one or more CPUs. When the sending device 160 is a component having the functions of the sending device, the transceiver module 1601 can be a radio frequency unit. The processing module 1602 can be a processor (or processing circuit), for example, a baseband processor. When the sending device 160 is a chip system, the transceiver module 1601 can be an input / output interface of a chip (for example, a baseband chip). The processing module 1602 can be a processor (or processing circuit) of the chip system, which can include one or more central processing units. It should be understood that the transceiver module 1601 in the embodiments of the present application can be implemented by a transceiver or a transceiver related circuit component. The processing module 1602 can be implemented by a processor or a processor related circuit component (or processing circuit).

[0408] For example, the transceiver module 1601 can be configured to perform all the transceiving operations performed by the sending device in the embodiments shown in FIGS. 10-15, and / or other processes for supporting the techniques described herein. The processing module 1602 can be configured to perform all the operations performed by the sending device in the embodiments shown in FIGS. 10-15, except for the transceiving operations, and / or other processes for supporting the techniques described herein.

[0409] FIG. 17 shows a receiving device 170 that can perform the actions performed by the receiving device in the methods shown in FIGS. 10-15. All related content of the steps in the method embodiments described above can be referred to the function description of the corresponding functional modules, and the technical effects that can be obtained can be referred to the method embodiments described above, which will not be described here again.

[0410] The receiving device 170 can include a transceiver module 1701 and a processing module 1702. The receiving device 170 can be a communication device, a chip or other combination device or component having the functions of the receiving device 170 described above. When the receiving device 170 is a communication device, the transceiver module 1701 can be a transceiver, which can include an antenna and a radio frequency circuit. The processing module 1702 can be a processor (or processing circuit), such as a baseband processor, which can include one or more CPUs. When the receiving device 170 is a component having the functions of the receiving device 170 described above, the transceiver module 1701 can be a radio frequency unit. The processing module 1702 can be a processor (or processing circuit), such as a baseband processor. When the receiving device 170 is a chip system, the transceiver module 1701 can be an input / output interface of a chip (such as a baseband chip). The processing module 1702 can be a processor (or processing circuit) of the chip system, which can include one or more central processing units. It should be understood that the transceiver module 1701 in the embodiments of the present application can be implemented by a transceiver or a transceiver-related circuit component. The processing module 1702 can be implemented by a processor or a processor-related circuit component (or processing circuit).

[0411] For example, the transceiver module 1701 can be configured to perform all the transceiver operations performed by the receiving device in the embodiments shown in FIGS. 10-15 and / or other processes for supporting the techniques described herein. The processing module 1702 can be configured to perform all the operations performed by the receiving device in the embodiments shown in FIGS. 10-15, except the transceiver operations, and / or other processes for supporting the techniques described herein.

[0412] As another implementation manner, the transceiver module 1601 in FIG. 16 can be replaced by a transceiver that can integrate the functions of the transceiver module 1601. The processing module 1602 can be replaced by a processor that can integrate the functions of the processing module 1602. Further, the transmitting device 160 shown in FIG. 16 can further include a memory. Alternatively, the transceiver module 1701 in FIG. 17 can be replaced by a transceiver that can integrate the functions of the transceiver module 1701. The processing module 1702 can be replaced by a processor that can integrate the functions of the processing module 1702. Further, the receiving device 170 shown in FIG. 17 can further include a memory.

[0413] Alternatively, when the processing module 1602 is replaced by a processor, and the transceiver module 1601 is replaced by a transceiver, the sending device 160 involved in the embodiments of the present application can also be a communication apparatus 180 shown in FIG. 18. Or, when the processing module 1702 is replaced by a processor, and the transceiver module 1701 is replaced by a transceiver, the receiving device 170 involved in the embodiments of the present application can also be a communication apparatus 180 shown in FIG. 18.

[0414] The processor can be a logic circuit 1801, and the transceiver can be an interface circuit 1802. Further, the communication apparatus 180 shown in FIG. 18 can further include a memory 1803.

[0415] The embodiments of the present application also provide a communication apparatus, as shown in FIG. 19, which can be applied in the method shown in any of the embodiments of FIG. 10 to FIG. 15. As shown in FIG. 19, the communication apparatus includes a processing module and a transceiver module. The processing module can be one or more processors, and the transceiver module can be a transceiver or a communication interface. The communication apparatus can be used to implement the sending device or the receiving device involved in any of the method embodiments, or to implement the functions of the device involved in any of the method embodiments. The device or the device function can be a network component in a hardware device, a software function running on a special hardware, or a virtualized function instantiated on a platform (for example, a cloud platform). Optionally, the communication apparatus can further include a storage module for storing program codes and data of the communication apparatus.

[0416] An example is that the communication apparatus serves as a sending device or a chip applied in a sending device, and performs the steps performed by the sending device in the above method embodiments. The transceiver module is used to specifically perform the sending and / or receiving actions performed by the sending device in any of the embodiments of FIG. 10 to FIG. 15, for example, supporting the sending device to perform other processes of the technologies described herein. The processing module can be used to support the communication apparatus to perform the processing actions in the above method embodiments, for example, supporting the sending device to perform other processes of the technologies described herein.

[0417] To implement the above functions, the chip of the present application can contain corresponding hardware structures and / or software modules for performing various functions. Those skilled in the art should easily realize that, in combination with the units and algorithm steps of the examples described in the embodiments disclosed herein, the present application can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is driven by hardware or computer software to drive hardware depends on the specific application and design constraints of the technical solution. Professional technicians can use different methods for each specific application to implement the described functions, but such implementation should not be considered beyond the scope of the present application.

[0418] In a possible implementation, when the sending device or the receiving device is a chip, the transceiving module can be a communication interface, a pin, a circuit, or the like. The communication interface can be configured to input data to be processed to the processor, and output the processing result of the processor to the outside. In specific implementation, the communication interface can be a general purpose input output (GPIO) interface, and can be connected with a plurality of peripheral devices (such as a display (LCD), a camera, a radio frequency (RF) module, an antenna, and the like). The communication interface is connected with the processor through a bus.

[0419] The processing module can be a processor, which can execute computer execution instructions stored in the storage module, so that the chip executes the method related to any of the embodiments shown in FIGS. 10 to 15. Further, the processor can include a controller, an arithmetic unit, and a register. For example, the controller is mainly responsible for instruction decoding, and sends a control signal for the operation corresponding to the instruction. The arithmetic unit is mainly responsible for executing fixed-point or floating-point arithmetic operation, shift operation, and logic operation, and can also execute address operation and conversion. The register is mainly responsible for saving the register operand and intermediate operation result temporarily stored in the process of instruction execution. In specific implementation, the hardware architecture of the processor can be an ASIC architecture, a microprocessor without interlocked piped stages architecture (MIPS) architecture, an advanced RISC machines (ARM) architecture, or a network processor (NP) architecture, or the like. The processor can be single-core or multi-core. The storage module can be a storage module in the chip, such as a register, a cache, or the like. The storage module can also be a storage module outside the chip, such as a ROM or another type of static storage device that can store static information and instructions, a RAM, or the like.

[0420] It should be noted that the functions of the processor and the interface can be implemented by hardware design, software design, or a combination of hardware and software, which is not limited here.

[0421] The embodiment of the present application further provides a computer program product, which can realize the functions of any of the above method embodiments when executed by a computer.

[0422] The embodiment of the present application further provides a computer program, which can realize the functions of any of the above method embodiments when executed by a computer.

[0423] The embodiments of the present application further provide a computer readable storage medium. All or part of the processes of the above method embodiments can be instructed by a computer program to relevant hardware to complete, the program can be stored in the above computer readable storage medium, and the program can include the processes of the above method embodiments when executed. The computer readable storage medium can be an internal storage unit of the terminal (including a data sending terminal and / or a data receiving terminal) of any of the above embodiments, for example, a hard disk or a memory of the terminal. The computer readable storage medium can also be an external storage device of the terminal, for example, a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card and the like. Further, the computer readable storage medium can include both the internal storage unit and the external storage device of the terminal. The computer readable storage medium is used to store the above computer program and other programs and data required by the terminal. The computer readable storage medium can also be used to temporarily store data that has been output or will be output.

[0424] It should be noted that the terms "first" and "second" and the like in the specification of the present application, claims and drawings are used to distinguish different objects, and are not used to describe a specific order. "First", "second" are only for description purposes, and cannot be understood as indicating or implying relative importance or implicitly indicating the number of indicated technical features. Therefore, the features defined with "first", "second" can explicitly or implicitly include one or more features. In the description of the present embodiment, unless otherwise stated, the meaning of "a plurality of" is two or more.

[0425] In addition, the terms "include" and "have" and any variations thereof are intended to cover non-exclusive inclusion. For example, a process, method, system, product or device that includes a series of steps or units is not limited to the listed steps or units, but can optionally include steps or units that are not listed, or can optionally include other steps or units inherent to the process, method, product or device.

[0426] It should be understood that in the present application, "at least one" means one or more. "Multiple" means two or more. "At least two" means two or three and more. "And / or" is used to describe the relationship between the associated objects, which means that there can be three relationships. For example, "A and / or B" can mean that there are three cases: only A, only B, and A and B exist at the same time, where A and B can be singular or plural. The character " / " generally represents an "or" relationship between the associated objects. "At least one of the following" or similar expressions means any combination of these items, including any combination of single or multiple items. For example, at least one of a, b or c, can mean: a, b, c, "a and b", "a and c", "b and c", or "a and b and c", where a, b, and c can be single or multiple. "When" and "if" both mean that under certain objective circumstances, the corresponding processing will be done, not limited to time, and does not require a judgment action when implemented, nor does it mean that there are other limitations.

[0427] In the embodiments of the present application, the words such as "exemplary" or "for example" are used to mean an example, illustration, or description. Any embodiment or design scheme described as "exemplary" or "for example" in the embodiments of the present application should not be interpreted as more preferred or more advantageous than other embodiments or design schemes. Rather, the words "exemplary" or "for example" are intended to present the relevant concept in a specific manner for understanding.

[0428] In the present application, "sending information to (a terminal device)" can be understood as that the destination of the information is the terminal device. It can include directly or indirectly sending information to the terminal device. "Receiving information from (a terminal device)" can be understood as that the source of the information is the terminal device, and it can include directly or indirectly receiving information from the terminal device. The information may be processed as necessary between the source and the destination of the information transmission, such as format change, etc., but the destination can understand the valid information from the source.

[0429] Through the description of the above embodiments, those skilled in the art can clearly understand that, for the convenience and brevity of description, only the above division of functional modules is taken as an example, and in actual application, the above functions can be completed by different functional modules according to needs, that is, the internal structure of the device is divided into different functional modules to complete all or part of the functions described above.

[0430] In several embodiments provided in the present application, it should be understood that the disclosed apparatus and method can be implemented by other manners. For example, the apparatus embodiments described above are merely illustrative, for example, the division of the modules or units is merely a logical function division, and actual implementation can have another division manner, for example, a plurality of units or components can be combined or integrated into another apparatus, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units or components shown or discussed can be indirect coupling or communication connection through some interfaces, apparatuses or units, and can be electrical, mechanical or other forms.

[0431] The units described as separate components can or can not be physically separated, and the components shown as units can be one physical unit or a plurality of physical units, that is, can be located in one place or can be distributed to a plurality of different places. Part or all of the units can be selected according to actual needs to achieve the purpose of the embodiment scheme.

[0432] In addition, each functional unit in each embodiment of the present application can be integrated in one processing unit, or each unit can be physically present separately, or two or more units can be integrated in one unit. The integrated unit can be realized in the form of hardware or in the form of a software functional unit.

[0433] The integrated unit, if realized in the form of a software functional unit and sold or used as an independent product, can be stored in a readable storage medium. Based on such understanding, the technical scheme of the embodiment of the present application can be embodied in the form of a software product in essence or all or part of the technical scheme. The software product is stored in a storage medium and includes a plurality of instructions for causing an apparatus (which can be a single-chip microcomputer, a chip, etc.) or a processor to execute all or part of the steps of the method described in each embodiment of the present application. The foregoing storage medium includes a U disk, a mobile hard disk, a ROM, a RAM, a magnetic disk or an optical disk and various program code storage media.

Claims

A communication method characterized by comprising: The method comprises the following steps: grouping information bit sequences with a length of K to obtain a first sequence with a length of K1, a second sequence with a length of K2 and a third sequence with a length of K3; the K1 is a positive integer smaller than the K, the K2 is equal to L*Y, the Y is a quantity of modulation symbols corresponding to a transmission resource, the L is greater than or equal to 0, and the K3 is equal to K-K1-K2; transforming the first sequence according to the second sequence to obtain a fourth sequence with a length of M; the M is greater than or equal to the K1; determining a fifth sequence with a length of K4 according to the fourth sequence, the second sequence and the third sequence, and performing LDPC encoding on the fifth sequence to obtain a sixth sequence with a length of E; the K4 is equal to M+K2+K3; interleaving the sixth sequence according to a first interleaving pattern to obtain a seventh sequence; the first interleaving pattern is related to a modulation order, the E, the M, the L and the Y; modulating the seventh sequence to obtain a modulation symbol sequence, and outputting the modulation symbol sequence. The method of claim 1, wherein The method further comprises the following steps: performing distributed matching transformation on the first sequence according to the second sequence to obtain the fourth sequence. The method according to claim 1 or 2, characterized in that The method further comprises the following steps: performing distributed matching transformation on the first sequence according to the second sequence based on a first encoding mode to obtain the fourth sequence. The method according to any one of claims 1 to 3, characterized in that The method further comprises the following steps: performing distributed matching transformation on the first sequence according to the second sequence based on a decoding mode of the first encoding mode to obtain the fourth sequence. The method according to any one of claims 1-4, wherein: the value of the M is determined according to the Y. The method according to claim 5, wherein: the M is equal to a product of P and the Y; the P is an even number. The method according to claim 5 or 6, wherein: the value of the M is 2Y. The method according to any one of claims 1 to 7, characterized in that The method further comprises the following steps: determining the fifth sequence according to the fourth sequence, the second sequence and the third sequence based on a first interleaving sequence. The method according to claim 8, wherein: the first interleaving sequence comprises M elements, K2 elements and K3 elements; the M elements are located before the K2 elements, and the M elements and the K2 elements are located before part or all of the K3 elements. The method according to claim 9, wherein: in the case that the M elements and the K2 elements are located before part of the K3 elements, the remaining part of the K3 elements is located before the M elements. The method according to claim 10, wherein: The number of the remaining elements of the K3 elements is X, the X is related to Zc, and the Zc is an extension factor of LDPC coding. The method according to any one of claims 8-11, characterized in that, The first interleaving sequence is related to one or more of the following parameters: the modulation order, the length of the third sequence, the M, the column weight of an LDPC base matrix, the row weight of an LDPC base matrix, the column weight of an LDPC check matrix, the row weight of an LDPC check matrix, the first interleaving pattern, or the E. The method according to any one of claims 1-12, characterized in that, The fifth sequence comprises, in order from small to large, the fourth sequence, the second sequence, and the third sequence; or The fifth sequence comprises, in order from small to large, X bits of the third sequence, the fourth sequence, the second sequence, and K3-X bits of the third sequence. The method according to claim 13, characterized in that, The X is related to Zc, and the Zc is an extension factor of LDPC coding. The method according to any one of claims 1-14, characterized in that, The length of the first interleaving pattern is equal to the modulation order Q, and the values of the second element to the P+L+1th element of the first interleaving pattern are 0 to P+L-1; the P is equal to M / Y, and the P is an even number. The method according to claim 15, characterized in that, The values of the Q-P-L elements of the first interleaving pattern other than the second element to the P+L+1th element are P+L, P+L+1, P+L+2 to Q-1. The method according to claim 16, characterized in that, The values of the 0th element to the 1th element of the first interleaving pattern are P+L to P+L+1; The values of the P+L+2th element to the Q-1th element of the first interleaving pattern are P+L+2 to Q-1. The method according to any one of claims 1 to 17, characterized in that The interleaving of the sixth sequence according to the first interleaving pattern to obtain a seventh sequence comprises: Mapping the Uth bit in the sixth sequence to the Vth position of the seventh sequence according to the first interleaving pattern; wherein the U is related to the first interleaving pattern, the E, and the modulation order; the V is related to the modulation order and the E, U=0, 1, 2, …, E-1; e2=0, 1, 2, …, E-1. The method according to claim 18, characterized in that, The U is equal to W(i)*E / Q+j; wherein W(i) represents the ith element in the first interleaving pattern, i=0, 1, 2, …, Q-1; Q is the modulation order, and j=0, 1, 2, …, E / Q-1. The method according to claim 18 or 19, characterized in that, The V is equal to i+j*Q; wherein i=0, 1, 2, …, Q-1; j=0, 1, 2, …, E / Q-1; and Q is the modulation order. The method according to any one of claims 1-20, characterized in that, The 2nd element to the P+L+1th element in the first interleaving pattern correspond to positions of transformed bits in the sixth sequence and in the seventh sequence, P equals to M / Y, and P is even. The method of any one of claims 1-21, wherein, The last A elements in the first interleaving pattern, except the 2nd element to the P+L+1th element, correspond to positions of check bits in the sixth sequence and in the seventh sequence, P equals to M / Y, and P is even. The method of any one of claims 1-22, wherein, The first B elements in the first interleaving pattern, except the 2nd element to the P+L+1th element, correspond to positions of non-transformed bits in the sixth sequence and in the seventh sequence, B equals to E / Y-A-L-P. The method of any one of claims 1-23, wherein, In the case that the modulation orders are the same, L corresponding to a first modulation and coding strategy (MCS) is less than or equal to L corresponding to a second MCS, wherein a serial number of the first MCS is less than a serial number of the second MCS. The method of claim 23, wherein, The L is less than or equal to a difference between the modulation order and 4. The method of any one of claims 1-25, wherein, The modulation symbol sequence comprises Y modulation symbols, and each modulation symbol corresponds to Q bits in the seventh sequence after interleaving based on the first interleaving pattern. The method of any one of claims 1-26, wherein, The K1 is determined according to Y. The method of claim 27, wherein, The K1 equals to a product of r and Y, and r is a positive number. The method of claim 28, wherein The r is related to the modulation order, including: The r is greater than 0 and less than or equal to 2. The method of claim 28, wherein The r is related to the modulation order and MCS, including: The r is greater than 0 and less than or equal to 2; In the case that the modulation orders are the same, r corresponding to a first MCS is less than or equal to r corresponding to a second MCS, wherein a serial number of the first MCS is less than a serial number of the second MCS. A communication method characterized by comprising: The method comprises: Receiving to-be-decoded information from a sending end device, wherein the to-be-decoded information corresponds to an information bit sequence with a length of K; Demodulating the to-be-decoded information to obtain a first symbol sequence with a length of E; De-interleaving the first symbol sequence according to a first interleaving pattern to obtain a second symbol sequence, wherein the first interleaving pattern is related to a modulation order, E, M, and L; M is a sequence inverse transformation length, and L is greater than or equal to 0; Decoding the second symbol sequence to obtain an eighth sequence with a length of K4; determining a ninth sequence with a length of M, a tenth sequence with a length of K2, and an eleventh sequence with a length of K3 according to the eighth sequence; K2 equals to L*Y, Y is a number of modulation symbols corresponding to a transmission resource, and K3 equals to K4-M-K2; According to the tenth sequence, performing inverse transformation on the ninth sequence to obtain a twelfth sequence with a length of K1; the M is greater than or equal to the K1; the K1 is equal to K-K2-K3; According to the twelfth sequence, the tenth sequence and the eleventh sequence, determining a decoding result of the information bit sequence. A communication method characterized by comprising: Comprise: Grouping an information bit sequence with a length of K to obtain a first sequence with a length of K1, a second sequence with a length of K2, a third sequence with a length of K3 and a fourth sequence with a length of K4, the K1 is a positive integer less than K, the K2 is equal to 2Y, the K3 is equal to L*Y, the K4 is equal to K-K1-K2-K3, the Y is a quantity of modulation symbols corresponding to a transmission resource; the L is greater than or equal to 0; According to the third sequence, performing transformation on the first sequence to obtain a fifth sequence with a length of M; the M is greater than or equal to the K1; According to the fifth sequence, the second sequence, the third sequence and the fourth sequence, determining a sixth sequence with a length of K5, and performing LDPC encoding on the sixth sequence to obtain a seventh sequence with a length of E; the K5 is equal to M+K2+K3+K4; According to a second interleaving pattern, performing row-column interleaving on the seventh sequence to obtain an eighth sequence; Performing modulation on the eighth sequence to obtain a modulation symbol sequence, and outputting the modulation symbol sequence. The method of claim 32, wherein The transformation of the first sequence according to the third sequence to obtain a fifth sequence with a length of M comprises: According to the third sequence, performing distributed matching transformation on the first sequence to obtain the fifth sequence. The method according to claim 32 or 33, characterized in that The transformation of the first sequence according to the third sequence to obtain a fifth sequence with a length of M comprises: According to the third sequence, performing distributed matching transformation on the first sequence based on a first encoding mode to obtain the fifth sequence. The method according to any one of claims 32-34, characterized in that The transformation of the first sequence according to the third sequence to obtain a fifth sequence with a length of M comprises: According to the third sequence, performing distributed matching transformation on the first sequence based on a decoding mode of a first encoding mode to obtain the fifth sequence. The method according to any one of claims 32-35, wherein: The value of the M is determined according to the Y. The method according to claim 36, wherein: The M is equal to the product of P and Y; wherein the P is an even number. The method according to claim 36 or 37, wherein: The value of the M is 2Y. The method according to any one of claims 32-38, characterized in that The determination of the sixth sequence with a length of K5 according to the fifth sequence, the second sequence, the third sequence and the fourth sequence comprises: The determination of the sixth sequence according to the fifth sequence, the second sequence, the third sequence and the fourth sequence based on a second interleaving sequence. The method according to claim 39, wherein: The second interleaving sequence comprises K2 elements, M elements, K3 elements and K4 elements, the K2 elements are located before the M elements, the M elements are located before the K3 elements, and the K2 elements, the M elements and the K3 elements are located before part or all of the K4 elements. The method of claim 40, wherein, In the case that the K2 elements, the M elements and the K3 elements are located before part of the K4 elements, the remaining part of the K4 elements is located before the K2 elements, the M elements and the K3 elements. The method of claim 41, wherein, The number of the remaining part of the K4 elements is X, and the X is related to Zc, the Zc being a spreading factor of LDPC encoding. The method of any one of claims 39-42, wherein, The second interleaving sequence is related to one or more of the following parameters: modulation order, length of the fourth sequence, the M, column weight of an LDPC base matrix, row weight of an LDPC base matrix, column weight of an LDPC check matrix, row weight of an LDPC check matrix, the second interleaving pattern, or the E. The method of any one of claims 32-43, wherein, The sixth sequence comprises, in order from small to large, the second sequence, the fifth sequence, the third sequence, and the fourth sequence; or The sixth sequence comprises, in order from small to large, X bits of the fourth sequence, the second sequence, the fifth sequence, the third sequence, and K-K1-2Y-L*Y-X bits of the fourth sequence. The method of claim 44, wherein, The X is related to Zc, the Zc being a spreading factor of LDPC encoding. The method of any one of claims 32-45, wherein, The second interleaving pattern has a second element to a (P+L+1)th element corresponding to positions of transformed bits in the seventh sequence and in the eighth sequence of the third sequence, the P being equal to M / Y, the P being an even number. The method of any one of claims 32-46, wherein, The second interleaving pattern has a last A elements other than the second element to the (P+L+1)th element corresponding to positions of check bits in the seventh sequence in the eighth sequence, the P being equal to M / Y, the P being an even number. The method of any one of claims 32-47, wherein, The second interleaving pattern has a first two elements corresponding to positions of untransformed information bits in the seventh sequence in the eighth sequence, the information bits being information bits in the second sequence. The method of any one of claims 32-48, wherein, The first C elements in the second interleaving pattern correspond to positions of the bits in the seventh sequence that are not transformed in the eighth sequence, where C equals E / Y-2-L-P-A. The method of any one of claims 32-49, wherein, In the case that the modulation orders are the same, L corresponding to a first modulation and coding strategy (MCS) is less than or equal to L corresponding to a second MCS, and a serial number of the first MCS is less than a serial number of the second MCS. The method of claim 50, wherein, The L is less than or equal to a difference between the modulation order and 4. The method according to any one of claims 32-51, characterized in that The LDPC encoding of the sixth sequence to obtain the seventh sequence with a length of E includes: The LDPC encoding and rate matching of the sixth sequence to obtain the seventh sequence. The method of any one of claims 32-52, wherein, The modulation symbol sequence includes Y modulation symbols, and each modulation symbol corresponds to Q bits in the eighth sequence after interleaving based on the second interleaving pattern. The method of any one of claims 32-53, wherein, The K1 is determined according to the Y. The method of claim 54, wherein, The K1 equals a product of r and the Y, and the r is an integer greater than 0. The method of claim 55, wherein The r is related to a modulation order, and includes: The r is greater than 0 and less than or equal to 2. The method of claim 55, wherein The r is related to a modulation order and a MCS, and includes: The r is greater than 0 and less than or equal to 2; In the case that the modulation orders are the same, r corresponding to a first MCS is less than or equal to r corresponding to a second MCS, and a serial number of the first MCS is less than a serial number of the second MCS. A communication method characterized by comprising: The method includes: receiving to-be-coded information from a sending end device, wherein the to-be-coded information corresponds to an information bit sequence with a length of K; demodulating the to-be-coded information to obtain a first symbol sequence with a length of E; de-row-column interleaving the first symbol sequence according to a second interleaving pattern to obtain a second symbol sequence; coding the second symbol sequence to obtain a ninth sequence with a length of K5, determining a tenth sequence with a length of M, an eleventh sequence with a length of K2, a twelfth sequence with a length of K3, and a thirteenth sequence with a length of K4 according to the ninth sequence, wherein the M is a sequence inverse transformation length, the K2 equals 2Y, the K3 equals L*Y, the K4 equals K5-M-K2-K3, and the Y is a number of modulation symbols corresponding to a transmission resource; inverse transforming the tenth sequence according to the twelfth sequence to obtain a fourteenth sequence with a length of K1, wherein the M is greater than or equal to the K1, and the K1 equals K-K2-K3-K4; determining a coding result of the information bit sequence according to the fourteenth sequence, the eleventh sequence, the twelfth sequence, and the thirteenth sequence. A communication device characterized by comprising: The communication apparatus comprises a processor; the processor is configured to execute a computer program or instructions, so that the communication method according to any one of claims 1-30 is executed, or so that the communication method according to claim 31 is executed, or so that the communication method according to any one of claims 32-57 is executed, or so that the communication method according to claim 58 is executed. A communication device characterized by comprising: The communication apparatus comprises an interface circuit and a logic circuit; the interface circuit is configured to input and / or output information; the logic circuit is configured to execute the communication method according to any one of claims 1-30, or execute the communication method according to claim 31, or execute the communication method according to any one of claims 32-57, or execute the communication method according to claim 58, process and / or generate the information according to the information. A computer-readable storage medium, characterized by, The computer readable storage medium stores computer instructions or programs, when the computer instructions or programs are executed on a computer, so that the communication method according to any one of claims 1-30 is executed, or so that the communication method according to claim 31 is executed, or so that the communication method according to any one of claims 32-57 is executed, or so that the communication method according to claim 58 is executed. A computer program product, characterized by The computer program product comprises computer instructions; when part or all of the computer instructions are executed on a computer, so that the communication method according to any one of claims 1-30 is executed, or so that the communication method according to claim 31 is executed, or so that the communication method according to any one of claims 32-57 is executed, or so that the communication method according to claim 58 is executed.

Images