Communication method and apparatus

Abstract

A communication method and apparatus, relating to the technical field of communications, and capable of improving a code spectrum and decoding performance while determining the position of a PC bit. The method comprises: a sending end device determines a check bit position set on the basis of a second sequence having a length of M; and further performs polar encoding on an information bit sequence on the basis of the check bit position set, to obtain an encoded bit sequence, and outputs one or more bits of the encoded bit sequence, wherein the second sequence is determined on the basis of the reliability of a first sequence having a length of N, and the second sequence comprises positions in the first sequence other than the position of a pre-frozen bit and the position of a rate matching bit; and the check bit position set comprises a first position set and least reliable [Equation I] positions in the second sequence, and the first position set comprises most reliable [Equation II] positions having a row weight of wK, K being the length of the information bit sequence, wK being a row weight corresponding to the most reliable K-th position in the second sequence, and [Equation II] being an integer greater than or equal to 0.

Description

Communication methods and devices

[0001] This application claims priority to Chinese Patent Application No. 202410829774.9, filed on June 24, 2024, entitled "Communication Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communication technology, and in particular to communication methods and apparatus. Background Technology

[0003] In communication systems, parity-check polar codes (PC-Polar codes) can be used for encoding. In this encoding method, the value of the PC bit can be determined based on the value of the information bit preceding the PC bit according to the PC equation, and the rate matching bit does not need to be sent to the channel.

[0004] In PC-Polar code encoding, the positions of the PC bits can be determined using a lossy reliability approach to improve the code spectrum. Specifically, the minimum row weight w corresponding to the positions of the K information bits can be determined. min From the most reliable first K bit positions, the minimum row overlap w min From the corresponding set of bit positions, select the most reliable first... Each bit position is used as the position of the PC bit, according to the predefined number of PC bits n in the communication protocol. PC The remaining The position of each PC bit can be determined from the most reliable first (K+n) bits. PC From ) bit positions, select the least reliable first Each bit position is used as the position of the PC bit.

[0005] However, in the above encoding process, when determining w min This requires repeatedly finding the minimum value from multiple rows, increasing the complexity of hardware implementation. Therefore, reducing the complexity of constructing PC-Polar codes has become an urgent technical problem to be solved. Summary of the Invention

[0006] This application provides a communication method and apparatus that can reduce the complexity of constructing PC-Polar codes; in addition, by flexibly determining the position of the PC bits, the code spectrum and decoding performance can be improved.

[0007] Firstly, this application provides a communication method that can be executed by a transmitting device. Unless otherwise specified, "transmitting device" in this application can refer to the transmitting device itself, a component within the transmitting device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the transmitting device. The method includes: the transmitting device determining a second sequence of length M based on the reliability corresponding to a first sequence of length N; determining a set of check bit positions based on the second sequence; polar encoding the information bit sequence based on the check bit position set 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 excluding the positions of pre-frozen bits and rate-matching bits; the check bit position set includes the least reliable position from the first position set and the second sequence. There are positions, and the first position set includes rows with weight w. K The most reliable There are positions; K is the length of the information bit sequence, w K The row weight corresponding to the most reliable Kth position in the second sequence; It is an integer greater than or equal to 0.

[0008] Based on the first aspect, the set of check bit positions may include the least reliable part of the first set of positions and the second sequence. There are positions, and the first set of positions includes rows with weight w. K The most reliable For each position, compared to selecting the most reliable first position from the set of bit positions whose row weight is equal to the minimum row weight of the most reliable K bit positions, the most reliable first position is chosen. Using each bit position as a PC bit can increase the range of values ​​for the check bit position set, ensuring w K The number of corresponding bit positions can support In larger cases, improving code spectrum and decoding performance can better meet the error correction performance requirements of ultra-short code intervals. Additionally, w K It is the row weight corresponding to the Kth position in the second sequence, which is different from the method of determining the minimum row weight from the K most reliable positions in the second sequence. This simplifies the determination of w. K The implementation reduces the complexity of constructing PC-Polar codes.

[0009] Secondly, this application provides a communication method that can be executed by a receiving device. Unless otherwise specified, "receiving device" in this application can refer to the receiving device itself, a component within the receiving device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the receiving device. The method includes: the receiving device receiving information to be decoded; determining a second sequence of length M based on the reliability corresponding to a first sequence of length N; determining a set of check bit positions based on the second sequence; and decoding the information to be decoded based on the set of check bit positions. Wherein, the length of the information bit sequence corresponding to the information to be decoded is K; the second sequence includes positions in the first sequence excluding the positions of pre-frozen bits and rate-matching bits; and the set of check bit positions includes the least reliable position from the first position set and the second sequence. There are positions, and the first position set includes rows with weight w. K The most reliable There are positions; K is the length of the information bit sequence, w K The row weight corresponding to the most reliable Kth position in the second sequence; It is an integer greater than or equal to 0.

[0010] Based on the second aspect, the set of check bit positions can include the first set of positions and the least reliable part of the second sequence. There are positions, and the first set of positions includes rows with weight w. K The most reliable For each position, compared to selecting the most reliable first position from the set of bit positions whose row weight is equal to the minimum row weight of the most reliable K bit positions, the most reliable first position is chosen. Using each bit position as a PC bit can increase the range of values ​​for the check bit position set, ensuring w K The number of corresponding bit positions can support In larger cases, improving code spectrum and decoding performance can better meet the error correction performance requirements of ultra-short code intervals. Additionally, w K It is the row weight corresponding to the Kth position in the second sequence, which is different from the method of determining the minimum row weight from the K most reliable positions in the second sequence. This simplifies the determination of w. K The implementation reduces the complexity of constructing PC-Polar codes.

[0011] In one possible implementation, combining the first and second aspects, the transmitting or receiving device determines the information bit position set based on the check bit position set; wherein the information bit position set includes positions in the second sequence other than the check bit position set.

[0012] With the first aspect and the second aspect, in a possible implementation, the sending device or the receiving device determines a set of information bit positions according to the second sequence; the set of information bit positions includes K most reliable positions in positions other than the set of first positions in the second sequence.

[0013] Based on the above two possible implementations, two feasible schemes are provided for determining the set of check bit positions, any of the above schemes can be used to determine the set of information bit positions, which can improve the flexibility and diversity of determining the set of information bit positions.

[0014] With the first aspect and the second aspect, in a possible implementation, when the first preset condition is met, 0, wherein the first preset condition includes one or more of the following: K is 7 and N is greater than 32; or, K is less than or equal to 6; or, the first difference value is less than or equal to 5, the first difference value is the difference between E and K, and E is the length after rate matching.

[0015] Based on the possible implementation, the set of check bit positions can be determined when the first preset condition is met 0, that is, when the first preset condition is met, the set of check bit positions includes M-K least reliable positions, which can simplify the construction of the PC-Polar code.

[0016] With the first aspect and the second aspect, in a possible implementation, when the first preset condition is not met, determined according to w K ; or, determined according to the code rate; or, determined according to the rate matching manner; wherein the first preset condition includes one or more of the following: K is 7 and N is greater than 32; or, K is less than or equal to 6; or, the first difference value is less than or equal to 5, the first difference value is the difference between E and K, and E is the length after rate matching.

[0017] Based on the possible implementation, determined according to the above several manners, so that the value range of w is increased, and the flexibility and diversity of the value of w are increased, so that w

[0018] With the first aspect and the second aspect, in a possible implementation, determined according to w K , including: when w K is greater than or equal to 8, 4; or, when w KWhen K is greater than or equal to 8, and K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, For 6; or, when w K When N is greater than or equal to 8, if N is less than or equal to 32, For 4; or, when w K When K is greater than or equal to 8, if K is less than 10, For 4; or, when w K When it is 4, It is EK-6.

[0019] Based on this possible implementation, it can be determined according to w K Sure For different w K Different can be determined This can better improve the error correction performance of PC-Polar codes, providing a basis for determination. Propose a feasible solution. Additionally, when w... K When the value is greater than or equal to 8, it can be further determined based on the values ​​of N and K. It can be determined in a more precise way This improves the error correction performance of PC-Polar codes.

[0020] Combining the first and second aspects, in one possible implementation, Determined based on bitrate, including when the bitrate is less than or equal to 7 / 16. The value is 4; or, when the bit rate is less than or equal to 7 / 16, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, The value is 6; or, when the bitrate is less than or equal to 7 / 16, if N is less than or equal to 32, The value is 4; or, when the bitrate is less than or equal to 7 / 16, if K is less than 10, The value is 4; or, when the bitrate is greater than 7 / 16, It is EK-6.

[0021] Based on this possible implementation, it can be determined according to the bitrate. Different bitrates can be used to determine different This can better improve the error correction performance of PC-Polar codes, providing a basis for determination. A feasible solution is proposed. Furthermore, when the bitrate is less than or equal to 7 / 16, the specific values ​​of N and K can be further determined. It can be determined in a more precise way This improves the error correction performance of PC-Polar codes.

