Communication method and device

Abstract

The invention discloses a communication method and device, relates to the technical field of communication, and can flexibly determine the number of PC bits and improve code spectrum and decoding performance. The method comprises the following steps: determining a second sequence comprising M positions except the position of a pre-freezing bit and the position of a rate matching bit in a first sequence according to the reliability corresponding to the first sequence with the length of N; determining a check bit position set according to a first position set comprising the most reliable (K + nPC) positions in the second sequence, and performing polarization coding on the information bit sequence 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 according to one or more of K, E, a rate matching mode or wmin; the row weight of the check bits is equal to wmin, and the reliability of the check bits is lower than that of all information bit positions in the check bit position set; wmin is the minimum row weight corresponding to the most reliable K positions in the first position set.

Description

TECHNICAL FIELD

[0001] The present application relates to the technical field of communication, in particular to a communication method and device. BACKGROUND

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

[0003] At present, 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

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

[0005] 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, or 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 check bit position set according to a first position set in the second sequence; polar encoding an information bit sequence according to the check bit position set to obtain an encoded bit sequence; and outputting one or more bits of the encoded bit sequence. The first position set 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 mode, 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 minIt represents the minimum row weight corresponding to the K most reliable positions in the first position set.

[0006] Based on the first 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.

[0007] Secondly, this application provides a communication method that can be executed by a receiving device. Unless otherwise specified, "receiving device" in this application can refer to the receiving device itself, a component within the receiving device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the receiving device. The method includes: receiving information to be decoded from a transmitting device; the length of the information bit sequence corresponding to the information to be decoded is K; determining a second sequence of length M based on the reliability corresponding to a first sequence of length N; the second sequence including positions in the first sequence excluding the positions of pre-frozen bits and rate-matching bits; determining a set of check bit positions based on a first set of positions in the second sequence; and decoding the information to be decoded based on the set of check bit positions. The first set of positions includes the most reliable (K+n) bits in the second sequence. PC ) positions, 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.

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

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

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

[0011] 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 (·).

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

[0013] 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 PC Let min(3,EK); where min(·) is the minimum value of (·).

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

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

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

[0017] Based on the possible implementation, multiple feasibility schemes are provided for determination of n PC , the flexibility of the value of n PC is improved, and code spectrum and decoding performance are improved.

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

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

[0020] Based on the above two possible implementations, when n PC is min(M-K, 9), the number of check bits is no 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 no 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.

[0021] 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, n PCmin (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.

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

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

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

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

[0026] In a third aspect, an embodiment of the present application provides a communication apparatus, which can be applied to the sending device in the first aspect to implement the functions of the sending device. The communication apparatus can be the sending device, a chip or a chip system or a system on chip, etc. The communication apparatus can implement the functions of the sending device through hardware or corresponding software. The hardware or software includes one or more modules corresponding to the functions. For example, a transceiver module and a processing module. The transceiver module can complete the transceiving operations independently or in cooperation with the processing module. Similarly, the processing module can complete the processing operations independently or in cooperation with the transceiver module.

[0027] For example, the processing module is configured to determine a second sequence with a length of M according to a reliability corresponding to a first sequence with a length of N. The second sequence includes positions in the first sequence except for positions of pre-frozen bits and positions of 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 perform polar encoding on an information bit sequence according to the set of check bit positions to obtain an encoded bit sequence. The transceiver module is configured to output one or more bits of the encoded bit sequence. The first set of positions includes K+n PC ) most reliable positions in the second sequence, K is a length of the information bit sequence, n PC is a number of check bits, and n PC is determined according to one or more of the following: K, a length E after rate matching, a rate matching manner, or w min ; is a 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 information bit positions, and w min is a minimum row weight corresponding to K most reliable positions in the first set of positions.

[0028] Optionally, the transceiver module and the processing module of the communication apparatus in the third aspect can also perform corresponding functions in the first aspect or any possible design of the first aspect. For details, refer to the detailed description in the method embodiment. The communication apparatus can achieve the beneficial effects as described above.

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

[0030] 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 (K+n PC ) most reliable 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. w min is the minimum row weight corresponding to the K most reliable positions in the first set of positions.

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

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

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

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

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

[0036] In a seventh aspect, this application provides a computer readable storage medium, which stores computer instructions or programs, and 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.

[0037] In an eighth aspect, this application provides a computer program product containing computer instructions, and 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.

[0038] In a ninth aspect, this application provides a computer program, and 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.

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

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

[0041] 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

