Encoding method and apparatus

Abstract

An encoding method and apparatus, relating to the technical field of communications, and capable of constructing Polar codes on the basis of different repeat sequence lengths to improve decoding performance. The method comprises: mapping information bits corresponding to A first bits among K first bits to A second bits among K second bits of a first sequence having a length of (N2-N1), to obtain a second sequence and perform polar encoding, to obtain a first encoded bit sequence having a length of (N2-N1), the K second bits comprising a first set of information bits and a second set of information bits; the first set of information bits comprising T most reliable bits among bits in a second reliability sequence other than a first set of pre-frozen bits, the first set of pre-frozen bits being determined on the basis of M2 and N2; and the second set of information bits comprising (K-T) most reliable bits among bits in the second reliability sequence other than the first set of information bits and a second set of pre-frozen bits, T being determined on the basis of K, M2, and N2.

Description

Encoding method and apparatus

[0001] The present application claims priority from the Chinese Patent Application No. 202411816553.4 filed on December 9, 2024, and entitled "Encoding method and apparatus", the content of which is incorporated herein by reference in its entirety. TECHNICAL FIELD

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

[0003] In a communication system, a transmitting device can perform Polar encoding on a sequence of information bits, and transmit the encoded sequence to a receiving device based on a hybrid automatic repeat request (HARQ) transmission mechanism. In the HARQ transmission mechanism, the transmitting device can modulate a sequence of initial transmission and transmit the modulated symbol sequence to the receiving device. Correspondingly, the receiving device receives the symbol sequence, demodulates the symbol sequence, and attempts to decode the demodulated bit sequence. If the decoding fails, the transmitting device can modulate a sequence of retransmission and transmit the modulated symbol sequence, and the receiving device can decode the bit sequences corresponding to the two received symbol sequences together.

[0004] However, in the case where the length of the retransmission sequence is different, it is difficult to construct a Polar code, which affects the decoding performance. SUMMARY

[0005] The present application provides an encoding method and apparatus, which can construct a Polar code according to different lengths of retransmission sequences, and can improve the decoding performance.

[0006] Firstly, this application provides an encoding method that can be executed by a transmitting device. Unless otherwise specified, "transmitting device" in this application can refer to the transmitting device itself, a component within the transmitting device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the transmitting device. The method includes: the transmitting device determining K first bits based on a first reliability sequence of length N1, and determining K second bits based on a second reliability sequence of length N2; determining information bits corresponding to A of the K first bits based on an information bit sequence of length K; mapping the information bits corresponding to the A first bits to A second bits of a first sequence of length (N2-N1) to obtain a second sequence; performing polar coding on the second sequence to obtain a first encoded bit sequence of length (N2-N1); and outputting one or more bits from the first encoded bit sequence. Wherein, K is less than or equal to N1, and N2 = 2N1; the K second bits include the first information bit set and the second information bit set; the first information bit set includes the T most reliable bits among the bits in the second reliability sequence other than the first pre-frozen bit set, and the first pre-frozen bit set is determined according to M2 and N2; the second information bit set includes the (KT) most reliable bits among the bits in the second reliability sequence other than the first information bit set and the second pre-frozen bit set; the second pre-frozen bit set is determined according to N1; T is determined according to K, M2, and N2; T is less than or equal to K; M2 is determined according to retransmission resources and N1; and A second bits are A bits among the K second bits.

[0007] Based on the first aspect, the transmitting device can determine the first information bit set and the second information bit set according to the retransmission resources (i.e., the length of the retransmission sequence). Based on the first and second information bit sets, it can determine K second bits. Then, it can map the information bits corresponding to A of the K first bits onto A of the K second bits to construct a polar code. In other words, the transmitting device can construct corresponding polar codes even with different retransmission sequence lengths, thus improving decoding performance. Furthermore, the transmitting device can determine the size of the first information bit set based on K, M², and N², and determine K second bits based on the first information bit set. This ensures that the determined K second bits support stable performance under various combinations of retransmission and initial transmission parameters.

[0008] In one possible implementation, the transmitting device maps the bits in the information bit sequence to K first bits in a third sequence of length N1 to obtain a fourth sequence; the fourth sequence is then polar-coded to obtain a second encoded bit sequence of length N1.

[0009] Based on this possible implementation, the transmitting device can determine the encoded bit sequence (i.e., the second encoded bit sequence) in the initial data transmission based on the K first bits. Since the transmitting device maps the information bit sequence to the K most reliable bits (i.e., the K first bits) in the third sequence, the reliability of the information bit sequence transmission can be improved, thereby improving the decoding performance.

[0010] In one possible implementation, the transmitting device obtains a third coded bit sequence based on the first coded bit sequence and the second coded bit sequence; and outputs one or more bits from the (M2-N1) bits in the third coded bit sequence.

[0011] Based on this possible implementation, the transmitting device can determine the retransmission sequence in data retransmission (i.e., one or more bits from the (M2-N1) bits in the third coded bit sequence), and can transmit retransmission sequences of arbitrary length in data retransmission, thereby improving retransmission flexibility.

[0012] In one possible implementation, when the rate matching method corresponding to the fourth sequence is punching, the first pre-frozen bit set also includes a third pre-frozen bit set; wherein the third pre-frozen bit set is determined based on one or more rate matching bits corresponding to the fourth sequence.

[0013] Based on this possible implementation, when the rate matching method corresponding to the fourth sequence is puncturing, the first information bit set may include the T most reliable bits in the second reliability sequence, excluding the first pre-frozen bit set and the third pre-frozen bit set. Pre-freezing one or more rate matching bits in the initial data transmission and the bits of one or more rate matching bits in the initial data transmission in a sequence of length N2 when determining the first information bit set can improve decoding performance.

[0014] In one possible implementation, when the rate matching method corresponding to the fourth sequence is shortening, the first pre-frozen bit set also includes a third pre-frozen bit set and a fourth pre-frozen bit set; wherein, the third pre-frozen bit set is determined according to one or more rate matching bits corresponding to the fourth sequence, and the fourth pre-frozen bit set includes one or more rate matching bits corresponding to the fourth sequence.

[0015] Based on this possible implementation, when the rate matching method corresponding to the fourth sequence is shortened, the first information bit set may include the T most reliable bits among the bits in the second reliability sequence other than the first pre-frozen bit set, the third pre-frozen bit set, and the fourth pre-frozen bit set. When determining the first information bit set, pre-freezing one or more rate matching bits in the initial data transmission, as well as the bits of one or more rate matching bits in the initial data transmission in the sequence of length N2, can improve decoding performance.

[0016] It is understandable that when the rate matching method corresponding to the fourth sequence is punched, one or more rate matching bits corresponding to the fourth sequence are located at the beginning of the fourth sequence, and in this case, the first pre-frozen bit set may include the fourth pre-frozen bit set. When the rate matching method corresponding to the fourth sequence is shortened, one or more rate matching bits corresponding to the fourth sequence are located at the end of the fourth sequence, and in this case, the first pre-frozen bit set does not include the fourth pre-frozen bit set.

[0017] In one possible implementation, if the length of the rate-matched bit corresponding to the fourth sequence is less than N1, the second pre-frozen bit set also includes a third pre-frozen bit set; wherein the third pre-frozen bit set is determined based on one or more rate-matched bit bits corresponding to the fourth sequence.

[0018] Based on this possible implementation, when the length of the rate-matched bit sequence corresponding to the fourth sequence is less than N1, the second information bit set may include the most reliable (KT) bits in the second reliability sequence other than the first information bit set, the first pre-frozen bit set, and the third pre-frozen bit set. In other words, when determining the second information bit set, pre-freezing one or more rate-matched bits in the initial data transmission, as well as the bits of one or more rate-matched bits in the initial data transmission in the sequence of length N2, can improve decoding performance.

[0019] It is understandable that, regardless of whether the rate matching method corresponding to the fourth sequence is shortening or punching, the second pre-frozen bit set can include the fourth pre-frozen bit set.

[0020] In one possible implementation, the third pre-frozen bit set is determined by adding N1 to one or more rate-matching bits corresponding to the fourth sequence.

[0021] Based on this possible implementation, the mother code length used when determining the initial transmission sequence is N1, and the mother code length used when determining the retransmission sequence is N2. Therefore, the rate matching bits that need to be frozen can include one or more rate matching bits corresponding to the fourth sequence, and the result of adding the bit index of one or more rate matching bits corresponding to the fourth sequence to N1, which can improve decoding performance.

[0022] Secondly, this application provides a decoding method that can be executed by a receiving device. Unless otherwise specified, "receiving device" in this application can refer to the receiving device itself, a component within the receiving device (e.g., a processor, chip, or chip system), or a logic module or software capable of implementing all or part of the functions of the receiving device. The method includes: the receiving device receiving a bit sequence to be decoded; determining K first bits based on a first reliability sequence of length N1, and determining K second bits based on a second reliability sequence of length N2; and decoding the bit sequence to be decoded based on A first bits from the K first bits and A second bits from the K second bits to obtain a decoding result. Wherein, the length of the information bit sequence corresponding to the bit sequence to be decoded is K; K is less than or equal to N1, N2 = 2N1; the K second bits include the first information bit set and the second information bit set; the first information bit set includes the T most reliable bits in the second reliability sequence other than the first pre-frozen bit set, the first pre-frozen bit set is determined according to M2 and N2; the second information bit set includes the (KT) most reliable bits in the second reliability sequence other than the first information bit set and the second pre-frozen bit set; the second pre-frozen bit set is determined according to N1; T is determined according to K, M2, and N2; T is less than or equal to K; M2 is determined according to retransmission resources and N1.

[0023] Based on the second aspect, the receiving device can determine A first bits and A second bits using the above method. There is a corresponding check relationship between the A first bits and A second bits. Based on this check relationship, the receiving device can determine the information bits located in the A first bits of the bit sequence to be decoded according to the information bits in the A second bits, thereby achieving decoding and improving decoding performance.

[0024] In one possible implementation, when the rate matching method corresponding to the fifth sequence is puncturing, the first pre-frozen bit set also includes a third pre-frozen bit set; wherein, the third pre-frozen bit set is determined according to one or more rate matching bits corresponding to the fifth sequence, and the fifth sequence is determined according to the bit sequence to be decoded in the initial data transmission.

[0025] Based on this possible implementation, when the rate matching method corresponding to the fifth sequence is puncturing, the first information bit set may include the T most reliable bits in the second reliability sequence, excluding the first pre-frozen bit set and the third pre-frozen bit set. In other words, when determining the first information bit set, pre-freezing one or more rate matching bits in the initial data transmission, as well as the bits of one or more rate matching bits in the initial data transmission in a sequence of length N2, can improve decoding performance.

[0026] In one possible implementation, when the rate matching method corresponding to the fifth sequence is shortening, the first pre-frozen bit set also includes a third pre-frozen bit set and a fourth pre-frozen bit set; wherein, the third pre-frozen bit set is determined according to one or more rate matching bits corresponding to the fifth sequence, and the fourth pre-frozen bit set includes one or more rate matching bits corresponding to the fifth sequence; the fifth sequence is determined according to the bit sequence to be decoded in the initial data transmission.

[0027] Based on this possible implementation, when the rate matching method corresponding to the fifth sequence is shortened, the first information bit set may include the T most reliable bits among the bits in the second reliability sequence other than the first pre-frozen bit set, the third pre-frozen bit set, and the fourth pre-frozen bit set. That is, when determining the first information bit set, pre-freezing one or more rate matching bits in the initial data transmission, as well as the bits of one or more rate matching bits in the initial data transmission in the sequence of length N2, can improve decoding performance.

[0028] In one possible implementation, if the length of the rate-matched bit corresponding to the fifth sequence is less than N1, the second pre-frozen bit set also includes a third pre-frozen bit set; wherein, the third pre-frozen bit set is determined based on one or more rate-matched bit bits corresponding to the fifth sequence; and the fifth sequence is determined based on the bit sequence to be decoded in the initial data transmission.

[0029] Based on this possible implementation, if the length of the rate-matched bit sequence corresponding to the fifth sequence is less than N1, the second information bit set may include the most reliable (KT) bits in the second reliability sequence other than the first information bit set, the first pre-frozen bit set, and the third pre-frozen bit set. In other words, when determining the second information bit set, pre-freezing one or more rate-matched bits in the initial data transmission, as well as the bits of one or more rate-matched bits in the initial data transmission in the sequence of length N2, can improve decoding performance.

[0030] In one possible implementation, the third pre-frozen bit set is determined by adding N1 to one or more rate-matching bits corresponding to the fifth sequence.

[0031] Based on this possible implementation, the mother code length used when determining the initial transmission sequence is N1, and the mother code length used when determining the retransmission sequence is N2. Therefore, the rate matching bits that need to be frozen can include one or more rate matching bits corresponding to the fifth sequence, as well as the result of adding the bit index of one or more rate matching bits corresponding to the fifth sequence to N1 (i.e., the bits of one or more rate matching bits corresponding to the fifth sequence in the sequence of length N2), which can improve decoding performance.

[0032] Combining the first and second aspects, in one possible implementation, the second pre-frozen bit set is {0 1 2 3…N1-1}.

[0033] Based on this possible implementation, the 0th to (N1-1)th bits in the second reliability sequence can be pre-frozen, and the set of second information bits can be determined from the remaining bits. This can make the determined set of second information bits include one or more bits from the K first bits as much as possible, thereby reducing the number of information bits in data retransmission, simplifying the implementation, and improving retransmission performance.

[0034] Combining the first and second aspects, in one possible implementation, A second bits are the second bits with bit indices less than N1 among K second bits.

[0035] Based on this possible implementation, A second bits can be determined from K second bits, and information bits on A second bits can be transmitted, thereby improving decoding performance.

[0036] Combining the first and second aspects, in one possible implementation, the first reliability sequence is the bits in the second reliability sequence other than the second pre-frozen bit set.

[0037] Combining the first and second aspects, in one possible implementation, the K first bits are the K most reliable bits determined according to the first reliability sequence.

[0038] Based on the two possible implementations mentioned above, the information bit sequence can be mapped to the K most reliable bits (i.e., the first bits) in the third sequence to transmit the information bit sequence, thereby improving the reliability of the information bit sequence transmission and thus enhancing decoding performance. Alternatively, the first reliability sequence can be determined based on the second reliability sequence and the second pre-frozen bit set, and the K first bits can be determined based on the first reliability sequence, providing a feasible solution for determining the K first bits.

[0039] Combining the first and second aspects, in one possible implementation, A first bits are determined based on K first bits and K second bits.

