Communication method and apparatus

Abstract

A communication method and apparatus, which relate to the technical field of communications, and are capable of flexibly determining the number of PC bits, thereby improving the code spectrum and decoding performance. The method comprises: on the basis of the reliability corresponding to a first sequence having a length of N, determining a second sequence comprising M positions in the first sequence other than the positions of pre-frozen bits and the positions of rate-matched bits; determining a check bit position set on the basis of a first position set comprising the most reliable (K+nPC) positions in the second sequence, and performing polar coding on an information bit sequence, so as to obtain a coded bit sequence; and outputting one or more bits of the coded bit sequence. K is the length of the information bit sequence; nPC is the number of check bits; and nPC is determined on the basis of one or more of the following: expression (1), K, E, a rate matching mode, or wmin, wherein expression (1) represents the number of check bits in the check bit position set that have a row weight equal to wmin and a reliability lower than check bits of all information bit positions, and wmin is the minimum row weight corresponding to K most reliable positions in the first position set.

Description

Communication method and apparatus

[0001] This application claims priority to the Chinese patent application No. 202410639340.2, filed on May 21, 2024, and entitled "Communication method and apparatus", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

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

[0003] In a communication system, parity check polar codes (PC-Polar codes) can be used for encoding. In this encoding method, the PC-Polar codes can include information bits, frozen bits, PC bits and rate matching shortening bits. The value of the PC bits can be determined based on the values of the information bits located in front of the PC bits according to PC equations, and the rate matching shortening bits do not need to be sent to the channel.

[0004] Currently, the number of PC bits is predefined by the communication protocol, and the design is not flexible, and the code spectrum and decoding performance are limited. Therefore, how to determine the number of PC bits to improve the code spectrum and decoding performance has become a technical problem to be solved. SUMMARY

[0005] The present application provides a communication method and apparatus, which can flexibly determine the number of PC bits and improve the code spectrum and decoding performance.

[0006] In a first aspect, the present application provides a communication method, which can be executed by a sending end device. In the absence of special description, the "sending end device" in the present application can refer to the sending end device itself, a component (for example, a processor, a chip, or a chip system, etc.) in the sending end device, or a logic module or software capable of realizing all or part of the functions of the sending end device. The method comprises: determining 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; determining a set of check bit positions according to a first set of positions in the second sequence; polar encoding an information bit sequence according to the set of check bit positions to obtain an encoded bit sequence; and outputting one or more bits of the encoded bit sequence. The first set of positions includes the most reliable (K+n PC ) positions in the second sequence, K is the length of the information bit sequence, n PC is the number of check bits, and n PC is determined according to one or more of the following: K, the length E after rate matching, the rate matching manner, or w min ; The number of check bits in the check bit position set is equal to w min and the reliability is lower than that of all information bit positions; w min The minimum row weight corresponding to the K most reliable positions in the first position set.

[0007] Based on the first aspect, the number of check bits can be determined according to one or more of the above parameters, which increases the selection range of the number of check bits, makes the value of the number of check bits more flexible and diversified, improves the code spectrum and decoding performance, and can better meet the requirements of the ultra-short code interval on error correction performance, and can approach the maximum likelihood (ML) decoding performance of the long term evolution-reed-muller (LTE-RM) code under successive cancellation list 8 (SCL8) decoding.

[0008] In a second aspect, the present application provides a communication method, which can be executed by a receiving end device. In the absence of special description, the "receiving end device" in the present application can refer to the receiving end device itself, a component (for example, a processor, a chip, or a chip system) in the receiving end device, or a logic module or software capable of realizing all or part of the functions of the receiving end device. The method comprises: receiving information to be decoded from a sending end device; the length of an information bit sequence corresponding to the information to be decoded is K; determining 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 other than the positions of pre-frozen bits and the positions of rate matching bits; determining a check bit position set according to a first position set in the second sequence; and decoding the information to be decoded according to the check bit position set. The first position set includes (K+n PC ) most reliable positions in the second sequence, n PC is the number of check bits, n PC is determined according to one or more of the following: K, the length E after rate matching, the rate matching manner, or w min ; The number of check bits in the check bit position set is equal to w min and the reliability is lower than that of all information bit positions; w min The minimum row weight corresponding to the K most reliable positions in the first position set.

[0009] Based on the second aspect, the number of parity bits can be determined according to one or more of the above parameters, which increases the range of selection of the number of parity bits, making the value of the number of parity bits more flexible and diverse, improving the code spectrum and decoding performance, while being compatible with the NR standard, and can better meet the error correction performance requirements of ultra-short code intervals. Under successive cancellation list 8 (SCL8) decoding, it can approximate the maximum likelihood (ML) decoding performance of long term evolution-reed-muller (LTE-RM) codes.

[0010] Combining the first and second aspects, in one possible implementation, the set of check bit positions includes a first set of check bit positions and a second set of check bit positions, wherein the first set of check bit positions includes the row weights in the first set equal to w. min The most reliable The second set of check bit positions includes the least reliable position from the first set of positions. One position.

[0011] Based on this possible implementation, the first set of check bit positions The positions are determined based on the first set of positions, which increases the selection range of the first set of check bit positions and ensures the minimum row overlap w among the most reliable K bit positions. min The number of corresponding bit positions can support In larger cases, improving code spectrum performance and decoding performance can better meet the error correction performance requirements of ultra-short code intervals, and can approach the ML decoding performance of LTE-RM codes under SCL8 decoding.

[0012] Combining the first and second aspects, in one possible implementation, n PC according to Determined, including: n PC for Where min(·) is the minimum value of (·).

[0013] Based on this possible implementation, n PC According to A unified configuration can simplify the description of the construction algorithm.

[0014] Combining the first and second aspects, in one possible implementation, when K is greater than or equal to 3 and less than or equal to the first threshold, n PCis min(3, E-K); wherein, min(·) is a minimum value of (·).

[0015] Based on the possible implementation, the number of check bits is not more than 3, and compatibility with the NR standard is achieved.

[0016] With reference to the first aspect and the second aspect, in a possible implementation, the first threshold value is 6.