[0042] Figure 1 A decoding flowchart of an LTE-RM code provided by an embodiment of the present application;

[0043] Figure 2 A schematic diagram of an upper triangular matrix provided by an embodiment of the present application;

[0044] Figure 3 A schematic diagram of a communication system provided by an embodiment of the present application;

[0045] Figure 4 A schematic diagram of encoding and decoding by a sending end device and a receiving end device provided by an embodiment of the present application;

[0046] Figure 5 A structural schematic diagram of a communication device provided by an embodiment of the present application;

[0047] Figure 6 A flowchart of a communication method provided by an embodiment of the present application;

[0048] Figure 7 A simulation schematic diagram of performances corresponding to different encoding methods provided by an embodiment of the present application;

[0049] Figure 8 A simulation schematic diagram of performances corresponding to different encoding methods provided by an embodiment of the present application;

[0050] Figure 9 A simulation schematic diagram of performances corresponding to different encoding methods provided by an embodiment of the present application;

[0051] Figure 10 A simulation schematic diagram of performances corresponding to different encoding methods provided by an embodiment of the present application;

[0052] Figure 11 A simulation schematic diagram of performances corresponding to different encoding methods provided by an embodiment of the present application;

[0053] Figure 12 A simulation schematic diagram of performances corresponding to different encoding methods provided by an embodiment of the present application;

[0054] Figure 13 A simulation schematic diagram of performances corresponding to different encoding methods provided by an embodiment of the present application;

[0055] Figure 14 A simulation diagram of performance corresponding to a different encoding method provided by an embodiment of the present application is shown in FIG. 2.

[0056] Figure 15 A structure diagram of a sending end device provided by an embodiment of the present application is shown in FIG. 3.

[0057] Figure 16 A structure diagram of a receiving end device provided by an embodiment of the present application is shown in FIG. 4.

[0058] Figure 17 A structure diagram of another communication device provided by an embodiment of the present application is shown in FIG. 5. DETAILED DESCRIPTION

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

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

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

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

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

[0064] Table 1

[0065]

[0066]

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

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

[0069] ​​When it is determined that E is not equal to the encoding length N (e.g., E is not equal to 32), the following rate matching manner can be adopted: when E is less than N (e.g., E is less than 32), puncturing from back to front; and when E is greater than N (e.g., E is greater than 32), repeating from front to back.

[0070] For example, the rate matching sequence f0, f1, …, f E-1 The following manner can be referred to for obtaining:

[0071] for k = 0 to E-1

[0072] f k = d k mod N ;

[0073] end for

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

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

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

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

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

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

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

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

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

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

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

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

[0086] In the above steps 4 and 5, the 1st-13th bits are defined from the 1st bit of the information bit sequence. It can be understood that the information bit sequence can also be defined from the 0th bit, i.e., the 1st-13th bits are replaced by the 0th-12th bits, respectively, without limitation.

[0087] 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 a performance bad point appears, affecting the decoding performance.

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

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

[0090] Among them, the reliability of each bit can be determined by a 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.

[0091] For example, taking a reliability sequence with a length N of 32 as an example, the reliability sequence can be the reliability sequence shown in Table 2 below, where, Indicates reliability. Bits representing reliability:

[0092] Table 2

[0093]

[0094] For example, when the length of the information bit sequence is 3, the three positions with the highest reliability in Table 2 can be selected as the positions of the information bits, that is, the 31st, 30th, and 29th bits of the PC-Polar code (at this time, the starting position of the PC-Polar code is the 0th bit). Alternatively, when the length of the information bit sequence is 11, the eleven positions with the highest reliability in Table 2 can be selected as the positions of the information bits, that is, the 31st, 30th, 29th, 27th, 23rd, 15th, 22nd, 13th, 14th, 11th, and 28th bits of the PC-Polar code (at this time, the starting position of the PC-Polar code is the 0th bit).

[0095] The transmitting device can encode ultra-short information bit sequences of 3 to 11 bits based on PC-Polar codes with nested PC equations (pre-transformation) and reliability sequences in the following manner (with N = 32 and the information bit sequence being...). The encoded codeword sequence is For example, where 0 ≤ k ≤ K, and K is the maximum length of the information bit sequence:

[0096] Step 1: The transmitting device selects the K positions with the highest reliability from Table 2 as the information bit positions from positions 0 to 31, and the remaining positions are designated as frozen bit positions. Mapping these bits to information bit positions, and setting the remaining 32-K positions to 0, yields the sequence.

[0097] Step 2: The sending device will send the sequence With the upper triangular matrix T pre Multiplying them together yields the sequence after the upper triangular pre-transformation.