[0040] Combining the first and second aspects, in one possible implementation, A first bits are bits that do not belong to the third bits corresponding to the K second bits among the K first bits; wherein, the bit index of the third bit corresponding to the second bit with bit index i is i-N1; i is greater than or equal to N1, and i is less than or equal to N2-1.

[0041] Based on the two possible implementations mentioned above, we can determine A first bits, which can enable the retransmission of information bits corresponding to the A first bits with lower reliability, thereby improving decoding performance.

[0042] Combining the first and second aspects, in one possible implementation, the first pre-frozen bit set is {0 1 2 3…Q}; where Q is determined according to M2 and N2.

[0043] Based on this possible implementation, the first set of pre-frozen bits can be determined according to the length of the retransmission sequence, so as to pre-freeze the bits with lower reliability, thereby making the bits in the determined first set of information bits more reliable and improving decoding performance.

[0044] Combining the first and second aspects, in one possible implementation, Q is... Or, Q is Or, Q is in, This is for rounding up.

[0045] Based on this possible implementation, three feasible schemes are provided for determining Q: Q can be determined according to the length of the retransmission sequence, so that the determined Q meets the communication requirements, the retransmission performance of the determined retransmission sequence can be stabilized, and the decoding performance can be improved.

[0046] Combining the first and second aspects, in one possible implementation, Q is N2 / 2-1 when M2 / N2 is less than 5 / 8; or Q is 3N2 / 8-1 when M2 / N2 is greater than or equal to 5 / 8 and less than 3 / 4; or Q is N2 / 4-1 when M2 / N2 is greater than or equal to 3 / 4.

[0047] Based on this possible implementation, the content of Q is determined as Q is The transformation can reduce computational complexity.

[0048] Combining the first and second aspects, in one possible implementation, when M² / N² is greater than or equal to the first threshold, T is... Alternatively, if M2 / N2 is greater than or equal to the second threshold and less than the first threshold, then T is... Alternatively, if M2 / N2 is less than the second threshold and the code rate is less than or equal to the third threshold, then T is... Alternatively, if M2 / N2 is less than the second threshold and the bit rate is greater than the third threshold, then T is... in, To round up, the first threshold is greater than the second threshold.

[0049] Based on this possible implementation, T can be determined according to the length of the retransmission sequence to ensure that T meets the requirement of stable retransmission performance under different retransmission sequence lengths, thus stabilizing the retransmission performance of the determined retransmission sequence and improving decoding performance. Alternatively, T can be determined according to the code rate; a smaller value for T at lower code rates and a larger value for T at higher code rates, to determine the A second bits corresponding to different code rates and ensure stable retransmission performance.

[0050] Combining the first and second aspects, in one possible implementation, when M² / N² is greater than or equal to the second threshold and less than the first threshold, T is... Alternatively, T is K if M² / N² is greater than or equal to the first threshold, or if M² / N² is less than the second threshold; where, To round up, the first threshold is greater than the second threshold.

[0051] Based on this possible implementation, T can be determined, simplifying its implementation and reducing computational complexity. Furthermore, T can be determined based on the retransmission sequence length to ensure that T meets the requirement of stable retransmission performance for different retransmission sequence lengths. This ensures stable retransmission performance of the determined retransmission sequence and improves decoding performance.

[0052] Combining the first and second aspects, in one possible implementation, when M² / N² is greater than or equal to the fourth threshold and less than the second threshold, T is... Alternatively, if M2 / N2 is greater than or equal to the second threshold and less than the first threshold, then T is... Alternatively, if M2 / N2 is greater than or equal to the first threshold and less than the fifth threshold, then T is... in, To round up, the fifth threshold is greater than the first threshold, the first threshold is greater than the second threshold, and the second threshold is greater than the fourth threshold.

[0053] Based on this possible implementation, T can be determined according to the length of the retransmission sequence to ensure that T under different retransmission sequence lengths can meet the requirement of stable retransmission performance, thus making the retransmission performance of the determined retransmission sequence stable and improving decoding performance.

[0054] Combining the first and second aspects, in one possible implementation, the fourth threshold is 9 / 16.

[0055] Combining the first and second aspects, in one possible implementation, the fifth threshold is 7 / 8.

[0056] Combining the first and second aspects, in one possible implementation, the first threshold is 3 / 4.

[0057] Combining the first and second aspects, in one possible implementation, the second threshold is 5 / 8.

[0058] Based on the above four possible implementations, a feasible scheme is provided for the values ​​of the first threshold, the second threshold, the third threshold, and the fourth threshold, which can determine the A second bits corresponding to M2 / N2 in different intervals to ensure stable retransmission performance.

[0059] Combining the first and second aspects, in one possible implementation, the third threshold is 1 / 2; or, the third threshold is 7 / 16.

[0060] Based on this possible implementation, at higher bit rates, the more information bits mapped to the second bit, the more stable the retransmission performance; at lower bit rates, the fewer information bits mapped to the second bit, the more stable the retransmission performance. A third threshold can be set to a value close to 1 / 2 to determine the bit rate, thereby determining the number of second bits corresponding to different bit rates to ensure stable retransmission performance.

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

[0062] For example, the processing module is configured to determine K first bits based on a first reliability sequence of length N1, and K second bits based on a second reliability sequence of length N2; wherein K is less than or equal to N1, and N2 = 2N1; the K second bits include a first information bit set and a second information bit set; the first information bit set includes the T most reliable bits among the bits in the second reliability sequence excluding the first pre-frozen bit set, and the first pre-frozen bit set is determined based on M2 and N2; the second information bit set includes the (KT) most reliable bits among the bits in the second reliability sequence excluding the first information bit set and the second pre-frozen bit set; the second pre-frozen bit set... The processing module is further configured to determine the information bits corresponding to A first bits out of K first bits based on the information bit sequence of length K; the processing module is further configured to map the information bits corresponding to A first bits out of K first bits to A second bits of the first sequence of length (N2-N1) to obtain the second sequence; wherein, A second bits are A bits out of K second bits; the processing module is further configured to perform polar coding on the second sequence to obtain the first coded bit sequence of length (N2-N1); the transceiver module is configured to output one or more bits in the first coded bit sequence.

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

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

[0065] For example, the processing module is used to obtain a sequence of bits to be decoded; wherein the length of the information bit sequence corresponding to the bit sequence to be decoded is K; the processing module is further used to determine K first bits according to a first reliability sequence of length N1, and K second bits according to a second reliability sequence of length N2; wherein K is less than or equal to N1, and N2 = 2N1; the K second bits include a first information bit set and a second information bit set; the first information bit set includes the T most reliable bits among the bits in the second reliability sequence excluding the first pre-frozen bit set. The first pre-frozen bit set is determined according to M2 and N2; the second information bit set includes the most reliable (KT) bits in the second reliability sequence other than the first information bit set and the second pre-frozen bit set; the second pre-frozen bit set is determined according to N1; T is determined according to K, M2, and N2; T is less than or equal to K; M2 is determined according to retransmission resources and N1; the processing module is also used to decode the bit sequence to be decoded according to A first bits from K first bits and A second bits from K second bits to obtain the decoding result.

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

[0067] Fifthly, embodiments of this application provide a communication device, which includes one or more processors; the one or more processors are configured to run computer programs or instructions, such that when the one or more processors execute the computer instructions or instructions, the encoding method described in the first aspect is executed, or the decoding method described in any of the second aspects is executed.

[0068] In one possible design, the communication device further includes one or more memories coupled to one or more processors, the memories used to store the aforementioned computer programs or instructions. In one possible implementation, the memories are located outside the communication device. In another possible implementation, the memories are located inside the communication device. In embodiments of this application, the processor and memory may also be integrated into a single device, i.e., the processor and memory may be integrated together. In one possible implementation, the communication device further includes a transceiver for receiving and / or transmitting information.

[0069] In one possible design, the communication device further includes one or more communication interfaces coupled to one or more processors, and the communication interfaces are used to communicate with other modules outside the communication device.

[0070] In a sixth aspect, embodiments of this application provide a communication device, which 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 encoding method as described in any aspect of the first aspect, to process and / or generate information based on the information, or to execute the decoding method as described in any aspect of the second aspect, to process and / or generate information based on the information.

[0071] In a seventh aspect, embodiments of this application provide a computer-readable storage medium storing computer instructions or programs that, when executed on a computer, cause the encoding method described in the first aspect to be executed, or the decoding method described in any of the second aspects to be executed.

[0072] Eighthly, embodiments of this application provide a computer program product containing computer instructions that, when run on a computer, causes the encoding method described in the first aspect to be executed, or the decoding method described in any of the second aspects to be executed.

[0073] Ninthly, embodiments of this application provide a computer program that, when run on a computer, causes the encoding method described in the first aspect to be executed, or the decoding method described in any of the second aspects to be executed.

[0074] In a tenth aspect, embodiments of this application provide a chip, including: a processor coupled to a memory, the memory being used to store programs or instructions, wherein when the program or instructions are executed by the processor, an encoding method as described in the first aspect is executed, or a decoding method as described in any of the second aspects is executed.

[0075] The technical effects of any of the design methods in aspects three through ten are similar to those in aspects one and two above, and will not be elaborated upon further.

[0076] Eleventhly, embodiments of this application provide a communication system that may include communication means for performing the communication as described in the first aspect or any possible design of the first aspect, and communication means for performing the communication as described in the second aspect or any possible design of the second aspect. Attached Figure Description

[0077] Figure 1 is a schematic diagram of a polar code encoding provided in an embodiment of this application;

[0078] Figure 2 is a schematic diagram of a polar code decoding provided in an embodiment of this application;

[0079] Figure 3 is a schematic diagram of an IR-HARQ framework based on Polar codes provided in an embodiment of this application;

[0080] Figure 4 is a schematic diagram of a communication system provided in an embodiment of this application;

[0081] Figure 5 is a schematic diagram of encoding and decoding performed by a transmitting end device and a receiving end device according to an embodiment of this application;

[0082] Figure 6 is a schematic diagram of the structure of a communication device provided in an embodiment of this application;

[0083] Figure 7 is a flowchart illustrating an encoding method provided in an embodiment of this application;

[0084] Figure 8 is a flowchart illustrating another encoding method provided in an embodiment of this application;

[0085] Figure 9 is a schematic diagram of the structure of a transmitting device provided in an embodiment of this application;

[0086] Figure 10 is a schematic diagram of the structure of a receiving device provided in an embodiment of this application;

[0087] Figure 11 is a schematic diagram of another communication device provided in an embodiment of this application;

[0088] Figure 12 is a schematic diagram of the structure of another communication device provided in an embodiment of this application. Detailed Implementation

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

[0090] Polar codes are a type of coding scheme that can be rigorously proven to "achieve" Shannon channel capacity. They have the advantages of good decoding performance and low complexity. Currently, they have been selected by the third generation partnership project (3GPP) standard as the control channel coding scheme for fifth generation (5G) enhanced mobile broadband (eMBB) scenarios.

[0091] Figure 1 shows a schematic diagram of an 8-bit Polar code encoding, also known as a factor graph. The Polar code encoding process can include several polarization kernel operations. The polarization kernel is used to combine two input bits with a matrix. Multiplying them yields two output bits. It can be seen that during the recursive construction of Polar codes, an 8-bit Polar code can be considered as a result of coupling two 4-bit Polar codes, and similarly, a 4-bit Polar code can be considered as a result of coupling two 2-bit Polar codes.

[0092] For example, when the input sequence (input from the left) is “00000011”, the output sequence (output from the right) can be “01010101”.

[0093] Similarly, a Polar code of length N can be seen as a result of coupling two Polar codes of length N / 2, and a Polar code of length N / 2 can be seen as a result of coupling two Polar codes of length N / 4.

[0094] Where N is a positive integer.

[0095] The construction process of Polar codes is used to determine the information bits and frozen bits. The reliability of each sub-channel can be ranked, and the K positions with the highest reliability are designated as information bits, while the remaining NK positions are designated as frozen bits. As shown in Figure 1, taking the construction of a Polar code with N=8 and K=4 as an example, assuming the zeroth position is the starting position, the third, fifth, sixth, and seventh positions have the highest reliability, and thus these positions can be designated as information bits, with the remaining positions as frozen bits; or assuming the first position is the starting position, the fourth, sixth, seventh, and eighth positions have the highest reliability, and thus these positions can be designated as information bits, with the remaining positions as frozen bits.

[0096] Where K is a positive integer.

[0097] In practice, Polar codes can be obtained offline through reliability sequences or online through methods such as Gaussian approximation; this application does not limit this to any particular method.

[0098] The receiving device can decode the encoded Polar code using a Successive Cancellation (SC) decoding algorithm. During SC decoding, the bit value of the information bit is determined by progressively calculating the log likelihood ratio (LLR) of the information bits. For example, if LLR > 0, the bit value of the information bit can be determined to be 0; if LLR < 0, the bit value of the information bit can be determined to be 1. Furthermore, for frozen bits, regardless of the LLR of the frozen bit, the frozen bit is set to 0.

[0099] For example, the SC decoding process can be illustrated in Figure 2, which includes eight computation nodes: four f nodes and four g nodes. The computation of an f node requires two LLR terms to be input to its right, and the computation of a g node requires two LLR terms to be input to its right and one "partial sum" term above it. The output can only be calculated after all input terms have been calculated. The receiving device can receive the signal from the right side of Figure 2. The received signal passes through the eight computation nodes in sequence to obtain the Polar code decoding, i.e., the decoding order is: ①→②→③→④.

[0100] Based on the above description of Polar codes, information bits need to be placed in their corresponding positions before Polar code encoding. When constructing Polar codes for HARQ transmission, the bit mapping process can be specially designed to reduce decoding complexity and improve decoding performance.

[0101] HARQ transmission: HARQ transmission can combine forward error correction (FEC) codes with automatic repeat request (ARQ) methods to significantly improve spectral efficiency. The specific process may include the following steps:

[0102] Step 1: The sending device sends a sequence of encoded bits with a higher code rate as the initial transmission.

[0103] Step 2: The receiving device receives the symbol sequence, demodulates the symbol sequence to obtain the bit sequence to be decoded, and attempts to decode the bit sequence to be decoded.

[0104] If the receiving device successfully decodes the code, it can send an acknowledgment (ACK) frame back to the sending device. Based on this acknowledgment frame, the sending device can stop transmitting.

[0105] If the receiving device fails to decode, it can buffer the received symbol sequence and send a negative acknowledgement (NACK) frame to the sending device. Alternatively, it may choose not to send a NACK frame. The sending device can continue transmitting the encoded bit sequence after receiving a NACK frame or if it does not receive an acknowledgment frame within a certain time period. The receiving device can decode both received sequences together.