[0017] With reference to the first aspect and the second aspect, in a possible implementation, when K is greater than the first threshold value and less than or equal to 11, n PC is determined according to a code rate; wherein, the code rate is a ratio of K to E; or, n PC is determined according to a rate matching manner; or, n PC is determined according to w min .

[0018] Based on the possible implementation, n PC is determined to provide multiple feasible schemes, improve flexibility of the value of n PC , and improve code spectrum and decoding performance.

[0019] With reference to the first aspect and the second aspect, in a possible implementation, n PC is determined according to a code rate, including: when the code rate is less than or equal to 7 / 16, n PC is min(M-K, 9); wherein, min(·) is a minimum value of (·); or, when the code rate is greater than 7 / 16, n PC is determined according to a first difference value; wherein, the first difference value is a difference between E and K.

[0020] With reference to the first aspect and the second aspect, in a possible implementation, when the first difference value is less than or equal to 5, n PC is min(E-K, 3); wherein, min(·) is a minimum value of (·); or, when the first difference value is greater than 5, n PC is E-K-3.

[0021] Based on the above two possible implementations, when n PC is min(M-K, 9), the number of check bits is not more than 9, error correction performance is good, and implementation complexity is low. When n PC is min(E-K, 3), the number of check bits is not more than 3, and compatibility with the NR standard can be achieved. When n PC is E-K-3, error correction performance is good and algorithm description is simple.

[0022] With reference to the first aspect and the second aspect, in a possible implementation, n PC is determined according to a rate matching manner, including: when the rate matching manner is puncturing, nPC min (M-K, 9) ; or when the rate matching manner is shortening, n PC min (M-K, 9) ; or when the rate matching manner is shortening, n PC determined according to the first difference value; wherein the first difference value is a difference between E and K.

[0023] In combination with the first aspect and the second aspect, in a possible implementation, when the first difference value is less than or equal to 5, n PC min (E-K, 3) ; or when the first difference value is greater than 5, n PC E-K-3.

[0024] Based on the above two possible implementations, when n PC min (M-K, 9), the number of check bits is not more than 9, the error correction performance is good, and the implementation complexity is low. When n PC min (E-K, 3), the number of check bits is not more than 3, and compatibility with the NR standard can be implemented. When n PC E-K-3, the error correction performance is good and the algorithm description is simple.

[0025] In combination with the first aspect and the second aspect, in a possible implementation, n PC is determined according to w min , including: when w min is 8, n PC min (M-K, 9) ; wherein min (·) is a minimum value of (·) ; or when w min is 2, n PC min (E-K, 3) ; or when w min is 4, n PC E-K-3.

[0026] Based on the possible implementation, when n PC min (M-K, 9), the number of check bits is not more than 9, the error correction performance is good, and the implementation complexity is low. When n PC min (E-K, 3), the number of check bits is not more than 3, and compatibility with the NR standard can be implemented. When n PC E-K-3, the error correction performance is good and the algorithm description is simple.

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

[0028] For example, the processing module is used to determine a second sequence of length M based on the reliability corresponding to a first sequence of length N; the second sequence includes positions in the first sequence excluding the positions of pre-frozen bits and rate-matching bits; the processing module is also used to determine a set of check bit positions based on a first set of positions in the second sequence; and to perform polar coding on the information bit sequence based on the set of check bit positions to obtain a coded bit sequence; the transceiver module is used to output one or more bits of the coded bit sequence. The first set of positions includes the most reliable (K+n) bits in the second sequence. PC There are ) positions, where K is the length of the information bit sequence, and n PC n is the number of parity bits. PC Determined according to one or more of the following: K, length after rate matching, E, rate matching method, or w min ; To check the row weight in the bit position set equal to w min And its reliability is lower than the number of check bits at all information bit positions; w min It represents the minimum row weight corresponding to the K most reliable positions in the first position set.

[0029] Optionally, the transceiver module and processing module of the communication device in the third aspect may also perform the corresponding functions in the first aspect or any possible design of the first aspect, as detailed in the method examples, and the beneficial effects that can be achieved can also be found in the foregoing related content.

[0030] In a fourth aspect, an embodiment of the present application provides a communication apparatus, which can be applied to the receiving end device of 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 by executing corresponding software. The hardware or software includes one or more modules corresponding to the functions. For example, a transceiver module and a processing module. The transceiver module can perform the transceiving operations independently or in cooperation with the processing module. Similarly, the processing module can perform the processing operations independently or in cooperation with the transceiver module. No limitation is imposed.

[0031] For example, the transceiver module is configured to receive the to-be-decoded information from the sending end device. The information bit sequence corresponding to the to-be-decoded information has a length of 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 other than the positions of the pre-frozen bits and the positions of the rate matching bits. The processing module is further configured to determine a set of check bit positions according to a first set of positions in the second sequence, and decode the to-be-decoded information according to the set of check bit positions. The first set of positions includes the most reliable (K+n PC ) positions in the second sequence, n PC is the number of check bits, and n PC is determined according to one or more of the following: K, the length E after rate matching, the rate matching manner, or w min . n min is the number of check bits in the set of check bit positions with a row weight equal to w min and a reliability lower than that of all the information bit positions, and w min is the minimum row weight corresponding to the most reliable K positions in the first set of positions.

[0032] 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. For details, refer to the detailed description in the method examples. The beneficial effects that can be achieved can also be found in the foregoing related content.

[0033] In a fifth aspect, an embodiment of the present application provides a communication apparatus, which includes one or more processors. The one or more processors are configured to run computer programs or instructions. When the one or more processors execute the computer programs or instructions, the communication method described in any one of the first aspect to the second aspect is executed.

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

[0035] In a possible design, the communication apparatus further includes 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.

[0036] In a sixth aspect, this application provides a communication apparatus, which includes an interface circuit and a logic circuit. The interface circuit is configured to input and / or output information. The logic circuit is configured to perform the communication method in any one of the first aspect or the second aspect, process and / or generate information according to the information.

[0037] In a seventh aspect, this application provides a computer-readable storage medium, which stores computer instructions or programs. When the computer instructions or programs are run on a computer, the communication method in any one of the first aspect or the second aspect is performed.

