Communication method, and apparatus

Abstract

A communication method, and an apparatus, which relate to the technical field of communications, and can determine a PC equation to improve the error correction performance. The method comprises: according to a reliability corresponding to a first sequence having a length of N, a transmitting end device determining a second sequence having a length of M; according to the second sequence, determining a check bit position set and an information bit position set; according to one or more first check equations, the check bit position set and the information bit position set, performing polar coding on an information bit sequence to obtain a coded bit sequence; and outputting one or more bits of the coded bit sequence, wherein the second sequence comprises positions other than positions of pre-frozen bits and positions of rate matching bits in the first sequence, N and M are positive integers, and the one or more first check equations are determined according to one or more of the following: one or more preset check equation sets, the check bit position set, the information bit position set, a code rate, or a rate matching mode.

Description

Communication method and apparatus

[0001] This application claims priority to the Chinese patent application No. 202410628804.X, filed on May 20, 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 parity check polar code (PC-Polar code) can be used to encode an information bit sequence. In this encoding manner, the PC-Polar code can include information bits, frozen bits, PC bits, and rate matching bits. The value of the PC bits can be determined according to the values of the information bits located in front of the PC bits based on a PC equation. The rate matching bits do not need to be sent to the channel.

[0004] In this case, when the lengths of the information bit sequences are different, the values of the PC bits can be determined according to different PC equations. Therefore, how to determine the PC equation to improve the error correction performance becomes a technical problem to be solved. SUMMARY

[0005] The present application provides a communication method and apparatus, which can flexibly determine the PC equation to improve the error correction performance.

[0006] In a first aspect, the present application provides a communication method, which can be executed by a sending end device. In the case where no special description is given, the “sending end device” in the present application can refer to the sending end device itself, a component (for example, a processor, a chip, or a chip system, etc.) in the sending end device, or a logic module or software capable of realizing all or part of the functions of the sending end device. The method includes: determining, by the sending end device, a second sequence with a length of M according to the reliability of a first sequence with a length of N; determining, according to the second sequence, a set of check bit positions and a set of information bit positions; polar encoding, according to one or more first check equations, the set of check bit positions, and the set of information bit positions, an information bit sequence to obtain an encoded bit sequence; and outputting one or more bits of the encoded bit sequence. The second sequence includes positions in the first sequence other than the positions of the pre-frozen bits and the positions of the rate matching bits. N and M are positive integers. The one or more first check equations are determined according to one or more of the following: one or more preset check equation groups, the set of check bit positions, the set of information bit positions, a code rate, or a rate matching manner.

[0007] Based on the first aspect, the one or more first check equations can be determined according to one or more of the following: one or more preset check equation groups, the set of check bit positions, the set of information bit positions, a code rate, or a rate matching manner. The one or more first check equations can be dynamically determined according to an actual communication scenario, which can improve the flexibility and diversity of determining the one or more first check equations. In addition, the determined one or more first check equations can better meet the requirements of the ultra-short code interval on error correction performance, improve the compatibility of new radio (NR), and also improve the decoding performance, thereby improving the communication performance.