[0022] With reference to the first aspect and the second aspect, in a possible implementation of the first aspect and the second aspect, According to the rate matching manner, when the rate matching manner is repetition or puncturing, 4; or, when the rate matching manner is repetition or puncturing, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, 6; or, when the rate matching manner is repetition or puncturing, if N is less than or equal to 32, 4; or, when the rate matching manner is repetition or puncturing, if K is less than 10, 4; or, when the rate matching manner is shortening, E-K-6.

[0023] According to the rate matching manner, when the rate matching manner is repetition or puncturing, Different values of M can be determined for different rate matching manners The error correction performance of the PC-Polar code can be better improved, and the value of M can be determined A feasible scheme is provided. In addition, when the rate matching manner is repetition or puncturing, the value of M can be further determined according to the values of N and K The value of M can be determined more finely Thus, the error correction performance of the PC-Polar code is improved.

[0024] With reference to the first aspect and the second aspect, in a possible implementation of the first aspect and the second aspect, when the second preset condition is met, 0; wherein the second preset condition includes one or more of the following: K is less than or equal to 7; or, the first difference is less than or equal to 5, the first difference being the difference between E and K, and E being the length after rate matching.

[0025] Optionally, when K is less than or equal to 7; or, the first difference is less than or equal to 5, or, K is less than or equal to 7 and the first difference is less than or equal to 5, 0.

[0026] According to the rate matching manner, when the rate matching manner is repetition or puncturing, 0, that is, when the second preset condition is met, the set of check bit positions includes the M-K least reliable positions, and the construction of the PC-Polar code can be simplified.

[0027] With reference to the first aspect and the second aspect, in a possible implementation of the first aspect and the second aspect, when the second preset condition is not met, is determined according to w K ; or, is determined according to the code rate; or, is determined according to a rate matching manner; wherein the second preset condition comprises one or more of the following: K is less than or equal to 7; or the first difference value is less than or equal to 5, the first difference value being a difference between E and K, E being a length after rate matching.

[0028] Based on the possible implementation, is determined according to the above several manners, so that the value range of is increased, and flexibility and diversity of the value are increased, so that different values can be taken in different communication scenarios, and communication performance is improved.

[0029] In combination with the first aspect and the second aspect, in a possible implementation, is determined according to w K , comprising: when w K is greater than or equal to 8, is 4; or when w K is greater than or equal to 8, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, is 6; or when w K is greater than or equal to 8, if N is less than or equal to 32, is 4; or when w K is greater than or equal to 8, if K is less than 10, is 4; or when w K is 4, is E-K-6.

[0030] Based on the possible implementation, w K may be determined different w K may be determined The error correction performance of the PC-Polar code can be better improved, and a feasible scheme is provided for determining In addition, when w K is greater than or equal to 8, w may be further determined according to the values of N and K so as to improve the error correction performance of the PC-Polar code.

[0031] In combination with the first aspect and the second aspect, in a possible implementation, is determined according to a code rate, comprising: when the code rate is less than or equal to 7 / 16, is 4; or when the code rate is less than or equal to 7 / 16, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, ​4; or, when the code rate is less than or equal to 7 / 16, if K is less than 10, 4; or, when the code rate is less than or equal to 7 / 16, if K is less than 10, 4; or, when the code rate is greater than 7 / 16, E-K-6.

[0032] Based on the possible implementation, the value of w can be determined according to the code rate Different values of w can be determined for different code rates The error correction performance of the PC-Polar code can be better improved, and the value of w is determined A feasible scheme is proposed. In addition, when the code rate is less than or equal to 7 / 16, the value of w can be further determined according to the value of N The value of w can be more finely determined Thus, the error correction performance of the PC-Polar code can be improved.

[0033] In combination with the first aspect and the second aspect, in a possible implementation, According to the rate matching manner, including: when the rate matching manner is repetition or puncturing, 4; or, when the rate matching manner is repetition or puncturing, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, 6; or, when the rate matching manner is repetition or puncturing, if N is less than or equal to 32, 4; or, when the rate matching manner is repetition or puncturing, if K is less than 10, 4; or, when the rate matching manner is shortening, E-K-6.

[0034] Based on the possible implementation, the value of w can be determined according to the rate matching manner Different values of w can be determined for different rate matching manners The error correction performance of the PC-Polar code can be better improved, and the value of w is determined A feasible scheme is proposed. In addition, when the rate matching manner is repetition or puncturing, the value of w can be further determined according to the values of N and K The value of w can be more finely determined Thus, the error correction performance of the PC-Polar code is improved.

[0035] In combination with the first aspect and the second aspect, in a possible implementation, According to one or more of the following: N, K, the length E after rate matching, the code rate, the rate matching manner, or w K .

[0036] Based on this possible implementation, the transmitting device can match the N, K, E, rate, or w... K One or more dynamic determinations in Make The value of is more flexible and diverse, and can increase The range of values ​​for .

[0037] Optionally, the parameters (such as N, K, w) can be used as a reference. K (Bitrate, rate matching method, etc.) are determined simultaneously. For example, when According to w K When determined, It can also be based on both bitrate and w K Determined, that is, It can be done with w K When determining the criteria, bitrate can also be used as a reference criterion for joint determination. This application does not impose any limitations on this.

[0038] Thirdly, embodiments of this application provide a communication device that can be applied to the transmitting end device described in the first aspect to realize the functions performed by the transmitting end device. The communication device can be the transmitting end device itself, or it can be a chip, chip system, or system-on-a-chip of the transmitting end device, etc. The communication device can execute the functions performed by the transmitting end device through hardware, or it can execute corresponding software through hardware. The hardware or software includes one or more modules corresponding to the above functions. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiver operations, or it can cooperate with the processing module to complete the following transceiver operations; correspondingly, the processing module can independently complete the following processing operations, or it can cooperate with the transceiver module to complete the following processing operations, without limitation.

[0039] For example, the processing module is configured to determine a second sequence of length M based on the reliability corresponding to a first sequence of length N; wherein the second sequence includes positions in the first sequence excluding the positions of pre-frozen bits and rate-matching bits; the processing module is further configured to determine a set of check bit positions based on the second sequence; wherein the set of check bit positions includes the least reliable position from the first position set and the second sequence. There are positions, and the first position set includes rows with weight w. K The most reliable There are positions; K is the length of the information bit sequence, w K The row weight corresponding to the most reliable Kth position in the second sequence; is an integer greater than or equal to 0; the processing module is further configured to perform polar encoding on the information bit sequence according to the set of check bit positions to obtain an encoded bit sequence; and the transceiver module is configured to output one or more bits of the encoded bit sequence.

[0040] 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 that can be achieved can also be seen from the foregoing related content.

[0041] 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 corresponding software through hardware. The hardware or software includes one or more modules corresponding to the functions. For example, a transceiver module and a processing module. The transceiver module can independently complete the following transceiving operations, or can cooperate with the processing module to complete the following transceiving operations. Correspondingly, the processing module can also independently complete the following processing operations, or can cooperate with the transceiver module to complete the following processing operations, which are not limited.

[0042] For example, the transceiver module is configured to receive to-be-decoded information. The length of an information bit sequence corresponding to the to-be-decoded information is K. The processing module is configured to determine a second sequence with a length of M according to the reliability of a first sequence with a length of N. The second sequence includes positions in the first sequence except for the positions of pre-frozen bits and the positions of rate matching bits. The processing module is further configured to determine a set of check bit positions according to the second sequence. The set of check bit positions includes a first set of positions and the most unreliable positions in the second sequence. The first set of positions includes the most reliable K positions with a row weight of w in the second sequence. K is the length of the information bit sequence, and w K is the row weight of the Kth most reliable position in the second sequence. is an integer greater than or equal to 0; the processing module is further configured to perform polar encoding on the information bit sequence according to the set of check bit positions to obtain an encoded bit sequence; and the transceiver module is configured to output one or more bits of the encoded bit sequence.

[0043] 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 details are described in the method examples. The beneficial effects that can be achieved can also be seen from the foregoing related content.

[0044] In a fifth aspect, an embodiment of the present application provides a communication apparatus, comprising 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 according to any one of the first aspect to the second aspect is performed.

[0045] 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 an embodiment 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.

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

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

[0048] In a seventh aspect, an embodiment of the present application provides 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 according to any one of the first aspect and the second aspect is performed.

[0049] In an eighth aspect, an embodiment of the present application provides a computer program product comprising computer programs or instructions, and when the computer programs or instructions are executed on a computer, the communication method according to any one of the first aspect and the second aspect is performed.