[0106] Compared to transmitting data in multiple parts in a single HARQ transmission, the above HARQ transmission allows transmission to stop upon successful decoding in the middle, which can improve system throughput. That is, if the initial transmission is successful, no retransmission is needed, saving spectrum resources and improving spectrum efficiency. If the initial transmission fails, the receiving device can decode the two received sequences together, still achieving the error correction performance of long codes.

[0107] For example, as shown in Figure 3, an incremental redundancy (IR)-HARQ framework based on Polar codes is provided. This framework may include an initial transmission sequence (or U-code) of length 8 and a retransmission sequence (or V-code) of length 8. The initial and retransmission sequences can be combined to form a 16-bit encoded bit sequence. In the initial transmission sequence, the positions of bits filled with patterns 1 and 2 are the positions of information bits. In the retransmission sequence, the positions of bits filled with pattern 3 are the positions of information bits. There is a corresponding check relationship between the positions of bits filled with pattern 3 and the positions of bits filled with pattern 1; that is, the positions of bits filled with pattern 3 and their corresponding positions filled with pattern 1 contain the same information bits.

[0108] Based on the Polar code shown in Figure 1, the receiving device can decode the initial transmission sequence independently. The positions of the bits filled with patterns 1 and 2 represent the positions of the information bits. If decoding is successful, the sending device does not need to continue transmitting the encoded bit sequence. If decoding fails, the receiving device can decode the initial and retransmission sequences together, i.e., it can decode the 16-bit Polar code composed of the initial and retransmission sequences. Here, the positions of the bits filled with patterns 2 and 3 represent the positions of the information bits. When decoding the position of the bit filled with pattern 1, the result has already been obtained by decoding the position of the same bit filled with pattern 3. The position of the bit filled with pattern 1 becomes a known value, which can be understood as dynamically freezing the bit positions.

[0109] Based on the above bit mapping relationship, it can be seen that the IR-HARQ framework based on Polar codes needs to form a corresponding check relationship between some information bits of the initial transmission sequence and some information bits of the retransmission sequence. Alternatively, it can be described as needing to map a portion of information bits to both the initial transmission sequence and the retransmission sequence simultaneously. This ensures that whether decoding the initial transmission sequence alone or decoding the initial transmission sequence and the retransmission sequence together, the corresponding information bits are always carried in a highly reliable position, thereby improving decoding performance.

[0110] However, constructing Polar codes becomes difficult when the lengths of the retransmission sequences differ, affecting decoding performance. For example, determining the position corresponding to either Figure 3 or Figure 2 is challenging when the retransmission sequences have different lengths, making Polar code construction difficult.

[0111] Therefore, this application provides an encoding method, which includes: a transmitting device determining K first bits based on a first reliability sequence of length N1, and determining K second bits based on a second reliability sequence of length N2; determining information bits corresponding to A first bits among the K first bits based on an information bit sequence of length K; mapping the information bits corresponding to the A first bits to A second bits of a first sequence of length (N2-N1) to obtain a second sequence; performing polar coding on the second sequence to obtain a first encoded bit sequence of length (N2-N1); and outputting one or more bits from the first encoded bit sequence. Wherein, K is less than or equal to N1, and N2 = 2N1; the K second bits include the first information bit set and the second information bit set; the first information bit set includes the T most reliable bits among the bits in the second reliability sequence other than the first pre-frozen bit set, and the first pre-frozen bit set is determined according to M2 and N2; the second information bit set includes the (KT) most reliable bits among the bits in the second reliability sequence other than the first information bit set and the second pre-frozen bit set; the second pre-frozen bit set is determined according to N1; T is determined according to K, M2, and N2; T is less than or equal to K; M2 is determined according to retransmission resources and N1; where, A second bits are A bits among the K second bits.

[0112] In this embodiment, the transmitting device can determine a first information bit set and a second information bit set based on the retransmission resources (i.e., the length of the retransmission sequence), and determine K second bits based on the first and second information bit sets. Then, the information bits corresponding to A of the K first bits can be mapped onto A of the K second bits to construct a polar code. In other words, the transmitting device can construct corresponding polar codes even with different retransmission sequence lengths, improving decoding performance. Furthermore, the transmitting device can determine the size of the first information bit set based on K, M2, and N2, and determine K second bits based on the first information bit set, thereby ensuring stable performance of the determined K second bits under various retransmission / initial transmission parameter combinations.

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

[0114] The encoding method provided in this application can be used in any communication system, such as a 3GPP communication system, for example, a long term evolution (LTE) system, or a 5G mobile communication system, a hybrid LTE and 5G network system, 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) system, a narrowband Internet of Things (NB-IoT) system, a global system for mobile communications (GSM), an enhanced data rate for GSM evolution (EDGE) system, a wideband code division multiple access (WCDMA) system, a code division multiple access (CDMA2000) system, or a time division-synchronization code division multiple access (TDMA) system. Access, TD-SCDMA, eMBB, ultra-reliable and low-latency communication (URLLC), enhanced machine-type communication (eMTC), and various types of future communication systems are also included, as well as non-terrestrial network (NTN) systems (such as satellite communication systems), non-3GPP communication systems, etc., without restriction.

[0115] The encoding method provided in this application can be applied to various communication scenarios. For example, it can be applied to one or more of the following communication scenarios: encoding of control channels, encoding of data channels, etc., without limitation.

[0116] The communication system provided in the embodiments of this application will be described below using Figure 4 as an example.

[0117] Figure 4 is a schematic diagram of a communication system provided in an embodiment of this application. As shown in Figure 4, the communication system may include at least one terminal device and at least one network device.

[0118] In Figure 4, the terminal device can be located within the beam / cell coverage area of ​​the network device, and the network device can provide communication services to the terminal device. For example, the network device can use channel coding to encode downlink data and then transmit it to the terminal device via air interface after constellation modulation (i.e., the network device is the transmitting device, and the terminal device is the receiving device); the terminal device can also use channel coding to encode uplink data and then transmit it to the network device via air interface after constellation modulation (i.e., the terminal device is the transmitting device, and the network device is the receiving device). It is understood that when network devices communicate with each other, or when terminal devices communicate with each other, communication can also be based on channel coding; that is, the transmitting and receiving devices can both be network devices or both be terminal devices, without restriction.

[0119] The terminal device in Figure 4 can be a device with wireless transceiver capabilities or a chip or chip system that can be configured on the device. It allows users to access the network and is used to provide voice and / or data connectivity to users. The terminal device can also be called user equipment (UE), subscriber unit, terminal, mobile station (MS), or mobile terminal (MT), etc.

[0120] For example, the terminal device can be a mobile phone, a tablet computer, or a computer with wireless transceiver capabilities. Terminal equipment can also be user stations, mobile stations, remote stations, remote terminal equipment, mobile terminal equipment, user terminal equipment, wireless communication equipment, user agents, user devices, cellular phones, cordless phones, session initiation protocol (SIP) phones, wireless local loop (WLL) stations, personal digital assistants (PDAs), handheld devices with wireless communication capabilities, computing devices, processing devices connected to wireless modems, in-vehicle equipment, wearable devices, terminal equipment in the Internet of Things (IoT), home appliances, virtual reality (VR) terminals, augmented reality (AR) terminals, wireless terminals in industrial control, wireless terminals in autonomous driving, wireless terminals in telemedicine, wireless terminals in smart grids, wireless terminals in smart cities, wireless terminals in smart homes, vehicles with vehicle-to-vehicle (V2V) communication capabilities, intelligent connected vehicles, and UAV-to-UAV communication. Unmanned aerial vehicles (UAVs) with U2U communication capabilities, terminal devices in future networks, or terminal devices in future evolved public land mobile networks (PLMNs) are not subject to restrictions.

[0121] In Figure 4, the network device can be any device deployed in the access network capable of wireless communication with terminal devices. It can also be a chip or chip system that can be configured within the aforementioned device, a logical node or logical module, or a function implemented in software. Its main responsibilities include air interface-side wireless physical control, 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 either a wired access device or a wireless access device.

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

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

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

[0125] In another example, the network device may also be a device that includes a radio unit (RU), or a device that includes a CU, a DU, and a RU. The RU may be included in a radio frequency device or radio frequency unit, such as an RRU, an active antenna unit (AAU), or a remote radio head (RRH).

[0126] It is understood that CU (or CU-CP and CU-UP), DU, or RU may have different names in different systems, but those skilled in the art will understand their meaning. For example, in an open radio access network (O-RAN) system, CU can also be called O-CU (open CU), DU can also be called O-DU, CU-CP can also be called O-CU-CP, CU-UP can also be called O-CU-UP, and RU can also be called O-RU. For ease of description, this application uses CU, CU-CP, CU-UP, DU, and RU as examples. Any of the units among CU (or CU-CP, CU-UP), DU, and RU in this application can be implemented through software modules, hardware modules, or a combination of software modules and hardware modules.

[0127] Based on the above description of the terminal device and network device, optionally, the encoding method provided in the embodiments of this application can be implemented by the aforementioned terminal device or network device, or by components of the terminal device or network device, such as by application-specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), or software (such as program code in memory) deployed in the terminal device or network device, without limitation.

[0128] Optionally, in this embodiment of the application, the transmitting device (or source) and the receiving device (or sink) can use the process shown in Figure 5 below for encoding and decoding. The transmitting device can be any terminal device or network device in the communication system shown in Figure 4, and the receiving device can also be any terminal device or network device in the communication system shown in Figure 4.

[0129] In this process, the transmitting device performs source coding on its generated bits to obtain a source bit stream. Then, it performs channel coding on the source bit stream, modulates it, and transmits the modulated symbols to the receiving device through a noisy channel. When the receiving device receives the modulated symbols through the noisy channel, it demodulates them, performs channel decoding to recover the source bit stream, and then performs source decoding to obtain the decoded result.

[0130] In specific implementation, as shown in Figure 4, each terminal device and network device can adopt the composition structure shown in Figure 6, or include the components shown in Figure 6. Figure 6 is a schematic diagram of the composition of a communication device 600 provided in an embodiment of this application. The communication device 600 can be a terminal device or a chip or system-on-a-chip in a terminal device; it can also be a network device or a chip or system-on-a-chip in a network device. As shown in Figure 6, the communication device 600 includes a processor 601, a transceiver 602, and a communication line 603.

[0131] Furthermore, the communication device 600 may also include a memory 604. The processor 601, memory 604, and transceiver 602 can be connected via a communication line 603.

[0132] The processor 601 can be a central processing unit (CPU), a network processor (NP), a digital signal processor (DSP), a microprocessor, a microcontroller, a programmable logic device (PLD), or any combination thereof. The processor 601 can also be other devices with processing capabilities, such as circuits, devices, or software modules, without limitation.

[0133] Transceiver 602 is used to communicate with other devices or other communication networks. These other communication networks can be Ethernet, radio access network (RAN), wireless local area network (WLAN), etc. Transceiver 602 can be a module, circuit, transceiver, or any device capable of enabling communication.

[0134] Communication line 603 is used to transmit information between the components included in communication device 600.

[0135] Memory 604 is used to store instructions. These instructions can be computer programs.