[0038] In an eighth aspect, this application provides a computer program product containing computer instructions. When the computer instructions are run on a computer, the communication method in any one of the first aspect or the second aspect is performed.

[0039] In a ninth aspect, this application provides a computer program. When the computer program is run on a computer, the communication method in any one of the first aspect or the second aspect is performed.

[0040] In a tenth aspect, this application provides a chip, which includes a processor and a memory. The processor is coupled to the memory, and the memory is configured to store programs or instructions. When the programs or instructions are executed by the processor, the communication method in any one of the first aspect or the second aspect is performed.

[0041] The technical effects brought by any one of the fifth aspect to the tenth aspect can be referred to the technical effects brought by any one of the first aspect or the second aspect, which will not be repeated here.

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

[0043] Fig. 1 is a schematic diagram of a decoding process of an LTE-RM code according to an embodiment of the present application;

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

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

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

[0047] Fig. 5 is a schematic diagram of a structure of a communication device according to an embodiment of the present application;

[0048] Fig. 6 is a schematic diagram of a flow of a communication method according to an embodiment of the present application;

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

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

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

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

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

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

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

[0056] Fig. 14 is a schematic diagram of simulation of performances corresponding to different encoding methods according to an embodiment of the present application;

[0057] Fig. 15 is a schematic diagram of a structure of a sending device according to an embodiment of the present application;

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

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

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

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

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

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

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

[0065] Table 1

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

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

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

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

[0070] for k=0 to E-1

[0071] f k = d k mod N ;

[0072] end for

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

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

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

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

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

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

[0079] Step 2, performing interleaving processing on the received code word processed in step 1 according to the mask vector.

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

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

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

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

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

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

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

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

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

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

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

[0091] Table 2

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

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

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

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

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

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

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

[0099] However, the PC-Polar code based on the nested PC equation is not compatible with the new radio (NR) communication standard, and cannot be implemented in the NR communication system.

[0100] In addition, the number of PC bits is predefined by the communication protocol, and the design is not flexible, and the code spectrum and decoding performance are limited.

[0101] In summary, how to determine the number of PC bits to improve the code spectrum and decoding performance has become a technical problem to be solved.

[0102] To solve the above technical problems, the present application provides a communication method, which comprises: a sending end device determines a second sequence with a length of M according to the reliability corresponding to a first sequence with a length of N; the second sequence includes positions in the first sequence except for the positions of pre-frozen bits and the positions of rate matching bits; determines a set of check bit positions according to a first set of positions in the second sequence; polar encodes an information bit sequence according to the set of check bit positions to obtain a coded bit sequence; and outputs one or more bits of the coded bit sequence. Wherein, the first set of positions includes the most reliable (K+n PC ) positions in the second sequence, K is the length of the information bit sequence, n PC is the number of check bits, and n PC is determined according to one or more of the following: K, the length E after rate matching, the rate matching method, or w min ; is the number of check bits in the set of check bit positions whose row weight is equal to w min and whose reliability is lower than that of all information bit positions; w min is the minimum row weight corresponding to the most reliable K positions in the first set of positions.

[0103] In the embodiments of the present application, the number of check bits can be determined according to one or more of the above parameters, which increases the selection range of the number of check bits, makes the value of the number of check bits more flexible and diversified, improves the code spectrum and decoding performance, and at the same time can be compatible with the NR standard, can better meet the requirements of ultra-short code interval on error correction performance, and can approach the maximum likelihood (ML) decoding performance of long term evolution-reed-muller (LTE-RM) code under successive cancellation list 8 (SCL8) decoding.

[0104] The embodiments of the present application will be described in detail below with reference to the accompanying drawings.

[0105] The communication method provided by the embodiments of the present application can be used in any communication system, which can be a third generation partnership project (3GPP) communication system, for example, a long term evolution (LTE) system, or 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 next-generation communication systems, such as a sixth generation (6G) mobile communication system, or a non-terrestrial network (NTN) system (such as a satellite communication system), a non-3GPP communication system, and the like.

[0106] 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, etc., without limitation.

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

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

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

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

[0111] 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, an in-vehicle device, a wearable device, a terminal device in Internet of Things, a household appliance, a virtual reality (VR) terminal, an augmented reality (AR) terminal, a wireless terminal in industrial control, a wireless terminal in unmanned driving, a wireless terminal in remote medical treatment, a wireless terminal in smart power grid, a wireless terminal in smart city, a wireless terminal in smart home, a vehicle with vehicle-to-vehicle (V2V) communication capability, a smart connected vehicle, a drone with unmanned aerial vehicle to unmanned aerial vehicle (UAV to UAV, U2U) communication capability, a terminal device in future network, or a terminal device in future evolved public land mobile network (PLMN), etc., without limitation.

[0112] The network device in FIG. 3 can be any device deployed in an access network and capable of wireless communication with a terminal device, can also be a chip or chip system that can be provided in the above device, can also be a logic node or a logic module or a 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.