[0050] In a ninth aspect, an embodiment of the present application provides a computer program, and when the computer program is executed on a computer, the communication method according to any one of the first aspect and the second aspect is performed.

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

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

[0053] In an eleventh aspect, an embodiment of the present application provides a communication system, which can include a communication device for performing the communication device as described in the first aspect or any possible design of the first aspect, and a communication device for performing the communication device as described in the second aspect or any possible design of the second aspect. BRIEF DESCRIPTION OF DRAWINGS

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

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

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

[0057] 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;

[0058] FIG. 5 is a structural schematic diagram of a communication device according to an embodiment of the present application;

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

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

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

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

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

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

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

[0066] FIG. 13 is a structural schematic diagram of a communication device according to an embodiment of the present application. DETAILED DESCRIPTION

[0067] Before describing the embodiments of this application, the technical terms involved in the embodiments of this application will be described.

[0068] Long term evolution-reed-muller (LTE-RM) coding: The transmitting device can encode ultra-short bit sequences of 3 to 11 bits in the following way:

[0069] Step 1: For an information bit sequence of length K, c0, c1, ..., c K-1 Encode the sequence to obtain an encoded sequence d0, d1, ..., dn of length N. N-1 .

[0070] For example, K can be any value from 3 to 11, and N can be 32.

[0071] in, M i,k The value can be determined according to Table 1 below, i = 0, 1, 2, ..., N-1.

[0072] Table 1

[0073] Step 2: Encode the sequence d0, d1, ..., d of length N. N-1 Rate matching is performed to obtain a rate matching sequence f0, f1, ..., f of length E. E-1 .

[0074] Here, E represents the actual transmitted code length after rate matching, or can be described as the transmitted code length after rate matching, or the length after rate matching. E can be determined based on rate matching related information.

[0075] When it is determined that E is not equal to the encoding length N (e.g., E is not equal to 32), the following rate matching method can be adopted: when E is less than N (e.g., E is less than 32), punch holes from back to front; when E is greater than N (e.g., E is greater than 32), repeat from front to back.

[0076] For example, the rate-matching sequence f0, f1, ..., f E-1 You can obtain it in the following way:

[0077] for k=0 to E-1

[0078] f k =d kmodN ;

[0079] end for

[0080] Step 3: Send the rate matching sequence f0, f1, ..., f E-1.

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

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

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

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

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

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

[0087] The interleaving process is the same as the interleaving process in step 1.

[0088] 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 of length 32.

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

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

[0091] Step 5: the 1st bit of the information bit sequence is determined according to the actual sign of the largest absolute value, i.e., 0 if positive, and 1 if negative.

[0092] ​In the above steps 4 and 5, the first bit to the thirteenth bit are defined from the first bit of the information bit sequence. It can be understood that the information bit sequence can also be defined from the zeroth bit, i.e., the first bit, the second bit, …, and the twelfth bit are replaced by the zeroth bit, the first bit, …, and the twelfth bit, respectively, without limitation.

[0093] However, the LTE-RM decoding adopts FHT. 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 large power consumption of the LTE-RM decoding scheme reaching the maximum likelihood (ML) decoding performance. In addition, when the rate matching length E is small, the number of puncturing is large, and a performance bad point appears, affecting the decoding performance.

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

[0095] 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 and are not fixed as 0, but are determined by PC equations according to the values of the information bits in front of the PC bits. Therefore, 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 shortening bits do not need to be sent to the channel.

[0096] Among them, the reliability sequence can be used to determine the reliability of each bit. The greater the value of the reliability, the more reliable the bit corresponding to the reliability. The length of the reliability sequence can be N, and N is a positive integer.

[0097] For example, when the length of the reliability sequence is 32, the reliability sequence can be as shown in Table 2 below. represents the reliability, represents the bit corresponding to the reliability:

[0098] Table 2

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

[0100] The transmitting 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):

[0101] Step 1. The transmitting 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

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

[0103] where 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 , the vertical axis represents the columns of the upper triangular matrix T pre , and the black points represent that the values of the elements at the positions are 1, and the values of the elements at the positions other than the black points are 0.

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

[0105] where G 32 is the Polar encoding matrix, G 32 is the 5th Kronecker product of G2,

[0106] In the PC-Polar code encoding, the positions of PC bits can be determined in a manner of losing reliability to improve the code spectrum. Specifically, the minimum row weight w min corresponding to the positions of the K most reliable bits can be determined min Among the bit position set corresponding to the minimum row weight w , the K most reliable bit positions are selected as the positions of PC bits, and the number of PC bits n PC is predefined according to a communication protocol The positions of the remaining n PC PC bits can be selected from the (K+n ) most reliable bit positions as the positions of PC bits.

[0107] However, in the above encoding process, when a large number of reliabilities need to be lost to improve the code spectrum, the number of bit positions corresponding to the minimum row weight w min may not support a larger value The number of PC bits is predefined in the communication protocol, and the design is not flexible enough, and the code spectrum and decoding performance are limited.

[0108] In addition, the above selection method of information bits of PC-Polar code based on nested PC equation, rate matching method, and generation method of PC check relationship are incompatible with the new radio (NR) communication standard, and cannot be implemented in the NR communication system; the construction parameters and check equations of PC-Polar code in the NR standard cannot meet the requirements of error correction performance in the ultra-short code interval, and cannot approach the decoding performance of LTE-RM code.

[0109] Furthermore, when w min is determined, multiple row weights need to be minimized, which increases the complexity of hardware implementation.

[0110] In summary, how to determine the positions of PC bits to improve the code spectrum and decoding performance, while reducing the complexity of constructing PC-Polar code, has become a technical problem to be solved.

[0111] Therefore, this application provides a communication method, which includes: a transmitting device determining a second sequence of length M based on the reliability corresponding to a first sequence of length N; determining a set of check bit positions based on the second sequence; performing polar coding on the information bit sequence based on the set of check bit positions to obtain a coded bit sequence; and outputting one or more bits of the coded bit sequence. The second sequence includes positions in the first sequence excluding the positions of pre-frozen bits and rate-matching bits; the set of check bit positions includes the least reliable bit from the first position set and the second sequence. There are positions, and the first position set includes rows with weight w. K The most reliable There are positions; K is the length of the information bit sequence, w K The row weight corresponding to the most reliable Kth position in the second sequence; It is an integer greater than or equal to 0.

[0112] In this embodiment of the application, the set of check bit positions may include the first set of positions and the least reliable part of the second sequence. There are positions, and the first set of positions includes rows with weight w. K The most reliable For each position, compared to selecting the most reliable first position from the set of bit positions whose row weight is equal to the minimum row weight of the most reliable K bit positions, the most reliable first position is chosen. Using each bit position as a PC bit can increase the range of values ​​for the check bit position set, ensuring w K The number of corresponding bit positions can support In larger cases, improving code spectrum and decoding performance can better meet the error correction performance requirements of ultra-short code intervals. Additionally, w K It is the row weight corresponding to the Kth position in the second sequence, which is different from the method of determining the minimum row weight from the K most reliable positions in the second sequence. This simplifies the determination of w. K The implementation reduces the complexity of constructing PC-Polar codes.

[0113] The embodiments of this application will now be described in detail with reference to the accompanying drawings.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0128] Optionally, in the embodiments of this 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.

[0129] 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 source decode the source bit stream to obtain a decoding result.

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

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

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

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

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

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

[0136] 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 so on, without limitation.

[0137] 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 so on. 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.

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

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

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

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

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

[0143] In addition, the actions, terms and the like involved between the embodiments of the present application can be mutually referenced, and are not limited. The message 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, and are not limited.

[0144] The communication method provided by the embodiments of the present application will be described below with reference to the communication system shown in FIG. 3 and FIG. 6. 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. 6.

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

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

[0147] N is the mother code length of data transmission, and 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.

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

[0149] wherein is the ceiling function.

[0150] For example, when K is 11 and E is 56, N can be 64.

[0151] The information bit sequence can include information bits and cyclic redundancy check (CRC) bits, and K can be the sum of the number of information bits and the number of CRC bits included in the information bit sequence. Alternatively, the information bit sequence includes information bits only, and K can be the number of information bits included in the information bit sequence.

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

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

[0154] Optionally, the reliability sequence can be pre-defined by a protocol. The sending device can select a reliability sequence of length N from one or more reliability sequences pre-defined by the protocol.

[0155] For example, the sending device determines N to be 64, and the reliability sequence of length 64 can be as shown in Tables 3-4 below. It can be understood that Table 2 above is defined from bit 0, and can also be defined from bit 1, that is, 0, 1, …, 63 can be replaced by 1, 2, …, 64, without limitation.

[0156] Table 3

[0157] Table 4