[0098] Among them, the upper triangular matrix T pre It can be a 32×32 matrix, with the following specific form: Figure 2 As shown. The horizontal axis represents the upper triangular matrix T. pre The rows, with the vertical axis representing the upper triangular matrix T preThe black dots represent the values of the elements at the positions, and the values of the elements at other positions except the black dots are 0.

[0099] Step 3, performing Polar encoding on the upper triangular pre-transformed sequence to obtain a final codeword sequence

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

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

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

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

[0104] 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 positions of pre-frozen bits and positions of rate matching bits; determines a check bit position set according to a first position set in the second sequence; polar encodes an information bit sequence according to the check bit position set to obtain a coded bit sequence; and outputs one or more bits of the coded bit sequence. 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 method, or w min ; is the number of check bits in the check bit position set whose row weight is equal to w min and whose reliability is lower than all information bit positions; w min is the minimum row weight corresponding to the K most reliable positions in the first position set.

[0105] 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 the ultra-short code interval on the 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.

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

[0107] The communication method provided by the embodiments of the present application can be used in any communication system, which can be a third generation partnership project (3GPP) communication system, for example, a long term evolution (LTE) system, and can also be a fifth generation (5G) mobile communication system, a system of mixed networking of LTE and 5G, 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, and can also be a non-terrestrial network (NTN) system (such as a satellite communication system), a non-3GPP communication system, and the like, without limitation.

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

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

[0110] Figure 3 A schematic diagram of the communication system provided by the embodiments of the present application is shown in Figure 3 , which can include at least one terminal device and at least one network device.