[0113] For example, a network device can consist 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, evolved Node Bs (gNBs), transmission reception points (TRPs), evolved Node Bs (eNBs), radio network controllers (RNCs), Node Bs (NBs), base station controllers (BSCs), base transceiver stations (BTSs), home base stations (e.g., home evolved Node Bs, or home Node Bs (HNBs), macro base stations, micro base stations, pico base stations, small cells, relay stations, balloon stations, drone stations, wireless backhaul nodes, base band units (BBUs), or wireless fidelity (Wi-Fi) access points (APs), etc. It is understood that network devices can be terrestrial devices or non-terrestrial devices (such as satellites, drones, high-altitude communication equipment, etc.). Furthermore, in communication systems employing different wireless access technologies, the names of network devices with base station functions may differ, and this application does not impose any restrictions on this.

[0114] In another example, the network equipment may include a BBU and a remote radio unit (RRU). The BBU and RRU can be located in different places; for example, the RRU can be moved remotely to a high-traffic area, while the BBU is located in the central equipment room. The BBU and RRU can also be located in the same equipment room. The BBU and RRU can also be different components under the same rack.

[0115] In another example, the network device can be a device that includes centralized unit (CU) nodes, distributed unit (DU) nodes, or both CU and DU nodes. For instance, the network device can be logically divided into CUs and DUs, with some protocol layer functions centrally controlled by the CU, and the remaining partial or complete protocol layer functions distributed in the DU, which is centrally controlled by the CU. The CU and DU can be separate entities or included in the same network element, such as a BBU. Furthermore, the centralized unit (CU) can be further divided into a control plane (CU-CP) and a user plane (CU-UP).

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

[0117] It can be understood 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 the present application. Any one of the CU (or CU-CP, CU-UP), DU and RU in the present application can be implemented by a software module, a hardware module, or a combination of a software module and a hardware module.

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

[0136] 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:

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

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

[0139] For example, the sending end device can determine the mother code length N = max (min ([N M , N R , N max ]), 32) according to the length K of the information bit sequence and the length E after rate matching. N M and the code rate R = K / E and N DM are related. If E ≤ 9 / 8 × N DM / 2 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.

[0140] Wherein, is the upward rounding.

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

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

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

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

[0145] For example, if the sending device determines that N is 32, the reliability sequence of length 32 can be the reliability sequence shown in Table 3 below. represents the reliability, represents the bit position corresponding to the reliability:

[0146] Table 3

[0147] It can be understood that Table 3 above is defined from the 0th bit, and can also be defined from the 1st bit, that is, the above 0, 1, …, 31 can be replaced by 1, 2, …, 32, without limitation.

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

[0149] The position of the rate matching bit can be determined according to the rate matching mode.

[0150] For example, if E>N, the rate matching mode is determined to be repetition, that is, the sending device sends the mother code of length N, and then re-sends (E-N) bits. If E<N, the sending 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 mode, that is, (N-E) bits are punctured. Otherwise, (N-E) bits are shortened.

[0151] For example, taking the length N of the first sequence as 32, the first sequence can be sorted from low to high reliability as follows: {0 1 2 4 8 16 3 5 9 6 17 10 18 12 20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31}. Assuming the positions of the rate matching bit and the pre-freeze bit are {0 1}, the second sequence can be {2 4 8 16 3 5 9 6 17 10 18 12 20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31}.

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

[0153] The first set of positions includes the most reliable (K+n) positions in the second sequence. PC There are ) positions, where K is the length of the information bit sequence, and n PC This represents the number of check bits.

[0154] Where, n PC It can be determined based on one or more of the following: K, length after rate matching, E, rate matching method, or w min ; To check the row weight in the bit position set equal to w min And its reliability is lower than the number of check bits at all information bit positions; w min It represents the minimum row weight corresponding to the K most reliable positions in the first position set.

[0155] For example, n PC According to Determine; or, n PC It can be determined based on K and E; or, n PC It can be determined based on the bitrate; or, n PC It can be determined based on the rate matching method; or, n PC According to w min Confirmed. For details, please refer to the relevant descriptions of methods one through four below, which will not be repeated here.

[0156] in, It can be determined based on one or more of the following: K, E, rate matching method, or w min .

[0157] For example, It can be determined based on K; or, It can be determined based on K and E; or, It can be determined based on the bitrate; or, It can be determined based on the rate matching method; or, According to w min Confirmed. For details, please refer to the relevant descriptions of methods one through four below, which will not be repeated here.

[0158] Based on the above description, for example, taking the second sequence {2 4 8 16 3 5 9 6 17 10 18 12 20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31} as an example, assuming K equals 11, n PC If the value is 7, then the set of the first position can be {20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31}.

[0159] The set of check bit positions may include a first set of check bit positions and a second set of check bit positions.

[0160] In the first possible design, the first set of check bit positions may include the row weight equal to w in the first set of positions. min The most reliable The second set of check bit positions can include the least reliable position from the first set of positions. One position.

[0161] For example, with K equal to 11, n PC If the value equals 7, and the first position set is {20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31}, then in this first position set, the row weight of {31} is 32, the row weight of {15 23 27 29 30} is 16, the row weight of {7 11 19 13 14 21 26 25 22 28} is 8, and the row weight of {20 24} is 4. The most reliable K=11 positions in the first position set are {21 26 25 22 28 15 23 27 29 30 31}. Therefore, the minimum row weight w corresponding to these 11 positions is... min It is 8. Assume... If the value is 4, then the row weight in the first position set is equal to w. min =8 is the most reliable The positions are {26 25 22 28}, which is the set of positions for the first check bit. The least reliable position in the first set is... The positions are {20 24 7}, which is the set of positions for the second check bit.

[0162] It is understandable that the K most reliable positions in the first position set can be considered as the second position set. When The row weight in the set less than or equal to the second position is equal to w min When the number of positions is specified, the first set of check bits is included in the second set of positions. The row weight in the set greater than the second position is equal to w min When determining the number of positions, some positions in the first set of check bits are included in the second set of positions, while others are included in positions not in the second set of positions.

[0163] For example, with K equal to 11, n PC Taking the first set of positions {20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31} as an example, if the first set of positions is {20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31}, the second set of positions can be {21 26 25 22 28 15 23 27 29 30 31}. The minimum row weight w corresponding to these 11 positions is... min The value is 8, assuming If the value is 4, then the first set of check bit positions is {26 25 22 28}, and this first set of check bit positions is contained in the second set of positions.

[0164] In the second possible design, the first set of check bit positions includes the row weights equal to w in the second set of positions. min The most reliable The second set of check bit positions includes the least reliable position from the first set of positions. One position.

[0165] For example, with K equal to 11, n PC Taking the first set of positions {20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31} as an example, if the first set of positions is {20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31}, the second set of positions can be {21 26 25 22 28 15 23 27 29 30 31}. The minimum row weight w corresponding to these 11 positions is... min It is 8. Assume... If the value is 4, then the row weight in the second position set is equal to w. min =8 is the most reliable The positions are {26 25 22 28}, which is the set of positions for the first check bit. The least reliable position in the first set is... The positions are {20 24 7}, which is the set of positions for the second check bit.