[0158] Based on the above reliability sequence, the sending device can determine the position of the pre-frozen bit and the position of the rate matching bit in the first sequence according to the reliability corresponding to the first sequence of length N, and determine the position of the second sequence in the first sequence except the position of the pre-frozen bit and the position of the rate matching bit.

[0159] Optionally, the position of the rate matching bit can be determined according to the rate matching mode.

[0160] Exemplarily, the rate matching manner can be determined according to the length E after rate matching and the mother code length N. For example, if E > N, it is determined that the rate matching manner is repetition, that is, the sending end device sends the mother code with a length of N, and then re-sends (E-N) bits (the (E-N) bits are the rate matching bits). If E < N, the sending end device can determine whether to puncture or shorten according to the current code rate R = K / E. If R < 7 / 16, the rate matching is performed in the puncturing manner; otherwise, (N-E) bits are shortened.

[0161] Optionally, when determining the positions of the rate matching bits, N can be equally divided into 32 sub-blocks, and the 32 sub-blocks are interleaved to obtain an interleaved bit sub-channel sequence number vector. When the rate matching method is repetition, (E-N) positions are determined from front to back in the interleaved bit sub-channel sequence number vector as the positions of the rate matching bits; when the rate matching method is shortening, (N-E) positions are selected from back to front in the interleaved bit sub-channel sequence number vector as the positions of the rate matching bits; and when the rate matching method is puncturing, (N-E) positions are selected from front to back in the interleaved bit sub-channel sequence number vector as the positions of the rate matching bits.

[0162] Exemplarily, taking N as 64 as an example, the interleaved bit sub-channel sequence number vector is {0 1 2 3 4 5 8 9 6 7 10 11 12 13 14 15 16 17 32 33 18 19 34 35 20 21 36 37 22 23 38 39 24 25 40 41 26 27 42 43 28 29 44 45 30 31 46 47 48 49 50 51 52 53 56 57 54 55 58 59 60 61 62 63}. When K is 11 and N is 56, it is assumed that the rate matching manner is puncturing, and the positions of the rate matching bits can be {0 1 2 3 4 5 8 9}.

[0163] For example, taking a first sequence with a length N of 64 as an example, the first sequence can be sorted from low to high reliability as follows: {0 1 2 4 8 16 32 3 5 9 6 17 10 18 12 33 20 34 24 36 7 11 40 19 13 48 14 21 35 26 37 25 22 38 41 28 42 49 44 50 15 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}. Assuming E is 56 (rate matching is achieved through puncturing) and the pre-frozen bit positions are {0 1 2 3 4 5 6 7}. The bit positions for punching can be determined as {0 1 2 3 4 5 8 9} based on the bit sub-channel sequence vector after interleaving. After removing the positions of the punched bits and the pre-frozen bits, the second sequence can be obtained, which can be {32 33 20 34 24 36 40 48 21 35 26 37 25 22 38 41 28 42 49 44 50 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}.

[0164] Step 602: The transmitting device determines the set of check bit positions based on the second sequence.

[0165] The set of check bit positions includes the first set of positions and the least reliable bit position in the second sequence. One position.

[0166] The first position set includes rows with weight w. K The most reliable One position, w K The row weight is the row weight corresponding to the most reliable Kth position in the second sequence.

[0167] For example, with K=11 and the second sequence {32 33 20 34 24 36 40 48 21 35 26 37 25 22 38 41 28 42 49 44 50 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}, the most reliable K=11th position is 54. In other words, we can start from the most reliable position (i.e., 63) and determine the K=11th position (i.e., 54).

[0168] Exemplarily, K=11, w =4, the second sequence is {32 33 20 34 24 36 40 48 21 35 26 37 25 22 38 41 28 42 49 44 50 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}, the row weight of {63} in the second sequence is 64, the row weight of {31 47 55 59 61 62} is 32, the row weight of {27 39 29 43 30 45 51 46 53 54 57 58 60} is 16, the row weight of {56} is 8, the row weight of {23} is 16, the row weight of {21 35 26 37 25 22 38 41 28 42 49 44 50 52} is 8, the row weight of {33 20 34 24 36 40 48} is 4, and the row weight of {32} is 2, then the K=11 reliable position in the second sequence is {54}, the row weight corresponding to {54} is 16, that is, w K =16, the first position set includes the 4 most reliable positions with w K =16, the first position set can be {54 57 58 60}.

[0169] Exemplarily, K=11, the first position set is {54 57 58 60}, and the second sequence is {32 33 20 34 24 36 40 48 21 35 26 37 25 22 38 41 28 42 49 44 50 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}, the least reliable position in the second sequence can be {32 33 20 34 24 36 40 48 21 35 26 37 25 22 38 41 28 42 49 44 50 52 23 56 27 39 29 43 30}, then the check bit position set can be {32 33 20 34 24 36 40 48 21 35 26 37 25 22 38 41 28 42 49 44 50 52 23 56 27 39 29 43 30 54 57 58 60}. wherein,

[0170] ​According to one or more of the following: N, K, E, code rate, rate matching manner, or w K For details, please refer to the description of the following , which will not be repeated here.

[0171] It can be understood that the above parameters (such as N, K, w K , code rate, rate matching manner, etc.) can be determined simultaneously For example, when According to w K determination, w K and code rate can also be determined simultaneously, that is, When w K is used as the determination criterion, code rate can also be used as the reference criterion to determine The present application does not limit this.

[0172] It can be understood that the sending end device can dynamically determine K one or more of N, K, E, rate matching manner, or w This makes the value of more flexible and diversified, and can also increase the value range of .

[0173] Step 603, the sending end device polar encodes the information bit sequence according to the check bit position set to obtain an encoded bit sequence.

[0174] Among them, the sending end device can determine the check bit corresponding to each check bit position according to the preset check relationship, and obtain the encoded bit sequence according to the information bit corresponding to each information bit position.

[0175] Among them, the information bit position can be included in the information bit position set.

[0176] Optionally, the information bit position set can be determined according to the second sequence, or the information bit position set can be determined according to the check bit position set.

[0177] In the first example, the sending end device can determine the information bit position set according to the check bit position set; wherein the information bit position set includes positions in the second sequence other than the check bit position set.

[0178] Exemplarily, taking the second sequence as {32 33 20 34 24 36 40 48 21 35 26 37 25 22 38 41 28 42 49 44 50 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}, the check bit position set can be {32 33 20 34 24 36 40 48 21 35 26 37 25 22 38 41 28 42 49 44 50 52 23 56 27 39 29 43 30 54 57 58 60}, and the information bit position set can be {45 51 46 53 31 47 55 59 61 62 63}.

[0179] In the second example, the sending end device can determine the information bit position set according to the second sequence; wherein the information bit position set includes the most reliable K positions in the positions of the second sequence except the first position set.

[0180] Exemplarily, taking the second sequence as {32 33 20 34 24 36 40 48 21 35 26 37 25 22 38 41 28 42 49 44 50 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}, the first position set as {54 57 58 60}, and K=11, the positions of the second sequence except the first position set are {32 33 20 34 24 36 40 48 21 35 26 37 25 22 38 41 28 42 49 44 50 52 23 56 27 39 29 43 30 45 51 46 53 31 47 55 59 61 62 63}, and the most reliable K=11 positions in {32 33 20 34 24 36 40 48 21 35 26 37 25 22 38 41 28 42 49 44 50 52 23 56 27 39 29 43 30 45 51 46 53 31 47 55 59 61 62 63} are {45 51 46 53 31 47 55 59 61 62 63}, and the information bit position set can be {45 51 46 53 31 47 55 59 61 62 63}.

[0181] It can be understood that the information bit position set can be determined according to the above two manners, the determined information bit position sets are the same, and the flexibility and diversity of determining the check bit position set can be improved. In addition, the information bit position set is determined based on the check bit position set, the complexity of determining the information bit position set can be reduced, and the implementation of determining the information bit position set can be simplified.

[0182] It can be understood that when the information bit position set is determined according to the second sequence, the check bit position set can also be determined after the information bit position set is determined, that is, the check bit position set can include positions in the second sequence except the information bit position set.

[0183] Step 604, the sending end device outputs one or more bits of the encoded bit sequence; correspondingly, the receiving end device receives the to-be-decoded information from the sending end device.

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

[0185] The one or more bits of the encoded bit sequence sent by the sending end device to the receiving end device can be affected by noise and other interference when transmitted through a channel, and the to-be-decoded information received by the receiving end device is one or more bits of the encoded bit sequence affected by noise and other interference.

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

[0187] Step 606, the receiving end device determines a check bit position set according to the second sequence.

[0188] The manner in which the receiving end device determines the check bit position set based on step 605 and step 606 can refer to the manner in which the sending end device determines the check bit position set based on step 601 and step 602, which will not be described herein.

[0189] Step 607, the receiving end device decodes the to-be-decoded information according to the check bit position set.