[0008] The second aspect provides a communication method, which can be executed by a receiving end device. In the absence of special description, the receiving end device in the present application can refer to the receiving end device itself, a component (for example, 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, by the receiving end device, to-be-decoded information from a sending end device; determining a second sequence with a length of M according to the reliability of a first sequence with a length of N; determining a set of check bit positions and a set of information bit positions according to the second sequence; and decoding the to-be-decoded information according to one or more first check equations, the set of check bit positions, and the set of information bit positions. The second sequence includes positions in the first sequence other than the positions of pre-frozen bits and the positions of rate matching bits. N and M are positive integers. The one or more first check equations are determined according to one or more of the following: one or more preset check equation groups, the set of check bit positions, the set of information bit positions, a code rate, or a rate matching manner.

[0009] Based on the second aspect, the one or more first check equations can be determined according to one or more of the following: one or more preset check equation groups, the set of check bit positions, the set of information bit positions, a code rate, or a rate matching manner. The one or more first check equations can be dynamically determined according to an actual communication scenario, which can improve the flexibility and diversity of determining the one or more first check equations. In addition, the determined one or more first check equations can better meet the requirements of the ultra-short code interval on error correction performance, improve the compatibility of new radio (NR), and also improve the decoding performance, thereby improving the communication performance.

[0010] With the first aspect and the second aspect, in a possible implementation, the preset check equation set includes one or more preset check equations, and each preset check equation includes a check bit position, and one or more bit positions checked by the check bit position, and a difference between a number of the check bit position and a number of each bit position of the one or more bit positions is less than a first threshold.

[0011] With the first aspect and the second aspect, in a possible implementation, the first threshold is 21.

[0012] Based on the above two possible implementations, by limiting the difference between the number of the check bit position and the number of each bit position of the one or more bit positions to be less than the first threshold, the search space can be greatly reduced, and the code spectrum characteristics can be improved while losing the optimality as little as possible.

[0013] With the first aspect and the second aspect, in a possible implementation, the number of the check bit position is one or more of 5, 9, 10, 11, 13, 17, 18, 19, 21, 23, 25, 26, 27, or 29.

[0014] With the first aspect and the second aspect, in a possible implementation, the number of the one or more bit positions is one or more of 4, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 20, 22, 24, or 28.

[0015] Based on the above two possible implementations, by determining the number of the check bit position and the number of the one or more bit positions, the search space can be greatly reduced, and the code spectrum characteristics can be improved while losing the optimality as little as possible; in addition, the preset check equation set can be determined according to the numbers of the positions, and the flexibility and diversity of determining the preset check equation set can be improved.

[0016] With the first aspect and the second aspect, in a possible implementation, the check bit position in the first check equation is included in a check bit position set.

[0017] With the first aspect and the second aspect, in a possible implementation, at least one bit position of the one or more bit positions in the first check equation is included in an information bit position set; and the one or more bit positions are one or more bit positions checked by the check bit position in the first check equation.

[0018] Based on the above two possible implementations, a feasible scheme is provided for determining the first check equation set.

[0019] With reference to the first aspect and the second aspect, in a possible implementation, when the code rate is greater than 7 / 16, the one or more first check equations are determined according to the first preset check equation set, the check bit position set, and the information bit position set; or when the code rate is less than or equal to 7 / 16, the one or more first check equations are determined according to the second preset check equation set, the check bit position set, and the information bit position set; wherein the plurality of preset check equation sets include the first preset check equation set and the second preset check equation set, and the first preset check equation set is different from the second preset check equation set.

[0020] Based on the above possible implementation, the preset check equation set can be determined more finely according to the code rate, so that the one or more first check equations can be determined according to the determined preset check equation set and the check bit position set and the information bit position set, the decoding performance can be improved, and the requirement of the ultra-short code interval on the error correction performance can be better met.

[0021] With reference to the first aspect and the second aspect, in a possible implementation, when the rate matching manner is shortening, the one or more first check equations are determined according to the first preset check equation set, the check bit position set, and the information bit position set; or when the rate matching manner is puncturing or the length N of the first sequence and E are the same, the one or more first check equations are determined according to the second preset check equation set, the check bit position set, and the information bit position set, wherein E is the length after rate matching; wherein the plurality of preset check equation sets include the first preset check equation set and the second preset check equation set, and the first preset check equation set is different from the second preset check equation set.

[0022] Based on the above possible implementation, the preset check equation set can be determined more finely according to the rate matching manner, so that the one or more first check equations can be determined according to the determined preset check equation set and the check bit position set and the information bit position set, the decoding performance can be improved, and the requirement of the ultra-short code interval on the error correction performance can be better met.

[0023] With reference to the first aspect and the second aspect, in a possible implementation, the number of the check bit position in at least one preset check equation in the first preset check equation set is one or more of the following: 5, 9, 10, 11, 13, 17, 18, 19, 21, or 25.

[0024] With reference to the first aspect and the second aspect, in a possible implementation, the number of the one or more bit positions of the check bit position in at least one preset check equation in the first preset check equation set is one or more of the following: 4, 6, 7, 8, 10, 12, 13, 14, 15, 16, 18, 19, 20, 22, 23, or 24.

[0025] Based on the above two possible implementations, by determining the number of the check bit position and the number of one or more bit positions in the first preset check equation set, the search space can be greatly reduced, and the code spectrum characteristics can be improved while losing the optimality as little as possible; in addition, the first preset check equation set can be determined according to the above position number, which can improve the flexibility and diversity of determining the first preset check equation set.

[0026] With reference to the first aspect and the second aspect, in a possible implementation, the number of the check bit position in at least one preset check equation in the second preset check equation set is one or more of the following: 17, 18, 19, 21, 23, 25, 26, 27, or 29.

[0027] With reference to the first aspect and the second aspect, in a possible implementation, the number of all bit positions checked by the check bit position in all preset check equations in the second preset check equation set is greater than or equal to a second threshold.

[0028] With reference to the first aspect and the second aspect, in a possible implementation, the second threshold is 12.

[0029] With reference to the first aspect and the second aspect, in a possible implementation, the number of one or more bit positions checked by the check bit position in at least one preset check equation in the second preset check equation set is one or more of the following: 12, 14, 15, 16, 20, 22, or 24.

[0030] Based on the above four possible implementations, by determining the number of the check bit position and the number of one or more bit positions in the second preset check equation set, the search space can be greatly reduced, and the code spectrum characteristics can be improved while losing the optimality as little as possible; in addition, the second preset check equation set can be determined according to the above position number, which can improve the flexibility and diversity of determining the second preset check equation set.

[0031] In a third aspect, an embodiment of the present application provides a communication apparatus, which can be applied to the sending end device of the first aspect to implement the functions performed by the sending end device. The communication apparatus can be the sending end device, a chip or a chip system or a system on chip, etc. The communication apparatus can perform the functions performed by the sending end device through hardware, or perform the functions through corresponding software. The hardware or software includes 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. No limitation is imposed.

[0032] The processing module is configured to determine a second sequence with a length of M according to a reliability corresponding to a first sequence with a length of N, wherein the second sequence comprises positions in the first sequence except for positions of pre-frozen bits and positions of rate matching bits, N and M are positive integers, the processing module is further configured to determine a set of check bit positions and a set of information bit positions according to the second sequence, and the processing module is further configured to perform polar encoding on the information bit sequence according to one or more first check equations, the set of check bit positions, and the set of information bit positions, to obtain a coded bit sequence, wherein the one or more first check equations are determined according to one or more of the following: one or more preset check equation groups, the set of check bit positions, the set of information bit positions, a code rate, or a rate matching manner, and the transceiver module is configured to output one or more bits of the coded bit sequence.

[0033] Optionally, the transceiver module and the processing module of the communication apparatus in the third aspect can also perform the corresponding functions in the first aspect or any possible design of the first aspect, and the details are described in the method examples. The beneficial effects achieved can also be seen from the foregoing related content.

[0034] In a fourth aspect, the embodiments of the present application provide a communication apparatus, which can be applied to the receiving end device in the second 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 perform the functions through corresponding software. The hardware or software comprises one or more modules corresponding to the functions. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiving operations, or can cooperate with the processing module to complete the transceiving operations. Correspondingly, the processing module can also independently complete the following processing operations, or can cooperate with the transceiver module to complete the processing operations, which are not limited.

[0035] The transceiver module is configured to receive to-be-decoded information from a sending end device, the processing module is configured to determine a second sequence with a length of M according to a reliability corresponding to a first sequence with a length of N, wherein the second sequence comprises positions in the first sequence except for positions of pre-frozen bits and positions of rate matching bits, N and M are positive integers, the processing module is further configured to determine a set of check bit positions and a set of information bit positions according to the second sequence, and the processing module is further configured to perform decoding on the to-be-decoded information according to one or more first check equations, the set of check bit positions, and the set of information bit positions, wherein the one or more first check equations are determined according to one or more of the following: one or more preset check equation groups, the set of check bit positions, the set of information bit positions, a code rate, or a rate matching manner.

[0036] Optionally, the transceiver module and the processing module of the communication apparatus in the fourth aspect can also perform the corresponding functions in the second aspect or any possible design of the second aspect, and the specific descriptions can be referred to the detailed description in the method examples. The beneficial effects can also be referred to the foregoing descriptions.

[0037] In the fifth aspect, the embodiments of the present application provide 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 second aspect is executed.

[0038] 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.

[0039] 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.

[0040] In the sixth aspect, the embodiments of the present application provide a communication apparatus, which comprises an interface circuit and a logic circuit; the interface circuit is configured to input and / or output information; and the logic circuit is configured to perform the communication method in any one of the first aspect and the second aspect, process and / or generate information according to the information.

[0041] In the seventh aspect, the embodiments of the present application provide a computer readable storage medium, which stores computer programs or instructions, and when the computer programs or instructions are executed on a computer, the communication method in any one of the first aspect and the second aspect is executed.

[0042] In the eighth aspect, the embodiments of the present application provide a computer program product comprising computer programs or instructions, and when the computer programs or instructions are executed on a computer, the communication method in any one of the first aspect and the second aspect is executed.

[0043] In a ninth aspect, an embodiment of the present application provides a computer program which, when running on a computer, causes the communication method according to any one of the first aspect and the second aspect to be performed.

[0044] In a tenth aspect, an embodiment of the present application provides a chip, comprising: a processor, and a memory coupled to the processor, the memory being configured to store a program or instructions, when the program or instructions are executed by the processor, causing the communication method according to any one of the first aspect and the second aspect to be performed.

[0045] The technical effects brought by any one of the third aspect to the tenth aspect can refer to the technical effects brought by any one of the first aspect and the second aspect, which will not be repeated here.

[0046] In an eleventh aspect, an embodiment of the present application provides a communication system, which can include 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. BRIEF DESCRIPTION OF DRAWINGS

[0047] FIG. 1 is a decoding flow diagram of an LTE-RM code according to an embodiment of the present application;

[0048] FIG. 2 is a schematic diagram of an upper triangular matrix according to an embodiment of the present application;

[0049] FIG. 3 is a schematic diagram of a communication system according to an embodiment of the present application;

[0050] FIG. 4 is a schematic diagram of encoding and decoding of a sending end device and a receiving end device according to an embodiment of the present application;

[0051] FIG. 5 is a schematic diagram of a communication apparatus according to an embodiment of the present application;

[0052] FIG. 6 is an interaction diagram of a communication method according to an embodiment of the present application;

[0053] FIG. 7 is a simulation diagram of performances corresponding to different encoding methods according to an embodiment of the present application;

[0054] FIG. 8 is a simulation diagram of performances corresponding to different encoding methods according to an embodiment of the present application;

[0055] FIG. 9 is a simulation diagram of performances corresponding to different encoding methods according to an embodiment of the present application;

[0056] FIG. 10 is a structural diagram of a sending end device according to an embodiment of the present application;

[0057] FIG. 11 is a structural diagram of a receiving end device according to an embodiment of the present application;

[0058] FIG. 12 is a structural schematic diagram of another communication device provided by an embodiment of the present application. DETAILED DESCRIPTION

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

[0060] Long Term Evolution-Reed-Muller (LTE-RM) encoding: a sending device can encode a super-short information bit sequence of 3-11 bits in the following manner:

[0061] Step 1, encode the information bit sequence c0, c1, …, cK-1 of length K to obtain the encoded sequence d0, d1, …, dN-1 of length N. K-1 N-1 .

[0062] wherein K and N are positive integers.

[0063] For example, K can be any value in 3-11, and N can be 32.

[0064] wherein, M i,k The value of M can be determined according to Table 1 below, i=0, 1, 2, …, N-1.

[0065] Table 1

[0066] Step 2, rate match the encoded sequence d0, d1, …, dN-1 of length N to obtain the rate matched sequence f0, f1, …, fE-1 of length E. N-1 E-1 .

[0067] wherein E is the actual sending code length after rate matching, or described as the transmission code length after rate matching, or described as the length after rate matching. E can be determined according to rate matching related information.

[0068] When it is determined that E is not equal to the encoding length N (for example, E is not equal to 32), the following rate matching manner can be used: when E is less than N (for example, E is less than 32), puncturing from back to front, and when E is greater than N (for example, E is greater than 32), repeating from front to back.

[0069] For example, the rate matched sequence f0, f1, …, fE-1 can be obtained in the following manner: E-1

[0070] for k=0 to E-1 ​​​

[0071] f k = d k mod N ;

[0072] end for

[0073] Step 3, sending rate matching sequence f0, f1, …, f E-1 .

[0074] LTE-RM decoding: the receiving end device can refer to the decoding flowchart shown in FIG. 1 to decode the encoding result of the 3-11 bit ultra-short information bit sequence in the following manner:

[0075] Step 1, simple decision (such as hard decision) is performed on the received sequence, and the code word (such as bipolar code word) or soft bit information after simple decision is interleaved to obtain the processed received code word.

[0076] The received sequence can be the rate matching sequence described above.

[0077] Optionally, if the length of the code word after simple decision is not equal to N, zero padding can be performed on the high bits.

[0078] For example, if the code word after simple decision is b0, b1, …, b 19 with a length of 20, 12 zeros can be padded in the high bits to obtain a code word 0, …, 0, b0, b1, …, b 19 with a length of N=32.

[0079] Step 2, the received code word processed in step 1 is interleaved according to the mask vector.

[0080] The interleaving process is the same as the interleaving process in step 1 described above.

[0081] For example, 128 mask vectors can be generated according to 7 basic mask sequences, and the 128 mask vectors are multiplied (i.e., unmasking) with the received code word processed in step 1 to obtain 128 bipolar sequences with a length of 32.

[0082] Step 3, the bipolar sequence obtained in step 2 is subjected to fast Hadamard transform (FHT) with a 32-order Hadamard matrix to obtain a 128x32 correlation value matrix.

[0083] Step 4, find the maximum absolute value from the correlation value matrix obtained in step 3, and the binary form of the row number corresponding to the maximum absolute value is the 2nd to 6th bit of the information bit sequence, and the binary form of the column number is the 7th to 13th bit of the information bit sequence.

[0084] Step 5, the 1st bit of the information bit sequence is determined according to the actual sign of the maximum absolute value, that is, 0 when positive, and 1 when negative.

[0085] In the above steps 4 and 5, the 1st to 13th bits are defined from the 1st bit of the information bit sequence, and it can be understood that the information bit sequence can also be defined from the 0th bit, that is, the 1st bit, the 2nd bit, …, the 13th bit are replaced by the 0th bit, the 1st bit, …, the 12th bit, without limitation.

[0086] However, the above LTE-RM decoding adopts FHT, and when the length of the information bit sequence is greater than 6 bits, the mask vector needs to be enumerated and demasked, resulting in high complexity and high power consumption of the LTE-RM decoding scheme to achieve the maximum likelihood (ML) decoding performance. In addition, when the rate matching length E is small, the number of puncturing is large, and performance bad points appear, affecting the decoding performance.

[0087] Parity check polar codes (PC-Polar codes): can include information bits, frozen bits, PC bits and rate matching bits.

[0088] Among them, a part of the frozen bits can be selected as PC bits, the values of these PC bits are different from other frozen bits, which are not fixed as 0, but are determined by PC equation according to the values of the information bits in front of the PC bits, so the PC bits can also be called dynamic frozen bits (i.e. the position comes from the frozen bits, but the value is not fixed as 0). The rate matching bits do not need to be sent to the channel.

[0089] Among them, the reliability of each bit can be determined by the reliability sequence, the greater the value of the reliability, the more reliable the bit corresponding to the reliability, and the length of the reliability sequence can be N, N is a positive integer.

[0090] For example, taking the length of the reliability sequence N as 32 as an example, the reliability sequence can be the reliability sequence shown in Table 2 below, wherein, represents the reliability, represents the bit corresponding to the reliability:

[0091] Table 2

[0092] For example, when the length of the information bit sequence is 3, the first three positions with the highest reliability in Table 2 can be selected as the message bits, i.e., the 31st, 30th, and 29th positions in the PC-Polar code (when the starting position of the PC-Polar code is the 0th position) are message bits; or when the length of the information bit sequence is 11, the first eleven positions with the highest reliability in Table 2 can be selected as the message bits, i.e., the 31st, 30th, 29th, 27th, 23rd, 15th, 22nd, 13th, 14th, 11th, and 28th positions in the PC-Polar code (when the starting position of the PC-Polar code is the 0th position) are message bits.

[0093] The sending end device can encode the ultra-short information bit sequence of 3-11 bits in the following manner based on the PC-Polar code of the nested PC equation (pre-transformation) and the reliability sequence (taking N as 32 and the information bit sequence as The coded codeword sequence is For example, where 0≤k≤K, K is the maximum value of the length of the information bit sequence):

[0094] Step 1. The sending end device selects the K positions with the highest reliability as the message bits in the 0-31 positions according to Table 2, and the remaining positions as frozen bits. The sequence is mapped to the message bits, and the remaining 32-K positions are set to 0 to obtain the sequence

[0095] Step 2. The sending end device multiplies the sequence by the upper triangular matrix T pre to obtain the sequence after upper triangular pre-transformation

[0096] The upper triangular matrix T pre may be a 32x32 matrix, and the specific form is shown in FIG. 2. The horizontal axis represents the rows of the upper triangular matrix T pre , and the vertical axis represents the columns of the upper triangular matrix T pre . The black points represent that the value of the element at this position is 1, and the values of the elements at other positions except the black points are 0.

[0097] Step 3. The sequence after upper triangular pre-transformation is subjected to Polar encoding to finally obtain the codeword sequence

[0098] where G 32 is the Polar encoding matrix, and G 32is a 5th order Kronecker product of G2,

[0099] However, in the Polar encoding process, when the length of the information bit sequence is different, rate matching needs to be redesigned, and the rate matching of the sub-block interleaving of the NR standard is not supported, at the same time, the information bit position also needs to be redesigned, and the message sequence of the NR standard is not supported. In addition, the PC equation in the NR standard cannot meet the requirements of the error correction performance in the ultra-short code interval.

[0100] Therefore, how to flexibly determine the PC equation to improve the error correction performance becomes a technical problem to be solved.

[0101] The present application provides a communication method, the method comprises: a sending end device determines a second sequence with a length of M according to the reliability corresponding to a first sequence with a length of N; determines a set of check bit positions and a set of information bit positions according to the second sequence; polar encodes the information bit sequence according to one or more first check equations, the set of check bit positions, and the set of information bit positions, to obtain a coded bit sequence; and outputs one or more bits of the coded bit sequence. Wherein, the second sequence includes positions in the first sequence other than the positions of pre-frozen bits and the positions of rate matching bits; N and M are positive integers; the one or more first check equations are determined according to one or more of the following: one or more preset check equation groups, the set of check bit positions, the set of information bit positions, the code rate, or the rate matching manner.

[0102] In the embodiments of the present application, the one or more first check equations can be determined according to one or more of the following: one or more preset check equation groups, the set of check bit positions, the set of information bit positions, the code rate, or the rate matching manner, which can dynamically determine the one or more first check equations according to the actual communication scenario, and can improve the flexibility and diversity of determining the one or more first check equations. In addition, the determined one or more first check equations can better meet the requirements of the error correction performance in the ultra-short code interval, improve the compatibility of NR, and also improve the decoding performance, thereby improving the communication performance.

[0103] The implementation of the embodiments of the present application will be described in detail below in conjunction with the drawings of the specification.

[0104] The communication method provided by the embodiments of the present application can be used in 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, a new radio (NR) system, a vehicle to everything (V2X) system of NR, 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 (CDMA2000) 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 next-generation communication systems such as a sixth generation (6G) mobile communication system, 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.

[0105] 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.

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

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

[0108] In FIG. 3, the terminal device can be located in the beam / cell coverage range 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, and transmit the data to the terminal device through the air interface after constellation modulation (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, and send the data to the network device through the air interface after constellation modulation (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, 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, without limitation.

[0109] The terminal device in FIG. 3 can be a device with wireless transceiving function or a chip or chip system that can be provided in the device, and can allow a user to access a network, and is a device for providing 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, or a mobile station (MS) or a mobile terminal (MT), and the like.

[0110] Exemplarily, the terminal device in FIG. 3 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, a vehicle-mounted 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.

[0111] The network device in FIG. 3 can be any device deployed in an access network and capable of wireless communication with the 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 software-implemented function, 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.

[0112] 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.

[0113] In yet another example, network devices can include a BBU and a remote radio unit (RRU). The BBU and 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 RRU can also be placed in the same machine room. The BBU and RRU can also be different components under one rack.

[0114] 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).

[0115] 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).

[0116] 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.

[0117] 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) deployed in the terminal device or the network device, a field programmable gate array (FPGA), or software (such as program code in a memory), etc., without limitation.