[0166] Compared to the second possible design described above, in the first possible design, the first check bit position set... The positions are determined based on the first set of positions, which increases the selection range of the first set of check bit positions and ensures the minimum row overlap w among the most reliable K bit positions. min The number of corresponding bit positions can support In larger cases, improving code spectrum performance and decoding performance can better meet the error correction performance requirements of ultra-short code intervals, and can approach the ML decoding performance of LTE-RM codes under SCL8 decoding.

[0167] Step 603: The transmitting device performs polar coding on the information bit sequence according to the set of check bit positions to obtain the encoded bit sequence.

[0168] The transmitting device can determine the information bit position set based on the parity bit position set; and determine the parity bit corresponding to each parity bit position and the information bit corresponding to each information bit position based on the shift register, thus obtaining the encoded bit sequence.

[0169] The information bit location set may include K locations in the first location set other than the check bit location set.

[0170] For example, taking the first set of positions as {20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31}, the first set of check bits as {26 25 22 28}, and the second set of check bits as {20 24 7}, the set of information bits can be {11 19 13 14 21 15 23 27 29 30 31}.

[0171] The shift register can be a three-tap shift register represented in decimal as 26: g = D 4 +D 3 +D; or, the shift register can also be a single-tap shift register represented in decimal as 16: g = D 4 .

[0172] It is understandable that, since the value of the check bit can be determined based on the value of the information bit preceding it, the set of check bit positions can be simplified based on the set of information bit positions. That is, the check bit positions that are preceded by information bits are retained in the set of check bit positions as valid check bit positions.

[0173] For example, when the set of check bit positions is {20 24 7 26 25 22 28} and the set of information bit positions is {11 19 13 14 21 15 23 27 29 30 31}, the set of valid check bit positions can include the check bit positions {20 24 26 25 22 28} with the preceding information bits.

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

[0175] The information bit sequence corresponding to the to-be-decoded information has a length of K.

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

[0177] In step 605, the receiving device determines a second sequence with a length of M according to the reliability corresponding to the first sequence with a length of N.

[0178] In step 606, the receiving device determines a set of check bit positions according to a first set of positions in the second sequence.

[0179] The receiving device can determine the set of check bit positions based on steps 605 and 606 in the same manner as the sending device determines the set of check bit positions based on steps 601 and 602, which will not be described again.

[0180] In step 607, the receiving device decodes the to-be-decoded information according to the set of check bit positions.

[0181] The receiving device can determine a set of information bit positions according to the set of check bit positions, and decode the to-be-decoded information according to the set of check bit positions, the set of information bit positions, and the shift register to obtain a decoding result.

[0182] Based on the method shown in FIG. 6, the number of check bits can be determined according to one or more of the above-mentioned parameters, which increases the selection range of the number of check bits, makes the value of the number of check bits more flexible and diversified, improves the code spectrum and decoding performance, and can better meet the requirements of ultra-short code interval on error correction performance, and can approach the maximum likelihood (ML) decoding performance of long term evolution-reed-muller (LTE-RM) code under successive cancellation list 8 (SCL8) decoding.

[0183] Based on the method shown in FIG. 6, n PC may be determined according to one or more of the following: the length K of the information bit sequence, the length E after rate matching, the rate matching manner, or w min . may be determined according to one or more of the following: K, E, the rate matching manner, or w min For example, n PC may be determined based on the following five ways: For example:

[0184] Way one, n PC is determined according to , is determined according to one or more of the following: K, E, or code rate.

[0185] In the first example, when K is greater than or equal to 3 and less than or equal to a first threshold value, is 0.

[0186] wherein the first threshold value is an integer greater than 3 and less than 11.

[0187] For example, the first threshold value is 6, that is, when K is greater than or equal to 3 and less than or equal to 6, is 0.

[0188] In the second example, when a first difference value is less than or equal to 5, is 0.

[0189] wherein the first difference value is the difference between E and K, that is, the first difference value is E-K.

[0190] In the third example, when K is greater than the first threshold value and less than or equal to 11, is determined according to one or more of the following: code rate, or the first difference value.

[0191] Where K is greater than the first threshold and less than or equal to 11, and the bit rate R = K / E is less than or equal to 7 / 16, The value is 4.

[0192] Specifically, when K is greater than the first threshold and less than or equal to 11, and the bitrate R = K / E is greater than 7 / 16, if the first difference is less than or equal to 5, The maximum value is max(0, EK-3), or, if the first difference is greater than 5, The value is EK-6. max(·) is the maximum value of (·).

[0193] Based on the above The description, exemplarily, n PC for Where min(·) is the minimum value of (·).

[0194] In this method, n PC According to A unified configuration can simplify the description of the construction algorithm.

[0195] For example, based on the above method one, n can be obtained as shown in Table 4 below. PC The values ​​of K in Table 4 are as follows: K is greater than or equal to 3 and less than or equal to 11 (i.e., 3≤K≤11), and E is greater than or equal to K+1 and less than or equal to 32 (i.e., K+1≤E≤32).

[0196] Table 4

[0197] Based on the n shown in the above method one PC To illustrate the value of , this application provides performance comparison diagrams in Figures 7 and 8, showing the simulation effects of the LTE-RM code (curve 1) and the Polar code (curve 2) determined by the method shown in Figure 6, respectively, when the information bit sequence length K is 8 and different E values ​​are applied. The decoding method corresponding to the LTE-RM code can be FHT decoding, and the decoding method corresponding to the Polar code can be SCL8 decoding. The horizontal axis represents the length E after rate matching, and the vertical axis represents the signal-to-noise ratio (SNR) required to achieve a block error rate (BLER) of 0.01.

[0198] The Polar code in Figure 7 is determined based on a three-tap shift register, while the Polar code in Figure 8 is determined based on a single-tap shift register. From Figures 7 and 8, it can be seen that the n in Method 1 described above… PC The decoding performance curve of the Polar code corresponding to the value of is almost the same as that of n determined by traversal search based on the block error rate. PCThe decoding performance curve of the Polar code corresponding to the optimal value of n coincides with curve 2, and can approximate the ML decoding performance of the LTE-RM code under SCL8 decoding.