[0190] The receiving end device can determine an information bit position set; and decodes the to-be-decoded information according to the information bit position set and the check bit position set to obtain a decoding result.

[0191] The manner in which the receiving end device determines the information bit position set can refer to the manner in which the sending end device determines the information bit position set, which will not be described herein.

[0192] Based on the method shown in Figure 6 above, the set of check bit positions can include the first set of positions and the least reliable part of the second sequence. There are positions, and the first set of positions includes rows with weight w. K The most reliable For each position, compared to selecting the most reliable first position from the set of bit positions whose row weight is equal to the minimum row weight of the most reliable K bit positions, the most reliable first position is chosen. Using each bit position as a PC bit can increase the range of values ​​for the check bit position set, ensuring w K The number of corresponding bit positions can support In larger cases, improving code spectrum and decoding performance can better meet the error correction performance requirements of ultra-short code intervals. Additionally, w K It is the row weight corresponding to the Kth position in the second sequence, which is different from the method of determining the minimum row weight from the K most reliable positions in the second sequence. This simplifies the determination of w. K The implementation reduces the complexity of constructing PC-Polar codes.

[0193] Based on the above The description is optional; the sending or receiving device can determine whether preset conditions are met. This application is aimed at determining Two possible designs are proposed: In the first possible design, the design can be determined based on whether the first preset condition is met. That is, when the first preset condition is met, It can be 0; or, when the first preset condition is not met, According to w K Determined; in the second possible design, the determination can be made based on whether the second preset condition is met. That is, when the second preset condition is met, It can be 0; or, when the second preset condition is not met, According to w K Sure.

[0194] The first preset condition includes one or more of the following:

[0195] K is 7 and N is greater than 32; or,

[0196] K is less than or equal to 6; or,

[0197] The first difference is less than or equal to 5.

[0198] The first difference value is a difference value of E and K (or can be described as an absolute value of the difference value of E and K), for example, the first difference value can be represented as E-K, or the first difference value can be represented as |E-K| or |K-E|.

[0199] It can be understood that the first difference value less than or equal to 5 can be equivalent to w K = 2, at this time, there is no need to improve performance by sacrificing reliability; for K less than or equal to 6, or K is 7 and N is greater than 32, the PC-Polar code can be a first-order RM code subcode, at this time, there is no need to improve performance by sacrificing reliability.

[0200] The second preset condition includes one or more of the following:

[0201] K is less than or equal to 7; or,

[0202] The first difference value is less than or equal to 5.

[0203] It can be understood that for K less than or equal to 7, the PC-Polar code can be a first-order RM code subcode, at this time, there is no need to improve performance by sacrificing reliability.

[0204] The first possible design is described in detail as follows:

[0205] The first possible design, when the first preset condition is met, can be 0; or when the first preset condition is not met, can be determined according to w K .

[0206] The first preset condition can also be understood as the first preset condition being that K is less than or equal to 6; or the first preset condition being that the first difference value is less than or equal to 5; or the first preset condition being that K is 7 and N is greater than 32; or the first preset condition being that K is less than or equal to 6 and the first difference value is less than or equal to 5; or the first preset condition being that K is 7 and the first difference value is less than or equal to 5; or the first preset condition being that K is less than or equal to 7 and N is greater than 32, or the first preset condition being that K is less than or equal to 7 and the first difference value is less than or equal to 5.

[0207] Based on the above seven first preset conditions, one or more first preset conditions (the one or more first preset conditions are one or more of the above seven first preset conditions) can be predefined, when any one of the one or more first preset conditions is met, is 0.

[0208] When the first preset condition is not met, is determined according to w Kdetermined, which can also be described as when a third preset condition is satisfied, According to w K determined.

[0209] For the first preset condition being K less than or equal to 6, the third preset condition is K greater than 6.

[0210] For the first preset condition being the first difference less than or equal to 5, the third preset condition is the first difference greater than 5.

[0211] For the first preset condition being K being 7 and N greater than 32, the third preset condition is K not being 7 or N less than or equal to 32.

[0212] For the first preset condition being K less than or equal to 6 and the first difference less than or equal to 5, the third preset condition is K greater than 6 or the first difference greater than 5.

[0213] For the first preset condition being K being 7 and the first difference less than or equal to 5, the third preset condition is K not being 7 or the first difference greater than 5.

[0214] For the first preset condition being K less than or equal to 7 and N greater than 32, the third preset condition is K greater than 7 or N less than or equal to 32.

[0215] For the first preset condition being K less than or equal to 7 and the first difference less than or equal to 5, the third preset condition is K greater than 7 or the first difference greater than 5.

[0216] Based on the above seven third preset conditions, one or more third preset conditions (the one or more third preset conditions being one or more of the above seven third preset conditions) can be predefined, when all of the one or more third preset conditions are satisfied, According to w K determined.

[0217] It can be understood that the predefined one or more third preset conditions correspond to the predefined one or more first preset conditions. For example, when the first three first preset conditions are predefined, the first three third preset conditions need to be predefined, and at this time, when K is less than or equal to 6, or the first difference is less than or equal to 5, or K is 7 and N is greater than 32, is 0; when K is greater than 6 and the first difference is greater than 5 (wherein when K is 7, N less than 32 and the first difference greater than 5 need to be satisfied), is 1. According to w K determined.

[0218] For example, taking the above seven first preset conditions as an example, when K is 6, the first preset condition being satisfied is K less than or equal to 6, which can be determined is 0; or, when K is 7, if N is greater than 32, the first predefined condition is satisfied that K is 7 and N is greater than 32, and is 0, if N is less than 32 and the first difference is greater than 5, none of the above seven predefined conditions is satisfied, and K is determined according to w if N is less than 32 and the first difference is less than or equal to 5, the first predefined condition is satisfied that the first difference is less than or equal to 5, and is 0; or, when K is 8, if the first difference is less than or equal to 5, the first predefined condition is satisfied that the first difference is less than or equal to 5, and is 0, if the first difference is greater than 5, none of the above seven predefined conditions is satisfied, and K is determined according to w

[0219] Specifically, in the case that none of the above predefined one or more first predefined conditions is satisfied, when w K is greater than or equal to 8, may be 4.

[0220] Specifically, in the case that none of the above predefined one or more first predefined conditions is satisfied, when w K is 4, may be E-K-6.

[0221] Based on the first possible design, the present application proposes a possible embodiment to take three first predefined conditions (i.e., the first predefined condition 1 is that K is less than or equal to 6; the first predefined condition 2 is that the first difference is less than or equal to 5; and the first predefined condition 3 is that K is 7 and N is greater than 32) as an example, when any one of the three first predefined conditions is satisfied, may be 0; otherwise, when all of the three first predefined conditions are not satisfied, if w K is greater than or equal to 8, may be 4, if w K is equal to 4, may be E-K-6.

[0222] In the above possible embodiment, the pseudo code for determining may be as follows:

[0223] Based on the above possible embodiment shown by The present application gives the performance comparison diagram of simulation results of the LTE-RM code (curve 1) and the Polar code (curve 2) determined based on the method shown in FIG. 6 in the length (that is, K) of different information bit sequences and the length (that is, E) after rate matching, respectively, as shown in FIG. 7. The decoding mode corresponding to the LTE-RM code can be FHT decoding, and the decoding mode corresponding to the Polar code can be successive cancellation list 8 (SCL8) decoding. The horizontal axis is the length E after rate matching, and the vertical axis is the signal noise ratio (SNR) (in dB) required to reach a block error rate (BLER) of 0.01. As can be seen from FIG. 7, the decoding performance curve of the Polar code corresponding to the value of w may be better than the ML decoding performance of the LTE-RM code.

[0224] Based on the above description of determining the Polar code according to w K , optionally, when w K is greater than or equal to 8, the Polar code can be further determined according to K and N.

[0225] For example, when w K is greater than or equal to 8, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, may be 6.

[0226] For another example, when w K is greater than or equal to 8, if N is less than or equal to 32, may be 4.

[0227] For another example, when w K is greater than or equal to 8, if K is less than 10, may be 4.

[0228] For another example, when w K is greater than or equal to 8, if K is less than 10 and N is less than or equal to 32, may be 4.

[0229] Based on the above description of further determining the Polar code according to K and N, the present application proposes a possible embodiment, taking three first preset conditions (for example, the first preset condition 1 is that K is less than or equal to 6; the first preset condition 2 is that the first difference is less than or equal to 5; and the first preset condition 3 is that K is 7 and N is greater than 32) as an example. When any one of the three first preset conditions is met,​ may be 0; otherwise, when w K is greater than or equal to 8, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, may be 6, if N is less than or equal to 32, or, if K is less than 10, may be 4, when w K is equal to 4, may be E-K-6.

[0230] The pseudo code for determining w in the above possible embodiments can be as follows:

[0231] Based on the value of w shown in the above possible embodiments, the present application gives the performance comparison diagram of simulation effects of LTE-RM code (curve 1) and Polar code (curve 2) determined based on the method shown in FIG. 6 under different information bit sequence length (i.e. K) and length after rate matching (i.e. E) respectively by FIG. 8. The decoding mode corresponding to the LTE-RM code can be FHT decoding, and the decoding mode corresponding to the Polar code can be SCL8 decoding. The horizontal axis is the length E after rate matching, and the vertical axis is the signal-to-noise ratio SNR (unit: dB) required to reach the block BLER = 0.01. It can be seen from FIG. 8 that the decoding performance curve of the Polar code corresponding to the value of w shown in the above possible embodiments can be superior to the ML decoding performance of the LTE-RM code under SCL8 decoding.

[0232] Based on the above possible embodiments, different from directly determining w K as 4 when w may be 4, w may be determined according to the values of N and K, so that w can be determined more finely, thereby improving the error correction performance of the PC-Polar code.

[0233] Optionally, when the first preset condition is not met, w K may be determined according to the code rate, or can be equivalent to determined according to the code rate, or can be equivalent to determined according to the rate matching mode, or may also be determined according to other conditions equivalent to w K , and the present application does not limit this.

[0234] wherein w K≥8 can be equivalent to code rate less than or equal to 7 / 16, or the rate matching manner is puncturing or repetition; w K =4 can be equivalent to code rate greater than 7 / 16, or the rate matching manner is shortening.

[0235] For example, for w K ≥8 =4 can be equivalent to, when code rate is less than or equal to 7 / 16, =4, or, when the rate matching manner is puncturing or repetition, =4.

[0236] For another example, for w K =4 =E-K-6 can be equivalent to, when code rate is greater than 7 / 16, =E-K-6, or, when the rate matching manner is shortening, =E-K-6.

[0237] Based on the above description of determining based on code rate and rate matching manner, the present application proposes two possible embodiments:

[0238] The first possible embodiment takes three first preset conditions (i.e., the first preset condition 1 is that K is less than or equal to 6; the first preset condition 2 is that the first difference value is less than or equal to 5; the first preset condition 3 is that K is 7 and N is greater than 32) as an example. When any one of the three first preset conditions is met, =0; otherwise, when all of the three first preset conditions are not met, if the rate matching manner is repetition or puncturing, =4, if the rate matching manner is shortening, =E-K-6.

[0239] In the first possible embodiment, the pseudo code for determining may be as follows:

[0240] Based on the above description of determining according to the rate matching manner, optionally, when the rate matching manner is repetition or puncturing, can be further determined according to K and N

[0241] For example, when the rate matching manner is repetition or puncturing, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, =6.

[0242] For example, when the rate matching manner is repetition or puncturing, if N is less than or equal to 32, may be 4.

[0243] For example, when the rate matching manner is repetition or puncturing, if K is less than 10, may be 4.

[0244] For example, when the rate matching manner is repetition or puncturing, if K is less than 10 and N is less than or equal to 32, may be 4.

[0245] Based on the above description of further determining based on K and N, the present application proposes a possible embodiment, taking three first preset conditions (for example, the first preset condition 1 is that K is less than or equal to 6; the first preset condition 2 is that the first difference is less than or equal to 5; and the first preset condition 3 is that K is 7 and N is greater than 32) as an example. When any one of the three first preset conditions is met, may be 0; otherwise, when all of the three first preset conditions are not met, if the rate matching manner is repetition or puncturing, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, may be 6, if N is less than or equal to 32, or if K is less than 10, may be 4, when the rate matching manner is shortening, may be E-K-6.

[0246] In the above possible embodiment, the pseudo code for determining may be as follows:

[0247] Based on the above possible embodiment, different from directly determining to be 4 when the rate matching manner is repetition or puncturing, the value of may be further determined according to the values of N and K, so as to more finely determine thus improving the error correction performance of the PC-Polar code.

[0248] A second possible embodiment, taking three first preset conditions (for example, the first preset condition 1 is that K is less than or equal to 6; the first preset condition 2 is that the first difference is less than or equal to 5; and the first preset condition 3 is that K is 7 and N is greater than 32) as an example. When any one of the three first preset conditions is met, may be 0; otherwise, when all of the three first preset conditions are not met, if the code rate is less than or equal to 7 / 16, It can be 4; if the bitrate is greater than 7 / 16, It can be EK-6.

[0249] In the second possible embodiment described above, it is determined that The pseudocode can be shown below:

[0250] Based on the above, determining according to bit rate The description is optional; when the bitrate is less than or equal to 7 / 16, it can be further determined based on K and N.

[0251] For example, when the bit rate is less than or equal to 7 / 16, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, It can be 6.

[0252] For example, when the bitrate is less than or equal to 7 / 16, if N is less than or equal to 32, It can be 4.

[0253] For example, when the bitrate is less than or equal to 7 / 16, if K is less than 10, It can be 4.

[0254] For example, when the bitrate is less than or equal to 7 / 16, if K is less than 10 and N is less than or equal to 32, It can be 4.

[0255] Based on the above, further determinations are made based on K and N. As described in this application, one possible embodiment is proposed, taking the existence of three first preset conditions (e.g., first preset condition 1 is K less than or equal to 6; first preset condition 2 is a first difference less than or equal to 5; first preset condition 3 is K is 7 and N is greater than 32) as an example. When any one of the three first preset conditions is met, It can be 0; otherwise, if all three first preset conditions are not met, when the bitrate is less than or equal to 7 / 16, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, It can be 6 if N is less than or equal to 32, or if K is less than 10. It can be 4, when the bitrate is greater than 7 / 16. It can be EK-6.

[0256] Among them, the above possible embodiments determine The pseudocode can be shown below:

[0257] Based on the above possible embodiments, it is distinguished from directly determining For 4, it can be further determined according to the values of N and K It can be more refined So as to improve the error correction performance of the PC-Polar code.

[0258] The second possible design is described in detail as follows:

[0259] The second possible design is when the second preset condition is met, It can be 0; or when the second preset condition is not met, It can be determined according to w K .

[0260] Among them, the second preset condition includes one or more of the following:

[0261] K is less than or equal to 7; or,

[0262] The first difference is less than or equal to 5.

[0263] Among them, the first difference can refer to the description of the first difference above, which will not be repeated here.

[0264] Among them, the second preset condition can also be understood as the second preset condition being K less than or equal to 7; or, the second preset condition being the first difference less than or equal to 5; or, the second preset condition being K less than or equal to 7 and the first difference less than or equal to 5.

[0265] Based on the above three second preset conditions, one or more second preset conditions (the one or more second preset conditions being one or more of the above three second preset conditions) can be predefined, when any one of the one or more second preset conditions is met, It is 0.

[0266] Among them, when the second preset condition is not met, It is determined according to w K , it can also be described as when the fourth preset condition is met, It is determined according to w K .

[0267] For the second preset condition being K less than or equal to 7, the fourth preset condition is K greater than 7.

[0268] For the second preset condition being the first difference less than or equal to 5, the fourth preset condition is the first difference greater than 5.

[0269] For the second preset condition that K is less than or equal to 7 and the first difference is less than or equal to 5, the fourth preset condition is that K is greater than 7, or the first difference is greater than 5.

[0270] Based on the above three fourth preset conditions, one or more fourth preset conditions (the one or more fourth preset conditions are one or more of the above three fourth preset conditions) can be predefined, and when all of the one or more fourth preset conditions are met, According to w K determined.

[0271] It can be understood that the predefined one or more fourth preset conditions correspond to the predefined one or more second preset conditions. For example, when the first two second preset conditions are predefined, the first two fourth preset conditions need to be predefined. At this time, when K is less than or equal to 7, or the first difference is less than or equal to 5, is 0; when K is greater than 7 and the first difference is greater than 5, According to w K determined.

[0272] For example, when the above three second preset conditions exist, when K is 6, the second preset condition that K is less than or equal to 7 is met, and it can be determined that is 0; or when K is 7, the second preset condition that K is less than or equal to 7 is met, and it can be determined that is 0; or when K is 8, if the first difference is greater than 5, all of the three second preset conditions are not met, and w K determined If the first difference is less than or equal to 5, the second preset condition that the first difference is less than or equal to 5 is met, and it can be determined that is 0.

[0273] Specifically, in the case where all of the above predefined one or more second preset conditions are not met, when w K is greater than or equal to 8, may be 4.

[0274] Specifically, in the case where all of the above predefined one or more second preset conditions are not met, when w K is 4, may be E-K-6.