[0136] The memory 604 can be a read-only memory (ROM) or other type of static storage device that can store static information and / or instructions; it can also be a random access memory (RAM) or other type of dynamic storage device that can store information and / or instructions; it can also be an electrically erasable programmable read-only memory (EEPROM), a compact disc read-only memory (CD-ROM) or other optical disc storage, optical disc storage (including compressed optical discs, laser discs, optical discs, universal optical discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, etc., without limitation.

[0137] The memory 604 can exist independently of the processor 601 or be integrated with the processor 601. The memory 604 can be used to store instructions, program code, or some data. The memory 604 can be located inside or outside the communication device 600, without limitation. The processor 601 is used to execute the instructions stored in the memory 604 to implement the encoding method provided in the following embodiments of this application.

[0138] In one example, processor 601 may include one or more CPUs, such as CPU0 and CPU1 in Figure 6.

[0139] As an optional implementation, the communication device 600 may include multiple processors, for example, in addition to the processor 601 in FIG. 6, it may also include a processor 607.

[0140] As an optional implementation, the communication device 600 also includes an output device 605 and an input device 606. For example, the input device 606 is a device such as a keyboard, mouse, microphone, or joystick, and the output device 605 is a device such as a display screen or speaker.

[0141] The communication device 600 can be a desktop computer, a portable computer, a web server, a mobile phone, a tablet computer, a wireless terminal, an embedded device, a chip system, or a device with a similar structure to that shown in Figure 6. Furthermore, the composition shown in Figure 6 does not constitute a limitation on the communication device. In addition to the components shown in Figure 6, the communication device may include more or fewer components than shown, or combine certain components, or have different component arrangements.

[0142] In this embodiment of the application, the chip system may be composed of chips or may include chips and other discrete devices.

[0143] Furthermore, the actions, terms, etc., involved in the various embodiments of this application can be referenced interchangeably without limitation. The message names or parameter names in the messages exchanged between the various devices in the embodiments of this application are merely examples, and other names may be used in specific implementations without limitation.

[0144] The encoding method provided in the embodiments of this application will be described below with reference to the communication system shown in Figure 4 and Figure 7. The transmitting device can be any terminal device or network device in the communication system shown in Figure 4, and the receiving device can also be any terminal device or network device in the communication system shown in Figure 4. The transmitting or receiving device described in the following embodiments may include the components shown in Figure 6.

[0145] Figure 7 is a flowchart of an encoding method provided in an embodiment of this application. As shown in Figure 7, the method may include:

[0146] Step 701: The transmitting device determines K first bits based on the first reliability sequence of length N1.

[0147] Where K ≤ N1, and both K and N1 are positive integers.

[0148] The transmitting device can determine the value of K based on the length of the information bit sequence; that is, the length of the information bit sequence can be determined as K. For example, the information bit sequence may include information bits and cyclic redundancy check (CRC) bits, and K can be the sum of the number of information bits and the number of CRC bits in the information bit sequence. Alternatively, the information bit sequence may include only the information bits themselves without CRC bits, and K can be the number of information bits.

[0149] N1 can be understood as the length of the mother code corresponding to the initial transmission sequence. The initial transmission sequence can be referred to in the following description of the initial transmission sequence.

[0150] Optionally, the transmitting device can select the first K bits of the first reliability sequence as the K first bits, in descending order of reliability. Alternatively, it can be described as the K first bits being the K bits with the highest reliability in the first reliability sequence. The first reliability sequence can be denoted as seq1.

[0151] The reliability sequence (such as the first reliability sequence or the second reliability sequence) can be used to indicate the reliability of each bit in the sequence. The larger the reliability value, the more reliable the bit corresponding to that reliability.

[0152] Optionally, the reliability sequence can be predefined by the protocol. The transmitting device can select a first reliability sequence of length N1 from one or more predefined reliability sequences based on N1. For example, if the transmitting device determines that N1 is 32, the first reliability sequence of length 32 can be {0 1 2 4 8 16 3 5 9 6 10 17 12 18 20 24 7 11 13 19 14 21 22 25 26 28 15 23 27 29 30 31}.

[0153] The bit sequence of the first reliability sequence can be defined starting from 0 or starting from 1. That is, the above 0, 1, ..., 31 can be replaced with 1, 2, ..., 32 respectively, without restriction.

[0154] The bit sequence mentioned above can also be described as a number or a sequence number, and this application does not limit it in this way.

[0155] For example, taking the first reliability sequence as {0 1 2 4 8 16 3 5 9 6 10 17 12 18 20 24 7 11 13 19 14 21 22 25 26 28 15 23 27 29 30 31}, and K as 21, the K first bits are the K most reliable bits in the first reliability sequence, that is, the K first bits can be: {17 12 18 20 24 7 11 13 19 14 21 22 25 26 28 15 23 27 29 30 31}.

[0156] Optionally, the K first bits can be denoted as Let I1 represent the set of first bits in a sequence of length N1, where I1 may include K first bits. For example,

[0157] Step 702: The transmitting device determines K second bits based on the second reliability sequence of length N2.

[0158] Where N1 < N2, and N2 is a positive integer. For example, N2 = 2N1.

[0159] Here, N2 can be understood as the length of the mother code corresponding to the retransmission sequence. The retransmission sequence can be referred to in the following description of the retransmission sequence, which will not be repeated here.

[0160] Optionally, the transmitting device can select a second reliability sequence (which can be denoted as seq2) of length N2 from one or more reliability sequences predefined in the protocol based on N2. For example, if the transmitting device determines that N2 is 64, the second reliability sequence of length 64 can be {0 1 2 4 8 16 32 3 5 9 6 17 10 18 12 33 20 34 24 36 7 11 40 19 13 48 14 21 35 26 37 25 22 38 41 28 42 49 44 50 15 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}.

[0161] Among them, the K second bits include the first information bit set and the second information bit set.

[0162] The first information bit set may include the T most reliable bits from the bit set other than the first pre-frozen bit set in the second reliability sequence. Alternatively, it can be described that the transmitting device may select the first T bits from the bit set other than the first pre-frozen bit set in the second reliability sequence as the first information bit set, in descending order of reliability.

[0163] Among them, the first pre-frozen bit set (i.e. It can be determined based on M2 and N2.

[0164] M2 can be determined based on the retransmission resource and N1. For example, M2 can be determined based on the number of bits corresponding to the retransmission resource and N1. For instance, M2 can be the sum of the number of bits corresponding to the retransmission resource and N1. Taking a retransmission resource with 16 bits and N1 with 32 bits as an example, M2 can be determined to be 48.

[0165] It is understood that the number of bits corresponding to the retransmission resource can be determined based on the number of bits carried by the resource element (RE) corresponding to the retransmission resource, and this application does not impose any limitation on this.

[0166] Optionally, the first set of pre-frozen bits can be {0 1 2 3…Q}; where Q can be determined based on M2 and N2. The specific method for determining Q can be found in the description of Q below, and will not be repeated here.

[0167] For example, with Q being 21, the first pre-frozen bit set can be determined as {0 1 2 3…21}.

[0168] Where T is a positive integer less than or equal to K, and T can be determined based on K, M², and N². The specific method for determining T can be referred to the description of T below, and will not be repeated here.

[0169] For example, if K is 21, T can be 19.

[0170] For example, taking the second reliability sequence as {0 1 2 4 8 16 32 3 5 9 6 17 10 18 12 33 20 34 24 36 7 11 40 19 13 48 14 21 35 26 37 25 22 38 41 28 42 49 44 50 15 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}, with K = 21, Q = 21, and T = 19, the first pre-frozen bit set can be determined as {0 1 2 4 8 16 32 3 5 9 6 17 10 18 12 33 20 34 24 36 7 11 40 19 13 48 14 21 35 26 37 25 22 38 41 28 42 49 44 50 15 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}. 3…21}, the first information bit set is the 18 bits with the highest reliability in the second reliability sequence excluding the first pre-frozen bit set, that is, the first information bit set can be: {39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}.

[0171] The second information bit set may include the most reliable (KT) bits from the bits other than the first information bit set and the second pre-frozen bit set in the second reliability sequence. Alternatively, it can be described that the transmitting device may select the first (KT) bits from the bits other than the second pre-frozen bit set and the first information bit set in the second reliability sequence as the second information bit set, in descending order of reliability.

[0172] Among them, the second pre-frozen bit set (which can be denoted as) The second pre-frozen bit set can be determined based on N1. For example, the second pre-frozen bit set can be {0 1 2 3…N1-1}. For instance, if N1 is 32, the second pre-frozen bit set can be {0 1 2 3…31}.

[0173] For example, the second pre-frozen bit set is defined by the second reliability sequence {0 1 2 4 8 16 32 3 5 9 6 17 10 18 12 33 20 34 24 36 7 11 40 19 13 48 14 21 35 26 37 25 22 38 41 28 42 49 44 50 15 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}. The first information bit set is {39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}, with K = 21 and T = 19 as an example. The second information bit set can include the most reliable (KT) bits (i.e., 21-19 = 2) bits in the second reliability sequence other than the first information bit set and the second pre-frozen bit set. That is, the second information bit set can be {52 56}.

[0174] Optionally, the transmitting device can pre-freeze the 0th to (N1-1)th bits in the second reliability sequence, and determine the second information bit set from the remaining bits. This can make the determined second information bit set include one or more bits from the K first bits as much as possible, reducing the number of information bits in data retransmission, simplifying implementation, and improving retransmission performance.

[0175] Optionally, if T equals K, then KT equals 0, meaning there is no second set of information bits, and it is not necessary to determine the aforementioned second pre-frozen bit set. The K second bits include the first set of information bits.

[0176] Optionally, the K second bits can be denoted as Let I2 represent the set of second bits in a sequence of length N2, where I2 may include K second bits. For example,

[0177] Optionally, there is no strict order of execution for steps 701 and 702. Step 701 can be executed first, followed by step 702, or step 702 can be executed first, followed by step 701, or steps 701 and 702 can be executed simultaneously.

[0178] Based on the above description of the first reliability sequence and the second reliability sequence, optionally, the first reliability sequence can be bits other than the second pre-frozen bit set in the second reliability sequence. For example, taking the second reliability sequence as {0 1 2 4 8 16 32 3 5 9 6 17 10 18 12 33 20 34 24 36 7 11 40 19 13 48 14 21 35 26 37 25 22 38 41 28 42 49 44 50 15 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63} and the second pre-frozen bit set as {0 1 2 3…31}, the first reliability sequence can be determined as {0 1 2 4 8 16 3 5 9 6 10}. 17 12 18 20 24 7 11 13 19 14 21 22 25 26 28 15 23 27 29 30 31}.

[0179] Optionally, the K first bits can also be determined based on the difference between the bit indices of the K most reliable bits (excluding the second pre-frozen bit set) in the second reliability sequence and N1. Alternatively, the transmitting device can determine the K first bits in descending order of reliability based on the difference between the bit indices of the first K bits (excluding the second pre-frozen bit set) in the second reliability sequence and N1.

[0180] For example, with the second reliability sequence {0 1 2 4 8 16 32 3 5 9 6 17 10 18 12 33 20 34 24 36 7 11 40 19 13 48 14 21 35 26 37 25 22 38 41 28 42 49 44 50 15 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}, the second pre-frozen bit set is {0 1 2 4 8 16 32 3 5 9 6 17 10 18 12 33 20 34 24 36 7 11 40 19 13 48 14 21 35 26 37 25 22 38 41 28 42 49 44 50 15 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}. Taking {3…31} as an example, with K=21, the most reliable K=21 bits in the second reliability sequence, excluding the second pre-frozen bit set, can be determined as {49 44 50 52 56 39 43 45 51 46 53 54 57 58 60 47 55 59 61 62 63}. Subtracting 32 from each bit number in {49 44 50 52 56 39 43 45 51 46 53 54 57 58 60 47 55 59 61 62 63}, we obtain the K first bits as {17 12 18 20 24 7 11 13 19 14 21 22 25 26 28 15 23 27 29}. 30 31}.

[0181] Understandably, the transmitting device can determine a reliability sequence (such as a second reliability sequence), and based on this reliability sequence, determine K first bits and K second bits, which simplifies implementation. Furthermore, determining K first bits and K second bits using the same reliability sequence improves the consistency of the determined bits, thereby enhancing decoding stability.

[0182] Step 703: The transmitting device determines the information bits corresponding to A first bits out of the K first bits based on the information bit sequence of length K.

[0183] Here, A first bits can be determined based on K first bits and K second bits. For example, A first bits can be bits whose bit indices are different from the third bits corresponding to the K second bits among the K first bits, or it can be described as A first bits being bits among the K first bits that do not belong to the third bits corresponding to the K second bits.

[0184] In this context, the bit index of the third bit corresponding to the second bit with bit index i is i-N1; i is greater than or equal to 0, and i is less than or equal to N2-1. That is to say, the transmitting device can subtract N1 from the bit indexes of K second bits to obtain K third bits.

[0185] For example, taking K as 21, assume the K first bits are {17 12 18 20 24 7 11 13 19 14 21 22 25 26 28 15 23 27 29 30 31}, the K second bits are {52 56 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}, and the bit index of the third bit corresponding to the second bit with bit index i is i-N1, where i is greater than or equal to N1. Then, the K third bits can be {20 24 7 11 13 19 14 21 22 25 26 28 15 23 27 29 30}. 31} Furthermore, the bits whose bit indices differ from those of the K third bits among the K first bits are A first bits, that is, A first bits can be {17 12 18}.

[0186] Based on the above description of the A first bits, optionally, the transmitting device can map the information bit sequence of length K onto the K first bits of the third sequence of length N1 to obtain a fourth sequence of length N1. That is, the transmitting device can map the information bit sequence onto the K information bits of the third sequence and set the values ​​of the remaining N1-K bits of the third sequence to 0.

[0187] Optionally, the transmitting device may sequentially map the information bit sequence to the K first bits of the third sequence with reliability from high to low, or sequentially map the information bit sequence to the K first bits of the third sequence with reliability from low to high, or map the information bit sequence to the K first bits of the third sequence according to any rule. This application does not limit this.

[0188] For example, with K = 21 and the K first bits being {17 12 18 20 24 7 11 13 19 14 21 22 25 26 28 15 23 27 29 30 31}, the 0th bit in the information bit sequence can be mapped to the 17th bit in the third sequence, the 1st bit in the information bit sequence can be mapped to the 12th bit in the third sequence, ..., and the 20th bit in the information bit sequence can be mapped to the 31st bit in the third sequence. Alternatively, the 0th bit in the information bit sequence can be mapped to the 17th bit in the third sequence, the 1st bit in the information bit sequence can be mapped to the 11th bit in the third sequence, ..., and the 20th bit in the information bit sequence can be mapped to the 31st bit in the third sequence. Alternatively, the 0th bit in the information bit sequence is mapped to the 31st bit in the third sequence, the 1st bit in the information bit sequence is mapped to the 30th bit in the third sequence, ..., the 20th bit in the information bit sequence is mapped to the 17th bit in the third sequence.

[0189] Understandably, the sending device can determine the encoded bit sequence (i.e., the second encoded bit sequence) in the initial data transmission based on the K first bits. Since the sending device maps the information bit sequence to the K most reliable bits (i.e., the K first bits) in the third sequence, it can improve the reliability of the information bit sequence transmission, thereby improving the decoding performance.

[0190] Optionally, the transmitting device can determine the information bits corresponding to the A first bits based on the fourth sequence. For example, taking the A first bits as {17 12 18}, the transmitting device can determine the information bits located at the 17th, 12th, and 18th bits in the fourth sequence as the information bits corresponding to the A first bits.

[0191] Optionally, the transmitting device can perform polar coding on the fourth sequence to obtain a second coded bit sequence of length N1.

[0192] Optionally, the transmitting device can perform rate matching on the second coded bit sequence to obtain an initial transmission sequence of length M1. M1 can be determined based on the initial transmission resources. For example, M1 can be the number of bits corresponding to the initial transmission resources (the number of bits corresponding to the initial transmission resources can be understood as the number of bits carried by the RE corresponding to the initial transmission resources).

[0193] M1 can be understood as the length of the rate-matched sequence corresponding to the fourth sequence, or the length of the rate-matched sequence corresponding to the second encoded bit sequence.

[0194] Step 704: The transmitting device maps the information bits corresponding to the A first bits to the A second bits of the first sequence of length (N2-N1) to obtain the second sequence.

[0195] Among them, A second bits are A bits out of K second bits.

[0196] Optionally, the A second bits can be the second bits among the K second bits whose bit indices are less than N1. For example, taking the K second bits as {52 56 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63} and N1 as 32, we can determine that the A second bits are the second bits among the K second bits whose bit indices are less than N1 = 32, so the A second bits can be {29 30 31}.

[0197] The transmitting device can use A second bits in the first sequence as A information bits, map the information bits corresponding to the A first bits to the A information bits (i.e. A second bits) in the first sequence, and set the values ​​of N2-N1-A bits other than the A second bits in the first sequence to 0 to obtain the second sequence.

[0198] For example, with N1 being 32, N2 being 64, A first bits being {17 12 18}, and A second bits being {29 30 31}, the transmitting device can map the information bits located at the 17th, 12th, and 18th bits in the fourth sequence of length 32 to the 29th, 30th, and 31st bits in the first sequence of length 32, and set the values ​​of the remaining 29 bits in the first sequence to 0, thereby obtaining the second sequence.

[0199] Optionally, the transmitting device may map information bits located on high-reliability bits in the fourth sequence to low-reliability bits in the first sequence; alternatively, the transmitting device may map information bits located on high-reliability bits in the fourth sequence to high-reliability bits in the first sequence; alternatively, the transmitting device may map information bits located on low-reliability bits in the fourth sequence to high-reliability bits in the first sequence. This application does not limit the scope of the mapping.