[0118] 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. 4 for encoding and decoding. The sending end device can be any terminal device or network device in the communication system shown in FIG. 3, and the receiving end device can also be any terminal device or network device in the communication system shown in FIG. 3.

[0119] 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.

[0120] In a specific implementation, each of the terminal devices and the network device shown in FIG. 3 can have the component structure shown in FIG. 5, or include the components shown in FIG. 5. FIG. 5 is a component structure diagram of a communication apparatus 500 provided by an embodiment of the present application. The communication apparatus 500 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. 5, the communication apparatus 500 includes a processor 501, a transceiver 502, and a communication line 503.

[0121] Further, the communication apparatus 500 can further include a memory 504. The processor 501, the memory 504, and the transceiver 502 can be connected through the communication line 503.

[0122] The processor 501 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 501 can also be another device with processing function, such as a circuit, a device, or a software module, without limitation.

[0123] The transceiver 502 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 502 can be a module, a circuit, a transceiver, or any device capable of implementing communication.

[0124] The communication line 503 is configured to transmit information between components included in the communication apparatus 500.

[0125] The memory 504 is configured to store instructions. The instructions can be a computer program.

[0126] The memory 504 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 magnetic disk storage or other magnetic storage devices, and the like, without limitation.

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

[0128] In an example, the processor 501 can include one or more CPUs, such as the CPU0 and the CPU1 in FIG. 5.