[0111] Among them, Figure 3 The terminal device can be located within 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 using channel coding, and after constellation modulation, transmit the data to the terminal device through the air interface (i.e., the network device is the transmitting terminal device, and the terminal device is the receiving terminal device); the terminal device can also encode uplink data using channel coding, and after constellation modulation, send the data to the network device through the air interface (i.e., the terminal device is the transmitting 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 transmitting terminal device and the receiving terminal device can both be network devices, or both be terminal devices, without limitation.

[0112] Figure 3 The terminal device in the above can be a device with wireless transceiver function or a chip or chip system that can be provided in the device, which can allow a user to access a network and is a device for providing voice and / or data connectivity to a user. The terminal device can also be referred to as user equipment (UE), subscriber unit, terminal, or mobile station (MS) or mobile terminal (MT), etc.

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

[0114] wherein, Figure 3 The network device in the foregoing embodiments 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 foregoing device, can also be a logic node or logic module or a function implemented in software, and is mainly responsible for functions such as wireless physical control function, resource scheduling, wireless resource management, quality of service management, data compression and encryption, wireless access control, and mobility management. Specifically, the network device can be a device supporting wired access or a device supporting wireless access.

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

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

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

[0118] In another example, the network device can also be a device including a radio unit (RU), or a device including a CU, a DU and a RU. The RU can be included in a radio frequency device or a radio frequency unit, for example, included in a RRU, an active antenna unit (AAU) or a remote radio head (RRH).

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

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

[0121] 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 following Figure 4 flow to encode and decode. The sending end device can be any terminal device or network device in the Figure 3 communication system shown in FIG. 1, and the receiving end device can also be any terminal device or network device in the Figure 3 communication system shown in FIG. 1.

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

[0123] In specific implementation, Figure 3 As shown in the embodiments, each terminal device and network device can have the component structure shown in the embodiments, or include the components shown in the embodiments. Figure 5 As shown in the embodiments, each terminal device and network device can have the component structure shown in the embodiments, or include the components shown in the embodiments. Figure 5 As shown in the embodiments, each terminal device and network device can have the component structure shown in the embodiments, or include the components shown in the embodiments. Figure 5 A component structure of a communication apparatus 500 is shown in the embodiments. 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 the embodiments, the communication apparatus 500 includes a processor 501, a transceiver 502, and a communication line 503. Figure 5

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

[0125] 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 other devices with processing functions, such as a circuit, a device, or a software module, without limitation.

[0126] The transceiver 502 is configured to communicate with other devices or other communication networks. The other communication networks can be an Ethernet network, 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 communication.

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

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

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

[0130] It should be noted that the memory 504 can be independent of the processor 501, or can be integrated with the processor 501. The memory 504 can be configured to store instructions or program codes or some data, etc. The memory 504 can be located in 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.

[0131] In an example, the processor 501 can include one or more CPUs, for example, the CPU0 and the CPU1 in the Figure 5

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

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

[0134] 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 in the Figure 5 . In addition, the constituent structures shown in the Figure 5 do not constitute limitation on the communication apparatus, except that Figure 5 ​In addition to the components shown, the communication device can include other components or fewer components, or different arrangements of the components shown. While various aspects and embodiments of the communication device have been disclosed, other aspects and embodiments will be apparent to those of ordinary skill in the art from the disclosure herein. The various aspects and embodiments disclosed herein can be combined in different combinations, or eliminated from the embodiments.

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

[0136] In addition, the actions, terms and the like involved between the embodiments of the present application can be mutually referred to 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, which is not limited.

[0137] The following describes the communication system shown in Figure 3 The following describes the communication system shown in Figure 6 The communication method provided by the embodiments of the present application is described, wherein the sending end device can be any terminal device or network device in the communication system shown in Figure 3 The receiving end device can also be any terminal device or network device in the communication system shown in Figure 3 The receiving end device can also be any terminal device or network device in the communication system shown in Figure 6 The sending end device or the receiving end device described in the following embodiments can have the components shown in

[0138] Figure 6 The flowchart of the communication method provided by the embodiments of the present application is shown in Figure 6 The method can include the following steps.

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

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

[0141] 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 to K and the minimum code rate R If E ≤ 9 / 8 × N DM / 2 and R < 9 / 16, then 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.

[0142] wherein, is rounded up.

[0143] wherein, 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, the number of CRC bits included in the information bit sequence. Or K can be the number of information bits included in the information bit sequence.

[0144] wherein, the sending end device can determine the reliability corresponding to the first sequence according to the reliability sequence with a length of N, and further determine the second sequence with a length of M.

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

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

[0147] Exemplarily, taking the sending end device determining N as 32 as an example, the reliability sequence with a length of 32 can be the reliability sequence shown in Table 3 below, wherein, represents the reliability, represents the bit position corresponding to the reliability:

[0148] Table 3

[0149]

[0150] It can be understood that the above Table 3 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.

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

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

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

[0154] Exemplarily, taking the length N of the first sequence as 32, the first sequence sorted from the lowest to the highest reliability can be: {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 that the positions of the rate matching bits and the pre-frozen bits 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}.

[0155] Step 602: The transmitting device determines the check bit position set according to the first position set in the second sequence.

[0156] Among them, the first position set includes the (K + n PC ) most reliable positions in the second sequence, K is the length of the information bit sequence, and n PC is the number of check bits.

[0157] Among them, n PC can be 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 whose row weight in the check bit position set is equal to w min and whose reliability is lower than all information bit positions; w min is the minimum row weight corresponding to the K most reliable positions in the first position set.

[0158] Exemplarily, n PC can be determined according to ; or, n PC can be determined according to K and E; or, n PC can be determined according to the code rate; or, n PC can be determined according to the rate matching method; or, nPC may be determined according to w min . Details can be found in the following description of Mode 1 to Mode 4, which will not be repeated here.

[0159] wherein, may be determined according to one or more of the following: K, E, rate matching mode, or w min .

[0160] Exemplarily, may be determined according to K; or, may be determined according to K and E; or, may be determined according to code rate; or, may be determined according to rate matching mode; or, may be determined according to w min . Details can be found in the following description of Mode 1 to Mode 4, which will not be repeated here.

[0161] Based on the above description, exemplarily, taking the second sequence as {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} for example, assuming that K is equal to 11, n PC is equal to 7, the first position set can be {20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31}.

[0162] wherein, the check bit position set can include a first check bit position set and a second check bit position set.

[0163] In the first possible design, the first check bit position set can include the most reliable min positions in the first position set with row weight equal to w , and the second check bit position set can include the least reliable positions in the first position set.

[0164] Exemplarily, taking K equal to 11, n PCIf 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.

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

[0166] For example, with K equal to 11, n PC Taking the first position set as {20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31}, which equals 7, the second position set 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 2522 28}, and this first set of check bit positions is contained in the second set of positions.

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

[0168] For example, with K equal to 11, n PC Taking the first position set as {20 24 7 11 19 13 14 21 26 25 22 28 15 23 27 29 30 31}, which equals 7, the second position set 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.

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

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

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

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

[0173] For example, when 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 first set of check bit positions is {26 25 22 28}, and the second set of check bit positions is {20 24 7}, the set of information bit positions can be {11 19 13 14 21 15 23 27 29 30 31}.

[0174] wherein 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 .