[0200] For example, taking A first bits as {17 12 18} and A second bits as {29 30 31}, the transmitting device can map the information bit located at the 17th bit in the fourth sequence to the 31st bit in the first sequence, map the information bit located at the 12th bit in the fourth sequence to the 30th bit in the first sequence, and map the information bit located at the 18th bit in the fourth sequence to the 29th bit in the first sequence.

[0201] Step 705: The transmitting device performs polar coding on the second sequence to obtain a first coded bit sequence of length (N2-N1).

[0202] Step 706: The transmitting device outputs one or more bits from the first encoded bit sequence; correspondingly, the receiving device acquires the bit sequence to be decoded.

[0203] Optionally, the transmitting device may output one or more bits from the (M2-N1) bits in the first encoded bit sequence; or, the transmitting device may obtain a third encoded bit sequence based on the first encoded bit sequence and the second encoded bit sequence, and output one or more bits from the (M2-N1) bits in the third encoded bit sequence.

[0204] For example, the transmitting device can perform an XOR operation on the first coded bit sequence and the second coded bit sequence to obtain the third coded bit sequence.

[0205] Optionally, for HARQ transmission scenarios, a sequence consisting of one or more bits from the (M2-N1) bits in the first or third coded bit sequence can be called a retransmission sequence.

[0206] Optionally, the transmitting device can modulate the retransmission sequence to obtain a symbol sequence and output the symbol sequence; or, the transmitting device can interleave the retransmission sequence to obtain an interleaved bit sequence, and then modulate the interleaved bit sequence to obtain a symbol sequence and output the symbol sequence.

[0207] Optionally, the symbol sequence sent by the transmitting device to the receiving device may be affected by noise and other interference when transmitted through the channel, and the symbol sequence received by the receiving device is a symbol sequence affected by noise and other interference.

[0208] Optionally, the transmitting device can refer to the aforementioned description of HARQ transmission and send an initial transmission sequence (such as the sequence after polar coding and rate matching of the fourth sequence mentioned above) to the receiving device. The receiving device attempts to demodulate, deinterleave, and de-rate match the received symbol sequence (which is the symbol sequence corresponding to the initial transmission sequence) to obtain the bit sequence to be decoded. It then decodes the bit sequence. If decoding is successful, it sends an acknowledgment frame back to the transmitting device, which can then stop transmitting based on this acknowledgment frame. If decoding fails, the receiving device can buffer the bit sequence to be decoded corresponding to the initial transmission sequence and send a negative acknowledgment frame back to the transmitting device; alternatively, it may choose not to send a negative acknowledgment frame. The transmitting device can continue transmitting the retransmission sequence as incremental redundancy if it receives a negative acknowledgment frame or does not receive an acknowledgment frame within a certain time period. The receiving device can decode both the bit sequence to be decoded corresponding to the received initial transmission sequence and the bit sequence to be decoded corresponding to the retransmission sequence.

[0209] Alternatively, the sending device can combine the initial transmission sequence and the retransmission sequence to reduce transmission overhead.

[0210] Step 707: The receiving device determines K first bits based on the first reliability sequence of length N1.

[0211] Step 708: The receiving device determines K second bits based on a second reliability sequence of length N². Wherein,

[0212] The receiving device can use the same method as the sending device to determine K first bits and K second bits by referring to steps 701 and 702 above, which will not be elaborated here.

[0213] Step 709: The receiving device decodes the bit sequence to be decoded based on A first bits out of K first bits and A second bits out of K second bits to obtain the decoding result.

[0214] The receiving device can use the same method as the sending device, referring to steps 703 and 704 above to determine A first bits and A second bits, and then decode the bit sequence to be decoded.

[0215] Optionally, when decoding the bit sequence to be decoded, the receiving device can decode the bit sequence to be decoded corresponding to the received initial transmission sequence and the bit sequence to be decoded corresponding to the retransmission sequence together based on A first bits and A second bits.

[0216] When decoding the bit sequence to be decoded, the receiving device can determine the information bits located at the A second bits of the bit sequence to be decoded based on the determined A second bits. Since the transmitting device maps the A information bits of the information bit sequence of length K to A first bits and A second bits simultaneously when encoding the information bit sequence, there is a corresponding check relationship between the A first bits and A second bits. Based on this check relationship, the receiving device can determine the information bits located at the A first bits of the bit sequence to be decoded based on the information bits at the A second bits, thus achieving decoding.

[0217] Based on the encoding method shown in Figure 7, the transmitting device can determine the first information bit set and the second information bit set according to the retransmission resources (i.e., the length of the retransmission sequence). Based on the first and second information bit sets, it can determine K second bits. Then, it can map the information bits corresponding to A of the K first bits onto A of the K second bits to construct a polar code. In other words, the transmitting device can construct corresponding polar codes even with different retransmission sequence lengths, thus improving decoding performance. Furthermore, the transmitting device can determine the size of the first information bit set based on K, M2, and N2, and determine K second bits based on the first information bit set. This ensures that the determined K second bits support stable performance under various combinations of retransmission and initial transmission parameters.

[0218] Based on the encoding method shown in Figure 7, unlike the transmitting device which determines the third encoded bit sequence based on the first and second encoded bit sequences, the transmitting device can also determine a sixth sequence based on the second and fourth sequences, and perform polar encoding on the sixth sequence to obtain the third encoded bit sequence. For example, the transmitting device can perform an XOR operation on the third and fourth sequences to obtain the sixth sequence, and then perform polar encoding on the sixth sequence to obtain the third encoded bit sequence.

[0219] Alternatively, the second sequence can be denoted as The fourth sequence can be denoted as The transmitting device performs polar coding on the second sequence to obtain a second coded bit sequence, which can be represented as follows: The transmitting device performs polar coding on the fourth sequence to obtain the first coded bit sequence, which can be represented as follows: Then, the third encoded bit sequence can be represented as Equivalent to in This can be understood as the sixth sequence. That is, the transmitting device can perform an XOR operation on the second and fourth sequences to obtain the sixth sequence, and then perform polar coding on the sixth sequence to obtain the third coded bit sequence.

[0220] in, This is the encoding matrix of a polar code of length N1. For example, G2 is the nth power of the Kronecker product, where... n = log2N1).

[0221] in, This means that the element in the first row and first column of G2 is 1, the element in the first row and second column is 0, the element in the second row and first column is 1, and the element in the second row and second column is 1. That is, G2 contains 4 elements, each of which is either 0 or 1.

[0222] In this application, all elements in the matrix are either "0" or "1". For example, a matrix with N1 rows and N1 columns will include N1×N1 elements, and each element is either 0 or 1. For ease of expression, no spaces are left between columns without affecting the understanding of the scheme.

[0223] Optionally, in different data retransmissions, the transmitting device may output any one or more bits from the third coded bit sequence (or the first coded bit sequence). For example, the transmitting device may determine different start positions and retransmission lengths in different data transmissions to determine different retransmission sequences.

[0224] For example, taking N2 as 2N1 and (M2-N1) as N1 / 4, in the first data retransmission, the starting position can be determined as the (3N1) / 4th bit in the third coded bit sequence (or the first coded bit sequence), and the retransmission length is N1 / 4. Therefore, retransmission sequence 1 includes the (3N1) / 4th bit to the (N1-1th bit) in the third coded bit sequence (or the first coded bit sequence). In the second data retransmission, the starting position can be determined as the (2N1) / 4th bit in the third coded bit sequence (or the first coded bit sequence), and the retransmission length is N1 / 4. Therefore, retransmission sequence 2 includes the (2N1) / 4th bit in the third coded bit sequence (or the first coded bit sequence). In the third data retransmission, the N1 / 4th bit in the third coded bit sequence (or the first coded bit sequence) can be determined as the starting position, and the retransmission length is N1 / 4. Therefore, the retransmission sequence 3 includes the N1 / 4th bit in the third coded bit sequence (or the first coded bit sequence) to the (2N1) / 4-1th bit. In the fourth data retransmission, the 0th bit in the third coded bit sequence (or the first coded bit sequence) can be determined as the starting position, and the retransmission length is N1 / 4. Therefore, the retransmission sequence 4 includes the 0th bit in the third coded bit sequence (or the first coded bit sequence) to the N1 / 4-1th bit.

[0225] Alternatively, in the first data retransmission, the starting position can be determined by the 0th bit of the third coded bit sequence (or the first coded bit sequence), and the retransmission length is N1 / 4. Therefore, retransmission sequence 1 includes bits 0 to N1 / 4-1 of the third coded bit sequence (or the first coded bit sequence). In the second data retransmission, the starting position can be determined by the N1 / 4th bit of the third coded bit sequence (or the first coded bit sequence), and the retransmission length is N1 / 4. Therefore, retransmission sequence 2 includes bits N1 / 4 to (2N1) / 4-1 of the third coded bit sequence (or the first coded bit sequence). In the third data retransmission... In the retransmission, the starting position can be determined by the (2N1) / 4th bit in the third coded bit sequence (or the first coded bit sequence), and the retransmission length is N1 / 4. Therefore, the retransmission sequence 3 includes the (2N1) / 4th bit to the (3N1) / 4-1th bit in the third coded bit sequence (or the first coded bit sequence). In the fourth data retransmission, the starting position can be determined by the (3N1) / 4th bit in the third coded bit sequence (or the first coded bit sequence), and the retransmission length is N1 / 4. Therefore, the retransmission sequence 4 includes the (3N1) / 4th bit to the N1-1th bit in the third coded bit sequence (or the first coded bit sequence).

[0226] The above-described retransmission sequence for different data retransmissions is merely an example. The retransmission lengths for different data retransmissions can be the same or different. Furthermore, the positions of the retransmission sequences in the third coded bit sequence (or the first coded bit sequence) in different data retransmissions can be sequential, reversed, or in any order. This application does not impose any limitations on this.

[0227] Understandably, the transmitting device can determine the retransmission sequence (i.e., one or more bits from the (M2-N1) bits in the aforementioned coded bit sequence) in different data retransmissions based on the third coded bit sequence (or the first coded bit sequence), and can transmit retransmission sequences of different lengths in different data retransmissions. Determining a third coded bit sequence (or the first coded bit sequence) and transmitting one or more bits from it in different data retransmissions simplifies implementation and reduces the workload of the transmitting device.

[0228] Optionally, the transmitting device can determine the retransmission sequence based on K first bits and K second bits, where the K second bits may include a set of first information bits and a set of second information bits. Based on the description of determining the set of first and second information bits in step 702 above, the transmitting device can also determine the set of first and second information bits according to the rate matching method corresponding to the fourth sequence; or, the transmitting device can also determine the set of first and second information bits according to the relationship between the length of the initial transmission sequence and N1. This application provides three possible implementations:

[0229] In the first possible implementation, the length M1 of the initial transmission sequence can be equal to N1. This can be understood as not performing rate matching on the second encoded bit sequence (at this time, the second encoded bit sequence can be the initial transmission sequence), or it can be understood as performing rate matching on the second encoded bit sequence and then the length of the initial transmission sequence is the same as the length of the second encoded bit sequence. The determination of the first information bit set and the second information bit set can refer to step 702 above, which will not be elaborated here.

[0230] In the second possible implementation, the rate matching method corresponding to the fourth sequence can be puncturing, that is, the transmitting device can puncture the second encoded bit sequence to obtain an initial transmission sequence of length M1, where M1 is less than N1.

[0231] To determine the first set of information bits, the first set of information bits may include the T most reliable bits among the bits in the second reliability sequence, excluding the first and third pre-frozen bit sets. Alternatively, it can be understood that the first pre-frozen bit set may also include the third pre-frozen bit set, and the first set of information bits may include the T most reliable bits among the bits in the second reliability sequence, excluding the first pre-frozen bit set.

[0232] The third pre-frozen bit set can be determined based on one or more rate-matching bits corresponding to the fourth sequence.

[0233] Optionally, the third pre-frozen bit set can be determined by adding N1 to one or more rate-matching bits corresponding to the fourth sequence. For example, if the one or more rate-matching (e.g., punched) bits corresponding to the fourth sequence are {0 1} and N1 is 32, the third pre-frozen bit set can be {32 33}.

[0234] For example, with the second reliability sequence {0 1 2 4 8 16 32 3 5 9 6 17 10 18 12 33 20 34 24 36 7 11 40 19 13 48 14 21 35 26 37 25 22 38 41 28 42 49 44 50 15 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}, K is 21, T is 19, the first pre-frozen bit set is {0 1 2 3…21}, and the third pre-frozen bit set is {32…21}. Taking {33} (or it can be understood as the first pre-frozen bit set being {0 1 2 3…21 32 33}) as an example, the first information bit set can be {39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}.

[0235] To determine the second set of information bits, the second set of information bits may include the (KT) most reliable bits among the bits in the second reliability sequence, excluding the first set of information bits, the second pre-frozen set of bits, and the third pre-frozen set of bits. Alternatively, it can be understood that the second pre-frozen set of bits may also include the third pre-frozen set of bits, and the second set of information bits may include the (KT) most reliable bits among the bits in the second reliability sequence, excluding the first set of information bits and the second pre-frozen set of bits.

[0236] For example, with the second reliability sequence {0 1 2 4 8 16 32 3 5 9 6 17 10 18 12 33 20 34 24 36 7 11 40 19 13 48 14 21 35 26 37 25 22 38 41 28 42 49 44 50 15 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}, K is 21, T is 19, and the first information bit set is {39 29 43 30 45 51 46 53 54 57 58 60}. For example, if the second pre-frozen bit set is {0 1 2 3…31} and the third pre-frozen bit set is {32 33} (or it can be understood as the second pre-frozen bit set being {0 1 2 3…31 32 33}), then the second information bit set can be {52 56}.

[0237] In the third possible implementation, the rate matching method corresponding to the fourth sequence can be shortening, that is, the transmitting device can shorten the second encoded bit sequence to obtain an initial transmission sequence of length M1, where M1 is less than N1.

[0238] For determining the first set of information bits, the first set of information bits may include the T most reliable bits among the bits in the second reliability sequence, excluding the first set of pre-frozen bits, the third set of pre-frozen bits, and the fourth set of pre-frozen bits. Alternatively, it can be understood that the first set of pre-frozen bits may also include the third set of pre-frozen bits and the fourth set of pre-frozen bits, and the first set of information bits may include the T most reliable bits among the bits in the second reliability sequence, excluding the first set of pre-frozen bits.

[0239] The third pre-frozen bit set can be determined based on one or more rate-matching bits corresponding to the fourth sequence.

[0240] Optionally, the third pre-frozen bit set can be determined by adding N1 to one or more rate-matching bits corresponding to the fourth sequence. For example, if the one or more rate-matching (i.e. shortened) bits corresponding to the fourth sequence are {30 31} and N1 is 32, the third pre-frozen bit set can be {62 63}.