[0129] As an optional implementation, the communication apparatus 500 includes a plurality of processors, for example, in addition to the processor 501 in FIG. 5, the communication apparatus 500 can further include a processor 507.

[0130] As an optional implementation, the communication apparatus 500 further includes an output device 505 and an input device 506. For example, the input device 506 is a keyboard, a mouse, a microphone, a joystick, or the like, and the output device 505 is a display screen, a speaker, or the like.

[0131] It should be noted that the communication apparatus 500 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. 5. In addition, the constituent structures shown in FIG. 5 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.

[0132] 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.

[0133] In addition, the actions, terms and the like involved between the embodiments of the present application can be mutually referenced without limitation. The message name or parameter name in the message between the devices in the embodiments of the present application is only an example, and other names can also be used in the specific implementation without limitation.

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

[0135] FIG. 6 is an interaction diagram of a communication method provided by an embodiment of the present application, as shown in FIG. 6, the method can include:

[0136] Step 601, the sending end device determines a second sequence with a length of M according to the reliability corresponding to a first sequence with a length of N.

[0137] Wherein, N is the mother code length of data transmission, and the second sequence includes positions in the first sequence except for the positions of pre-frozen bits and the positions of rate matching bits. M is a positive integer.

[0138] For example, the sending end device can determine the mother code length N = max (min ([N M , N R , N max ]), 32) according to the length K of the information bit sequence and the length E after rate matching. M And the code rate R = K / E and N DM are related, If E≤9 / 8×N DM / 2 and R<9 / 16, then N M =N DM / 2; otherwise, N M =N DM . N R is related to K and the minimum code rate R min , R min =1 / 8. N max =1024.

[0139] Wherein, is the upward rounding.

[0140] The information bit sequence can include information bits, CRC bits, or the information bit sequence includes information bits themselves. K can be the sum of the number of information bits and the number of CRC bits included in the information bit sequence. Alternatively, K can be the number of information bits included in the information bit sequence.

[0141] The sending device can determine the reliability corresponding to the first sequence according to the reliability sequence of length N, and then determine the second sequence of length M.

[0142] The reliability sequence can be used to indicate the reliability corresponding to the position of each bit of the sequence. The greater the value of the reliability, the more reliable the position corresponding to the reliability.

[0143] Alternatively, the reliability sequence can be predefined by a protocol. The sending device can select a reliability sequence of length N from one or more reliability sequences predefined by the protocol.

[0144] For example, the sending device determines N to be 32, and the reliability sequence of length 32 can be as shown in Table 2 above. It can be understood that Table 2 above is defined from bit 0, and can also be defined from bit 1, i.e., 0, 1, …, 31 can be replaced by 1, 2, …, 32, without limitation.

[0145] Based on the above reliability sequence, the sending device can determine the position of the pre-frozen bits and the position of the rate matching bits in the first sequence according to the reliability corresponding to the first sequence of length N, and determine the second sequence as the positions in the first sequence other than the positions of the pre-frozen bits and the positions of the rate matching bits.

[0146] The position of the rate matching bits can be determined according to the rate matching manner.

[0147] For example, if E>N, the rate matching manner is determined to be repetition, i.e., the sending device sends the mother code of length N, and then re-sends (E-N) bits. If E

[0148] For example, assuming the length N of the first sequence is 32, the first sequence can be sorted according to reliability from low to high as {1 2 3 5 9 17 4 6 10 7 18 11 19 13 21 11 8 12 20 14 15 22 27 12 23 29 16 10 28 30 31 32}, and assuming the positions of the rate matching bits and the pre-frozen bits are {1 2}, the second sequence can be {3 5 9 17 4 6 10 7 18 11 19 13 21 11 8 12 20 14 15 22 27 12 23 29 16 10 28 30 31 32}. Alternatively, assuming the positions of the rate matching bits and the pre-frozen bits are {13 21 11 20 14 15 22 27 12 23 29 16 10 28 30 31 32}, the second sequence can be {1 2 3 5 9 17 4 6 10 7 18 11 19 8 12}.

[0149] In step 602, the sending device determines a set of check bit positions and a set of information bit positions according to the second sequence.

[0150] The set of check bit positions includes a first set of check bit positions and a second set of check bit positions, the first set of check bit positions includes the most reliable w min positions in the first set of positions with row weight equal to w , and the second set of check bit positions includes the least reliable w positions in the first set of positions.

[0151] The first set of positions includes the most reliable (K+n PC ) positions in the second sequence, K is the length of the information bit sequence, n PC is the number of check bits, and w min is the minimum row weight corresponding to the most reliable K positions in the first set of positions.

[0152] Optionally, n PC may be less than or equal to the difference between M and K. For example, assuming M is equal to 30 and K is equal to 11, n PC is less than or equal to 19.

[0153] In one example, assuming the second sequence is {3 5 9 17 4 6 10 7 18 11 19 13 21 11 8 12 20 14 15 22 27 12 23 29 16 10 28 30 31 32}, and K is equal to 11, n PCEqual to 19, the first position set can be {3 5 9 17 4 6 10 7 18 11 19 13 21 11 8 12 20 14 15 22 27 12 23 29 16 10 28 30 31 32}.

[0154] In another example, with the second sequence being {1 2 3 5 9 17 4 6 10 7 18 11 19 8 12}, assume K is equal to 8, n PC Equal to 7, the first position set can be {1 2 3 5 9 17 4 6 10 7 18 11 19 8 12}.

[0155] Optionally, K, E, or code rate.

[0156] The code rate can refer to the description of code rate above, and will not be repeated here.

[0157] For example, When K is greater than or equal to 3 and less than or equal to 6, When K is greater than 6 (or K is greater than or equal to 7) and less than or equal to 11, Code rate, E-K, for example, when code rate is less than or equal to 7 / 16 (i.e. K / E≤7 / 16, or R≤7 / 16), Can be 4; for another example, when code rate is greater than 7 / 16, E-K (e.g., when E-K is less than or equal to 5 (i.e. E-K≤5), Can be Or, when E-K is greater than 5 (i.e. E-K>5), Can be E-K-6.

[0158] In one example, with K equal to 11, n PCIf the first position set equals 19, taking {3 5 9 17 4 6 10 7 18 11 19 13 21 11 8 12 20 14 15 22 27 12 23 29 16 10 28 30 31 32} as an example, the row weight of {32} in this first position set is 32, the row weight of {16 10 28 30 31} is 16, the row weight of {8 12 20 14 15 22 27 12 23 29} is 8, and the row weight of {3 5 9 17 4 6 10 7 18 11 19 13 21 11} is 4. The most reliable K=11 positions in the first position set are {22 27 12 23 29 16 10}. If we have 28 30 31 32}, then the minimum row weight w corresponding to these 11 positions is... min It is 8. Assume... If the value is 4, then the row weight in the first position set is equal to w. min =8 is the most reliable Positions {27 26 23 29} represent the set of positions for the first check bit. The least reliable position in this first set is... The positions are {3 5 9 17 4 6 10 7 18 11 19 13 21 25 8}, which is the set of positions for the second check bit.