[0275] Based on the second possible design, the present application provides a possible embodiment, taking an example of two second preset conditions (e.g., the second preset condition 1 is that the first difference is less than or equal to 5; the second preset condition 2 is that K is less than or equal to 7), when any one of the above two second preset conditions is satisfied, may be 0; otherwise, when all of the above two second preset conditions are not satisfied, w K is greater than or equal to 8, may be 4, if w K is equal to 4, may be E-K-6.

[0276] In the above possible embodiment, the pseudo code for determining may be as follows:

[0277] Based on the value of determined in the above possible embodiment, the present application provides a performance comparison diagram of simulation effects of the LTE-RM code (curve 1) and the Polar code (curve 2) determined based on the method shown in FIG. 6, respectively, under the length of different information bit sequences (i.e., K) and the length after rate matching (i.e., E). The decoding mode corresponding to the LTE-RM code can be FHT decoding, and the decoding mode corresponding to the Polar code can be SCL8 decoding. The horizontal axis is the length E after rate matching, and the vertical axis is the signal-to-noise ratio SNR (unit: dB) required to reach the block BLER=0.01. As can be seen from FIG. 9, the decoding performance curve of the Polar code corresponding to the value of determined in the above possible embodiment can be better than the ML decoding performance of the LTE-RM code under SCL8 decoding.

[0278] Based on the above description of determined according to w K , optionally, when w K is greater than or equal to 8, the value of may be further determined according to K and N.

[0279] In the above description of determined according to w K , the value of may be further determined according to K and N. may refer to the description of determined according to K and N in the above first possible design, which will not be described here.

[0280] In the description of the possible embodiments, taking an example that there are two second preset conditions (for example, the second preset condition 1 is that the first difference is less than or equal to 5, and the second preset condition 2 is that K is less than or equal to 7), when any one of the above two second preset conditions is met, may be 0; otherwise, when all of the above two second preset conditions are not met, when w K is greater than or equal to 8, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, may be 6, if N is less than or equal to 32, or if K is less than 10, may be 4, when w K is equal to 4, may be E-K-6.

[0281] In the above possible embodiments, the pseudo code for determining may be as follows:

[0282] Based on the value of shown in the above possible embodiments, the present application shows the performance comparison diagram of the simulation effect of the LTE-RM code (curve 1) and the Polar code (curve 2) determined based on the method shown in FIG. 6 under the length of the different information bit sequence (that is, K) and the length after rate matching (that is, E) respectively. The decoding mode corresponding to the LTE-RM code can be FHT decoding, and the decoding mode corresponding to the Polar code can be SCL8 decoding. The horizontal axis is the length E after rate matching, and the vertical axis is the signal-to-noise ratio SNR (unit: dB) required to reach the block BLER=0.01. It can be seen from FIG. 10 that the decoding performance curve of the Polar code corresponding to the value of shown in the above possible embodiments can be better than the ML decoding performance of the LTE-RM code under SCL8 decoding.

[0283] Optionally, when the second preset condition is not met, may be determined according to w K may be equivalent to determined according to the code rate, or may be equivalent to determined according to the rate matching mode, or may also be determined according to other conditions equivalent to w K , and specific details can be referred to the description of the equivalent conditions in the above first possible design, which will not be repeated here.

[0284] For determined according to the code rate or the rate matching mode, the present application proposes two possible embodiments:

[0285] In a first possible implementation, taking an example that there are two second preset conditions (e.g., the first difference is less than or equal to 5 is the first preset condition, and K is less than or equal to 7 is the second preset condition), when any one of the two second preset conditions is met, may be 0; otherwise, when any one of the two second preset conditions is not met, if the rate matching manner is repetition or puncturing, may be 4, if the rate matching manner is shortening, may be E-K-6.

[0286] In the second possible implementation, the pseudo code for determining may be as follows:

[0287] Based on the description of determining based on the rate matching manner, optionally, when the rate matching manner is repetition or puncturing, K and N can be further determined as

[0288] In the determination of based on the rate matching manner, K and N can be further determined as may be determined based on K and N in the first possible implementation, which will not be described here. Based on the description of further determining

[0289] based on K and N, a possible implementation is provided in the present application, taking an example that there are two second preset conditions (e.g., the first difference is less than or equal to 5 is the first preset condition, and K is less than or equal to 7 is the second preset condition), when any one of the two second preset conditions is met, may be 0; otherwise, when all of the two second preset conditions are not met, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, when the rate matching manner is repetition or puncturing, may be 6, if N is less than or equal to 32, or if K is less than 10, may be 4, when the rate matching manner is shortening, may be E-K-6. In the possible implementation, the pseudo code for determining

[0290] may be as follows:

[0291] ​In a second possible embodiment, taking the existence of two second preset conditions (e.g., second preset condition 1 is that the first difference is less than or equal to 5; second preset condition 2 is that K is less than or equal to 7) as an example, when all of the above two second preset conditions are met... It can be 0; otherwise, when neither of the above two second preset conditions is met, if the bitrate is less than or equal to 7 / 16, It can be 4, if the bitrate is greater than 7 / 16. It can be EK-6.

[0292] In the second possible embodiment described above, it is determined that The pseudocode can be shown below:

[0293] Based on the above, determining according to bit rate The description is optional; when the bitrate is less than or equal to 7 / 16, it can be further determined based on K and N.

[0294] Among them, determination based on bit rate In the middle, further determination is made based on K and N. The first possible design described above can be further determined based on K and N. The description of that will not be repeated here.

[0295] Based on the above, further determinations are made based on K and N. As described in this application, one possible embodiment is proposed, taking the existence of two second preset conditions (e.g., second preset condition 1 is that the first difference is less than or equal to 5; second preset condition 2 is that K is less than or equal to 7) as an example. When either of the above two second preset conditions is met, It can be 0; otherwise, if all of the above two second preset conditions are not met, when the bitrate is less than or equal to 7 / 16, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, It can be 6 if N is less than or equal to 32, or if K is less than 10. It can be 4, when the bitrate is greater than 7 / 16. It can be EK-6.

[0296] Among them, the above possible embodiments determine The pseudocode can be shown below:

[0297] Based on the two possible designs mentioned above, in the first possible design where K equals 7, it is necessary to further determine the value of N. The determination can be more refined Thus, the error correction performance of the PC-Polar code can be improved. The second possible design can simplify the determination compared to the first possible design. The implementation can reduce the complexity of the determination .

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

[0299] 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. These steps or operations are only examples, and 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.

[0300] 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 each device includes a hardware structure and / or software module corresponding to the execution of each function in order to achieve the above functions. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed 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 hardware or computer software driven hardware depends on the specific application of the technical solution and the design constraint conditions. Professional technicians can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0301] 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 function division. Actual implementation can have another division method.

[0302] In the case of dividing each functional module according to each function, FIG. 11 shows a sending terminal device 110 which can perform the actions performed by the sending terminal device in the method shown in FIG. 6, and all the related contents of the steps involved in the method embodiment described above can be referred to the function description of the corresponding functional module, and the technical effects that can be achieved can be referred to the method embodiment described above, which will not be repeated here.

[0303] The sending terminal device 110 can include a transceiver module 1101 and a processing module 1102. The sending terminal device 110 can be a communication device, or a chip applied to a communication device or other combination device, component, etc. with the above-mentioned sending terminal device function. When the sending terminal 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 sending terminal device 110 is a component with the above-mentioned sending terminal device function, 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 sending terminal 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 embodiment of the present application can be realized by a transceiver or a transceiver-related circuit component; the processing module 1102 can be realized by a processor or a processor-related circuit component (or processing circuit).

[0304] For example, the transceiver module 1101 can be configured to perform all the transceiver operations performed by the sending terminal device in the embodiment 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 sending terminal device in the embodiment shown in FIG. 6, except for the transceiver operations, and / or other processes for supporting the technologies described herein.

[0305] FIG. 12 shows a receiving terminal device 120 which can perform the actions performed by the receiving terminal device in the method shown in FIG. 6, and all the related contents of the steps involved in the method embodiment described above can be referred to the function description of the corresponding functional module, and the technical effects that can be achieved can be referred to the method embodiment described above, which will not be repeated here.

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

[0307] For example, the transceiver module 1201 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 1202 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.

[0308] As another implementation manner, 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 sending end device 110 shown in FIG. 11 can further include a memory. Alternatively, the transceiver module 1201 in FIG. 12 can be replaced by a transceiver, which can integrate the functions of the transceiver module 1201. The processing module 1202 can be replaced by a processor, which can integrate the functions of the processing module 1202. Further, the receiving end device 120 shown in FIG. 12 can further include a memory.

[0309] Alternatively, when the processing module 1102 is replaced by a processor, and the transceiver module 1101 is replaced by a transceiver, the sending end device 110 related to the embodiments of the present application can also be the communication apparatus 130 shown in FIG. 13. Or, when the processing module 1202 is replaced by a processor, and the transceiver module 1201 is replaced by a transceiver, the receiving end device 120 related to the embodiments of the present application can also be the communication apparatus 130 shown in FIG. 13.