[0241] The fourth pre-frozen bit set may include one or more rate-matching bit sets corresponding to the fourth sequence; that is, the fourth pre-frozen bit set may include one or more shortened bit sets corresponding to the fourth sequence. For example, if the one or more rate-matching (i.e. shortened) bit sets corresponding to the fourth sequence are {30 31}, the fourth pre-frozen bit set may be {30 31}.

[0242] For example, with the second reliability sequence {0 1 2 4 8 16 32 3 5 9 6 17 10 18 12 33 20 34 24 36 7 11 40 19 13 48 14 21 35 26 37 25 22 38 41 28 42 49 44 50 15 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}, K is 21, T is 19, the first pre-frozen bit set is {0 1 2 3…21}, and the third pre-frozen bit set is {62}. Taking the fourth pre-frozen bit set as {30 31} (or the first pre-frozen bit set as {0 1 2 3…21 30 31 62 63}) as an example, the first information bit set can be {23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 47 55 59 61}.

[0243] In the third possible implementation, the determination of the second information bit set can refer to the determination of the second information bit set in the second possible implementation, and will not be repeated here.

[0244] For example, with the second reliability sequence {0 1 2 4 8 16 32 3 5 9 6 17 10 18 12 33 20 34 24 36 7 11 40 19 13 48 14 21 35 26 37 25 22 38 41 28 42 49 44 50 15 52 23 56 27 39 29 43 30 45 51 46 53 54 57 58 60 31 47 55 59 61 62 63}, K is 21, T is 19, and the first information bit set is {23 56 27 39 29 43 30 45 51 46 53 54}. For example, if the second set of pre-frozen bits is {0 1 2 3…31} and the third set of pre-frozen bits is {62 63} (or it can be understood as the second set of pre-frozen bits being {0 1 2 3…31 62 63}), then the second set of information bits can be {50 52}.

[0245] Based on the second and third possible implementations, when the rate matching method corresponding to the fourth sequence is puncturing, one or more rate matching bits corresponding to the fourth sequence are located at the beginning of the fourth sequence. In this case, the first pre-frozen bit set may include the fourth pre-frozen bit set, and the fourth pre-frozen bit set does not need to be considered when determining the first information bit set. When the rate matching method corresponding to the fourth sequence is shortening, one or more rate matching bits corresponding to the fourth sequence are located at the end of the fourth sequence. In this case, the first pre-frozen bit set does not include the fourth pre-frozen bit set, and the fourth pre-frozen bit set needs to be considered when determining the first information bit set.

[0246] Furthermore, regardless of whether the rate matching method corresponding to the fourth sequence is shortening or punching, the second pre-frozen bit set can include the fourth pre-frozen bit set. Therefore, the fourth pre-frozen bit set can be disregarded when determining the second information bit set.

[0247] It is understandable that when the rate matching method corresponding to the fourth sequence is puncturing or shortening, the first information bit set may include the T most reliable bits in the second reliability sequence other than the first pre-frozen bit set and the third pre-frozen bit set. That is, when determining the first information bit set, pre-freezing one or more rate matching bits in the initial data transmission, as well as the bits of one or more rate matching bits in the initial data transmission in the sequence of length N2, can improve decoding performance.

[0248] Based on the above description of the rate matching method corresponding to the fourth sequence, optionally, when the rate matching method corresponding to the fourth sequence is punching or shortening, the K first bits in step 701 may include the K most reliable bits among the bits other than the fourth pre-frozen bit set in the first reliability sequence; or it can be described that the K first bits can be determined based on the K most reliable bits among the bits other than the third and fourth pre-frozen bit sets in the second reliability sequence.

[0249] For example, the transmitting device can determine the K most reliable bits in the second reliability sequence, excluding the third and fourth pre-frozen bit sets, and obtain the K first bits by subtracting N1 from the bit index of each of the K bits.

[0250] Optionally, the receiving device can determine the first set of information bits and the second set of information bits based on the rate matching method corresponding to the fifth sequence. The fifth sequence is determined based on the sequence of bits to be decoded during the initial data transmission.

[0251] It is understandable that the fifth sequence corresponds to the fourth sequence. The receiving device determines the first information bit set and the second information bit set based on one or more rate matching bits corresponding to the fifth sequence. For details, please refer to the above description of the sending device determining the first information bit set and the second information bit set based on one or more rate matching bits corresponding to the fourth sequence, which will not be repeated here.

[0252] Optionally, the first set of information bits can be determined based on the second reliability sequence and the first set of pre-frozen bits. The first set of pre-frozen bits can be determined based on Q, where Q can be determined based on M2 and N2.

[0253] In the first example, Q can be... in, To round up. For example, the first pre-frozen bit set can be...

[0254] In the second example, Q can be... For example, the first pre-frozen bit set can be

[0255] For example, if N2 is 2*N1, Q can be N2 / 2-1 when M2 / N2 is less than 5 / 8; or, if M2 / N2 is greater than or equal to 5 / 8 and less than 3 / 4, Q can be 3N2 / 8-1; or, if M2 / N2 is greater than or equal to 3 / 4, Q can be N2 / 4-1.

[0256] In the third example, Q can be... For example, the first pre-frozen bit set can be

[0257] It is understandable that the transmitting device can determine Q based on the length of the retransmission sequence (i.e., M2-N1) so that the determined Q meets the communication requirements. Then, it can determine the retransmission sequence based on the first pre-frozen bit set, so that the retransmission performance of the determined retransmission sequence is stable and the decoding performance can be improved.

[0258] Optionally, the first set of information bits may include the T most reliable bits from the second reliability sequence, excluding the first pre-frozen set of bits. Here, T can be determined based on K, M², and N². This application proposes several possible implementations:

[0259] In the first possible implementation, T can be T if M² / N² is greater than or equal to the first threshold. Alternatively, if M2 / N2 is greater than or equal to the second threshold and less than the first threshold, T can be... Alternatively, if M2 / N2 is less than the second threshold and the code rate is less than or equal to the third threshold, T can be... Alternatively, if M2 / N2 is less than the second threshold and the bit rate is greater than the third threshold, T can be...

[0260] The first threshold is greater than the second threshold.

[0261] The first threshold can be predefined, or it can be determined based on the actual communication scenario or situation. For example, the first threshold can be 3 / 4.

[0262] At higher bit rates, the more information bits mapped to the second bit, the more stable the retransmission performance; at lower bit rates, the fewer information bits mapped to the second bit, the more stable the retransmission performance. A third threshold can be set to a value close to 1 / 2 to determine the bit rate, thereby determining the number of second bits corresponding to different bit rates and ensuring stable retransmission performance.

[0263] The second threshold can be predefined, or it can be determined based on the actual communication scenario or situation. For example, the second threshold can be 5 / 8.

[0264] The third threshold can be predefined, or it can be determined based on the actual communication scenario or situation. For example, the third threshold can be 1 / 2, or it can be 7 / 16.

[0265] For example, taking a first threshold of 3 / 4, a second threshold of 5 / 8, and a third threshold of 1 / 2 as an example, when M² / N² is greater than or equal to 3 / 4, T can be... Alternatively, if M² / N² is greater than or equal to 5 / 8 and less than 3 / 4, T can be... Alternatively, if M2 / N2 is less than 5 / 8 and the code rate is less than or equal to 1 / 2, T can be... Alternatively, when M2 / N2 is less than 5 / 8 and the bit rate is greater than 1 / 2, T can be...

[0266] Based on the first possible implementation, the transmitting device can determine the corresponding T when the length of the retransmission sequence (the length of the retransmission sequence is M2-N1) is N1 / 4. That is, the interval length corresponding to different M2 / N2 is 1 / 4, which can make the retransmission performance of the retransmission sequence with a length of N1 / 4 stable and improve the decoding performance.

[0267] In the second possible implementation, when M² / N² is greater than or equal to the second threshold and less than the first threshold, T can be... Alternatively, T can be K if M2 / N2 is greater than or equal to the first threshold, or if M2 / N2 is less than the second threshold.

[0268] The first threshold or the second threshold can be referred to the description of the first threshold and the second threshold in the first possible implementation, which will not be repeated here.

[0269] For example, taking a first threshold of 3 / 4 and a second threshold of 5 / 8 as an example, when M2 / N2 is greater than or equal to 5 / 8 and less than 3 / 4, T can be... Alternatively, if M2 / N2 is greater than or equal to 3 / 4, or if M2 / N2 is less than 5 / 8, then T can be K.

[0270] Based on the second possible implementation, the transmitting device can determine the corresponding T when the length of the retransmission sequence (the length of the retransmission sequence is M2-N1) is N1 / 4. That is, the interval length corresponding to different M2 / N2 is 1 / 4, which can make the retransmission performance of the retransmission sequence with a length of N1 / 4 stable and improve the decoding performance.

[0271] In the third possible implementation, when M² / N² is greater than or equal to the fourth threshold and less than the second threshold, T can be... Alternatively, if M2 / N2 is greater than or equal to the second threshold and less than the first threshold, T can be... Alternatively, if M2 / N2 is greater than or equal to the first threshold and less than the fifth threshold, T can be...

[0272] Among them, the fifth threshold is greater than the first threshold, and the second threshold is greater than the fourth threshold.

[0273] The first threshold or the second threshold can be referred to the description of the first threshold and the second threshold in the first possible implementation, which will not be repeated here.

[0274] The fourth threshold can be predefined, or it can be determined based on the actual communication scenario or situation. For example, the fourth threshold can be 9 / 16.

[0275] The fifth threshold can be predefined, or it can be determined based on the actual communication scenario or situation. For example, the fifth threshold can be 7 / 8.

[0276] For example, taking a first threshold of 3 / 4, a second threshold of 5 / 8, a fourth threshold of 9 / 16, and a fifth threshold of 7 / 8 as an example, when M² / N² is greater than or equal to 9 / 16 and less than 5 / 8, T can be... Alternatively, if M² / N² is greater than or equal to 5 / 8 and less than 3 / 4, T can be... Alternatively, if M² / N² is greater than or equal to 3 / 4 and less than 7 / 8, T can be...

[0277] Based on the third possible implementation, the transmitting device can determine the corresponding T when the length of the retransmission sequence (the length of the retransmission sequence is M2-N1) is N1 / 8. That is, the interval length corresponding to different M2 / N2 is 1 / 8, which can make the retransmission performance of the retransmission sequence with a length of N1 / 8 stable and improve the decoding performance.

[0278] Based on the description of the above method, this application provides five possible embodiments for determining the retransmission sequence:

[0279] In a first possible embodiment, the transmitting device can determine that the length of the information bit sequence is K, the length of the initial transmission sequence is M1 = N1, N1 is the length of the mother code corresponding to the initial transmission sequence, the length of the retransmission sequence is (M2 - N1), and the length of the mother code corresponding to the retransmission sequence is N2 = 2N1. The specific process of determining the retransmission sequence can be shown in Figure 8 below.

[0280] Step 801: The transmitting device determines K first bits.

[0281] Specifically, the transmitting device can determine K first bits based on the second reliability sequence. Further, the transmitting device can determine the K most reliable bits from the bits outside the second pre-frozen bit set in the second reliability sequence. Then, the transmitting device can obtain the K second bits by subtracting N1 from the bit indices of each of the K first bits.

[0282] For details, please refer to the above description of determining the K first bits, which will not be repeated here.

[0283] The first reliability sequence or the second reliability sequence can be referred to the above description of the first reliability sequence or the second reliability sequence, and will not be repeated here.

[0284] Specifically, the transmitting device can map an information bit sequence of length K onto K first bits of a third sequence of length N1 to obtain a fourth sequence of length N1; furthermore, the transmitting device can perform polar coding on the fourth sequence to obtain a second coded bit sequence.

[0285] Step 802: The transmitting device determines K second bits.

[0286] The K second bits can include the first set of information bits and the second set of information bits.

[0287] The first set of information bits may include the T most reliable bits from the second reliability sequence, excluding the first set of pre-frozen bits.

[0288] The first pre-frozen bit set can be:

[0289] Where M² / N² is greater than or equal to 3 / 4, T can be... Alternatively, if M² / N² is greater than or equal to 5 / 8 and less than 3 / 4, T can be... Alternatively, if M2 / N2 is less than 5 / 8 and the code rate is less than or equal to 1 / 2, T can be... Alternatively, when M2 / N2 is less than 5 / 8 and the bit rate is greater than 1 / 2, T can be...

[0290] The second set of information bits may include the most reliable (KT) bits in the second reliability sequence, excluding the first set of information bits and the second set of pre-frozen bits.

[0291] The second pre-frozen bit set may include {0 1 2…N1}.

[0292] Optionally, there is no strict order of execution for steps 801 and 802. Step 801 can be executed first, followed by step 802, or step 802 can be executed first, followed by step 801, or steps 801 and 802 can be executed simultaneously.

[0293] Step 803: The transmitting device determines the information bits corresponding to A first bits out of the K first bits based on the information bit sequence of length K.

[0294] Step 803 can be referred to step 703 above, and will not be repeated here.

[0295] Step 804: The transmitting device maps the information bits corresponding to the A first bits to the A second bits of the first sequence of length N1 to obtain the second sequence.

[0296] Among them, K second bits include A second bits.

[0297] Step 804 can be referred to step 704 above, and will not be repeated here.

[0298] Step 805: The transmitting device performs polar coding on the second sequence to obtain a first coded bit sequence of length N1.

[0299] Step 806: The transmitting device determines a retransmission sequence of length (M2-N1) based on the first encoded bit sequence.

[0300] The transmitting device can perform an XOR operation on the first and second encoded bit sequences to obtain the third encoded bit sequence. Furthermore, the transmitting device can determine that (M2-N1) bits of the third encoded bit sequence are the retransmission sequence.

[0301] Optionally, the transmitting device can perform an XOR operation on the second sequence and the fourth sequence to obtain the sixth sequence, perform polar coding on the sixth sequence to obtain a third coded bit sequence of length N1, and further, the transmitting device can determine that (M2-N1) bits of the third coded bit sequence are retransmission sequences.

[0302] In the second possible embodiment, the transmitting device can determine that the length of the information bit sequence is K, the length of the initial transmission sequence is M1 = N1, N1 is the length of the mother code corresponding to the initial transmission sequence, the length of the retransmission sequence is (M2 - N1), and the length of the mother code corresponding to the retransmission sequence is N2 = 2N1. The steps for determining the retransmission sequence can be referred to Figure 8. The relevant content for determining the K second bits in the second possible embodiment differs from that in the first possible embodiment.