[0159] The set of check bit positions can be {3 5 9 17 4 6 10 7 18 11 19 13 21 25 8 27 26 23 29}.

[0160] In another example, with K equal to 8, n PC If the value equals 7, and the first position set is {1 2 3 5 9 17 4 6 10 7 18 11 19 8 12}, then the row weight of {16 10 28 30 31} in this first position set is 4, and the row weight of {8 12} is 8. The most reliable K=8 positions in the first position set are {6 10 7 18 11 19 8 12}. Therefore, the minimum row weight w corresponding to these 11 positions is... min It is 4. Assume If the value is 1, then the row weight in the first position set is equal to w. min =4 is the most reliable The set of positions {19} represents the first check bit positions. The least reliable position in the first set is... The positions are {1 2 3 5 9 17}, which is the set of positions for the second check bit.

[0161] The set of check bit positions can be {1 2 3 5 9 17 19}.

[0162] The information bit position set comprises positions in the first position set except the check bit position set.

[0163] In an example, the first position set is {2 4 8 16 3 5 9 6 17 10 18 12 20 10 7 11 19 13 14 21 12 11 22 28 15 23 27 29 30 31}, and the check bit position set is {3 5 9 17 4 6 10 7 18 11 19 13 21 25 8 27 26 23 29}. The information bit position set can be {12 20 14 15 22 16 10 28 30 31 32}.

[0164] In another example, the first position set is {1 2 3 5 9 17 4 6 10 7 18 11 19 8 12}, and the check bit position set is {1 2 3 5 9 17 19}. The information bit position set can be {4 6 10 7 18 11 8 12}.

[0165] In step 603, the sending device performs polar encoding on the information bit sequence according to the one or more first check equations, the check bit position set and the information bit position set, to obtain an encoded bit sequence.

[0166] The first check equation is used to determine the bit value of the check bit. For example, the first check equation is [6, 8, 10], the number (or sequence number) of the check bit position is 10, and the numbers of the positions of the bits checked by the check bit position are 6 and 8. The bit value of the check bit (i.e., the bit value corresponding to the bit position 10) can be determined by the bit values corresponding to the bit positions 6 and 8. For example, when the bit values corresponding to the bit positions 6 and 8 are 11 or 00, the bit value of the check bit (i.e., the bit value corresponding to the bit position 10) can be determined based on the parity check mode (e.g., the number of bits with a value of 1 is even). For example, when the bit values corresponding to the bit positions 6 and 8 are 10 or 01, the bit value of the check bit (i.e., the bit value corresponding to the bit position 10) can be determined based on the parity check mode (e.g., the number of bits with a value of 1 is odd).

[0167] Optionally, the one or more first check equations can be determined according to one or more of the following: one or more preset check equation groups, the check bit position set, the information bit position set, the code rate, or the rate matching mode.

[0168] The preset check equation set can include one or more preset check equations, and each preset check equation includes a check bit position and one or more bit positions checked by the check bit position. For example, the check bit position can be located at the last position of the preset check equation, and the bit positions checked by the check bit can be located at positions other than the last position of the preset check equation.

[0169] Optionally, a difference between the number of the check bit position and the number of each bit position in the one or more bit positions is less than a first threshold. By limiting the difference between the number of the check bit position and the number of each bit position in the one or more bit positions to be less than the first threshold, the search space can be greatly reduced, and the code spectrum characteristics can be improved while losing the optimality as little as possible.

[0170] For example, the first threshold can be 21.

[0171] For example, the number of the check bit position can be one or more of 5, 9, 10, 11, 13, 17, 18, 19, 21, 23, 25, 26, 27, or 29.

[0172] For example, the number of the one or more bit positions can be one or more of 4, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 20, 22, 24, or 28.

[0173] For example, when the number of the check bit position is 29 and the first threshold is 21, the number of the one or more bit positions can be one or more of 15 (i.e., 29-15=14<21), 22 (i.e., 29-22=7<21), and 28 (i.e., 29-28=1<21).

[0174] It can be understood that the preset check equation set can be determined according to the numbers of the above positions, and the flexibility and diversity of determining the preset check equation set can be improved.

[0175] It can be understood that the one or more first check equations can be determined according to one preset check equation set, the set of check bit positions, and the set of information bit positions, or can be determined according to at least two preset check equation sets, the set of check bit positions, the set of information bit positions, a code rate, and a rate matching manner. For details, reference can be made to the description of the one or more first check equations below, which will not be described here.

[0176] In step 604, the sending end device outputs one or more bits of the encoded bit sequence, and correspondingly, the receiving end device receives the to-be-decoded information from the sending end device.

[0177] The length of the information bit sequence corresponding to the to-be-decoded information is K.

[0178] Wherein, one or more bits in the encoding bit sequence sent by the sending end device to the receiving end device may be affected by noise and other interference when transmitted through the channel, and the to-be-decoded information received by the receiving end device is one or more bits in the encoding bit sequence affected by noise and other interference.

[0179] Step 605, the receiving end device determines the second sequence with a length of M according to the reliability corresponding to the first sequence with a length of N.

[0180] Step 606, the receiving end device determines the check bit position set and the information bit position set according to the second sequence.

[0181] Wherein, the way in which the receiving end device determines the check bit position set and the information bit position set based on step 605 and step 606 can refer to the way in which the sending end device determines the check bit position set and the information bit position set based on step 601 and step 602, which will not be repeated here.

[0182] Step 607, the receiving end device decodes the to-be-decoded information according to one or more first check equations, the check bit position set, and the information bit position set.

[0183] Wherein, the first check equation is used to decode the check bit. For example, taking the first check equation [6, 8, 10] as an example, bit position 10 can be decoded by bit position 6 and bit position 8, such as when the bit values corresponding to bit position 6 and bit position 8 are 11 or 00, bit position 10 can be decoded as 0; or when the bit values corresponding to bit position 6 and bit position 8 are 10 or 01, bit position 10 can be decoded as 1.

[0184] Based on the communication method shown in the above Fig. 6, one or more first check equations can be determined according to one or more of the following: one or more preset check equation groups, the check bit position set, the information bit position set, the code rate, or the rate matching manner. One or more first check equations can be dynamically determined according to the actual communication scene, which can improve the flexibility and diversity of determining one or more first check equations. In addition, the determined one or more first check equations can better meet the requirements of ultra-short code interval on error correction performance, improve the compatibility of NR, and also improve the decoding performance, thereby improving the communication performance.

[0185] Based on the communication method shown in the above Fig. 6, optionally, the check bit position in the first check equation is contained in the check bit position set.

[0186] The first check equation can be selected from one or more preset check equation groups, and in the selection process, the positions of the check bits in the first check equation are included in the check bit position set. For example, assuming that the check bit position set includes {11} and does not include {5, 9, 10}, and the information bit position set includes {6} and does not include {7, 8}, the preset check equation [6, 7, 8, 11] can be selected as the first check equation.

[0187] Optionally, the check bit positions in the first check equation are included in the check bit position set, and at least one bit position in the one or more bit positions in the first check equation is included in the information bit position set. Alternatively, the check bit positions in the first check equation are included in the check bit position set, and the one or more bit positions in the first check equation are included in the information bit position set. The one or more bit positions are one or more bit positions checked by the check bit positions in the first check equation.

[0188] For example, assuming that the check bit position set includes {11} and does not include {5, 9, 10}, and the information bit position set includes {6} and does not include {7, 8}, the preset check equation [6, 11] can be selected as the first check equation. Alternatively, assuming that the check bit position set includes {11} and does not include {5, 9, 10}, and the information bit position set includes {6, 7, 8}, the preset check equation [6, 7, 8, 11] can be selected as the first check equation.

[0189] Based on the above description, the present application proposes two possible designs for determining one or more first check equations:

[0190] In a first possible design, when there is one preset check equation group, one or more first check equations can be determined according to the one preset check equation group, the check bit position set, and the information bit position set.

[0191] For example, the preset check equation group can be represented as: [4, 5] [4, 6, 9] [8, 10] [6, 7, 8, 11] [6, 7, 10, 12, 13] [8, 10, 12, 13, 14, 17] [4, 7, 14, 18] [4, 6, 7, 10, 16, 19] [4, 6, 7, 11, 12, 15, 20, 21] [16, 22, 23] [6, 8, 12, 15, 20, 22, 25] [15, 20, 24, 26] [12, 14, 15, 20, 27] [15, 22, 28, 29]

[0192] wherein each row can represent a preset check equation, taking the first preset check equation (i.e., [4, 5]) as an example for illustration, the position of the check bit in the preset check equation is 5, and the positions of the bits checked by the check bit are 4.

[0193] wherein when determining the one or more first check equations, the position of the check bit in each first check equation can be included in the check bit position set, and one or more bits in each first check equation can be included in the information bit position set. The one or more bit positions are one or more bit positions checked by the check bit position in the first check equation.

[0194] For example, taking the preset check equation set in the above example, the check bit position set is {3 5 9 17 4 6 10 7 18 11 19 13 21 25 8 27 26 23 29}, the check bit positions in the first preset check equation to the fourth preset check equation are not in the check bit position set, the check bit positions in the fifth preset check equation to the fourteenth preset check equation are included in the check bit position set, and at least one bit position in the one or more bit positions in the fifth preset check equation to the fourteenth preset check equation is included in the information bit position set. One or more first check equations can be determined from the fifth preset check equation to the fourteenth preset check equation, for example, taking the fifth preset check equation as an example, the numbers of the bit positions checked by the check bit in the fifth preset check equation are 13, and the numbers of the bit positions checked by the check bit position are 6, 7, 10, and 12, so [12, 13] can be determined as a first check equation.

[0195] Based on the first possible design, a possible embodiment is proposed, taking the check bit position set as {3 5 9 17 4 6 10 7 18 11 19 13 21 25 8 27 26 23 29} and the information bit position set as {12 20 14 15 22 16 10 28 30 31 32} as an example, a plurality of first check equations can be determined from the preset check equation set in the above example based on the check bit position set and the information bit position set. The plurality of first check equations can be: [12, 13] [12, 14, 17] [14, 18] [16, 19] [12, 15, 20, 21] [16, 22, 23] [12, 15, 20, 22, 25] [15, 20, 24, 26] [12, 14, 15, 20, 27] [15, 22, 28, 29]

[0196] The application gives a performance comparison diagram of simulation effects of LTE-RM codes (curve 1) and Polar codes (curve 2 and curve 3) under the same code length and the length after rate matching through FIG. 7, wherein curve 2 corresponds to the Polar code determined based on the possible embodiments, curve 3 corresponds to the Polar code determined based on the shift register, the horizontal axis represents the length after rate matching (that is, E), and the vertical axis represents the signal noise ratio (SNR).

[0197] It can be seen from FIG. 7 that the Polar code determined based on the possible embodiments has better decoding performance under SCL8 decoding, which is obviously better than the ML decoding performance of the LTE-RM code under SCL8 decoding and the decoding performance of the Polar code determined based on the shift register.

[0198] In the second possible design, when there are multiple preset check equation sets (for example, there are a first preset check equation set and a second preset check equation set), one or more first check equations can be determined according to the multiple preset check equation sets, the check bit position set, the information bit position set, and the code rate; or one or more first check equations can be determined according to the multiple preset check equation sets, the check bit position set, the information bit position set, and the rate matching manner.

[0199] The first preset check equation set is different from the second preset check equation set.

[0200] For example, the number of the check bit position in at least one preset check equation in the first preset check equation set can be one or more of the following: 5, 9, 10, 11, 13, 17, 18, 19, 21, or 25.

[0201] For example, the number of one or more bit positions checked by the check bit position in at least one preset check equation in the first preset check equation set can be one or more of the following: 4, 6, 7, 8, 10, 12, 13, 14, 15, 16, 18, 19, 20, 22, 23, or 24.

[0202] It can be understood that by determining the number of the check bit position and the number of one or more bit positions in the first preset check equation set, the search space can be greatly reduced, the code spectrum characteristics can be improved, and the optimality loss can be as small as possible; in addition, the first preset check equation set can be determined according to the above position numbers, and the flexibility and diversity of determining the first preset check equation set can be improved.

[0203] For example, the first preset check equation set can be: [4, 5] [7, 9] [6, 8, 10] [6, 7, 10, 11] [4, 6, 8, 12, 13] [7, 13, 14, 16, 17] [6, 7, 8, 14, 15, 18] [4, 7, 10, 15, 16, 18, 19] [4, 7, 15, 18, 19, 21] [4, 14, 16, 20, 22, 23, 24, 25]

[0204] For example, the number of the check bit position in at least one preset check equation in the second preset check equation set can be one or more of: 17, 18, 19, 21, 23, 25, 26, 27, or 29.

[0205] For example, the number of all bit positions checked by the check bit positions in all preset check equations in the second preset check equation set is greater than or equal to a second threshold value.

[0206] For example, the second threshold value can be 12.

[0207] For example, the number of one or more bit positions checked by the check bit position in at least one preset check equation in the second preset check equation set is one or more of: 12, 14, 15, 16, 20, 22, or 24.

[0208] It can be understood that by determining the number of the check bit position and the number of one or more bit positions in the second preset check equation set, the search space can be greatly reduced, and the code spectrum characteristics can be improved while losing the optimality as little as possible; in addition, the second preset check equation set can be determined according to the above position numbers, which can improve the flexibility and diversity of determining the second preset check equation set.

[0209] For example, the second preset check equation set can be: [12, 17] [14, 18] [16, 19] [14, 21] [14, 16, 23] [12, 14, 15, 25] [12, 15, 22, 24, 26] [14, 15, 22, 27] [14, 15, 20, 22, 29]

[0210] Based on the second possible design, the present application proposes two possible implementations for determining one or more first check equations:

[0211] In a first possible implementation, one or more first check equations can be determined according to a plurality of preset check equation sets, a check bit position set, an information bit position set, and a code rate.

[0212] Specifically, when the code rate is greater than 7 / 16, the one or more first check equations are determined according to the first preset check equation set, the check bit position set, and the information bit position set. When the code rate is less than or equal to 7 / 16, the one or more first check equations are determined according to the second preset check equation set, the check bit position set, and the information bit position set.

[0213] In the determination of the one or more first check equations, the position of the check bit in each first check equation can be included in the check bit position set, and one or more bit positions in each first check equation can be included in the information bit position set. The one or more bit positions are one or more bit positions checked by the check bit in the first check equation.

[0214] Based on the first possible implementation, a possible embodiment is provided. Taking an example where E is equal to 30, K is equal to 11, the check bit position set is {3 5 9 17 4 6 10 7 18 11 19 13 21 25 8 27 26 23 29}, and the information bit position set is {12 20 14 15 22 16 10 28 30 31 32}, the preset check equation set can be determined to be the second preset check equation set according to the ratio of K and E (i.e., the code rate is less than 7 / 16), and a plurality of first check equations can be determined from the second preset check equation set in the above example. The plurality of first check equations can be: [12, 17] [14, 18] [16, 19] [14, 21] [14, 16, 23] [12, 14, 15, 25] [12, 15, 22, 24, 26] [14, 15, 22, 27] [14, 15, 20, 22, 29]

[0215] The application provides a performance comparison diagram of simulation effects of LTE-RM codes (curve 1) and Polar codes (curve 2 and curve 3) under the same code length and length after rate matching, as shown in FIG. 8. Curve 2 corresponds to the Polar code determined based on the possible embodiment in the first possible implementation, and curve 3 corresponds to the Polar code determined based on a shift register. The horizontal axis represents the length after rate matching (i.e., E), and the vertical axis represents SNR.

[0216] As can be seen from FIG. 8, the Polar code determined based on the possible embodiment in the first possible implementation has better decoding performance under SCL8 decoding, which is obviously better than the ML decoding performance of the LTE-RM code under SCL8 decoding and the decoding performance of the Polar code determined based on a shift register.