[0175] It can be understood that, since the value of a check bit can be determined based on the values of information bits located before the check bit, the set of check bit positions can be refined based on the set of information bit positions, i.e., the check bit positions with information bits before them are kept in the set of check bit positions as valid check bit positions.

[0176] 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 information bits before them.

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

[0178] wherein the to-be-decoded information corresponds to an information bit sequence with a length of K.

[0179] wherein 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 the one or more bits of the encoded bit sequence affected by noise and other interference.

[0180] Step 605: the receiving device determines a second sequence with a length of M based on the reliability corresponding to the first sequence with a length of N.

[0181] Step 606: the receiving device determines a set of check bit positions based on a first set of positions in the second sequence.

[0182] The receiving end device determines the set of check bit positions based on steps 605 and 606. For details, refer to the method of determining the set of check bit positions by the sending end device based on steps 601 and 602, which will not be described herein.

[0183] At step 607, the receiving end device decodes the information to be decoded according to the set of check bit positions.

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

[0185] Based on the method shown in Figure 6 , 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 be compatible with the NR standard, better meets 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.

[0186] Based on the method shown in Figure 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:

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

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

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

[0190] For example, the first threshold is 6, meaning when K is greater than or equal to 3 and less than or equal to 6. It is 0.

[0191] In the second example, when the first difference is less than or equal to 5... It is 0.

[0192] The first difference is the difference between E and K, i.e., the first difference is EK.

[0193] In the third example, when K is greater than the first threshold and less than or equal to 11, Determined based on one or more of the following: bit rate, or first difference.

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

[0195] 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 (·).

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

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

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

[0199] Table 4

[0200]

[0201]

[0202] Based on the n shown in the above method one PC The value of is determined by this application. Figure 7 and Figure 8The information bit sequence length K is given for different E values ​​based on LTE-RM code (curve 1) and based on... Figure 6 The diagram illustrates the performance comparison of the simulation results of the Polar code (curve 2) determined by the method shown. The decoding method for the LTE-RM code can be FHT decoding, and the decoding method for 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.

[0203] Figure 7 The Polar code in the code is determined based on a three-tap shift register. Figure 8 The polar code in the code is determined based on a single-tap shift register. From Figure 7 and Figure 8 As can be seen from the above method one, n 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. PC The decoding performance curves of the Polar codes corresponding to the optimal values ​​coincide, both being curve 2. Under SCL8 decoding, it can approximate the ML decoding performance of LTE-RM codes.

[0204] Method 2, n PC Determined by one or more of the following: K, bit rate, or first difference. Determined by one or more of the following: K, bit rate, or first difference.

[0205] In the first example, when K is greater than or equal to 3 and less than or equal to the first threshold, n PC For min(3,EK), It is 0.

[0206] The first threshold is an integer greater than 3 and less than 11. For example, if the first threshold is 6, then when K is greater than or equal to 3 and less than or equal to 6, n PC For min(3,EK), It is 0.

[0207] 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 does not exceed 3, thus achieving compatibility with the NR standard.

[0208] In the second example, when K is greater than the first threshold and less than or equal to 11, n PC Determined based on one or more of the following: bitrate, or first difference; Determined based on one or more of the following: bit rate, or first difference.

[0209] wherein, when K is greater than the first threshold value and less than or equal to 11, and the code rate R = K / E is less than or equal to 7 / 16, n PC is min(M-K, 9), 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.

[0210] wherein, when K is greater than the first threshold value and less than or equal to 11, and the code rate R = K / E is greater than 7 / 16, 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 not more than 3, and compatibility with the NR standard can be achieved. 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, the error correction performance is good, and the algorithm description is simple.

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

[0212]

[0213]

[0214] Exemplarily, based on the above-described mode two, the values of n PC can be obtained as shown in Table 5 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).

[0215] Table 5