[0310] The processor can be a logic circuit 1301, and the transceiver can be an interface circuit 1302. Further, the communication apparatus 130 shown in FIG. 13 can further include a memory 1303.

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

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

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

[0314] It should be noted that the terms "first", "second" and "third" and the like in the description and in the claims of the present application are used for distinguishing between similar elements and not necessarily for describing a sequential or chronological order. The terms "first", "second", and the like, are used herein to distinguish elements with a different function and not to imply a sequential or chronological order. Thus, a "first" element can be termed a "second" element without departing from the teachings of the present application. The terms "comprise", "comprising", "comprises", and the like, are used herein to mean including, but not limited to. The term "coupled" is used herein to express a relationship between or among two or more elements, and / or a relationship among more than two elements, and is used in the sense of a connection between or among the elements, and / or a relationship among more than two elements. The term "and / or" includes combinations thereof, i.e. "and / or" means A; B; or A and B. The term "plurality" is used herein to mean two or more.

[0315] Furthermore, the terms "comprise", "comprising", "comprises", and the like, are used herein to mean including, but not limited to. The term "coupled" is used herein to express a relationship between or among two or more elements, and / or a relationship among more than two elements, and is used in the sense of a connection between or among the elements, and / or a relationship among more than two elements. The term "and / or" includes combinations thereof, i.e. "and / or" means A; B; or A and B. The term "plurality" is used herein to mean two or more.

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

[0317] In the embodiments of the present application, the words "exemplary" or "for example" are used to mean serving as an example, instance, or illustration. Any embodiment or design described herein as "exemplary" or "for example" is not necessarily to be construed as preferred or advantageous over other embodiments or designs. Rather, use of the words "exemplary" or "for example" is intended to present concepts in a concrete manner, and to assist in understanding the application.

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

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

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

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

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

[0323] 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 in that, include: Based on the reliability corresponding to the first sequence of length N, a second sequence of length M is determined; wherein, the second sequence includes the positions in the first sequence excluding the positions of the pre-frozen bits and the rate matching bits; Based on the second sequence, a set of check bit positions is determined; wherein, the set of check bit positions includes a first set of positions and the least reliable position in the second sequence. The first set of positions includes rows with weight w. K The most reliable There are 1 position; K is the length of the information bit sequence, and w K The row weight corresponding to the most reliable Kth position in the second sequence; Integers greater than or equal to 0; Based on the set of check bit positions, the information bit sequence is polar-coded to obtain the encoded bit sequence; Output one or more bits of the encoded bit sequence.

2. A communication method, characterized in that, include: Receive information to be decoded; wherein the length of the information bit sequence corresponding to the information to be decoded is K; Based on the reliability corresponding to the first sequence of length N, a second sequence of length M is determined; wherein, the second sequence includes the positions in the first sequence excluding the positions of the pre-frozen bits and the rate matching bits; Based on the second sequence, a set of check bit positions is determined; wherein, the set of check bit positions includes a first set of positions and the least reliable position in the second sequence. The first set of positions includes rows with weight w. K The most reliable There are 1 position; K is the length of the information bit sequence, and w K The row weight corresponding to the most reliable Kth position in the second sequence; Integers greater than or equal to 0; The information to be decoded is decoded according to the set of check bit positions.

3. The method according to claim 1 or 2, characterized in that, The method further includes: Based on the set of check bit positions, a set of information bit positions is determined; wherein, the set of information bit positions includes positions in the second sequence other than the set of check bit positions.

4. The method according to claim 1 or 2, characterized in that, The method further includes: Based on the second sequence, a set of information bit positions is determined; wherein the set of information bit positions includes the K most reliable positions among the positions in the second sequence other than the first position set.

5. The method according to any one of claims 1-4, characterized in that, When the first preset condition is met, the =0: Wherein, the first preset condition includes one or more of the following: K is 7 and N is greater than 32; or K is less than or equal to 6; or The first difference is less than or equal to 5. The first difference is the difference between E and K, where E is the length after rate matching.

6. The method according to any one of claims 1-5, characterized in that, When the first preset condition is not met The According to the w K Confirm; or The Determined based on bitrate; or The Determined based on the rate matching method; The first preset condition includes one or more of the following: K is 7 and N is greater than 32; or K is less than or equal to 6; or The first difference is less than or equal to 5. The first difference is the difference between E and K, where E is the length after rate matching.

7. The method according to claim 6, characterized in that, The According to the w K Determined, including: When the w K When greater than or equal to 8, the It is 4; or When the w K When K is greater than or equal to 8 and less than or equal to 10 and 11, and N is greater than 32, the... It is 6; or When the w K When N is greater than or equal to 8, if N is less than or equal to 32, the following... It is 4; or When the w K When K is greater than or equal to 8, if K is less than 10, the following It is 4; or When the w K When it is 4, the It is EK-6.

8. The method according to claim 6, characterized in that, The Determined based on the bitrate, including: When the bit rate is less than or equal to 7 / 16, the It is 4; or When the bitrate is less than or equal to 7 / 16, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, the... It is 6; or When the bitrate is less than or equal to 7 / 16, if N is less than or equal to 32, the It is 4; or When the bitrate is less than or equal to 7 / 16, if K is less than 10, the It is 4; or When the bit rate is greater than 7 / 16, the It is EK-6.

9. The method according to claim 6, characterized in that, The Determined according to the rate matching method, including: When the rate matching method is repetition or punching, the It is 4; or When the rate matching method is repetition or punching, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, the It is 6; or When the rate matching method is repetition or punching, if N is less than or equal to 32, the It is 4; or When the rate matching method is repetition or punching, if K is less than 10, the It is 4; or When the rate matching method is shortening, the It is EK-6.

10. The method according to any one of claims 1-4, characterized in that, When the second preset condition is met, the The value is 0; wherein, the second preset condition includes one or more of the following: K is less than or equal to 7; or The first difference is less than or equal to 5. The first difference is the difference between E and K, where E is the length after rate matching.

11. The method according to any one of claims 1-4, 10, characterized in that, When the second preset condition is not met The According to the w K Confirm; or The Determined based on bitrate; or The Determined based on the rate matching method; The second preset condition includes one or more of the following: K is less than or equal to 7; or The first difference is less than or equal to 5. The first difference is the difference between E and K, where E is the length after rate matching.

12. The method according to claim 11, characterized in that, The According to the w K Determined, including: When the w K When greater than or equal to 8, the It is 4; or When the w K When K is greater than or equal to 8 and less than or equal to 10 and 11, and N is greater than 32, the... It is 6; or When the w K When N is greater than or equal to 8, if N is less than or equal to 32, the following... It is 4; or When the w K When K is greater than or equal to 8, if K is less than 10, the following It is 4; or When the w K When it is 4, the It is EK-6.

13. The method according to claim 11, characterized in that, When the bit rate is less than or equal to 7 / 16, the It is 4; or When the bitrate is less than or equal to 7 / 16, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, the... It is 6; or When the bitrate is less than or equal to 7 / 16, if N is less than or equal to 32, the It is 4; or When the bitrate is less than or equal to 7 / 16, if K is less than 10, the It is 4; or When the bit rate is greater than 7 / 16, the It is EK-6.

14. The method according to claim 11, characterized in that, The Determined according to the rate matching method, including: When the rate matching method is repetition or punching, the It is 4; or When the rate matching method is repetition or punching, if K is greater than or equal to 10 and less than or equal to 11, and N is greater than 32, the It is 6; or When the rate matching method is repetition or punching, if N is less than or equal to 32, the It is 4; or When the rate matching method is repetition or punching, if K is less than 10, the It is 4; or When the rate matching method is shortening, the It is EK-6.

15. The method according to any one of claims 1-14, characterized in that, The Determined based on one or more of the following: N, K, length E after rate matching, bitrate, rate matching method, or w. K .

16. A communication device, characterized in that, The communication device includes a processor; the processor is configured to run a computer program or instructions that cause the communication method as described in any one of claims 1 or 3-15 to be executed, or cause the communication method as described in any one of claims 2-15 to be executed.

17. A communication device, characterized in that, The communication device includes an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to execute the communication method as described in any one of claims 1 or 3-15, or to execute the communication method as described in any one of claims 2-15, and to process and / or generate the information based on the information.

18. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions or programs that, when executed on a computer, cause the communication method as described in any one of claims 1 to be executed, or cause the communication method as described in any one of claims 2 to 15 to be executed.

19. A computer program product, characterized in that, The computer program product includes computer instructions; when some or all of the computer instructions are executed on a computer, they cause the communication method as described in any one of claims 1 or 3-15 to be executed, or cause the communication method as described in any one of claims 2-15 to be executed.

Images