[0303] Among them, the K second bits may include the first set of information bits and the second set of information bits.

[0304] The first set of information bits may include the T most reliable bits from the second reliability sequence, excluding the first set of pre-frozen bits.

[0305] The first pre-frozen bit set can be: Alternatively, if M² / N² is less than 5 / 8, Q can be N² / 2-1; or if M² / N² is greater than or equal to 5 / 8 and less than 3 / 4, Q can be 3N² / 8-1; or if M² / N² is greater than or equal to 3 / 4, Q can be N² / 4-1.

[0306] Where M² / N² is greater than or equal to 5 / 8 and less than 3 / 4, T can be... Alternatively, if M2 / N2 is greater than or equal to 3 / 4, or if M2 / N2 is less than 5 / 8, then T can be K.

[0307] The second set of information bits may include the most reliable (KT) bits in the second reliability sequence, excluding the first set of information bits and the second set of pre-frozen bits.

[0308] The second pre-frozen bit set may include {0 1 2…N1}.

[0309] In the third possible embodiment, the transmitting device can determine that the length of the information bit sequence is K, the length of the initial transmission sequence is M1 = N1, N1 is the length of the mother code corresponding to the initial transmission sequence, the length of the retransmission sequence is (M2 - N1), and the length of the mother code corresponding to the retransmission sequence is N2 = 2N1. The steps for determining the retransmission sequence can be referred to Figure 8. The relevant content for determining the K second bits in the third possible embodiment differs from that in the first possible embodiment.

[0310] The K second bits can include the first set of information bits and the second set of information bits.

[0311] The first set of information bits may include the T most reliable bits from the second reliability sequence, excluding the first set of pre-frozen bits.

[0312] The first pre-frozen bit set can be:

[0313] Where M² / N² is greater than or equal to 9 / 16 and less than 5 / 8, T can be... Alternatively, when M2 / N2 is greater than or equal to 5 / 8 and less than 3 / 4, T can be Alternatively, when M2 / N2 is greater than or equal to 3 / 4 and less than 7 / 8, T can be

[0314] Among them, the second information bit set may include the (K-T) most reliable bits among the bits in the second reliability sequence except the first information bit set and the second pre-frozen bit set.

[0315] Among them, the second pre-frozen bit set may include {0 1 2…N1}.

[0316] In the fourth possible embodiment, the sending device may determine that the length of the information bit sequence is K, the length of the initial transmission sequence M1 < N1 (the rate matching method corresponding to the initial transmission sequence is puncturing), N1 is the length of the mother code corresponding to the initial transmission sequence, the length of the retransmission sequence is (M2-N1), and the length of the mother code corresponding to the retransmission sequence is N2 = 2N1. The steps for determining the retransmission sequence can be referred to as shown in FIG. 8. In the fourth possible embodiment, the determination of the K first bits is different from the first possible embodiment. In addition, the relevant content for determining the K second bits in the fourth possible embodiment is different from the first possible embodiment.

[0317] Among them, the K first bits can be determined according to the K most reliable bits among the bits in the second reliability sequence except the third pre-frozen bit set and the fourth pre-frozen bit set. Specifically, the sending device may determine the K most reliable bits among the bits in the second reliability sequence except the third pre-frozen bit set and the fourth pre-frozen bit set. Further, the sending device may obtain the K first bits by subtracting the bit numbers of the K bits by N1 respectively.

[0318] Among them, the third pre-frozen bit set and the fourth pre-frozen bit set can be referred to the description of the third pre-frozen bit set and the fourth pre-frozen bit set above, and will not be elaborated here.

[0319] Among them, the K second bits may include the first information bit set and the second information bit set.

[0320] Among them, the first information bit set may include the T most reliable bits among the bits in the second reliability sequence except the first pre-frozen bit set and the third pre-frozen bit set.

[0321] Wherein, when M2 / N2 is less than 5 / 8, Q can be N2 / 2 - 1; or, when M2 / N2 is greater than or equal to 5 / 8 and less than 3 / 4, Q can be 3N2 / 8 - 1; or, when M2 / N2 is greater than or equal to 3 / 4, Q can be N2 / 4 - 1.

[0322] Wherein, the third pre-frozen bit set can be determined according to the results of adding one or more punctured bits corresponding to the fourth sequence to N1 respectively.

[0323] Wherein, when M2 / N2 is greater than or equal to 5 / 8 and less than 3 / 4, T can be Or, when M2 / N2 is greater than or equal to 3 / 4, or M2 / N2 is less than 5 / 8, T can be K.

[0324] Wherein, the second information bit set can include the (K - T) most reliable bits among the bits other than the first information bit set, the second pre-frozen bit set, and the third pre-frozen bit set in the second reliability sequence.

[0325] Wherein, the second pre-frozen bit set can include {0 1 2…N1}.

[0326] In the fifth possible embodiment, the sending device can determine that the length of the information bit sequence is K, the length of the initial transmission sequence M1 < N1 (the rate matching method corresponding to the initial transmission sequence is shortening), N1 is the mother code length corresponding to the initial transmission sequence, the length of the retransmission sequence is (M2 - N1), and the mother code length corresponding to the retransmission sequence is N2 = 2N1. The steps for determining the retransmission sequence can be referred to as shown in FIG. 8. In the fifth possible embodiment, the determination of the K first bits is different from that in the first possible embodiment. In addition, the relevant content for determining the K second bits in the fifth possible embodiment is different from that in the first possible embodiment.

[0327] Wherein, the K first bits can be determined according to the K most reliable bits among the bits other than the third pre-frozen bit set and the fourth pre-frozen bit set in the second reliability sequence. Specifically, the sending device can determine the K most reliable bits among the bits other than the third pre-frozen bit set and the fourth pre-frozen bit set in the second reliability sequence. Further, the sending device can obtain the K first bits by subtracting N1 from the bit sequence numbers of the K bits respectively.

[0328] Wherein, the K second bits can include the first information bit set and the second information bit set.

[0329] The first set of information bits may include the T most reliable bits from the bits in the second reliability sequence, excluding the first set of pre-frozen bits, the third set of pre-frozen bits, and the fourth set of pre-frozen bits.

[0330] Specifically, when M² / N² is less than 5 / 8, Q can be N² / 2-1; or when M² / N² is greater than or equal to 5 / 8 and less than 3 / 4, Q can be 3N² / 8-1; or when M² / N² is greater than or equal to 3 / 4, Q can be N² / 4-1.

[0331] The third pre-frozen bit set can be determined by adding N1 to one or more shortened bits corresponding to the fourth sequence.

[0332] The fourth pre-frozen bit set may include one or more shortened bits corresponding to the fourth sequence.

[0333] Where M² / N² is greater than or equal to 5 / 8 and less than 3 / 4, T can be... Alternatively, if M2 / N2 is greater than or equal to 3 / 4, or if M2 / N2 is less than 5 / 8, then T can be K.

[0334] The second set of information bits may include the most reliable (KT) bits in the second reliability sequence, excluding the first set of information bits, the second set of pre-frozen bits, and the third set of pre-frozen bits.

[0335] The second pre-frozen bit set may include {0 1 2…N1}.

[0336] Based on the description of the first to fifth possible embodiments above, the method by which the transmitting device determines A first bits and A second bits can also be applied to the receiving device. That is, the receiving device can determine A first bits and A second bits according to the method by which the transmitting device determines A first bits and A second bits, which will not be elaborated here.

[0337] In addition, the receiving device can decode the bit sequence to be decoded based on the determined A first bits and A second bits to obtain the decoding result.

[0338] It is understood that in this application, M2 / N2 greater than the threshold can be replaced with M2 / N2 greater than or equal to the threshold, or M2 / N2 less than the threshold can be replaced with M2 / N2 less than or equal to the threshold, or M2 / N2 greater than or equal to the threshold can be replaced with M2 / N2 greater than the threshold, or M2 / N2 less than or equal to the threshold can be replaced with M2 / N2 less than the threshold. The threshold can be any of the above-mentioned thresholds or a specific numerical value. For example, when M2 / N2 is greater than or equal to the second threshold and less than the first threshold, T is... Taking the case where T is K when M² / N² is greater than or equal to the first threshold, or when M² / N² is less than the second threshold, it can be replaced with the case where T is K when M² / N² is greater than the second threshold and less than or equal to the first threshold. T is K when M² / N² is greater than the first threshold, or when M² / N² is less than or equal to the second threshold. Alternatively, it can be replaced by: T is K when M² / N² is greater than the second threshold and less than the first threshold. T is K when M² / N² is greater than or equal to the first threshold, or when M² / N² is less than or equal to the second threshold. It is understood that the arbitrary bit set shown in the embodiments of this application is merely an example, and the order of elements in the bit set is not limited.

[0339] The various embodiments of this application can be implemented independently or in combination, without limitation. Unless otherwise specified or in conflict of logic, the terminology and / or descriptions between the different embodiments provided in this application are consistent and can be referenced mutually. Technical features in different embodiments can be combined to form new embodiments based on their inherent logical relationships.

[0340] It is understood that in the embodiments of this application, the executing entity may perform some or all of the steps in the embodiments of this application. These steps or operations are merely examples, and the embodiments of this application may also perform other operations or variations thereof. Furthermore, the various steps may be executed in different orders as presented in the embodiments of this application, and it is not necessarily necessary to execute all the operations in the embodiments of this application.

[0341] The foregoing primarily describes the solutions provided in this application from the perspective of device-to-device interaction. It is understood that each device, in order to achieve the aforementioned functions, includes corresponding hardware structures and / or software modules for executing each function. Those skilled in the art will readily recognize that, based on the algorithmic steps of the examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

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

[0343] With each functional module divided according to its corresponding function, Figure 9 shows a transmitting device 90. The transmitting device 90 can perform the actions performed by the transmitting device in the methods shown in Figures 7 to 8. All relevant content of each step involved in the above method embodiments can be referred to 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.

[0344] The transmitting device 90 may include a transceiver module 901 and a processing module 902. Exemplarily, the transmitting device 90 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 90 is a communication device, the transceiver module 901 may be a transceiver, which may include an antenna and radio frequency circuits, etc.; the processing module 902 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the transmitting device 90 is a component having the aforementioned transmitting device functions, the transceiver module 901 may be a radio frequency unit; the processing module 902 may be a processor (or processing circuit), such as a baseband processor. When the transmitting device 90 is a chip system, the transceiver module 901 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 902 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 901 in the embodiments of this application can be implemented by a transceiver or transceiver-related circuit components; the processing module 902 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0345] For example, the transceiver module 901 can be used to execute all the transceiver operations performed by the transmitting device in the embodiments shown in Figures 7 and 8, and / or to support other processes for the technology described herein; the processing module 902 can be used to execute all operations other than the transceiver operations performed by the transmitting device in the embodiments shown in Figures 7 and 8, and / or to support other processes for the technology described herein.

[0346] Figure 10 shows a receiving device 100, which can perform the actions performed by the receiving device in the methods shown in Figures 7 and 8 above. All relevant content of each step involved in the above method embodiments can be referred to the functional description of the corresponding functional module, and the technical effects that can be obtained can be referred to the above method embodiments, which will not be repeated here.

[0347] The receiving device 100 may include a transceiver module 1001 and a processing module 1002. For example, the receiving device 100 may be a communication device, or a chip or other combination device or component having the aforementioned receiving device functions. When the receiving device 100 is a communication device, the transceiver module 1001 may be a transceiver, which may include an antenna and radio frequency circuits; the processing module 1002 may be a processor (or processing circuit), such as a baseband processor, which may include one or more CPUs. When the receiving device 100 is a component having the aforementioned receiving device functions, the transceiver module 1001 may be a radio frequency unit; the processing module 1002 may be a processor (or processing circuit), such as a baseband processor. When the receiving device 100 is a chip system, the transceiver module 1001 may be an input / output interface of a chip (e.g., a baseband chip); the processing module 1002 may be a processor (or processing circuit) of the chip system, and may include one or more central processing units. The transceiver module 1001 in this embodiment can be implemented by a transceiver or transceiver-related circuit components; the processing module 1002 can be implemented by a processor or processor-related circuit components (or, referred to as processing circuit).

[0348] For example, the transceiver module 1001 can be used to execute all the transceiver operations performed by the receiving device in the embodiment shown in FIG7, and / or to support other processes of the technology described herein; the processing module 1002 can be used to execute all operations other than the transceiver operations performed by the receiving device in the embodiment shown in FIG7, and / or to support other processes of the technology described herein.

[0349] As another possible implementation, the transceiver module 901 in Figure 9 can be replaced by a transceiver unit that integrates the functions of the transceiver module 901; the processing module 902 can be replaced by a processor that integrates the functions of the processing module 902. Furthermore, the transmitting end device 90 shown in Figure 9 may also include a memory. Alternatively, the transceiver module 1001 in Figure 10 can be replaced by a transceiver unit that integrates the functions of the transceiver module 1001; the processing module 1002 can be replaced by a processor that integrates the functions of the processing module 1002. Furthermore, the receiving end device 100 shown in Figure 10 may also include a memory.

[0350] Alternatively, when the processing module 902 is replaced by a processor and the transceiver module 901 is replaced by a transceiver, the transmitting end device 90 involved in the embodiments of this application can also be the communication device 110 shown in FIG11. Or, when the processing module 1002 is replaced by a processor and the transceiver module 1001 is replaced by a transceiver, the receiving end device 100 involved in the embodiments of this application can also be the communication device 110 shown in FIG11.

[0351] The processor can be logic circuit 1101, and the transceiver can be interface circuit 1102. Furthermore, the communication device 110 shown in Figure 11 may also include a memory 1103. The memory 1103 can exist independently of the processor or be integrated with it. The memory 1103 can be used to store instructions, program code, or some data. The memory 1103 can be located inside or outside the communication device 110, without limitation.

[0352] This application also provides a communication device, as shown in FIG12. This communication device can be applied to the methods shown in any of the embodiments of FIG7 to FIG8. As shown in FIG12, the communication device includes a processing module and a transceiver module. The processing module may be one or more processors, and the transceiver module may be a transceiver or a communication interface. This communication device can be used to implement the sending or receiving device involved in any of the above method embodiments, or to implement the functions of the device involved in any of the above method embodiments. The device or device function may be a network component in a hardware device, a software function running on dedicated hardware, or a virtualization function instantiated on a platform (e.g., a cloud platform). Optionally, the communication device may further include a storage module for storing the program code and data of the communication device.