[0217] In a second possible implementation, the one or more first check equations can be determined according to a plurality of preset check equation groups, a check bit position set, an information bit position set, and a rate matching manner.

[0218] Specifically, when the rate matching manner is shortening, the one or more first check equations are determined according to a first preset check equation group, the check bit position set, and the information bit position set. When the rate matching manner is puncturing or N (i.e., the length of the first sequence) is equal to E (i.e., the length after rate matching), the one or more first check equations are determined according to a second preset check equation group, the check bit position set, and the information bit position set.

[0219] In the determination of the one or more first check equations, the position of the check bit in each first check equation can be included in the check bit position set, and one or more bit positions in each first check equation can be included in the information bit position set. The one or more bit positions are one or more bit positions checked by the check bit position in the first check equation.

[0220] Based on the second possible implementation, a possible embodiment is provided. When the rate matching manner is shortening (e.g., E is equal to 15), the check bit position set is {1 2 3 5 9 17 19}, and the information bit position set is {4 6 10 7 18 11 8 12}, for example, the preset check equation group can be determined to be the first preset check equation group according to the rate matching manner, and a plurality of first check equations can be determined from the first preset check equation group in the above example. The plurality of first check equations can be: [4, 5] [7, 9] [7, 17] [4, 7, 10, 18, 19]

[0221] The application provides a performance comparison diagram of simulation effects of LTE-RM codes (curve 1) and Polar codes (curve 2 and curve 3) under the same code length and the length after rate matching by means of FIG. 9. The curve 2 corresponds to the Polar code determined based on the possible embodiment in the second possible implementation, and the curve 3 corresponds to the Polar code determined based on a shift register. The horizontal axis represents the length after rate matching (i.e., E), and the vertical axis represents SNR.

[0222] As can be seen from FIG. 9, the Polar code determined based on the possible embodiment in the second possible implementation has better decoding performance under SCL8 decoding, which is obviously better than the ML decoding performance of the LTE-RM code under SCL8 decoding and the decoding performance of the Polar code determined based on a shift register.

[0223] It should be noted that each of the embodiments of the present application can be implemented independently, or in combination, without limitation. If not specifically stated and there is no logical conflict, the terms and / or descriptions provided in different embodiments of the present application are consistent and can be mutually referred to. The technical features in different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0224] 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. The embodiments of the present application can also execute other operations or variations of various operations. In addition, each step can be executed in a different order as presented in the embodiments of the present application, and it is possible that not all operations in the embodiments of the present application are executed.

[0225] The above mainly introduces the scheme provided by the embodiments of the present application from the perspective of interaction between devices. It can be understood that, in order to realize the above functions, each device comprises a hardware structure and / or a software module corresponding to the execution of each function. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed in the present application, 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. Professional technicians can use different methods to realize the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0226] 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.

[0227] In the case of dividing each functional module according to each function, FIG. 10 shows a sending end device 100, which can execute the actions performed by the sending end device in the method shown in FIG. 6. All related contents of each step involved in the above method embodiment can be referred to the functional description of the corresponding functional module, and the technical effects that can be obtained are referred to the above method embodiment, which will not be described here.

[0228] The sending device 100 can include a transceiver module 1001 and a processing module 1002. The sending device 100 can be a communication device, or a chip or other combination device or component having the functions of the sending device 100. When the sending device 100 is a communication device, the transceiver module 1001 can be a transceiver, which can include an antenna and a radio frequency circuit. The processing module 1002 can be a processor (or processing circuit), such as a baseband processor, which can include one or more CPUs. When the sending device 100 is a component having the functions of the sending device 100, the transceiver module 1001 can be a radio frequency unit. The processing module 1002 can be a processor (or processing circuit), such as a baseband processor. When the sending device 100 is a chip system, the transceiver module 1001 can be an input / output interface of a chip (such as a baseband chip). The processing module 1002 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 1001 in the embodiments of the present application can be implemented by a transceiver or a transceiver-related circuit component. The processing module 1002 can be implemented by a processor or a processor-related circuit component (or processing circuit).

[0229] For example, the transceiver module 1001 can be configured to perform all the transceiving operations performed by the sending device in the embodiments shown in FIG. 6, and / or other processes for supporting the technologies described herein. The processing module 1002 can be configured to perform all the operations performed by the sending device in the embodiments shown in FIG. 6, except for the transceiving operations, and / or other processes for supporting the technologies described herein.

[0230] FIG. 11 shows a receiving device 110, which can perform the actions performed by the receiving device in the method shown in FIG. 6. All related contents 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 achieved can be referred to the method embodiments described above, which will not be described here again.

[0231] The receiving end device 110 can include a transceiver module 1101 and a processing module 1102. For example, the receiving end device 110 can be a communication device, or a chip or other combination device or component having the functions of the receiving end device described above. When the receiving end device 110 is a communication device, the transceiver module 1101 can be a transceiver, which can include an antenna and a radio frequency circuit, etc. The processing module 1102 can be a processor (or processing circuit), for example, a baseband processor, which can include one or more CPUs. When the receiving end device 110 is a component having the functions of the receiving end device described above, the transceiver module 1101 can be a radio frequency unit. The processing module 1102 can be a processor (or processing circuit), for example, a baseband processor. When the receiving end device 110 is a chip system, the transceiver module 1101 can be an input / output interface of a chip (for example, a baseband chip). The processing module 1102 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 1101 in the embodiments of the present application can be implemented by a transceiver or a transceiver-related circuit component. The processing module 1102 can be implemented by a processor or a processor-related circuit component (or processing circuit).

[0232] For example, the transceiver module 1101 can be configured to perform all the transceiving operations performed by the receiving end device in the embodiments shown in FIG. 6, and / or other processes for supporting the technologies described herein. The processing module 1102 can be configured to perform all the operations performed by the receiving end device in the embodiments shown in FIG. 6, except for the transceiving operations, and / or other processes for supporting the technologies described herein.

[0233] As another implementation manner, the transceiver module 1001 in FIG. 10 can be replaced by a transceiver, which can integrate the functions of the transceiver module 1001. The processing module 1002 can be replaced by a processor, which can integrate the functions of the processing module 1002. Further, the sending end device 100 shown in FIG. 10 can further include a memory. Alternatively, the transceiver module 1101 in FIG. 11 can be replaced by a transceiver, which can integrate the functions of the transceiver module 1101. The processing module 1102 can be replaced by a processor, which can integrate the functions of the processing module 1102. Further, the receiving end device 110 shown in FIG. 11 can further include a memory.

[0234] Alternatively, when the processing module 1002 is replaced by a processor, and the transceiver module 1001 is replaced by a transceiver, the sending end device 100 related to the embodiments of the present application can also be the communication apparatus 120 shown in FIG. 12. Or, when the processing module 1102 is replaced by a processor, and the transceiver module 1101 is replaced by a transceiver, the receiving end device 110 related to the embodiments of the present application can also be the communication apparatus 120 shown in FIG. 12.

[0235] The processor can be a logic circuit 1201, and the transceiver can be an interface circuit 1202. Further, the communication apparatus 120 shown in FIG. 12 can further include a memory 1203.

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

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

[0238] The embodiments of the present application further provide a computer readable storage medium. All or part of the flow of the above method embodiments can be instructed by a computer program to relevant hardware to complete, and the program can be stored in the above computer readable storage medium. When the program is executed, the program can include the flow of each of the above method embodiments. The computer readable storage medium can be an internal storage unit of the terminal (including a data sending end and / or a data receiving end) of any of the above embodiments, such as a hard disk or a memory of the terminal. The computer readable storage medium can also be an external storage device of the terminal, such as a plug-in hard disk, a smart media card (SMC), a secure digital (SD) card, a flash card, etc. 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.

[0239] It should be noted that the terms "first" and "second," etc., in the specification, claims, and drawings of this application are used to distinguish different objects, not to describe a specific order. "First" and "second" are used for descriptive purposes only and should not be construed as indicating or implying relative importance or implicitly specifying the number of indicated technical features. Therefore, a feature defined with "first" and "second" may explicitly or implicitly include one or more of that feature. In the description of this embodiment, unless otherwise stated, "a plurality of" means two or more.