[0216] K＝3 K＝4 K＝5 K＝6 K＝7 K＝8 K＝9 K＝10 K＝11 E＝4 1 -1 -1 -1 -1 -1 -1 -1 -1 E＝5 2 1 -1 -1 -1 -1 -1 -1 -1 E＝6 3 2 1 -1 -1 -1 -1 -1 -1 E＝7 3 3 2 1 -1 -1 -1 -1 -1 E＝8 3 3 3 2 1 -1 -1 -1 -1 E＝9 3 3 3 3 2 1 -1 -1 -1 E＝10 3 3 3 3 3 2 1 -1 -1 E＝11 3 3 3 3 3 3 2 1 -1 E＝12 3 3 3 3 3 3 3 2 1 E＝13 3 3 3 3 3 3 3 3 2 E＝14 3 3 3 3 4 3 3 3 3 E＝15 3 3 3 3 5 4 3 3 3 E＝16 3 3 3 3 7 5 4 3 3 E＝17 3 3 3 3 8 6 5 4 3 E＝18 3 3 3 3 8 7 6 5 4 E＝19 3 3 3 3 9 8 7 6 5 E＝20 3 3 3 3 9 9 8 7 6 E＝21 3 3 3 3 9 9 9 8 7 E＝22 3 3 3 3 9 9 9 9 8 E＝23 3 3 3 3 9 9 9 9 9 E＝24 3 3 3 3 9 9 9 9 10 E＝25 3 3 3 3 9 9 9 9 11 E＝26 3 3 3 3 9 9 9 9 9 E＝27 3 3 3 3 9 9 9 9 9 E＝28 3 3 3 3 9 9 9 9 9 E＝29 3 3 3 3 9 9 9 9 9 E＝30 3 3 3 3 9 9 9 9 9 E＝31 3 3 3 3 9 9 9 9 9 E＝32 3 3 3 3 9 9 9 9 9

[0217] Based on the values of n PC shown in the above-described mode two, the present application gives the values of n Figure 9 and Figure 10 based on the LTE-RM code (curve 1) and based on the Figure 6Performance comparison diagram of simulation results of Polar codes (curve 2) determined by the method shown. The decoding mode corresponding to the LTE-RM code can be FHT decoding, and the decoding mode corresponding to the Polar code can be SCL8 decoding. The horizontal axis is the length E after rate matching, and the vertical axis is the signal noise ratio (SNR) required to reach a block error rate (BLER) of 0.01.

[0218] Figure 9 The Polar code in the formula is determined based on a three-tap shift register, Figure 10 The polar code in the formula is determined based on a single-tap shift register. From Figure 9 and Figure 10 It can be seen that the n PC The decoding performance curve of the Polar code corresponding to the value of corresponds to the decoding performance curve of the Polar code corresponding to the optimal value of n PC determined by block error rate exhaustive search, both are curve 2, and can approximate the ML decoding performance of the LTE-RM code under SCL8 decoding.

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

[0220] 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 is 0.

[0221] 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 is 0.

[0222] 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, achieving compatibility with the NR standard.

[0223] 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 one or more of the following: the rate matching method, or the first difference; is determined according to one or more of the following: the rate matching method, or the first difference.

[0224] When K is greater than the first threshold value 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 value 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 does not exceed 9, the error correction performance is good, and the implementation complexity is low.

[0225] When K is greater than the first threshold value and less than or equal to 11, and the rate matching manner is puncturing, n PC is min(M-K, 9), is max(0, E-K-3), in which case the number of check bits does not exceed 3, and compatibility with the NR standard can be achieved. 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, the error correction performance is good, and the algorithm description is simple.

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

[0227]

[0228] Exemplarily, based on the above-mentioned manner three, the values of n PC can 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).

[0229] Table 6

[0230]

[0231]

[0232] Based on the values of n PC shown in the above-mentioned manner three, the present application gives the information bit sequence length K as 8, different E, based on the LTE-RM code (curve 1) and based on the Figure 11 and Figure 12 respectively. Figure 6Performance comparison diagram of simulation results of Polar codes (curve 2) determined by the method shown. The decoding mode corresponding to the LTE-RM code can be FHT decoding, and the decoding mode corresponding to the Polar code can be SCL8 decoding. The horizontal axis is the length E after rate matching, and the vertical axis is the signal noise ratio (SNR) required to achieve a block error rate (BLER) of 0.01.

[0233] Figure 11 The Polar code in the formula is determined based on a three-tap shift register, Figure 12 The polar code in the formula is determined based on a single-tap shift register. From Figure 11 and Figure 12 It can be seen that the n PC The decoding performance curve of the Polar code corresponding to the value of corresponds to the decoding performance curve of the Polar code corresponding to the optimal value of n PC determined by block error rate exhaustive search, both are curve 2, and can approximate the ML decoding performance of the LTE-RM code under SCL8 decoding.

[0234] Method four, 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 .

[0235] 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 is 0.

[0236] 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 is 0.

[0237] 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 compatibility with the NR standard.

[0238] 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 w min ; is determined according to w min .

[0239] wherein when K is greater than the first threshold and less than or equal to 11, and w minn = 8 when n PC n = min(M-K, 9), = 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