[0353] In one example, the communication device functions as a transmitting device or is a chip applied within a transmitting device, and executes the steps performed by the transmitting device in the above method embodiments. The transceiver module is used to specifically execute the transmitting and / or receiving actions performed by the transmitting device in any of the embodiments of Figures 7 and 8, for example, supporting the transmitting device in performing other processes of the technology described herein. The processing module can be used to support the communication device in performing the processing actions in the above method embodiments, for example, supporting the transmitting device in performing other processes of the technology described herein.

[0354] To achieve the above functions, the chip of this application may include hardware structures and / or software modules corresponding to the execution of each function. Those skilled in the art will readily recognize that, based on the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein, this application can be implemented in hardware or a combination of hardware and computer software. Whether a function is executed in hardware or by computer software driving hardware depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0355] In one possible implementation, when the transmitting or receiving device is a chip, the transceiver module can be a communication interface, pins, or circuits. The communication interface can be used to input data to be processed to the processor and can output the processor's processing results. Specifically, the communication interface can be a general purpose input / output (GPIO) interface, which can connect to multiple peripheral devices (such as LCD displays, cameras, radio frequency (RF) modules, antennas, etc.). The communication interface is connected to the processor via a bus.

[0356] The processing module can be a processor, which can execute computer execution instructions stored in the storage module to cause the chip to execute the methods involved in any of the embodiments shown in Figures 7 and 8. Further, the processor may include a controller, an arithmetic logic unit (ALU), and registers. For example, the controller is mainly responsible for instruction decoding and issuing control signals for the operations corresponding to the instructions. The ALU is mainly responsible for performing fixed-point or floating-point arithmetic operations, shift operations, and logical operations, and can also perform address operations and conversions. The registers are mainly responsible for storing register operands and intermediate operation results temporarily stored during instruction execution. In specific implementations, the processor's hardware architecture can be an ASIC architecture, a microprocessor without interlocked piped stages architecture (MIPS), an advanced reduced instruction set machine (RISC) machine (ARM) architecture, or a network processor (NP) architecture, etc. The processor can be single-core or multi-core. The storage module can be an in-chip storage module, such as registers or caches. Storage modules can also be external to the chip, such as ROM or other types of static storage devices that can store static information and instructions, RAM, etc.

[0357] This application also provides a computer program product that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0358] This application also provides a computer program that, when executed by a computer, can implement the functions of any of the above method embodiments.

[0359] This application also provides a computer-readable storage medium. All or part of the processes in the above method embodiments can be implemented by a computer program instructing related hardware. This program can be stored in the computer-readable storage medium, and when executed, it can include the processes of the above method embodiments. The computer-readable storage medium can be an internal storage unit of the terminal (including a data sending end and / or a data receiving end) of any of the foregoing embodiments, such as the terminal's hard disk or memory. The computer-readable storage medium can also be an external storage device of the terminal, such as a plug-in hard disk, smart media card (SMC), secure digital (SD) card, flash card, etc., equipped on the terminal. Further, the computer-readable storage medium can include both the terminal's internal storage unit and external storage devices. The computer-readable storage medium is used to store the 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.

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

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

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

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

[0364] In this application, "sending information to...(terminal device)" can be understood as the destination of the information being the terminal device. This can include sending information directly or indirectly to the terminal device. "Receiving information from...(terminal device)" can be understood as the source of the information being the terminal device, and can include receiving information directly or indirectly from the terminal device. Information may undergo necessary processing between the source and destination, such as format changes, but the destination can understand the valid information from the source.

[0365] Through the above description of the embodiments, those skilled in the art can clearly understand that, for the sake of convenience and brevity, only the division of the above functional modules is used as an example. In actual applications, the above functions can be assigned to different functional modules as needed, that is, the internal structure of the device can be divided into different functional modules to complete all or part of the functions described above.

[0366] In the several embodiments provided in this application, the disclosed apparatus and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative. For instance, the division of modules or units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another device, or some features may be ignored or not executed. Furthermore, the displayed or discussed mutual couplings, direct couplings, or communication connections may be through some interfaces; indirect couplings or communication connections between devices or units may be electrical, mechanical, or other forms.

[0367] The units described as separate components may or may not be physically separate. A component shown as a unit can be one or more physical units; that is, it can be located in one place or distributed in multiple different locations. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0368] Furthermore, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit. The integrated unit can be implemented in hardware or as a software functional unit.

[0369] If the integrated unit is implemented as a software functional unit and sold or used as an independent product, it can be stored in a readable storage medium. Based on this understanding, the technical solution of this application embodiment, or all or part of the technical solution, can be embodied in the form of a software product. This software product is stored in a storage medium and includes several instructions to cause a device (which may be a microcontroller, chip, etc.) or processor to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, ROM, RAM, magnetic disks, or optical disks.

Claims

1. An encoding method characterized by comprising: The method comprises: determining K first bits according to a first reliability sequence with a length of N1, and determining K second bits according to a second reliability sequence with a length of N2; wherein the K is less than or equal to the N1, and N2=2N1; the K second bits comprise a first information bit set and a second information bit set; the first information bit set comprises T bits most reliable in bits of the second reliability sequence except for a first pre-frozen bit set, the first pre-frozen bit set being determined according to M2 and the N2; the second information bit set comprises (K-T) bits most reliable in bits of the second reliability sequence except for the first information bit set and a second pre-frozen bit set; the second pre-frozen bit set is determined according to the N1; the T is determined according to the K, the M2, and the N2; the T is less than or equal to the K; the M2 is determined according to a retransmission resource and the N1; determining information bits corresponding to A first bits in the K first bits according to an information bit sequence with a length of K; mapping the information bits corresponding to the A first bits onto A second bits of a first sequence with a length of (N2-N1) to obtain a second sequence; wherein the A second bits are A bits in the K second bits; polar encoding the second sequence to obtain a first coded bit sequence with a length of (N2-N1); outputting one or more bits in the first coded bit sequence.

2. The method of claim 1, wherein, The method further comprises: mapping bits in the information bit sequence onto the K first bits in a third sequence with a length of N1 to obtain a fourth sequence; polar encoding the fourth sequence to obtain a second coded bit sequence with a length of N1.

3. The method of claim 2, wherein, The method further comprises: obtaining a third coded bit sequence according to the first coded bit sequence and the second coded bit sequence; outputting one or more bits in (M2-N1) bits in the third coded bit sequence.

4. The method according to claim 2 or 3, characterized in that, In a case where a rate matching manner corresponding to the fourth sequence is puncturing, the first pre-frozen bit set further comprises a third pre-frozen bit set; wherein the third pre-frozen bit set is determined according to one or more rate matching bits corresponding to the fourth sequence.

5. The method according to claim 2 or 3, characterized in that, In a case where the rate matching manner corresponding to the fourth sequence is shortening, the first pre-frozen bit set further comprises a third pre-frozen bit set and a fourth pre-frozen bit set; wherein the third pre-frozen bit set is determined according to one more rate matching bits corresponding to the fourth sequence, and the fourth pre-frozen bit set comprises one or more rate matching bits corresponding to the fourth sequence.

6. The method according to any one of claims 2-5, characterized in that, In a case where a length after rate matching corresponding to the fourth sequence is less than N1, the second pre-frozen bit set further comprises a third pre-frozen bit set; wherein the third pre- frozen bit set is determined according to one or more rate matching bits corresponding to the fourth sequence.

7. The method according to any one of claims 4-6, characterized in that, The third pre-frozen bit set is determined according to one or more rate matching bits corresponding to the fourth sequence. The third pre-frozen bit set is determined according to a result of adding N1 to one or more rate matching bits corresponding to the fourth sequence respectively.

8. A decoding method, comprising: Comprising: Obtaining a to-be-decoded bit sequence; wherein a length of an information bit sequence corresponding to the to-be-decoded bit sequence is K; Determining K first bits according to a first reliability sequence with a length of N1, and determining K second bits according to a second reliability sequence with a length of N2; wherein the K is less than or equal to the N1, N2=2N1; the K second bits comprise a first information bit set and a second information bit set; the first information bit set comprises T most reliable bits in bits of the second reliability sequence except a first pre-frozen bit set, the first pre-frozen bit set being determined according to M2 and the N2; the second information bit set comprises (K-T) most reliable bits in bits of the second reliability sequence except the first information bit set and a second pre-frozen bit set; the second pre-frozen bit set is determined according to the N1; the T is determined according to the K, the M2, and the N2; the T is less than or equal to the K; the M2 is determined according to retransmission resources and the N1; Decoding the to-be-decoded bit sequence according to A first bits in the K first bits and A second bits in the K second bits, to obtain a decoding result.

9. The method of claim 8, wherein, In a case where a rate matching manner corresponding to the fifth sequence is puncturing, The first pre-frozen bit set further comprises a third pre-frozen bit set; wherein the third pre-frozen bit set is determined according to one or more rate matching bits corresponding to the fifth sequence, the fifth sequence being determined according to a to-be-decoded bit sequence of data initial transmission.

10. The method of claim 8, wherein, In a case where a rate matching manner corresponding to the fifth sequence is shortening, The first pre-frozen bit set further comprises a third pre-frozen bit set and a fourth pre-frozen bit set; wherein the third pre-frozen bit set is determined according to one more rate matching bits corresponding to the fifth sequence, the fourth pre-frozen bit set comprising one or more rate matching bits corresponding to the fifth sequence; the fifth sequence being determined according to a to-be-decoded bit sequence of data initial transmission.

11. The method according to any one of claims 8-10, characterized in that, The second pre-frozen bit set further comprises a third pre-frozen bit set; wherein the third pre- frozen bit set is determined according to one or more rate matching bits corresponding to the fifth sequence; the fifth sequence being determined according to the to-be-decoded bit sequence of data initial transmission. The third pre-frozen bit set is determined according to one or more rate matching bits corresponding to a fourth sequence.

12. The method according to any one of claims 9-11, characterized in that, The third pre-frozen bit set is determined according to a result of adding N 1 to one or more rate matching bits corresponding to the fifth sequence respectively. ​ 13. The method of any one of claims 1-12, wherein the second pre-frozen set of bits is {0 1 2 3... N1-1}.

14. The method of any one of claims 1-13, wherein the A second bits are the second bits in the K second bits with bit indices smaller than the N1.

15. The method of any one of claims 1-14, wherein the first reliability sequence is the bits in the second reliability sequence other than the second pre-frozen set of bits.

16. The method of any one of claims 1-15, wherein the K first bits are the K most reliable bits determined according to the first reliability sequence.

17. The method of any one of claims 1-16, wherein the A first bits are determined according to the K first bits and the K second bits.

18. The method of claim 17, wherein the A first bits are the bits in the K first bits that are not the third bits corresponding to the K second bits; wherein the third bit corresponding to a second bit with bit index i has bit index i-N1; the i is greater than or equal to N1, and the i is smaller than or equal to N2-1.

19. The method of any one of claims 1-18, wherein the first pre-frozen set of bits is {0 1 2 3... Q}; wherein the Q is determined according to the M2 and the N2. The Q is determined according to the M2 and the N2, comprising: or or is a ceiling function. In the case that M2 / N2 is smaller than 5 / 8, the Q is N2 / 2-1; or In the case that M2 / N2 is greater than or equal to 5 / 8 and smaller than 3 / 4, the Q is 3N2 / 8-1; or In the case that M2 / N2 is greater than or equal to3 / 4, the Q is N2 / 4-1.

20. The method of claim 19, wherein, 22. The method of any one of claims 1-21, wherein the T is K in the case that M2 / N2 is greater than or equal to a first threshold, or, M2 / N2 is smaller than a second threshold. The Q is or The Q is or The Q is wherein, or 21. The method of claim 20, wherein, The Q is Including: is a ceiling function, the first threshold is greater than the second threshold.

23. The method of any one of claims 1-21, wherein the T is K in case that M2 / N2 is greater than or equal to a first threshold, or, M 2 / N 2 is smaller than a second threshold. or is a ceiling function, the first threshold is greater than the second threshold. In case M2 / N2 is greater than or equal to a first threshold, said T is 24. The method of any one of claims 1-21, wherein the T is K in cases that M2 / N2 is greater than or equal to a first threshold, or, M2 / N2 is smaller than a second threshold, or, M2 / N2 is greater than or equal to a third threshold, or, M2 / N2 is smaller than a fourth threshold. In case M2 / N2 is greater than or equal to the second threshold value and smaller than the first threshold value, the T is or In a case where the M2 / N2 is less than the second threshold value and the code rate is less than or equal to a third threshold value, the T is or In a case where the M2 / N2 is less than the second threshold value and the code rate is greater than a third threshold value, the T is wherein is a ceiling function, the fifth threshold is greater than the first threshold, the first threshold is greater than the second threshold, and the second threshold is greater than the fourth threshold.

25. The method of claim 24, wherein the fourth threshold is 9 / 16. In case M2 / N2 is greater than or equal to the second threshold value and smaller than the first threshold value, the T is 26. The method of claim 24 or 25, wherein the fifth threshold is 7 / 8.

27. The method of any one of claims 22-26, wherein the first threshold is 3 / 4. wherein, ​ ​ In the case where M2 / N2 is greater than or equal to the fourth threshold value and smaller than the second threshold value, the T is ​ In case M2 / N2 is greater than or equal to the second threshold value and smaller than the first threshold value, the T is ​ In the case where M2 / N2 is greater than or equal to a first threshold value and smaller than a fifth threshold value, the T is wherein, ​ ​ ​ ​ ​ ​ ​ 28. The method of any of claims 22-27, wherein, the second threshold is 5 / 8.

29. The method of any of claims 22-28, wherein, the third threshold is 1 / 2; or the third threshold is 7 / 16.

30. A communications device, characterized by The communication apparatus comprises a processor; the processor is configured to execute a computer program or instructions, so that the encoding method of any of claims 1-7, 13-29 is executed, or so that the decoding method of any of claims 8-29 is executed.

31. A communications device, characterized by The communication apparatus comprises an interface circuit and a logic circuit; the interface circuit is configured to input and / or output information; the logic circuit is configured to execute the encoding method of any of claims 1-7, 13-29, or execute the decoding method of any of claims 8-29, process and / or generate the information according to the information.

32. A computer-readable storage medium, comprising: The computer readable storage medium stores computer instructions or programs; when the computer instructions or programs are executed on a computer, the encoding method of any of claims 1-7, 13-29 is executed, or the decoding method of any of claims 8-29 is executed.

33. A computer program product, characterised in that, The computer program product comprises computer instructions; when part or all of the computer instructions are executed on a computer, the encoding method of any of claims 1-7, 13-29 is executed, or the decoding method of any of claims 8-29 is executed.

Images