[0199] In the second example, when K is greater than the first threshold value and less than or equal to 11, n PC is determined according to one or more of the following: K, code rate, or the first difference value. is determined according to one or more of the following: K, code rate, or the first difference value.

[0200] In the first example, when K is greater than or equal to 3 and less than or equal to the first threshold value, n PC is min(3, E-K), and is 0.

[0201] In the first example, when K is greater than or equal to 3 and less than or equal to the first threshold value, n PC is min(3, E-K), and is 0.

[0202] In this example, when K is greater than or equal to 3 and less than or equal to the first threshold value, the number of check bits is not more than 3, achieving compatibility with the NR standard.

[0203] In the second example, when K is greater than the first threshold value and less than or equal to 11, n PC is determined according to one or more of the following: code rate, or the first difference value. is determined according to one or more of the following: code rate, or the first difference value.

[0204] In the second example, when K is greater than the first threshold value and less than or equal to 11, n PC is min(M-K, 9), and is 4. In this case, the number of check bits is not more than 9, the error correction performance is good, and the implementation complexity is low.

[0205] In the second example, when K is greater than the first threshold value and less than or equal to 11, n PC is min(E-K, 3), and is max(0, E-K-3), in which case the number of check bits is not more than 3, and compatibility with the NR standard can be achieved. Alternatively, if the first difference value E-K is greater than 5, n PC is E-K-3, and is E-K-6, in which case the number of check bits is set to E-K-3, the error correction performance is good, and the algorithm description is simple.

[0206] Optionally, taking the first threshold value of 6 as an example, n PC and The pseudo code of the method two can be shown as follows:

[0207] For example, based on the method two, the value of n PC can be obtained as shown in Table 5, where K is greater than or equal to 3 and less than or equal to 11 (i.e., 3≤K≤11), and E is greater than or equal to K+1 and less than or equal to 32 (i.e., K+1≤E≤32).

[0208] Table 5

[0209] Based on the value of n PC shown in the method two, the performance comparison between the simulation results of the Polar code based on the LTE-RM code (curve 1) and the Polar code based on the method shown in Figure 6 (curve 2) is shown in Figures 9 and 10, respectively, when the information bit sequence length K is 8 and E is different. The decoding method corresponding to the LTE-RM code can be FHT decoding, and the decoding method 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 noise ratio (SNR) required to achieve a block error rate (BLER) of 0.01.

[0210] The Polar code in Figure 9 is determined based on a three-tap shift register, and the Polar code in Figure 10 is determined based on a single-tap shift register. As can be seen from Figures 9 and 10, the decoding performance curve of the Polar code corresponding to the value of n PC shown in the method two is almost the same as the decoding performance curve of the Polar code corresponding to the optimal value of n PC determined by block error rate iteration search, both of which are curve 2, and can approximate the ML decoding performance of the LTE-RM code under SCL8 decoding.

[0211] Method three, n PC is determined according to one or more of the following: K, the rate matching method, or the first difference. is determined according to one or more of the following: K, the rate matching method, or the first difference.

[0212] In the first example, when K is greater than or equal to 3 and less than or equal to the first threshold value, n PC is min(3, E-K), and n

[0213] wherein the first threshold is an integer greater than 3 and less than 11. For example, the first threshold is 6, i.e., when K is greater than or equal to 3 and less than or equal to 6, n PC is min(3, E-K), is 0.

[0214] In this example, when K is greater than or equal to 3 and less than or equal to the first threshold, the number of check bits is no more than 3, which achieves compatibility with the NR standard.

[0215] In a second example, when K is greater than the first threshold and less than or equal to 11, n PC is determined according to one or more of the following: the rate matching manner, or the first difference; is determined according to one or more of the following: the rate matching manner, or the first difference.

[0216] wherein when K is greater than the first threshold and less than or equal to 11, and the rate matching manner is puncturing, n PC is min(M-K, 9), is 4. Alternatively, when K is greater than the first threshold and less than or equal to 11, and E is greater than or equal to N, n PC is min(M-K, 9), is 4. In both cases, the number of check bits is no more than 9, which achieves good error correction performance and low implementation complexity.

[0217] wherein when K is greater than the first threshold and less than or equal to 11, and the rate matching manner is shortening, if the first difference E-K is less than or equal to 5, n PC is min(E-K, 3), is max(0, E-K-3), in which case the number of check bits is no more than 3, which achieves compatibility with the NR standard. Alternatively, if the first difference E-K is greater than 5, n PC is E-K-3, is E-K-6, in which case the number of check bits is set to E-K-3, which achieves good error correction performance and simple algorithm description.

[0218] Optionally, taking the first threshold as 6 for example, the pseudo code for determining n PC and may be as follows:

[0219] Illustratively, based on the above-described manner three, the values of n PC may be obtained as shown in Table 6 below, in which K is greater than or equal to 3 and less than or equal to 11 (i.e., 3≤K≤11), and E is greater than or equal to K+1 and less than or equal to 32 (i.e., K+1≤E≤32).

[0220] Table 6

[0221] Based on the value of n PC shown in the third manner, the present application gives the performance comparison diagram of the simulation effect of the Polar code (curve 2) determined based on the method shown in FIG. 6 (curve 1) when the information bit sequence length K is 8 and E is different, respectively, through FIG. 11 and FIG. 12. The decoding manner corresponding to the LTE-RM code can be FHT decoding, and the decoding manner 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 noise ratio (SNR) required to reach the block error rate (BLER) = 0.01.

[0222] The Polar code in FIG. 11 is determined based on a three-tap shift register, and the Polar code in FIG. 12 is determined based on a single-tap shift register. It can be seen from FIG. 11 and FIG. 12 that the decoding performance curve of the Polar code corresponding to the value of n PC shown in the third manner is almost coincided with the decoding performance curve of the Polar code corresponding to the optimal value of n PC determined according to the block error rate iterative search, both of which are curve 2, and can approach the ML decoding performance of the LTE-RM code under SCL8 decoding.

[0223] The fourth manner, n PC is determined according to one or more of the following: K, or w min . is determined according to one or more of the following: K, or w min .

[0224] In the first example, when K is greater than or equal to 3 and less than or equal to a first threshold, n PC is min(3, E-K), and p is 0.