[0240] wherein, when K is greater than the first threshold value and less than or equal to 11, and w min n = 8 when n PC n = min(E-K, 3), = 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.

[0241] wherein, when K is greater than the first threshold value and less than or equal to 11, and w min n = 8 when n PC n = E-K-3, = 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.

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

[0243]

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

[0245] Table 7

[0246]

[0247]

[0248] Based on the values of n PC shown in the above-mentioned mode four, the present application gives the values of n Figure 13 and Figure 14 based on the LTE-RM code (curve 1) and the Figure 6The performance comparison diagram of the simulation results of the Polar code (curve 2) determined by the method shown. The decoding mode corresponding to the LTE-RM code can be FHT decoding, and the decoding mode corresponding to the Polar code can be SCL8 decoding. The horizontal axis is the length E after rate matching, and the vertical axis is the signal noise ratio (SNR) required to reach a block error rate (BLER) of 0.01.

[0249] Figure 13 The Polar code in the method is determined based on a three-tap shift register, Figure 14 The polar code in the method is determined based on a single-tap shift register. From Figure 13 and Figure 14 It can be seen that 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

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

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

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

[0253] This application embodiment can divide each device into functional modules according to the above method example. For example, each function can be divided into a separate functional module, or two or more functions can be integrated into one processing module. The integrated module can be implemented in hardware or as a software functional module. It should be noted that the module division in this application embodiment is illustrative and only represents one logical functional division. In actual implementation, there may be other division methods.

[0254] When dividing each function into modules according to its corresponding function. Figure 15 A transmitting device 150 is shown, which can perform the above-described... Figures 6 to 14 The actions performed by the sending device in the method shown, and all related content of each step involved in the above method embodiments, can be referenced from the functional description of the corresponding functional module. The technical effects that can be obtained can be referred to the above method embodiments, and will not be repeated here.

[0255] The transmitting device 150 may include a transceiver module 1501 and a processing module 1502. Exemplarily, the transmitting device 150 may be a communication device, or a chip or other combination device or component having the aforementioned transmitting device functions applied in a communication device. When the transmitting device 150 is a communication device, the transceiver module 1501 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 1502 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the transmitting device 150 is a component having the aforementioned transmitting device functions, the transceiver module 1501 may be a radio frequency unit; the processing module 1502 may be a processor (or processing circuit), such as a baseband processor. When the transmitting device 150 is a chip system, the transceiver module 1501 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1502 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. It should be understood that the transceiver module 1501 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 1502 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0256] For example, the transceiver module 1501 can be used to perform... Figures 6 to 14 In the illustrated embodiment, all transmit and receive operations performed by the transmitting device, and / or other processes used to support the techniques described herein; the processing module 1502 can be used to perform Figures 6 to 14All operations performed by the sending-end device in the embodiments shown, other than the transceiving operations, and / or other processes used to support the techniques described herein.

[0257] Figure 16 A receiving-end device 160 is shown, which can perform the above-described Figures 6 to 14 The actions performed by the receiving-end device in the methods shown, all related content of the steps involved in the method embodiments described above can be referred to the function description of the corresponding functional modules, and the technical effects they can obtain can be referred to the above method embodiments, which will not be described here.

[0258] The receiving-end device 160 can include a transceiver module 1601 and a processing module 1602. Exemplarily, the receiving-end device 160 can be a communication device, or a chip applied in a communication device, or other combination devices, components, etc. having the functions of the receiving-end device described above. 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 described above, 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 realized by a transceiver or a transceiver-related circuit component; the processing module 1602 can be realized by a processor or a processor-related circuit component (or processing circuit).

[0259] For example, the transceiver module 1601 can be configured to perform Figures 6 to 14 All transceiving operations performed by the receiving-end device in the embodiments shown, and / or other processes used to support the techniques described herein; the processing module 1602 can be configured to perform Figures 6 to 14 All operations performed by the receiving-end device in the embodiments shown, other than the transceiving operations, and / or other processes used to support the techniques described herein.

[0260] As another implementation manner, Figure 15 The transceiver module 1501 in the sending-end device 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, Figure 15The sending end device 150 shown can also include a memory. Alternatively, Figure 16 The transceiver module 1601 in the receiving end device 160 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, Figure 16 The receiving end device 160 shown can also include a memory.

[0261] 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 involved in the embodiments of the present application can also be a communication apparatus 170 shown. Figure 17 Alternatively, 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 involved in the embodiments of the present application can also be a communication apparatus 170 shown. Figure 17