[0240] Furthermore, the terms “comprising” and “having”, and any variations thereof, are intended to cover non-exclusive inclusion. For example, a process, method, system, product, or apparatus that includes a series of steps or units is not limited to the steps or units listed, but may optionally include steps or units not listed, or may optionally include other steps or units inherent to such process, method, product, or apparatus.

[0241] It should be understood that in this application, "at least one (item)" means one or more. "More than one" means two or more. "At least two (items)" means two or three or more. "And / or" is used to describe the relationship between related objects, indicating that there can be three relationships. For example, "A and / or B" can mean: only A exists, only B exists, and A and B exist simultaneously, where A and B can be singular or plural. The character " / " generally indicates that the related objects before and after are in an "or" relationship. "At least one (item) of the following" or similar expressions refer to any combination of these items, including any combination of single or plural items. For example, at least one (item) 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. Both "...when" and "if" indicate that a corresponding action will be taken under certain objective circumstances. They are not time limits, nor do they require a judgment action to be taken when the action is taken, nor do they imply any other limitations.

[0242] In the embodiments of this application, the terms "exemplary" or "for example" are used to indicate that something is an example, illustration, or description. Any embodiment or design that is described as "exemplary" or "for example" in the embodiments of this application should not be construed as being more preferred or advantageous than other embodiments or design. Specifically, the use of terms such as "exemplary" or "for example" is intended to present the relevant concepts in a specific manner to facilitate understanding.

[0243] 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. It can include directly or indirectly receiving information from the terminal device. The information can be processed between the source and the destination of the information sending, for example, format change, etc., but the destination can understand the valid information from the source.

[0244] 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.

[0245] In several embodiments provided in the present application, it should be understood that the disclosed devices and methods can be implemented in other ways. For example, the device embodiments described above are only schematic, for example, the division of the modules or units is only 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 device, or some features can be ignored or not executed. In addition, the coupling or direct coupling or communication connection between the units shown or discussed can be indirect coupling or communication connection through some interface, device or unit, and can be electrical, mechanical or other forms.

[0246] 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 multiple physical units, that is, can be located in one place, or can be distributed to multiple different places. Part or all of the units can be selected according to actual needs to achieve the purpose of the present embodiment scheme.

[0247] In addition, each functional unit in each embodiment of the present application can be integrated in one processing unit, or each unit can exist physically, 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.

[0248] The integrated unit, if in the form of a software function unit and sold or used as an independent product, can be stored in a readable storage medium. Based on such an understanding, the technical solutions of the embodiments of the present application can essentially or partially be embodied in the form of a software product, which is stored in a storage medium, includes several instructions to make an apparatus (which can be a single-chip microcomputer, a chip, etc.) or a processor execute all or part of the steps of the methods described in the various embodiments of the present application. The aforementioned storage medium includes: a U disk, a mobile hard disk, a ROM, a RAM, a magnetic disk or an optical disk, and various media that can store program codes.

Claims

1. A communication method characterized by comprising: The method comprises: determining a second sequence with a length of M according to reliabilities corresponding to a first sequence with a length of N; wherein the second sequence comprises positions in the first sequence other than positions of pre-frozen bits and positions of rate matching bits; N and M are positive integers; determining a set of check bit positions and a set of information bit positions according to the second sequence; polar encoding an information bit sequence according to one or more first check equations, the set of check bit positions, and the set of information bit positions, to obtain an encoded bit sequence; wherein the one or more first check equations are determined according to one or more of the following: one or more preset check equation groups, the set of check bit positions, the set of information bit positions, a code rate, or a rate matching manner; outputting one or more bits of the encoded bit sequence.

2. A communication method characterized by comprising: The method comprises: receiving to-be-decoded information from a sending end device; determining a second sequence with a length of M according to reliabilities corresponding to a first sequence with a length of N; wherein the second sequence comprises positions in the first sequence other than positions of pre-frozen bits and positions of rate matching bits; N and M are positive integers; determining a set of check bit positions and a set of information bit positions according to the second sequence; decoding the to-be-decoded information according to one or more first check equations, the set of check bit positions, and the set of information bit positions; wherein the one or more first check equations are determined according to one or more of the following: one or more preset check equation groups, the set of check bit positions, the set of information bit positions, a code rate, or a rate matching manner.

3. The method of claim 1 or 2, wherein the preset check equation group comprises one or more preset check equations, and the preset check equation comprises a check bit position and one or more bit positions checked by the check bit position, and a difference between a number of the check bit position and a number of each bit position of the one or more bit positions is less than a first threshold.

4. The method of claim 3, wherein the first threshold is 21.

5. The method of claim 3 or 4, wherein the number of the check bit position is one or more of 5, 9, 10, 11, 13, 17, 18, 19, 21, 23, 25, 26, 27, or 29.

6. The method of any one of claims 3-5, wherein the number of each bit position of the one or more bit positions is one or more of 4, 6, 7, 8, 10, 11, 12, 13, 14, 15, 16, 20, 22, 24, or 28.

7. The method of any one of claims 1-6, wherein the check bit position in the first check equation is included in the set of check bit positions.

8. The method of any one of claims 1-7, wherein At least one bit position in the one or more bit positions in the first check equation is included in the set of information bit positions; wherein the one or more bit positions are one or more bit positions checked by the check bit position in the first check equation.

9. The method according to any one of claims 1 to 8, characterized in that, When there are multiple preset check equation groups, When the code rate is greater than 7 / 16, the one or more first check equations are determined according to a first preset check equation group, the set of check bit positions, and the set of information bit positions; or When the code rate is less than or equal to 7 / 16, the one or more first check equations are determined according to a second preset check equation group, the set of check bit positions, and the set of information bit positions. The multiple preset check equation groups include the first preset check equation group and the second preset check equation group, and the first preset check equation group is different from the second preset check equation group.

10. The method according to any one of claims 1 to 9, characterized in that, When there are multiple preset check equation groups, When the rate matching manner is shortening, the one or more first check equations are determined according to a first preset check equation group, the set of check bit positions, and the set of information bit positions; or When the rate matching manner is puncturing or the length N of the first sequence and E are the same, the one or more first check equations are determined according to a second preset check equation group, the set of check bit positions, and the set of information bit positions, wherein E is the length after rate matching; The multiple preset check equation groups include the first preset check equation group and the second preset check equation group, and the first preset check equation group is different from the second preset check equation group.

11. The method of claim 9 or 10, wherein, The number of the check bit position in at least one preset check equation in the first preset check equation group is one or more of the following: 5, 9, 10, 11, 13, 17, 18, 19, 21, or 25.

12. The method of any one of claims 9-11, wherein, The number of the one or more bit positions checked by the check bit position in at least one preset check equation in the first preset check equation group is one or more of the following: 4, 6, 7, 8, 10, 12, 13, 14, 15, 16, 18, 19, 20, 22, 23, or 24.

13. The method of any one of claims 9-12, wherein, The number of the check bit position in at least one preset check equation in the second preset check equation group is one or more of the following: 17, 18, 19, 21, 23, 25, 26, 27, or 29.

14. The method of any one of claims 9-13, wherein, The number of all bit positions checked by the check bit position in all preset check equations in the second preset check equation group is greater than or equal to a second threshold value.

15. The method of claim 14, wherein, The second threshold value is 12.

16. The method of any one of claims 9-15, wherein, The number of one or more bit positions of the check bit position check in at least one preset check equation in the second preset check equation set is one or more of 12, 14, 15, 16, 20, 22, or 24.

17. A communications device, characterized by The communication device comprises a processor; the processor is configured to run a computer program or instruction, so that the communication method of any one of claims 1, 3-16 is executed, or so that the communication method of any one of claims 2-16 is executed.

18. A communications device, characterized by The communication device 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 of any one of claims 1, 3-16, or execute the communication method of any one of claims 2-16, process and / or generate the information according to the information.

19. A computer-readable storage medium, characterized in that, The computer readable storage medium stores computer instructions or programs; when the computer instructions or programs are run on a computer, the communication method of any one of claims 1, 3-16 is executed, or the communication method of any one of claims 2-16 is executed.

20. A computer program product, characterised in that, The computer program product comprises computer instructions; when part or all of the computer instructions are run on a computer, the communication method of any one of claims 1, 3-16 is executed, or the communication method of any one of claims 2-16 is executed.

Images