[0225] wherein the first threshold is an integer greater than 3 and less than 11. For example, the first threshold is 6, that is, when K is greater than or equal to 3 and less than or equal to 6, n PC is min(3, E-K), and p is 0.

[0226] In this example, when K is greater than or equal to 3 and less than or equal to the first threshold, the number of check bits is not more than 3, which realizes the compatibility with the NR standard.

[0227] In the second example, when K is greater than the first threshold and less than or equal to 11, n PC is determined according to wmin determining; According to w min determining.

[0228] wherein, when K is greater than the first threshold value and less than or equal to 11, and w min is 8, n PC is min(M-K, 9), and 4. In this case, the number of check bits does not exceed 9, the error correction performance is good and the implementation complexity is low

[0229] wherein, when K is greater than the first threshold value and less than or equal to 11, and w min is 2, n PC is min(E-K, 3), and max(0, E-K-3). In this case, the number of check bits does not exceed 3, and compatibility with the NR standard can be achieved.

[0230] wherein, when K is greater than the first threshold value and less than or equal to 11, and w min is 4, n PC is E-K-3, and E-K-6. In this case, by setting the number of check bits to E-K-3, the error correction performance is good and the algorithm description is simple.

[0231] Optionally, taking the first threshold value of 6 as an example, the pseudo code of determining n PC and may be as follows:

[0232] Exemplarily, based on the above-mentioned mode four, the values of n PC may be obtained as shown in Table 7 below, in which K is greater than or equal to 3 and less than or equal to 11 (i.e., 3≤K≤11), and E is greater than or equal to K+1 and less than or equal to 32 (i.e., K+1≤E≤32).

[0233] Table 7

[0234] Based on the n PCThe application gives performance comparison diagrams of simulation results of Polar codes based on the method shown in FIG. 13 and FIG. 14, respectively, when the information bit sequence length K is 8 and E is different. The Polar codes based on the method shown in FIG. 13 are curve 1, and the Polar codes based on the method shown in FIG. 14 are curve 2. The decoding method corresponding to the LTE-RM code can be FHT decoding, and the decoding method 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 noise ratio (SNR) required to achieve a block error rate (BLER) of 0.01.

[0235] The Polar code in FIG. 13 is determined based on a three-tap shift register, and the Polar code in FIG. 14 is determined based on a single-tap shift register. As can be seen from FIG. 13 and FIG. 14, the decoding performance curve of the n PC The decoding performance curve of the Polar code corresponding to the value of n PC The decoding performance curve of the Polar code corresponding to the optimal value of n

[0236] It should be noted that each embodiment of the 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 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.

[0237] It can be understood that in the embodiments of the application, the execution subject can execute part or all of the steps in the embodiments of the application. These steps or operations are only examples, and the embodiments of the 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 application, and it is possible that not all operations in the embodiments of the application are executed.

[0238] It should be understood that, in order to achieve the above functions, each device comprises a hardware structure and / or a software module corresponding to each function. Those skilled in the art should easily realize that, in combination with the algorithm steps of each example described in the embodiments disclosed in the present text, the present application can be realized in the form of hardware or a combination of hardware and computer software. Whether a certain function is executed in the form of hardware or computer software driven hardware depends on the specific application of the technical solution and the design constraint conditions. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of the present application.

[0239] 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. In actual implementation, there can be another division method.

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

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

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

[0243] FIG. 16 shows a receiving device 160, which can perform the actions performed by the receiving device in the methods shown in FIGS. 6 to 14. All related contents of the steps in the method embodiments described above can be referred to the function description of the corresponding functional modules, and the technical effects that can be obtained can be referred to the method embodiments described above, which will not be described here again.

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

[0245] For example, the transceiver module 1601 can be configured to perform all the transceiver operations performed by the receiving end device in the embodiments shown in FIGS. 6 to 14, and / or other processes for supporting the technologies described herein. The processing module 1602 can be configured to perform all the operations performed by the receiving end device in the embodiments shown in FIGS. 6 to 14, except for the transceiver operations, and / or other processes for supporting the technologies described herein.

[0246] As another implementation manner, the transceiver module 1501 in FIG. 15 can be replaced by a transceiver which can integrate the functions of the transceiver module 1501. The processing module 1502 can be replaced by a processor which can integrate the functions of the processing module 1502. Further, the sending end device 150 shown in FIG. 15 can further include a memory. Alternatively, the transceiver module 1601 in FIG. 16 can be replaced by a transceiver which can integrate the functions of the transceiver module 1601. The processing module 1602 can be replaced by a processor which can integrate the functions of the processing module 1602. Further, the receiving end device 160 shown in FIG. 16 can further include a memory.

[0247] Alternatively, when the processing module 1502 is replaced by a processor, and the transceiver module 1501 is replaced by a transceiver, the sending end device 150 related to the embodiments of the present application can also be the communication apparatus 170 shown in FIG. 17. Or, when the processing module 1602 is replaced by a processor, and the transceiver module 1601 is replaced by a transceiver, the receiving end device 160 related to the embodiments of the present application can also be the communication apparatus 170 shown in FIG. 17.

[0248] The processor can be a logic circuit 1701, and the transceiver can be an interface circuit 1702. Further, the communication apparatus 170 shown in FIG. 17 can further include a memory 1703.

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

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

[0251] The embodiments of the present application further provide a computer readable storage medium. All or part of the flow of the above method embodiments can be instructed by a computer program to relevant hardware to complete, and the program can be stored in the above computer readable storage medium. When the program is executed, the program can include the flow of each of the above method embodiments. The computer readable storage medium can be an internal storage unit of the terminal (including a data sending end and / or a data receiving end) of any of the preceding 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.

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

[0253] Furthermore, the terms "comprise", "comprising", "comprises", and the like, are used herein to mean including, but not limited to; 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.

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