[0262] The processor can be a logic circuit 1701, and the transceiver can be an interface circuit 1702. Further, Figure 17 The communication apparatus 170 shown can also include a memory 1703.

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

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

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

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

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

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

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

[0270] 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 direct or indirect sending of information to the terminal device. "Receiving information from (a terminal device)" can be understood as that the source of the information is the terminal device, and it can include direct or indirect receiving of information from the terminal device. The information can be processed as necessary between the source and the destination of the information transmission, such as format change, etc., but the destination can understand the valid information from the source.

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

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

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

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

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

Claims

1. A communication method, characterized in that, include: Based on the reliability corresponding to the first sequence of length N, a second sequence of length M is determined; wherein, the second sequence includes the positions in the first sequence excluding the positions of the pre-frozen bits and the rate matching bits; Based on the first set of positions in the second sequence, a set of check bit positions is determined; wherein, the first set of positions includes the most reliable (K+n) bits in the second sequence. PC ) positions, where K is the length of the information bit sequence, and n PC n is the number of check bits. PC Determined according to one or more of the following: The K, the length E after rate matching, the rate matching method, or w min The For the row weight in the set of check bit positions equal to w min And the reliability is lower than the number of check bits at all information bit positions; the w min The minimum row weight corresponding to the K most reliable positions in the first position set; Based on the set of check bit positions, the information bit sequence is polar-coded to obtain the encoded bit sequence; Output one or more bits of the encoded bit sequence.

2. A communication method, characterized in that, include: Receive information to be decoded from the transmitting device; wherein the length of the information bit sequence corresponding to the information to be decoded is K; Based on the reliability corresponding to the first sequence of length N, a second sequence of length M is determined; wherein, the second sequence includes the positions in the first sequence excluding the positions of the pre-frozen bits and the rate matching bits; Based on the first set of positions in the second sequence, a set of check bit positions is determined; wherein, the first set of positions includes the most reliable (K+n) bits in the second sequence. PC ) positions, the n PC n is the number of check bits. PC Determined according to one or more of the following: The K, the length E after rate matching, the rate matching method, or w min The For the row weight in the set of check bit positions equal to w min And the reliability is lower than the number of check bits at all information bit positions; the w min The minimum row weight corresponding to the K most reliable positions in the first position set; The information to be decoded is decoded according to the set of check bit positions.

3. The method according to claim 1 or 2, characterized in that, The set of check bit positions includes a first set of check bit positions and a second set of check bit positions. The first set of check bit positions includes the row weights equal to w in the first 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.

4. The method according to any one of claims 1-3, characterized in that, The n PC According to the above Determined, including: The n PC for Where min(·) is the minimum value of (·).

5. The method according to any one of claims 1-3, characterized in that, When K is greater than or equal to 3 and less than or equal to the first threshold, n PC Let min(3,EK); where min(·) is the minimum value of (·).

6. The method according to claim 5, characterized in that, The first threshold is 6.

7. The method according to any one of claims 1-3, characterized in that, When K is greater than the first threshold and less than or equal to 11 The n PC Determined based on the code rate; wherein, the code rate is the ratio of K to E; or The n PC Determined according to the rate matching method; or The n PC According to the w min Sure.

8. The method according to claim 7, characterized in that, The n PC Determined based on bitrate, including: When the bit rate is less than or equal to 7 / 16, the n PC Let min(MK,9); where min(·) is the minimum value of (·); or When the bit rate is greater than 7 / 16, n PC Determined based on a first difference; wherein the first difference is the difference between E and K.

9. The method according to claim 8, characterized in that, When the first difference is less than or equal to 5, n PC Let min(EK,3); where min(·) is the minimum value of (·); or When the first difference is greater than 5, n PC It is EK-3.

10. The method according to claim 7, characterized in that, The n PC Determined according to the rate matching method, including: When the rate matching method is punching, the n PC Let min(MK,9); where min(·) is the minimum value of (·); or When E is greater than or equal to N, n PC For min(MK,9); or When the rate matching method is shortening, the n PC Determined based on a first difference; wherein the first difference is the difference between E and K.

11. The method according to claim 10, characterized in that, When the first difference is less than or equal to 5, n PC For min(EK,3); or When the first difference is greater than 5, n PC It is EK-3.

12. The method according to claim 7, characterized in that, The n PC According to the w min Determined, including: When the w min When n is 8, the n PC Let min(MK,9); where min(·) is the minimum value of (·); or When the w min When n is 2, the n PC For min(EK,3); or When the w min When n is 4, the n PC It is EK-3.

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

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

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

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

Images