[0255] In the present application, the word "exemplary" or "for example" is used to mean serving as an example, instance, or illustration. Any implementation described as "exemplary" or "for example" is not necessarily to be construed as preferred or advantageous over other implementations. The word "exemplary" or "for example" is used herein to mean serving as an example, instance, or illustration. Any implementation described as "exemplary" or "for example" is not necessarily to be construed as preferred or advantageous over other implementations. The word "exemplary" or "for example" is used herein to mean serving as an example, instance, or illustration. Any implementation described as "exemplary" or "for example" is not necessarily to be construed as preferred or advantageous over other implementations. The word "exemplary" or "for example" is used herein to mean serving as an example, instance, or illustration. Any implementation described as "exemplary" or "for example" is not necessarily to be construed as preferred or advantageous over other implementations.

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

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

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

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

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

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

Claims

1. A communication method characterized by comprising: The method comprises: determining a second sequence with a length of M according to reliabilities corresponding to a first sequence with a length of N; wherein the second sequence comprises positions in the first sequence except for positions of pre-frozen bits and positions of rate matching bits; According to a first position set in the second sequence, a check bit position set is determined; wherein the first position set includes (K+n PC ) most reliable positions in the second sequence, K is the length of the information bit sequence, n PC is the number of check bits, and n PC is determined according to one or more of the following: K, the length E after rate matching, the rate matching manner, or w min ; the w is the minimum row weight of the K most reliable positions in the first position set min and the number of check bits whose reliabilities are lower than all information bits is less than w min w is the minimum row weight of the K most reliable positions in the first position set performing polar encoding on the information bit sequence according to the set of check bit positions to obtain an encoded bit sequence; outputting one or more bits of the encoded bit sequence.

2. A communication method characterized by comprising: The method comprises: receiving to-be-decoded information from a sending end device; wherein a length of an information bit sequence corresponding to the to-be-decoded information is K; determining a second sequence with a length of M according to reliabilities corresponding to a first sequence with a length of N; wherein the second sequence comprises positions in the first sequence except for positions of pre-frozen bits and positions of rate matching bits; According to a first set of positions in the second sequence, determine a set of check bit positions; wherein the first set of positions comprises the most reliable (K+n PC ) positions in the second sequence, the n PC is the number of check bits, and the n PC is determined according to one or more of the following: K, the length E after rate matching, the rate matching manner, or w min ; the w is the minimum row weight of the K most reliable positions in the first position set min and the number of check bits whose reliabilities are lower than all information bits is less than w min w is the minimum row weight of the K most reliable positions in the first position set performing decoding on the to-be-decoded information according to the set of check bit positions.

3. The method according to claim 1 or 2, wherein the first threshold is 6. The set of check bit positions includes a first set of check bit positions and a second set of check bit positions, the first set of check bit positions including the most reliable min ​ a second set of check bit positions, the second set of check bit positions including the most unreliable of the first set of positions 4. The method according to any one of claims 1-3, wherein the second threshold is 11.

4. The method according to any one of claims 1 to 3, characterized in that, the n PC According to the determining, comprising: The n PC To 5. The method according to any one of claims 1-3, wherein the first threshold is 6 and the second threshold is 11.

6. The method according to claim 5, wherein the first threshold is 6. when the K is greater than or equal to 3 and less than or equal to a first threshold, the n PC is min(3, E-K); where min(·) is a minimum of (·).

7. The method according to claim 6, wherein when the K is greater than the first threshold and less than or equal to 11, 9. The method according to claim 8, wherein the first threshold is 6 and the second threshold is 11.

7. The method according to any one of claims 1 to 3, characterized in that, 11. The method according to claim 10, wherein the first threshold is 6 and the second threshold is 11. The n PC According to the code rate determination; wherein the code rate is the ratio of the K to the E; or The n PC According to the rate matching manner determination; or The n PC According to the w min Determination.

8. The method of claim 7, wherein, The n PC According to the code rate determination, comprising: when the code rate is less than or equal to 7 / 16, the n PC is min(M-K, 9); where min( ) is a minimum value of ( ); or when the code rate is greater than 7 / 16, the n PC determined according to a first difference value; wherein the first difference value is a difference between the E and the K.

12. The method according to any one of claims 1-10, wherein the communication device comprises a processor; and the processor is configured to run a computer program or instructions so that the communication method according to any one of claims 1, 3-12 is executed, or so that the communication method according to any one of claims 2-12 is executed. when the first difference is less than or equal to 5, the n PC is min(E-K,3); where min( ) is the minimum value of ( ) or when the first difference is greater than 5, the n PC is E-K-3.

10. The method of claim 7, wherein, The n PC According to the rate matching manner determination, comprising: When the rate matching manner is puncturing, the n PC is min(M-K, 9); wherein min( ) is a minimum value of ( ); or when the E is greater than or equal to the N, the n PC is min(M-K, 9); or when the rate matching manner is shortening, the n PC determined according to a first difference value; wherein the first difference value is a difference value between the E and the K.

13. The method according to any one of claims 1-12, wherein the communication device comprises an interface circuit and a logic circuit; the interface circuit is configured to input and / or output information; and the logic circuit is configured to execute the communication method according to any one of claims 1, 3-12, or execute the communication method according to any one of claims 2-12, process and / or generate the information according to the information. when the first difference is less than or equal to 5, the n PC is min(E-K,3); or when the first difference is greater than 5, the n PC is E-K-3.

12. The method of claim 7, wherein, The n PC According to the w min Determination, comprising: when the w min is 8, the n PC is min(M-K, 9); wherein min( ) is the minimum value of ( ). when the w min n is min(E-K,3); or PC n is min(E-K,3); or when said w min is 4, said n PC is E-K-3.

13. A communications device, characterized by 14. The method according to any one of claims 1-12, wherein the computer readable storage medium stores computer instructions or programs; and when the computer instructions or programs are run on a computer, the communication method according to any one of claims 1, 3-12 is executed, or the communication method according to any one of claims 2-12 is executed.

14. A communications device, characterized by 15. The method according to any one of claims 1-12, wherein the computer program product comprises computer instructions; and when part or all of the computer instructions are run on a computer, the communication method according to any one of claims 1, 3-12 is executed, or the communication method according to any one of claims 2-12 is executed.

15. A computer-readable storage medium, characterized in that, ​ 16. A computer program product, characterised in that, ​

Images