Information encoding method and apparatus

Abstract

The present application relates to the field of communications, and provides an information encoding method and apparatus, capable of balancing the transmission performance of different numbers of retransmitted bits. The method comprises: during data retransmission, a transmission end device performing polar encoding on a first bit sequence on the basis of a first information set, to obtain a second bit sequence having a length of N1; performing first interleaving on the basis of the second bit sequence, to obtain a third bit sequence; and outputting one or more bits in the third bit sequence. The first information set comprises bits in a second information set having bit indices less than N1, the second information set is a union of M sub-information sets, and an m-th sub-information set among the M sub-information sets comprises (Tm-Tm-1) first bits in a reliability sequence having a length of N2, where m = 1, 2, ..., M, Tm is greater than Tm-1, T0 = 0, TM = K, N2 = 2*N1, and M is greater than or equal to 2. The (Tm-Tm-1) first bits comprise (Tm-Tm-1) bits among bits in the reliability sequence excluding those in the first m-1 sub-information sets and an m-th pre-frozen set.

Description

Information encoding method and apparatus

[0001] This application claims priority to Chinese Patent Application No. 202411808388.8, filed with the State Intellectual Property Office of China on December 9, 2024, entitled "Information Encoding Method and Apparatus", the entire contents of which are incorporated herein by reference. Technical Field

[0002] This application relates to the field of communications, and more particularly to information encoding methods and apparatus. Background Technology

[0003] In wireless communication scenarios, when implementing the hybrid automatic repeat request (HARQ) mechanism, the resources used for retransmission (hereinafter referred to as retransmission resources) are scheduled by the system. In this case, rateless transmission is usually adopted. That is, the encoding is completed in advance, and then appropriate bits are selected for retransmission based on the size of the retransmission resources. In other words, the code rate is determined based on the retransmission resources to ensure transmission performance.

[0004] Polar codes are the first coding scheme that can be rigorously proven to "achieve" Shannon channel capacity. They possess advantages such as good decoding performance and low complexity, and have been selected by the Third Generation Partnership Project (3GPP) as the control channel coding scheme for 5G enhanced mobile broadband (eMBB) scenarios. The construction process of polar codes is used to determine the information bits. Typically, based on the reliability ranking of each sub-channel, the K positions with the highest reliability are set as information bits, and the remaining NK positions are set as pre-frozen bits.

[0005] However, when polar codes are applied to the HARQ mechanism, the change in the number of retransmitted bits affects the reliability ranking of sub-channels; it is necessary to balance the transmission performance of different numbers of retransmitted bits. Summary of the Invention

[0006] This application provides an information encoding method and apparatus that can balance the transmission performance of different numbers of retransmission bits.

[0007] Firstly, this application provides an information encoding method, which 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: in data retransmission, polar encoding a first bit sequence according to a first information set to obtain a second bit sequence of length N1; performing a first interleaving based on the second bit sequence to obtain a third bit sequence; and outputting one or more bits from the third bit sequence.

[0008] The first bit sequence includes a portion of the information bits from the input bit sequence of length K in the initial data transmission, where the initial data transmission corresponds to data retransmission. K is a positive integer, and K is less than or equal to N1. The first information set includes bits with bit indices less than N1 in the second information set. The second information set is the union of M sub-information sets. The m-th sub-information set in the M sub-information sets includes (T) bits from the reliability sequence of length N2. m -T m-1 The first bit of the M sub-information sets has no overlap, and the M sub-information sets have m = 1, 2, ..., M. m Greater than T m-1 T0 = ​​0, T M =K, N2 = 2 * N1, M is greater than or equal to 2; (T m -T m-1 The first bit includes the bits in the reliability sequence excluding the first m-1 sub-information sets and the m-th pre-frozen set (T) m -T m-1 The m-th pre-frozen set includes multiple consecutive second bits, which include some consecutive bits in the sequence obtained after the first bit set of length N1 is interleaved. The first bit set is {0,1,2,…,N1}.

[0009] Based on the first aspect, the transmitting device can map the retransmitted information bit sequence (i.e., the first bit sequence, which includes a portion of the information bits of the input bit sequence of length K, where K is a positive integer and K is less than or equal to N1) to the bits contained in the first information set, and then perform polar coding on the bit sequence to obtain a polar-coded sequence of length N1 (i.e., the second bit sequence); furthermore, the polar-coded sequence is interleaved (such as the first interleaving), and one or more bits in the interleaved sequence (i.e., the third bit sequence) are output, thereby realizing the retransmission of the input bit sequence, so that the receiving device can jointly decode one or more bits of the initial transmission and retransmission output sequence corresponding to the input bit sequence, thereby improving the decoding performance.

[0010] In the process of polar coding, a polar code can be constructed based on the initial transmission length and the retransmission length being equal (both lengths are N1), that is, the length of the constructed polar code is N2 (N2 = 2 * N1); the reliability order of the bits in this polar code is a reliability sequence of length N2. Therefore, the information bits in the polar code are a portion of the bits in this reliability sequence (that is, a portion of the bits in the second information set that are in the reliability sequence of N2); among them, the bits with bit numbers less than N1 are the bits in the retransmitted bit sequence (that is, the first bit sequence) (that is, the bits in the first information set that have bit numbers less than N1 in the second information set), that is, during retransmission, the retransmitted bit sequence needs to be mapped to these bits.

[0011] In the construction of polar codes, the information bits of the polar code (i.e., the M sub-information sets included in the second information set) can be obtained in M ​​steps. Considering the limited number of retransmissions, the number of information bits on the retransmission resources should not be too large, otherwise it will lead to a decrease in retransmission performance; therefore, a small number of information bits (i.e., (T...)) can be determined in each step. m -T m-1 ) first bits, m = 1, 2, ..., M, T m Greater than T m-1 T0 = ​​0, T M =K, M is greater than or equal to 2), so that a total of K information bits are determined in M ​​steps. That is, the K information bits are distributed among M sub-information sets, so that the number of information bits in each sub-information set is small (i.e., the number of first bits is small).

[0012] In addition, the bits in the m-th sub-information set (i.e., T) m -T m-1 The bits (T) are the bits excluding the first m-1 sub-information sets and the m-th pre-frozen set. m -T m-1 The m-th pre-frozen set includes a portion of consecutive bits in the sequence obtained after the first interleaving of the first bit set of length N1 (i.e., the m-th pre-frozen set includes multiple consecutive second bits, which in turn include a portion of consecutive bits in the sequence obtained after the first interleaving of the first bit set of length N1). The first bit set is {0,1,2,…,N1}, meaning the bits in the m-th pre-frozen set correspond to retransmissions. In other words, when determining the bits in the m-th sub-information set, the transmitting device must skip the multiple consecutive second bits included in the m-th pre-frozen set from the bits outside the first m-1 sub-information sets in the reliability sequence, and then determine the bits in the m-th sub-information set from the remaining bits.

[0013] When retransmission resources are limited (i.e., few retransmissions), the transmitting device extracts the number of bits corresponding to the retransmission resources from the third bit sequence after the first interleaving, maps these bits to the retransmission resources, and outputs them. Because pre-freezing is performed based on the third bit sequence, the number of bits in the first information set is small when retransmission resources are limited, thus ensuring retransmission performance. When retransmission resources are abundant (i.e., many retransmissions), such as when the retransmission length equals the initial transmission length, the number of bits in the first information set is large, thus not causing a decrease in retransmission performance. In other words, retransmission performance is guaranteed regardless of the amount of retransmission resources.

[0014] In one possible design, the transmitting device performs polar coding on the first bit sequence according to the first information set to obtain a second bit sequence of length N1, including: mapping the first bit sequence to bits in the first information set, and performing polar coding on the first bit sequence to obtain the second bit sequence.

[0015] Based on this possible design, the transmitting device can map the first bit sequence onto the bits of the first information set and perform polar coding to determine the encoded bit sequence (i.e., the second bit sequence) in data retransmission. This provides a possible implementation method for data transmission.

[0016] In one possible design, the information encoding method further includes: in the initial data transmission, polar encoding is performed on the input bit sequence according to the third information set to obtain a fourth bit sequence of length N1; one or more bits in the fourth bit sequence are output.

[0017] The third information set includes K third bits, which correspond one-to-one with K fourth bits in the reliability sequence excluding the first bit set. The bit number of the third bit corresponding to the fourth bit with bit number k is k-N1, where k is greater than or equal to N1.

[0018] Based on this possible design, when constructing a polar code of length N2, the transmitting device can determine the initial data transmission information bits (i.e., the third information set) in the bits with bit indices less than N1 in the reliability sequence of length N2; thus, the input bit sequence can be mapped to these information bits to achieve polar coding of the input bit sequence.

[0019] In one possible design, the K fourth bits are the K most reliable bits in the reliability sequence, excluding the set of the first bits.

[0020] Based on this possible design, since the transmitting device maps the input bit sequence to the K most reliable bits (i.e., the K fourth bits) in the reliability sequence, the reliability of the input bit sequence transmission can be improved, thereby improving the decoding performance.

[0021] In one possible design, the K fourth bits are the K most reliable bits in the reliability sequence, excluding the first bit set and the fifth bit set. When the rate matching method of the input bit sequence is puncturing, the bit with bit number n+N1 in the fifth bit set corresponds to the puncturing bit with bit number n in the fourth bit sequence, where n is greater than or equal to 0 and n is less than N1. When the rate matching method is shortening, the fifth bit set includes at least one seventh bit, where the seventh bit with bit number x+N1 corresponds to the shortened bit with bit number x in the fourth bit set, where x is greater than or equal to 0 and x is less than N1.

[0022] Based on this possible design, when the rate matching method is puncturing or shortening, the third information set can include the K most reliable bits from the reliability sequence, excluding the first bit set and the fifth bit set. Specifically, when the rate matching method is puncturing, one or more punctured bits in the initial data transmission are pre-frozen; when the rate matching method is shortening, one or more shortened bits in the initial data transmission are pre-frozen, thereby improving decoding performance.

[0023] In one possible design, the third bit sequence is the last Y bits of the sequence obtained after the second bit sequence is interleaved for the first time, where Y is the length of the data retransmission.

[0024] Based on this possible design, the transmitting device can determine the retransmission length based on the size of the retransmission resource, and then determine the third bit sequence to improve retransmission performance.

[0025] 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: receiving a first sequence to be decoded, corresponding to data retransmission; receiving a second sequence to be decoded, corresponding to initial data transmission; and decoding the first and second sequences to be decoded according to a first information set to obtain a first bit sequence.

[0026] The first bit sequence includes a portion of the information bits from the input bit sequence of length K in the initial data transmission, where the initial data transmission corresponds to data retransmission, and K is a positive integer. The first information set includes bits with bit indices less than N1 in the second information set. The second information set is the union of M sub-information sets, and the m-th sub-information set in the M sub-information sets includes (T) bits from the reliability sequence of length N2. m -T m-1 The first bit of the M sub-information sets has no overlap, and the M sub-information sets have m = 1, 2, ..., M. m Greater than T m-1 T0 = ​​0, T M =K, N2 = 2 * N1, M is greater than or equal to 2, N1 is greater than or equal to K; (T m -T m-1 The first bit includes the bits in the reliability sequence excluding the first m-1 sub-information sets and the m-th pre-frozen set (T) m -T m-1 The m-th pre-frozen set includes multiple consecutive second bits, which include some consecutive bits in the sequence obtained after the first bit set of length N1 is interleaved. The first bit set is {0,1,2,…,N1}.

[0027] Based on the second aspect, after receiving the retransmission sequence (i.e., the first sequence to be decoded) and the initial transmission sequence (i.e., the second sequence to be decoded) from the transmitting device, the receiving device can perform joint decoding on the retransmission sequence and the initial transmission sequence, thereby improving decoding performance. Specifically, the retransmission sequence is obtained by the transmitting device mapping a first bit sequence (which includes some information bits of an input bit sequence of length K, where K is a positive integer and K is less than or equal to N1) to the bits contained in a first information set, and then polar-encoding it to obtain a polar-coded sequence of length N1 (i.e., the second bit sequence). Further, the polar-coded sequence is interleaved (as in the first interleaving), and one or more bits in the interleaved sequence (i.e., the third bit sequence) are output as a sequence.

[0028] During the polar coding process at the transmitting end device, a polar code can be constructed based on the initial transmission length and the retransmission length being equal (both lengths are N1), that is, the length of the constructed polar code is N2 (N2 = 2 * N1); the reliability order of the bits in this polar code is a reliability sequence of length N2. Therefore, the information bits in the polar code are a portion of the bits in this reliability sequence (i.e., the bits in the second information set are a portion of the bits in the reliability sequence of N2); among them, the bits with a bit index less than N1 are the bits in the retransmitted bit sequence (i.e., the first bit sequence) (i.e., the bits in the first information set with a bit index less than N1 in the second information set), that is, during retransmission, the retransmitted bit sequence needs to be mapped to these bits.

[0029] In the construction of polar codes, the information bits of the polar code (i.e., the M sub-information sets included in the second information set) can be obtained in M ​​steps. Considering the limited number of retransmissions, the number of information bits on the retransmission resources should not be too large, otherwise it will lead to a decrease in retransmission performance; therefore, a small number of information bits (i.e., (T...)) can be determined in each step. m -T m-1 ) first bits, m = 1, 2, ..., M, T m Greater than T m-1 T0 = ​​0, T M =K, M is greater than or equal to 2), so that a total of K information bits are determined in M ​​steps. That is, the K information bits are distributed among M sub-information sets, so that the number of information bits in each sub-information set is small (i.e., the number of first bits is small).

[0030] In addition, the bits in the m-th sub-information set (i.e., T) m -T m-1 The bits (T) are the bits excluding the first m-1 sub-information sets and the m-th pre-frozen set. m -T m-1 The m-th pre-frozen set includes a portion of consecutive bits in the sequence obtained after the first interleaving of the first bit set of length N1 (i.e., the m-th pre-frozen set includes multiple consecutive second bits, which in turn include a portion of consecutive bits in the sequence obtained after the first interleaving of the first bit set of length N1). The first bit set is {0,1,2,…,N1}, meaning the bits in the m-th pre-frozen set correspond to retransmissions. In other words, when determining the bits in the m-th sub-information set, the transmitting device must skip the multiple consecutive second bits included in the m-th pre-frozen set from the bits outside the first m-1 sub-information sets in the reliability sequence, and then determine the bits in the m-th sub-information set from the remaining bits.

[0031] When retransmission resources are limited (i.e., few retransmissions), the transmitting device extracts the number of bits corresponding to the retransmission resources from the third bit sequence after the first interleaving, maps these bits to the retransmission resources, and outputs them. Because pre-freezing is performed based on the third bit sequence, the number of bits in the first information set is small when retransmission resources are limited, thus ensuring retransmission performance. When retransmission resources are abundant (i.e., many retransmissions), such as when the retransmission length equals the initial transmission length, the number of bits in the first information set is large, thus not causing a decrease in retransmission performance. In other words, retransmission performance is guaranteed regardless of the amount of retransmission resources.

[0032] In one possible design, the first bit sequence is mapped to the bits of the first information set.

[0033] Based on this possible design, the first bit sequence can be mapped to the bits of the first information set and polarized encoded to determine the encoded bit sequence (i.e., the second bit sequence) in data retransmission. This provides a possible implementation method for data transmission.

[0034] Combining the first and second aspects, in one possible design, the number of bits for multiple consecutive second bits is (N1 / 2). M+2-m ).

[0035] Based on this possible design, the size of the retransmission resource is typically N1 / 4; therefore, the m-th pre-freeze set can be set to be less than or equal to N1 / 4 (i.e., the m-th pre-freeze set includes (N1 / 2)). M+2-m (The second bit); so that in the case of a small number of retransmissions, the transmitting device can take out the bit with a bit sequence number greater than the second bit from the second bit corresponding to the m-th pre-frozen set for retransmission; so that the determined m-th pre-frozen set can support finer-grained retransmission performance stability.

[0036] Combining the first and second aspects, in one possible design, some information bits include information bits corresponding to bits located in the fourth information set in the input bit sequence. The fourth information set is determined based on the third and fifth information sets. The third information set includes K third bits, which correspond one-to-one with K fourth bits in the reliability sequence excluding the first bit set. The bit index of the third bit corresponding to the fourth bit with bit index k-N1 is k, where k is greater than or equal to N1 and k is less than N2. The fifth information set includes one or more fifth bits, where the fifth bit with bit index i-N1 corresponds to the first bit with bit index i in the second information set, where i is greater than or equal to N1 and i is less than N2.

[0037] Combining the first and second aspects, in one possible design, the fourth information set includes bits within the third information set that do not belong to the bit sequence number in the fifth information set.

[0038] Based on the two possible designs mentioned above, a third information set can be determined, which enables the retransmission of information bits (i.e., the first bit sequence) corresponding to information bits with lower reliability, thereby improving decoding performance.

[0039] Combining the first and second aspects, in one possible design, (T) m -T m-1 The first bit is the most reliable bit in the reliability sequence, excluding the first m-1 sub-information sets and the m-th pre-frozen set (T). m -T m-1 ) bits.

[0040] Based on this possible design, since the transmitting device maps the first bit sequence to the bits with high reliability in the reliability sequence (i.e., the bits included in the first information set), the reliability of the first bit sequence transmission can be improved, thereby improving the decoding performance.

[0041] Combining the first and second aspects, in one possible design, (T) m -T m-1 The first bit includes the bits in the reliability sequence excluding the first m-1 sub-information sets and the m-th pre-frozen set (T) m -T m-1 ) bits, including: (T m -T m-1 The first bit includes bits from the reliability sequence excluding the first m-1 sub-information sets, the m-th pre-frozen set, and the second bit set (T). m -T m-1 The first set of bits is 10 bits, and the second set of bits is determined based on the rate matching method of the input bit sequence, which includes puncturing and shortening.

[0042] Combining the first and second aspects, in one possible design, (T) m -T m-1 The first bit is the most reliable bit in the reliability sequence, excluding the first m-1 sub-information sets, the m-th pre-frozen set, and the second bit set. m -T m-1 ) bits.

[0043] Based on the two possible designs mentioned above, when the rate matching method is puncturing or shortening, the bits included in the second information set do not include one or more punctured bits in the initial data transmission; or one or more shortened bits in the initial data transmission and data retransmission, which can improve the reliability of the first bit sequence transmission and thus improve the decoding performance.

[0044] Combining the first and second aspects, in one possible design, the second bit set includes at least one sixth bit; wherein, when the rate matching method is puncturing, the sixth bit with bit number n+N1 corresponds to the puncturing bit with bit number n in the fourth bit sequence, the fourth bit sequence is obtained by polar coding of the input bit sequence, n is greater than or equal to 0 and n is less than N1; when the rate matching method is shortening, at least one sixth bit is the union of the third bit set and the fourth bit set, the third bit set includes at least one seventh bit, the seventh bit with bit number x+N1 corresponds to the shortened bit with bit number x in the fourth bit set, the fourth bit set includes the shortened bit in the fourth bit set, x is greater than or equal to 0 and x is less than N1.

[0045] Based on this possible design, when the rate matching method is shortening, one or more shortened bits in the initial data transmission are pre-frozen; when the rate matching method is puncturing, one or more punctured bits in the initial data transmission are pre-frozen; when the rate matching method is shortening, one or more shortened bits in the initial data transmission are pre-frozen; that is, the bit set included in the second information set does not include the second bit set, thereby improving decoding performance.

[0046] Combining the first and second aspects, in one possible design, when m=1, the first pre-frozen set is an empty set.

[0047] Combining the first and second aspects, in one possible design, T m Related to K, or T m Related to K and N1.

[0048] Combining the first and second aspects, in one possible design, T m Related to K and N1, including: when K / N1 is greater than the first threshold, T m =K; When K / N1 is less than or equal to the first threshold, T m Greater than T m-1 .

[0049] Combining the first and second aspects, in one possible design, T m Related to K include:

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

[0051] For example, in data retransmission, the processing module is used to perform polar coding on the first bit sequence according to the first information set to obtain a second bit sequence of length N1; the processing module is also used to perform a first interleaving based on the second bit sequence to obtain a third bit sequence; and the transceiver module is used to output one or more bits in the third bit sequence.

[0052] The first bit sequence includes a portion of the information bits from the input bit sequence of length K in the initial data transmission, where the initial data transmission corresponds to data retransmission. K is a positive integer, and K is less than or equal to N1. The first information set includes bits with bit indices less than N1 in the second information set. The second information set is the union of M sub-information sets. The m-th sub-information set in the M sub-information sets includes (T) bits from the reliability sequence of length N2. m -T m-1 The first bit of the M sub-information sets has no overlap, and the M sub-information sets have m = 1, 2, ..., M. m Greater than T m-1 T0 = ​​0, T M =K, N2 = 2 * N1, M is greater than or equal to 2; (T m -T m-1 The first bit includes the bits in the reliability sequence excluding the first m-1 sub-information sets and the m-th pre-frozen set (T) m -T m-1 The m-th pre-frozen set includes multiple consecutive second bits, which include some consecutive bits in the sequence obtained after the first bit set of length N1 is interleaved. The first bit set is {0,1,2,…,N1}.

[0053] Optionally, the processing module is also used to map the first bit sequence onto bits within the first information set and to perform polar coding on the first bit sequence to obtain the second bit sequence.

[0054] Optionally, in the initial data transmission, the processing module is further configured to perform polar coding on the input bit sequence according to the third information set to obtain a fourth bit sequence of length N1; the transceiver module is further configured to output one or more bits from the fourth bit sequence. The third information set includes K third bits, which correspond one-to-one with K fourth bits in the reliability sequence excluding the first bit set. The bit index of the third bit corresponding to the fourth bit with bit index k is k-N1, where k is greater than or equal to N1.

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

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

[0057] For example, the processing module is used to obtain a first sequence to be decoded, and the first sequence to be decoded corresponds to data retransmission; the processing module is also used to obtain a second sequence to be decoded, and the second sequence to be decoded corresponds to data initial transmission; the processing module is also used to perform joint decoding on the first sequence to be decoded and the second sequence to be decoded according to a first information set to obtain a first bit sequence.

[0058] The first bit sequence includes a portion of the information bits from the input bit sequence of length K in the initial data transmission, where the initial data transmission corresponds to data retransmission, and K is a positive integer. The first information set includes bits with bit indices less than N1 in the second information set. The second information set is the union of M sub-information sets, and the m-th sub-information set in the M sub-information sets includes (T) bits from the reliability sequence of length N2. m -T m-1 The first bit of the M sub-information sets has no overlap, and the M sub-information sets have m = 1, 2, ..., M. m Greater than T m-1T0 = ​​0, T M =K, N2 = 2 * N1, M is greater than or equal to 2, N1 is greater than or equal to K; (T m -T m-1 The first bit includes the bits in the reliability sequence excluding the first m-1 sub-information sets and the m-th pre-frozen set (T) m -T m-1 The m-th pre-frozen set includes multiple consecutive second bits, which include some consecutive bits in the sequence obtained after the first bit set of length N1 is interleaved. The first bit set is {0,1,2,…,N1}.

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

[0060] 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 information encoding method described in the first aspect is executed, or the information decoding method described in any of the second aspects is executed.

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

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

[0063] 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 information 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 information decoding method as described in any aspect of the second aspect, to process and / or generate information based on the information.

[0064] 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 information encoding method described in the first aspect to be executed, or the information decoding method described in any of the second aspects to be executed.

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

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

[0067] 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, the information encoding method as described in the first aspect is executed, or the information decoding method as described in any of the second aspects is executed.

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

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

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

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

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

[0073] Figure 4 is a schematic diagram of bits during a large number of retransmissions and a small number of retransmissions of a polar code provided in an embodiment of this application.

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

[0075] Figure 6 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;

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

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

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

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

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

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

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

[0083] Hybrid Automatic Repeat Request (HARQ) Mechanism: In the HARQ mechanism, the combined use of forward error correction (FEC) and automatic repeat request (ARQ) can significantly improve spectral efficiency.

[0084] Specifically, the encoding device can send an encoded bit sequence, which is then modulated to obtain a symbol sequence. This symbol sequence is sent as the initial transmission to the decoding side. The decoding side receives the symbol sequence, demodulates it, and attempts to decode. If decoding is successful, an acknowledgment (ACK) message is sent back; subsequently, the encoding device stops sending the bit sequence after receiving the ACK message. If decoding fails, the decoding device buffers the received bit sequence or the corresponding demodulation soft information (or soft demodulation information) and sends back a negative acknowledgement (NACK) message, or does not send any feedback; subsequently, if the encoding device receives a NACK message or does not receive feedback from the decoding side within a certain period of time, it continues to send a re-encoded bit sequence as incremental redundancy (IR). This allows the decoding device to use multiple received bit sequences for joint decoding.

[0085] Compared to sending all the data at once, the HARQ mechanism allows the encoding device to stop sending data if the decoding device successfully decodes it during transmission, thereby improving system throughput. For example, if the initial transmission is successful, the encoding device does not need to retransmit the corresponding bit sequence, saving spectrum resources and improving spectrum efficiency. If the initial transmission fails, the decoding device can perform joint decoding on the multiple received bit sequences, still achieving the error correction performance of long codes.

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

[0087] For example, as shown in Figure 1, is a schematic diagram of an 8-bit polar code encoding. The encoding process includes several polar kernel operations (the polar kernel is indicated by a dashed box). The polar kernel ANDs two input bits with... Multiplying them yields two output bits. It can be seen that the recursive construction of polar codes shows that an 8-bit polar code can be obtained by coupling two 4-bit polar codes, and a 4-bit polar code can be obtained by coupling two 2-bit polar codes.

[0088] The construction process of polar codes is used to determine the information bits and frozen bits. Generally, the reliability of each sub-channel is ranked, and the K positions with the highest reliability are set as information bits, while the remaining NK positions are set as frozen bits. As shown in Figure 1, a polar code with N=8 and K=4 is constructed, where u3, u5, u6, and u7 are typically information bits, and the remaining positions are frozen bits.

[0089] Decoding is performed using a successive cancellation (SC) decoding algorithm. In SC, the log likelihood rate (LLR) of the information bits is calculated sequentially. For an information bit, if LLR > 0, the bit is determined to be 0; if LLR < 0, the bit is determined to be 1. For frozen bits, the bit is set to 0 regardless of the LLR value. A simple SC decoding diagram is shown in Figure 2: there are 8 computation nodes in the figure, including 4 f nodes and 4 g nodes. The computation of f nodes requires 2 LLR inputs on its right side, and the computation of g nodes requires 2 LLR inputs on its right side and 1 "partial sum" input above. Note that the output can only be calculated after the input items are calculated. According to the above rules, starting from the received signal on the right side, the 8 nodes are calculated sequentially, and the resulting decoding sequence is ①→②→③→④, which is the SC decoding process.

[0090] Based on the above description of polar codes, the following describes the implementation of applying polar codes to the HARQ mechanism:

[0091] For example, taking the polar encoding of an initial input bit sequence 141-1 of length 8 as an example, during the encoding process, as shown in Figure 3, the information bits are input from the left and polar encoded to obtain the encoded bit sequence output on the right, i.e., the polar encoded sequence; where, in the input bits on the left, the black solid circles represent information bits, and the hollow circles represent frozen bits. 141 is the polar encoded sequence of the initial input bit sequence of length 8 (i.e., the encoded sequence obtained by polar encoding the initial input bit sequence 141-1 (where the initial input bit sequence 141-1 includes information bit 143), or it can also be called U code. For example, the information bits in the initial input bit sequence 141-1 can be obtained as bit 144 after initial polar encoding. In each column between the initial input bit sequence 141-1 and the initial polar encoded sequence 141, the hollow circles with two input bits (145 in Figure 3) indicate that the two input bits are XORed.

[0092] In Figure 3, 142 represents the 8-bit retransmission polar-coded sequence (i.e., the coded sequence obtained by recoding the 8-bit retransmission input bit sequence 142-1 (which includes information bit 146)), or it can also be called V-code. The retransmission input bit sequence 142-1 includes some information bits (such as information bits 149 and 150) from the initial input bit sequence 141-1. For example, the information bits in the retransmission input bit sequence 142-1 can be converted into bit 147 after retransmission polar coding.

[0093] The retransmission input bit sequence 142-1 includes information bit 151 and information bit 152; wherein, information bit 151 is copied from information bit 150 in the initial input bit sequence 141-1, that is, information bit 151 and information bit 150 have the same bit value; information bit 152 is copied from information bit 149 in the initial input bit sequence 141-1, that is, information bit 152 and information bit 149 have the same bit value.

[0094] In each column between the retransmission input bit sequence 142-1 and the retransmission polar coding sequence 142, a hollow circle with two input bits (148 in Figure 3) indicates that the two input bits are XORed. Furthermore, between the retransmission input bit sequence 142-1 and the retransmission polar coding sequence 142, there is a connecting line (153 in Figure 3) used to completely introduce the information from the initial polar coding sequence 141 into the retransmission polar coding sequence 142.

[0095] Furthermore, during the decoding process, decoding the initial polarization code sequence 141 alone yields the corresponding decoded bit sequence, which includes information bits 149 and 150. If the initial polarization code sequence 141 and the retransmission polarization code sequence 142 are decoded together, they form a polar code of length 16. Decoding this polar code yields its corresponding decoded bit sequence, which includes information bits 151 and 152. Specifically, since information bits 151 and 152 are already identical, information bits 149 and 150 can be considered known values, and thus, during the decoding process, information bits 149 and 150 can be used as frozen bits.

[0096] Through the above coding framework, whether decoding the initial polar coding sequence 141 alone or jointly decoding the initial polar coding sequence 141 and the retransmission polar coding sequence 142, the information bits are always located in a highly reliable position, thus ensuring optimal decoding performance. Furthermore, at the code rate allocation level, the mapping relationship in the above coding framework is equivalent to "moving" the information bits from the initial polar coding sequence 141 to the retransmission polar coding sequence 142, achieving optimal code rate allocation between the initial polar coding sequence 141 and the retransmission polar coding sequence 142.

[0097] Rate-free (RL) transmission mechanism: RL transmission refers to a transmission where the code rate is not predetermined, but determined after resources are available, and transmission is then performed based on that code rate. For example, in wireless communication implementing the HARQ mechanism, retransmission resources are determined by system scheduling, so the number of retransmission resources may be large or small. Therefore, RL transmission can be used, where the bit sequence to be transmitted is pre-encoded to obtain an encoded bit sequence, and then the corresponding number of bits are taken from the encoded bit sequence according to the number of retransmission resources for transmission.

[0098] The RL transmission mechanism requires balancing performance under different numbers of retransmission resources. Specifically, for polar codes, the RL transmission mechanism requires that: regardless of the number of bits transmitted, the information bits are always on a highly reliable channel; and the optimal polar code for a small number of retransmissions (i.e., fewer bits on retransmission resources) is a subcode of the optimal polar code for a large number of retransmissions (i.e., more bits on retransmission resources). Specifically, taking a large number of retransmissions with a length equal to the initial transmission length (both N) as an example, a polar code is constructed with a length of 2N (this polar code includes an initial polar coding sequence of length N and a retransmission polar coding sequence of length N), as shown in Figure 4. Therefore, when the retransmission length is less than the initial transmission length (e.g., retransmission length is 3N / 4, N / 2, or N / 4), bits of the corresponding length can be extracted from the retransmission polar coding sequence of length N for transmission.

[0099] However, changes in retransmission resources lead to changes in the reliability and ordering of sub-channels, making it impossible to guarantee that information bits are always on high-reliability channels, thus easily causing a decline in retransmission performance. For example, when the retransmission length is N / 4, the extracted bits are shown in Figure 4. It can be seen that when the retransmission length is N / 4, the proportion of information bits is relatively large, resulting in a decrease in retransmission performance. Therefore, a method is needed that can balance the transmission performance of polar codes at different lengths.

[0100] In view of this, embodiments of this application provide an information encoding method and apparatus. The transmitting device can map the retransmitted information bit sequence (i.e., the first bit sequence, which includes a portion of the information bits of the input bit sequence of length K, where K is a positive integer and K is less than or equal to N1) to the bits contained in the first information set, and then perform polar encoding on the bit sequence to obtain a polar encoded sequence of length N1 (i.e., the second bit sequence). Further, the polar encoded sequence is interleaved (such as the first interleaving), and one or more bits in the interleaved sequence (i.e., the third bit sequence) are output, thereby realizing the retransmission of the input bit sequence. This allows the receiving device to jointly decode one or more bits of the initial transmission and retransmission output sequence corresponding to the input bit sequence, thereby improving the decoding performance.

[0101] In the process of polar coding, a polar code can be constructed based on the initial transmission length and the retransmission length being equal (both lengths are N1), that is, the length of the constructed polar code is N2 (N2 = 2 * N1); the reliability order of the bits in this polar code is a reliability sequence of length N2. Therefore, the information bits in the polar code are a portion of the bits in this reliability sequence (that is, a portion of the bits in the second information set that are in the reliability sequence of N2); among them, the bits with bit numbers less than N1 are the bits in the retransmitted bit sequence (that is, the first bit sequence) (that is, the bits in the first information set that have bit numbers less than N1 in the second information set), that is, during retransmission, the retransmitted bit sequence needs to be mapped to these bits.

[0102] In the construction of polar codes, the information bits of the polar code (i.e., the M sub-information sets included in the second information set) can be obtained in M ​​steps. Considering the limited number of retransmissions, the number of information bits on the retransmission resources should not be too large, otherwise it will lead to a decrease in retransmission performance; therefore, a small number of information bits (i.e., (T...)) can be determined in each step. m -T m-1 ) first bits, m = 1, 2, ..., M, T m Greater than T m-1 T0 = ​​0, T M =K, M is greater than or equal to 2), so that a total of K information bits are determined in M ​​steps. That is, the K information bits are distributed among M sub-information sets, so that the number of information bits in each sub-information set is small (i.e., the number of first bits is small).

[0103] In addition, the bits in the m-th sub-information set (i.e., T) m -T m-1 The bits (T) are the bits excluding the first m-1 sub-information sets and the m-th pre-frozen set. m -T m-1) bits; thus, in the second bit sequence obtained after polar coding of the first bit sequence based on the first information set. Furthermore, the m-th pre-frozen set includes a portion of consecutive bits in the sequence obtained after the first interleaving of the first bit set of length N1 (i.e., the m-th pre-frozen set includes multiple consecutive second bits, and the multiple consecutive second bits include a portion of consecutive bits in the sequence obtained after the first interleaving of the first bit set of length N1). The first bit set is {0,1,2,…,N1}, that is, the bits in the m-th pre-frozen set correspond to retransmissions. In other words, when the transmitting device determines the bits in the m-th sub-information set, in the bits outside the first m-1 sub-information sets in the reliability sequence, it needs to skip the multiple consecutive second bits included in the m-th pre-frozen set, and then determine the bits in the m-th sub-information set from the remaining bits.

[0104] When retransmission resources are limited (i.e., few retransmissions), the transmitting device extracts the number of bits corresponding to the retransmission resources from the third bit sequence after the first interleaving, maps these bits to the retransmission resources, and outputs them. Because pre-freezing is performed based on the third bit sequence, the number of bits in the first information set is small when retransmission resources are limited, thus ensuring retransmission performance. When retransmission resources are abundant (i.e., many retransmissions), such as when the retransmission length equals the initial transmission length, the number of bits in the first information set is large, thus not causing a decrease in retransmission performance. In other words, retransmission performance is guaranteed regardless of the amount of retransmission resources.

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

[0106] The information encoding method provided in this application embodiment can be used in any communication system, such as a 3GPP communication system, for example, a long term evolution (LTE) system, a fifth generation (5G) mobile communication system, a hybrid LTE and 5G network system, a new radio (NR) system, a 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 narrow band 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, and a time division-synchronization code division multiple access (TDMA) system. Access, TD-SCDMA, enhanced mobile broadband (eMBB), ultra-reliable and low-latency communication (URLLC), enhanced machine-type communication (eMTC), and various types of future communication systems are not restricted. Non-terrestrial network (NTN) systems (such as satellite communication systems) and non-3GPP communication systems are also included.

[0107] The information 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.

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

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

[0110] In Figure 5, 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).

[0111] It is understandable that when network devices communicate with each other, or when terminal devices communicate with each other, they can also communicate based on channel coding. That is, the sending end device and the receiving end device can both be network devices or both be terminal devices, without restriction.

[0112] The terminal device in Figure 5 can be a device with wireless transceiver capabilities or a chip or chip system that can be installed 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.

[0113] For example, the terminal device in Figure 5 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.

[0114] In Figure 5, 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 such a device, a logical node or 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.

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

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

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

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

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

[0120] Based on the above description of the terminal device and network device, optionally, the information 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.

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

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

[0123] In specific implementation, as shown in Figure 5, each terminal device and network device can adopt the structure shown in Figure 7, or include the components shown in Figure 7. Figure 7 is a schematic diagram of the composition of a communication device 700 provided in an embodiment of this application. The communication device 700 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 7, the communication device 700 includes a processor 701, a transceiver 702, and a communication line 703.

[0124] Furthermore, the communication device 700 may also include a memory 704. The processor 701, memory 704, and transceiver 702 can be connected via a communication line 703.

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

[0126] Transceiver 702 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 702 can be a module, circuit, transceiver, or any device capable of enabling communication.

[0127] Communication line 703 is used to transmit information between the components included in communication device 700.

[0128] Memory 704 is used to store instructions. These instructions can be computer programs.

[0129] The memory 704 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, digital universal optical discs, Blu-ray discs, etc.), magnetic disk storage media or other magnetic storage devices, etc., without limitation.

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

[0131] In one example, processor 701 may include one or more CPUs, such as CPU0 and CPU1 in Figure 7.

[0132] As an optional implementation, the communication device 700 may include multiple processors, for example, in addition to the processor 701 in FIG7, it may also include a processor 707.

[0133] As an optional implementation, the communication device 700 also includes an output device 705 and an input device 706. For example, the input device 706 is a device such as a keyboard, mouse, microphone, or joystick, and the output device 705 is a device such as a display screen or speaker.

[0134] The communication device 700 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 FIG7. Furthermore, the composition shown in FIG7 does not constitute a limitation on the communication device; in addition to the components shown in FIG7, the communication device may include more or fewer components than shown, or combine certain components, or have different component arrangements.

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

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

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

[0138] Figure 8 is a flowchart of an information encoding method provided in an embodiment of this application. As shown in Figure 8, the method may include the following steps:

[0139] S801. In data retransmission, the sending device performs polar coding on the first bit sequence according to the first information set to obtain a second bit sequence of length N1.

[0140] The first bit sequence includes part of the information bits of the input bit sequence of length K in the initial data transmission. The initial data transmission corresponds to the data retransmission. K is a positive integer and K is less than or equal to N1.

[0141] The first information set includes bits with bit indices less than N1 from the second information set. The second information set is the union of M sub-information sets. The m-th sub-information set among the M sub-information sets includes (T) bits from the reliability sequence of length N2. m -T m-1 The first bit of the M sub-information sets has no overlap, and the M sub-information sets have m = 1, 2, ..., M. m Greater than T m-1 T0 = ​​0, T M =K, N2 = 2 * N1, M is greater than or equal to 2.

[0142] Among them, (T) m -T m-1 The first bit includes the bits in the reliability sequence excluding the first m-1 sub-information sets and the m-th pre-frozen set (T) m -T m-1 ) bits; the m-th pre-frozen set includes multiple consecutive second bits, which include some consecutive bits in the sequence obtained after the first bit set of length N1 is interleaved, and the first bit set is {0,1,2,…,N1}.

[0143] For example, the input bit sequence consists of the information bits of the initial input bit sequence of length N1 in the initial data transmission. That is, the initial input bit sequence contains K information bits and N1-K frozen bits. Among them, the initial input bit sequence in the initial data transmission is polar-coded to obtain the initial bit sequence of length N1 (i.e., the fourth bit sequence below). For example, the first bit sequence includes part of the information bits of the input bit sequence of length K in the initial data transmission, which can be understood as: encoding part of the information bits in the input bit sequence (i.e., the first bit sequence) and then retransmitting it.

[0144] Optionally, polar encoding is performed on the first bit sequence according to the first information set to obtain a second bit sequence of length N1, including: mapping the first bit sequence to bits in the first information set, and polar encoding the first bit sequence to obtain the second bit sequence.

[0145] For example, the transmitting device can sequentially map information bits in the first bit sequence to bits in the first information set. For instance, the information bit at the lowest reliability bit in the first bit sequence can be mapped to the highest reliability bit in the first information set; correspondingly, the information bit at the highest reliability bit in the first bit sequence can be mapped to the lowest reliability bit in the first information set. Alternatively, the information bit at the lowest reliability bit in the first bit sequence can be mapped to the lowest reliability bit in the first information set; correspondingly, the information bit at the highest reliability bit in the first bit sequence can be mapped to the highest reliability bit in the first information set.

[0146] Alternatively, the transmitting device can map information bits in the first bit sequence to any bit in the first information set; such that each information bit in the first bit sequence can be mapped to a bit in the first information set, and the bit positions mapped by each information bit do not overlap. For example, information bit A1 in the first bit sequence can be mapped to bit B1 in the first information set, and information bit A2 in the first bit sequence can be mapped to bit B2 in the first information set. Here, A1 and A2 are not equal, and B1 and B2 are not equal.

[0147] For example, in the polar coding process, a polar code is constructed based on the initial transmission length and the retransmission length being equal (both lengths are N1), that is, the length of the constructed polar code is N2 (N2 = 2 * N1); the reliability order of the bits in this polar code is a reliability sequence of length N2. Therefore, the information bits in the polar code are a portion of the bits in this reliability sequence (i.e., a portion of the bits in the second information set that are in the reliability sequence of N2); wherein, the bit indices in the reliability sequence are sorted from high to low reliability, and the bits with bit indices less than N1 are the bits in the retransmitted bit sequence (i.e., the first bit sequence) (i.e., the bits in the first information set that have bit indices less than N1 in the second information set). That is, during retransmission, the retransmitted bit sequence needs to be mapped onto these bits.

[0148] For example, the second information set is the union of M sub-information sets, and the m-th sub-information set in the M sub-information sets includes (T) a reliability sequence of length N2. m -T m-1 The first bit can be understood as follows: In the construction of the polar code, the information bits of the polar code (i.e., the M sub-information sets included in the second information set) can be obtained in M ​​steps. Considering a small number of retransmissions, the number of information bits on the retransmission resources should not be too large, otherwise it will lead to a decrease in retransmission performance; therefore, a small number of information bits (i.e., (T)) can be determined in each step. m -T m-1 ) first bits, m = 1, 2, ..., M, T m Greater than T m-1 T0 = ​​0, T M =K, M is greater than or equal to 2), so that a total of K information bits are determined in M ​​steps. That is, the K information bits are distributed among M sub-information sets, so that the number of information bits in each sub-information set is small (i.e., the number of first bits is small).

[0149] For example, due to the bits in the m-th sub-information set (i.e., T) m -T m-1 The bits (T) are the bits excluding the first m-1 sub-information sets and the m-th pre-frozen set. m -T m-1(N) bits. Furthermore, since the m-th pre-frozen set includes a portion of consecutive bits from the sequence obtained after the first interleaving of the first bit set of length N1; the first bit set is {0,1,2,…,N1}. That is, the bits in the m-th pre-frozen set correspond to retransmissions. In other words, when determining the bits in the m-th sub-information set, the transmitting device, in the bits outside the first m-1 sub-information sets in the reliability sequence, needs to skip multiple consecutive second bits included in the m-th pre-frozen set before determining the bits in the m-th sub-information set from the remaining bits.

[0150] Therefore, when retransmission resources are limited (i.e., few retransmissions), the transmitting device extracts the number of bits corresponding to the retransmission resources from the third bit sequence after the first interleaving, maps these bits to the retransmission resources, and outputs them. Because pre-freezing is performed based on the third bit sequence, the number of bits in the first information set is small when retransmission resources are limited, thus ensuring retransmission performance. When retransmission resources are abundant (i.e., many retransmissions), such as when the retransmission length equals the initial transmission length, the number of bits in the first information set is large, thus not causing a decrease in retransmission performance. In other words, retransmission performance is guaranteed regardless of the amount of retransmission resources.

[0151] S802. The transmitting device performs a first interleaving based on the second bit sequence to obtain a third bit sequence.

[0152] Optionally, the third bit sequence is the last Y bits of the sequence obtained after the second bit sequence undergoes the first interleaving, where Y is the length of the retransmitted bit sequence. For example, taking the total transmission length of the polar code for initial transmission and retransmission as Q, Y = Q - N1.

[0153] Optionally, the first interleaving can be sub-block interleaving or row-column interleaving; or, the first interleaving can be any other possible interleaving besides the examples above, which is not limited in this application.

[0154] For example, taking N1=32 as an example, if the first interleaving adopts the interleaving method in the encoding process of NR, the information encoding method can be compatible with NR; at this time, the sequence obtained after the first bit set is after the first interleaving can be [0, 1, 2, 4, 3, 5, 6, 7, 8, 16, 9, 17, 10, 18, 11, 19, 12, 20, 13, 21, 14, 22, 15, 23, 24, 25, 26, 28, 27, 29, 30, 31].

[0155] If the first interleaving is a sub-block interleaving, excellent interleaving performance can be obtained; at this time, the sequence obtained after the first bit set is [0, 4, 8, 12, 1, 5, 9, 13, 2, 6, 10, 14, 3, 7, 11, 15, 16, 20, 24, 28, 17, 21, 25, 29, 18, 22, 26, 30, 19, 23, 27, 31].

[0156] If the first interleaving is row-column interleaving, the complexity of interleaving can be reduced; in this case, the sequence obtained after the first bit set is [0, 8, 16, 24, 1, 9, 17, 25, 2, 10, 18, 26, 3, 11, 19, 27, 4, 12, 20, 28, 5, 13, 21, 29, 6, 14, 22, 30, 7, 15, 23, 31].

[0157] S803, the transmitting device outputs one or more bits from the third bit sequence; correspondingly, the receiving device acquires the first sequence to be decoded. The first sequence to be decoded corresponds to data retransmission.

[0158] The third bit sequence output by the transmitting device may include one or more bits, which may be modulated by the transmitting device to obtain symbol sequence #1 and then transmitted to the receiving device.

[0159] The first sequence to be decoded, obtained by the receiving device, may include: the receiving device receiving symbol sequence #2 from the transmitting device and demodulating symbol sequence #2 to obtain the first sequence to be decoded.

[0160] When symbol sequence #1 is transmitted through the channel, it may be affected by noise and other interference; therefore, the symbol sequence #2 received by the receiving device is symbol sequence #1 affected by noise and other interference.

[0161] S804. In the initial data transmission, the transmitting device outputs one or more bits from the fourth bit sequence; correspondingly, the receiving device acquires the second sequence to be decoded, wherein the second sequence to be decoded corresponds to the initial data transmission.

[0162] The fourth bit sequence output by the transmitting device may include one or more bits, which may be modulated by the transmitting device to obtain symbol sequence #3, and then transmitted to the receiving device.

[0163] The second sequence to be decoded, obtained by the receiving device, may include: the receiving device receiving symbol sequence #4 from the transmitting device and demodulating symbol sequence #4 to obtain the second sequence to be decoded.

[0164] Among them, symbol sequence #3 may be affected by noise and other interference when it is transmitted through the channel; therefore, the symbol sequence #4 received by the receiving device is symbol sequence #3 affected by noise and other interference.

[0165] Optionally, the fourth bit sequence is obtained by the transmitting device through polar encoding of the input bit sequence based on the third information set, and the length of the fourth bit sequence is N1. That is, before step S804, the transmitting device also needs to perform polar encoding of the input bit sequence based on the third information set to obtain the fourth bit sequence.

[0166] The third information set includes K third bits, which correspond one-to-one with K fourth bits in the reliability sequence excluding the first bit set. The bit index of the third bit corresponding to the fourth bit with bit index k is k-N1, where k is greater than or equal to N1 and k is less than N2. In other words, the transmitting device can determine K bits from the bits in the reliability sequence excluding the first bit set as K fourth bits; further, N1 is subtracted from the bit index of each fourth bit to obtain the corresponding third bit. For example, the transmitting device can map the input bit sequence to the bits in the third information set and perform polar coding to obtain the fourth bit sequence.

[0167] For example, the transmitting device polarizes the input bit sequence according to the third information set to obtain the fourth bit sequence, including: the transmitting device maps the input to the bits of the third information set, and combines the input bit sequence mapped to the K third bits and the N1-K frozen bits with a reliability lower than the K third bits to form an initial transmission input bit sequence of length N1 in the initial data transmission. Thus, the initial transmission input bit sequence includes K information bits (i.e., the input bit sequence) and N1-K frozen bits. Further, the initial transmission input bit sequence is polarized to obtain the fourth bit sequence. It can be understood that step S804 is a step performed during the initial data transmission, and steps S801 to S803 are steps performed during the data retransmission. Therefore, step S804 is performed before steps S801 to S803; furthermore, after the transmitting device performs step S804 and learns that the receiving device has failed to decode the second sequence to be decoded, steps S801 to S803 are performed. For example, after executing step S804, if the transmitting device receives a NACK message from the receiving device, it executes steps S801 to S803. Alternatively, the transmitting device may also learn that the receiving device has failed to decode the second sequence to be decoded through any other possible means; this application embodiment does not limit this.

[0168] S805. The receiving device decodes the first sequence to be decoded and the second sequence to be decoded according to the first information set to obtain the first bit sequence.

[0169] For example, the receiving device can perform joint decoding on the first sequence to be decoded and the second sequence to be decoded. Specifically, the implementation of decoding the first sequence to be decoded and the second sequence to be decoded by the receiving device is similar to the implementation of joint decoding involved in the above-mentioned related technologies. For details, please refer to the relevant descriptions in the above embodiments, which will not be repeated here.

[0170] For example, the decoding result obtained by the receiving device after decoding the first and second sequences to be decoded includes at least the first bit sequence. Further, the decoding result may include the input bit sequence; that is, the receiving device can obtain the input bit sequence according to the joint decoding in step S805. In this case, step S805 can also be replaced by: the receiving device decoding the first and second sequences to be decoded according to the first information set to obtain the input bit sequence.

[0171] The information encoding method provided in this application embodiment allows the transmitting device to map a retransmitted information bit sequence (i.e., a first bit sequence, which includes a portion of the information bits of an input bit sequence of length K, where K is a positive integer and K is less than or equal to N1) to the bits contained in a first information set, and then perform polar encoding on the bit sequence to obtain a polar encoded sequence of length N1 (i.e., a second bit sequence); furthermore, the polar encoded sequence is interleaved (such as a first interleaving), and one or more bits in the interleaved sequence (i.e., a third bit sequence) are output, thereby realizing the retransmission of the input bit sequence, so that the receiving device can jointly decode one or more bits of the output sequence corresponding to the input bit sequence, thereby improving the decoding performance.

[0172] In the process of polar coding, a polar code can be constructed based on the initial transmission length and the retransmission length being equal (both lengths are N1), that is, the length of the constructed polar code is N2 (N2 = 2 * N1); the reliability order of the bits in this polar code is a reliability sequence of length N2. Therefore, the information bits in the polar code are a portion of the bits in this reliability sequence (that is, a portion of the bits in the second information set that are in the reliability sequence of N2); among them, the bits with bit numbers less than N1 are the bits in the retransmitted bit sequence (that is, the first bit sequence) (that is, the bits in the first information set that have bit numbers less than N1 in the second information set), that is, during retransmission, the retransmitted bit sequence needs to be mapped to these bits.

[0173] In the construction of polar codes, the information bits of the polar code (i.e., the M sub-information sets included in the second information set) can be obtained in M ​​steps. Considering the limited number of retransmissions, the number of information bits on the retransmission resources should not be too large, otherwise it will lead to a decrease in retransmission performance; therefore, a small number of information bits (i.e., (T...)) can be determined in each step. m -T m-1 ) first bits, m = 1, 2, ..., M, T m Greater than T m-1 T0 = ​​0, T M =K, M is greater than or equal to 2), so that a total of K information bits are determined in M ​​steps. That is, the K information bits are distributed among M sub-information sets, so that the number of information bits in each sub-information set is small (i.e., the number of first bits is small).

[0174] In addition, the bits in the m-th sub-information set (i.e., T) m -T m-1 The bits (T) are the bits excluding the first m-1 sub-information sets and the m-th pre-frozen set. m -T m-1 The m-th pre-frozen set includes a portion of consecutive bits in the sequence obtained after the first interleaving of the first bit set of length N1 (i.e., the m-th pre-frozen set includes multiple consecutive second bits, which in turn include a portion of consecutive bits in the sequence obtained after the first interleaving of the first bit set of length N1). The first bit set is {0, 1, 2, ..., N1}, meaning the bits in the m-th pre-frozen set correspond to retransmissions. In other words, when determining the bits in the m-th sub-information set, the transmitting device must skip the multiple consecutive second bits included in the m-th pre-frozen set from the bits outside the first m-1 sub-information sets in the reliability sequence, and then determine the bits in the m-th sub-information set from the remaining bits.

[0175] When retransmission resources are limited (i.e., few retransmissions), the transmitting device extracts the number of bits corresponding to the retransmission resources from the third bit sequence after the first interleaving, maps these bits to the retransmission resources, and outputs them. Because pre-freezing is performed based on the third bit sequence, the number of bits in the first information set is small when retransmission resources are limited, thus ensuring retransmission performance. When retransmission resources are abundant (i.e., many retransmissions), such as when the retransmission length equals the initial transmission length, the number of bits in the first information set is large, thus not causing a decrease in retransmission performance. In other words, retransmission performance is guaranteed regardless of the amount of retransmission resources.

[0176] The above is a general description of the information encoding method provided in this application. The "second information set" and "third information set" involved in the above embodiments will be described in detail below.

[0177] Optionally, when m=1, the first pre-frozen set used to determine the m-th sub-information set in the second information set is an empty set. That is, the T1 first bits included in the first sub-information set are the T1 first bits in the reliability sequence.

[0178] Based on the implementation of the first pre-frozen set, the "second information set" and "third information set" can be implemented in the following two possible ways:

[0179] In one possible implementation, the m-th sub-information set in the second information set is determined based on three elements: the reliability sequence, the first m-1 sub-information sets, and the m-th pre-frozen set; the third information set is determined based on two elements: the reliability sequence and the first bit set.

[0180] (I) Regarding the second information set:

[0181] Optionally, in this possible implementation, the m-th sub-information set contains (T) m -T m-1 The first bit is the most reliable bit in the reliability sequence, excluding the first m-1 sub-information sets and the m-th pre-frozen set. m -T m-1 ) bits.

[0182] For example, (T) m -T m-1 The first bit includes the most reliable bit (T) in the reliability sequence, excluding the first m-1 sub-information sets and the m-th pre-frozen set. m -T m-1 The process of selecting T1 of the most reliable bits from a reliability sequence of length N2 can be understood as follows: First, select T1 of the most reliable bits as the first sub-information set. Then, consider the bits contained in the first sub-information set and the second pre-frozen set in the reliability sequence as pre-frozen bits, and select the most reliable (T2-T1) bits from the remaining bits as the second sub-information set. Further, consider the bits contained in the first sub-information set, the second sub-information set, and the third pre-frozen set in the reliability sequence as pre-frozen bits, and select the most reliable (T3-T2) bits from the remaining bits as the third sub-information set, and so on, until K bits are determined from the reliability sequence.

[0183] Optionally, the m-th pre-frozen set includes the most reliable consecutive bits in the sequence obtained after the first interleaving of the first bit set of length N1.

[0184] For example, taking N1 = 32 and the m-th pre-frozen set containing N1 / 4 second bits as an example, if the sequence obtained after the first interleaving of the first bit set is [0, 1, 2, 4, 3, 5, 6, 7, 8, 16, 9, 17, 10, 18, 11, 19, 12, 20, 13, 21, 14, 22, 15, 23, 24, 25, 26, 28, 27, 29, 30, 31], then the m-th pre-frozen set is [24, 25, 26, 28, 27, 29, 30, 31]. If the sequence obtained after the first interleaving of the first bit set is [0, 4, 8, 12, 1, 5, 9, 13, 2, 6, 10, 14, 3, 7, 11, 15, 16, 20, 24, 28, 17, 21, 25, 29, 18, 22, 26, 30, 19, 23, 27, 31], then the m-th pre-frozen set is [18, 22, 26, 30, 19, 23, 27, 31]. If the sequence obtained after the first interleaving of the first bit set is [0, 8, 16, 24, 1, 9, 17, 25, 2, 10, 18, 26, 3, 11, 19, 27, 4, 12, 20, 28, 5, 13, 21, 29, 6, 14, 22, 30, 7, 15, 23, 31], then the m-th pre-frozen set is [6, 14, 22, 30, 7, 15, 23, 31].

[0185] Optionally, the number of second bits in the m-th pre-frozen set is less than the number of second bits in the (m+1)-th pre-frozen set. That is, the larger the value of m, the more second bits the m-th pre-frozen set contains.

[0186] For example, the number of consecutive second bits contained in the m-th pre-frozen set is (N1 / 2). M+2-m For example, when M is 3, the second pre-frozen set contains (N1 / 8) consecutive second bits; the third pre-frozen set contains (N1 / 4) consecutive second bits. When M is 2, the second pre-frozen set contains (N1 / 4) consecutive second bits.

[0187] It is understandable that the above example assumes that the number of second bits contained in the m-th pre-frozen set is (N1 / 2). M+2-m The implementation of the m-th pre-frozen set is illustrated using an example. In fact, the number of second bits contained in the m-th pre-frozen set can also include any other possible implementations besides the example above, and this application does not limit it.

[0188] Taking a reliability sequence of length N2 with N2 = 64 as an example, [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 transmitting device can determine the T1 bits from the end to the beginning of this reliability sequence as the first sub-information set. For example, when K=21 and T1=19, the first sub-information set is [39,29,43,30,45,51,46,53,54,57,58,60,31,47,55,59,61,62,63]. Furthermore, if the sequence obtained after the first interleaving of the first bit set is [0, 4, 8, 12, 1, 5, 9, 13, 2, 6, 10, 14, 3, 7, 11, 15, 16, 20, 24, 28, 17, 21, 25, 29, 18, 22, 26, 30, 19, 23, 27, 31], then the second pre-frozen set is [18, 22, 26, 30, 19, 23, 27, 31]. Then, the second sub-information set can be determined from the last (T2-T1) = 2 bits in the reliability sequence, excluding the first sub-information set and the second pre-frozen set. In this case, the second sub-information set is [52, 56]. Therefore, the union of the first and second sub-information sets is obtained, i.e., the second information set is [52,56,39,29,43,30,45,51,46,53,54,57,58,60,31,47,55,59,61,62,63]. At this time, the first information set is [29,30,31].

[0189] Optional, T m Related to K, or T m Related to K and N1.

[0190] In one example, when K / N1 is greater than the first threshold, T m =K; When K / N1 is less than or equal to the first threshold, T m Greater than T m-1 In other words, when K / N1 is less than or equal to the first threshold, the information encoding method described in this application is used; otherwise, let T... m =K, that is, T1=K, which means that the polar coding method described in the related technology can be used.

[0191] In another example, T mRelated to K include:

[0192] For example, when M=2, When M=3 Understandably, the above example shows T m The partial implementation does not represent the T in this application. m Including only the above implementations, T actually m Other possible implementations may exist, and this application does not limit them.

[0193] (II) For the third information set:

[0194] Optionally, in this possible implementation, the K fourth bits used to determine the third information set are the K most reliable bits among the bits in the reliability sequence other than the first bit set.

[0195] For example, taking a reliability sequence of length N2 with N1=32, K=21 and [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] as an example, the first bit set is [[0,1,2,3,4,…,31]. Therefore, the K fourth bits include [49,44,50,52,56,39,43,45,51,46,53,54,57,58,60,47,55,59,61,62,63]. Furthermore, subtracting N1 from the bit index of the fourth bit yields the K third bits [17,12,18,20,24,7,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31].

[0196] In another possible implementation, the m-th sub-information set in the second information set is determined based on four elements: the reliability sequence, the first m-1 sub-information sets, the m-th pre-frozen set, and the second bit set; the third information set is determined based on three elements: the reliability sequence, the first bit set, and the second bit set. The second bit set is determined based on the rate matching method of the input bit sequence, which includes puncturing and shortening.

[0197] Optionally, the second set of bits includes at least one sixth bit.

[0198] As an example, when the rate matching method is puncturing, the sixth bit with bit index n+N1 corresponds to the punctured bit with bit index n in the fourth bit sequence. Here, n is greater than or equal to 0, and n is less than N1. That is, the punctured bit is first determined from the fourth bit sequence, and then N1 is added to the bit index of that punctured bit to obtain the sixth bit.

[0199] For example, in this example, the implementation of determining the sixth bit based on the puncture bit in the fourth bit sequence is similar to the implementation of determining the third bit based on the fourth bit in the above embodiments. For details, please refer to the relevant descriptions in the above embodiments, which will not be repeated here.

[0200] As another example, when the rate matching method is shortening, the at least one sixth bit is the union of the third bit set and the fourth bit set. The third bit set includes at least one seventh bit, and the seventh bit with bit number x+N1 corresponds to the shortened bit with bit number x in the fourth bit sequence. The fourth bit set includes the shortened bits in the second bit sequence. Here, n is greater than or equal to 0, and x is less than N1.

[0201] In other words, the shortened bit is first determined from the fourth bit sequence. Then, the bit index of the shortened bit is added to N1 to obtain the seventh bit. The union of at least one seventh bit included in the third bit set and the shortened bit in the second bit sequence is determined as the second bit set (i.e., at least one sixth bit).

[0202] For example, in this example, the implementation of determining the seventh bit based on the shortened bit in the fourth bit sequence is similar to the implementation of determining the third bit based on the fourth bit in the above embodiments. For details, please refer to the relevant descriptions in the above embodiments, which will not be repeated here.

[0203] Combining the two examples above, (i) for the second information set:

[0204] Optionally, in this possible implementation, the m-th sub-information set contains (T) m -T m-1 The first bit includes bits from the reliability sequence excluding the first m-1 sub-information sets, the m-th pre-frozen set, and the second bit set (T). m -T m-1 ) bits.

[0205] In other words, (T) m -T m-1The first bit includes the bits in the reliability sequence excluding the first m-1 sub-information sets and the m-th pre-frozen set (T) m -T m-1 ) bits, including: (T m -T m-1 The first bit includes bits from the reliability sequence excluding the first m-1 sub-information sets, the m-th pre-frozen set, and the second bit set (T). m -T m-1 ) bits.

[0206] Optional, (T) m -T m-1 The first bit is the most reliable bit in the reliability sequence, excluding the first m-1 sub-information sets, the m-th pre-frozen set, and the second bit set. m -T m-1 ) bits.

[0207] For example, (T) m -T m-1 The first bit includes the most reliable bit (T) in the reliability sequence, excluding the first m-1 sub-information sets, the m-th pre-frozen set, and the second bit set. m -T m-1 The process of determining the number of bits can be understood as follows: First, the bits contained in the second bit set of the reliability sequence of length N² are considered as pre-frozen bits, and the most reliable T1 bits are selected from the remaining bits as the first sub-information set. Then, the bits contained in the first sub-information set, the second pre-frozen set, and the second bit set of the reliability sequence are considered as pre-frozen bits, and the most reliable (T2-T1) bits are selected from the remaining bits as the second sub-information set. Further, the bits contained in the first sub-information set, the second sub-information set, the second bit set, and the third pre-frozen set of the reliability sequence are considered as pre-frozen bits, and the most reliable (T3-T2) bits are selected from the remaining bits as the third sub-information set, and so on, until K bits are determined from the reliability sequence. Finally, the union of the M sub-information sets is used to determine the second information set.

[0208] For example, in this possible implementation, the implementation of the m-th pre-frozen set can be found in the implementation of the m-th pre-frozen set in "as one possible implementation" above, and will not be repeated here.

[0209] (II) For the third information set:

[0210] Optionally, in this possible implementation, the K fourth bits used to determine the third information set are the K most reliable bits among the bits in the reliability sequence other than the first bit set and the fifth bit set.

[0211] As an example, when the rate matching method is puncturing, the fifth bit set includes bits with bit indices n+N1 that correspond to the punctured bit with bit indices n in the fourth bit sequence. Here, n is greater than or equal to 0, and n is less than N1. That is, the punctured bit is first determined from the fourth bit sequence, and then N1 is added to the bit index of that punctured bit to obtain the fifth bit set.

[0212] For example, in this example, the implementation of determining the fifth bit set based on the punctured bits in the fourth bit sequence is similar to the implementation of determining the third bit based on the fourth bit in the above embodiments. For details, please refer to the relevant descriptions in the above embodiments, which will not be repeated here.

[0213] As another example, when the rate matching mode is shortening, the fifth bit set includes at least one seventh bit, and the seventh bit with bit number x+N1 corresponds to the shortened bit with bit number x in the fourth bit set. That is, the shortened bit is determined from the fourth bit sequence, and further, the seventh bit is obtained by subtracting N1 from the bit number of the shortened bit.

[0214] For example, in this example, the implementation of determining the seventh bit based on the shortened bit in the fourth bit sequence can be found in the relevant description in the above embodiments, and will not be repeated here.

[0215] Combining the two possible implementation methods mentioned above, optionally, after determining the second information set and the third information set, the first bit sequence (i.e., the partial information bits mentioned in step S801) can be determined based on the second information set and the third information set.

[0216] Optionally, the first bit sequence includes the information bits corresponding to the bit positions in the fourth information set in the input bit sequence, and the fourth information set is determined based on the third information set and the fifth information set.

[0217] The fifth information set includes one or more fifth bits. The fifth bit with bit number i-N1 corresponds to the first bit with bit number i in the second information set, where i is less than or equal to N1 and less than N2. In other words, the fifth bit corresponding to each first bit in the second information set is obtained by subtracting N1 from its bit number.

[0218] For example, with N1 = 32, the second information set is [52,56,39,29,43,30,45,51,46,53,54,57,58,60,31,47,55,59,61,62,63], and the fifth information set is [20,24,7,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31].

[0219] For example, the implementation of the third information can be found in the relevant descriptions in the above embodiments, and will not be repeated here.

[0220] Optionally, the fourth information set includes bits in the third information set that do not belong to the bit sequence number in the fifth information set.

[0221] For example, the fourth information set includes the bits in the third information set other than those included in the fifth information set. Taking the fifth information set as [20,24,7,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31] and the third information set as [17,12,18,20,24,7,11,13,19,14,21,22,25,26,28,15,23,27,29,30,31] as an example, the fourth information set is [17,12,18].

[0222] Optionally, after determining the first bit sequence, in step S801, the transmitting device can map the first bit sequence to the bits contained in the first information set and perform polar coding to obtain the second bit sequence.

[0223] Optionally, when the rate matching method is puncturing, one or more bits in the fourth bit sequence output in step S804 can be information bits of the non-punctured bits in the fourth information bit sequence.

[0224] Optionally, when the rate matching mode is shortened, one or more bits in the fourth bit sequence output in step S804 can be information bits in the fourth information bit sequence that are not shortened.

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

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

[0227] 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, in conjunction with the algorithm steps of the examples described in 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.

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

[0229] 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 method shown in Figure 8. All relevant content of each step involved in the above method embodiment 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 embodiment, and will not be repeated here.

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

[0231] For example, the transceiver module 901 can be used to execute all the transceiver operations performed by the sending device in the embodiment shown in FIG8, and / or to support other processes of the technology described herein; the processing module 902 can be used to execute all operations other than the transceiver operations performed by the sending device in the embodiment shown in FIG8, and / or to support other processes of the technology described herein.

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

[0233] 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. It should be understood that the transceiver module 1001 in the embodiments of this application 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).

[0234] 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 FIG8, 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 FIG8, and / or to support other processes of the technology described herein.

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

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

[0237] The processor can be logic circuit 1101, and the transceiver can be interface circuit 1102. Furthermore, the communication device 110 shown in FIG11 may also include a memory 1103.

[0238] This application also provides a communication device, as shown in FIG12. This communication device can be applied to the method shown in the embodiment of FIG8 above. 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.

[0239] In one example, the communication device acts as a transmitting device or is a chip applied in a transmitting device, and performs the steps performed by the transmitting device in the above method embodiments. The transceiver module is used to specifically perform the sending and / or receiving actions performed by the transmitting device in the embodiments of FIG8, 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.

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

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

[0242] 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 method involved in the embodiment shown in Figure 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 internal storage module of the chip, such as a register or cache. The storage module can also be an external storage module, such as ROM or other types of static storage devices that can store static information and instructions, RAM, etc.

[0243] It should be noted that the functions of the processor and interface can be implemented through hardware design, software design, or a combination of both; no restrictions are imposed here.

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

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

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

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

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

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

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

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

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

[0253] In the several embodiments provided in this application, it should be understood that 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 mutual coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between devices or units may be electrical, mechanical, or other forms.

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

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

[0256] 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 information encoding method, characterized in that, The method includes: In data retransmission, the first bit sequence is polar-coded according to the first information set to obtain a second bit sequence of length N1. Based on the second bit sequence, a first interleaving is performed to obtain a third bit sequence; and... Output one or more bits from the third bit sequence; Wherein, the first bit sequence includes part of the information bits of the input bit sequence of length K in the initial data transmission, the initial data transmission corresponds to the data retransmission, K is a positive integer, and K is less than or equal to N1; The first information set includes bits with bit indices less than N1 from the second information set. The second information set is the union of M sub-information sets, and the m-th sub-information set among the M sub-information sets includes (T) bits from a reliability sequence of length N2. m -T m-1 The first bit is defined as M bits, and there is no overlap between the M sub-information sets, m = 1, 2, ..., M, T m Greater than T m-1 T0 = ​​0, T M =K, N2 = 2 * N1, M is greater than or equal to 2; The (T) m -T m-1 The first bit includes the bits in the reliability sequence other than the first m-1 sub-information sets and the m-th pre-frozen set (T) m -T m-1 The m-th pre-frozen set includes multiple consecutive second bits, which include a portion of consecutive bits in the sequence obtained after the first interleaving of the first bit set of length N1. The first bit set is {0,1,2,…,N1}.

2. The method according to claim 1, characterized in that, The step of polar encoding the first bit sequence according to the first information set to obtain a second bit sequence of length N1 includes: mapping the first bit sequence to bits in the first information set, and polar encoding the first bit sequence to obtain the second bit sequence.

3. The method according to claim 1 or 2, characterized in that, The method further includes: In the initial data transmission, the input bit sequence is polar-coded according to the third information set to obtain a fourth bit sequence of length N1; Output one or more bits from the fourth bit sequence; The third information set includes K third bits, which correspond one-to-one with K fourth bits in the reliability sequence other than the first bit set. The bit number of the third bit corresponding to the fourth bit with bit number k is k-N1, where k is greater than or equal to N1 and k is less than N2.

4. The method according to claim 3, characterized in that, The K fourth bits are the K most reliable bits in the reliability sequence, excluding the first set of bits.

5. The method according to claim 3, characterized in that, The K fourth bits are the K most reliable bits in the reliability sequence, excluding the first bit set and the fifth bit set; where, When the rate matching method of the input bit sequence is puncturing, the bit with bit number n+N1 in the fifth bit set corresponds to the puncturing bit with bit number n in the fourth bit sequence, where n is greater than or equal to 0 and n is less than N1. When the rate matching method is shortening, the fifth bit set includes at least one seventh bit, and the seventh bit with bit number x+N1 corresponds to the shortened bit with bit number x in the fourth bit, where x is greater than or equal to 0 and x is less than N1.

6. The method according to any one of claims 1-5, characterized in that, The third bit sequence is the last Y bits of the sequence obtained after the second bit sequence is interleaved by the first interleaving, where Y is the length of the data retransmission.

7. An information decoding method, characterized in that, The method includes: Obtain the first sequence to be decoded, and retransmit the data corresponding to the first sequence to be decoded. Obtain the second sequence to be decoded, and transmit the data corresponding to the second sequence to be decoded initially. Based on the first information set, the first sequence to be decoded and the second sequence to be decoded are decoded to obtain the first bit sequence; Wherein, the first bit sequence includes part of the information bits of the input bit sequence of length K in the initial data transmission, the initial data transmission corresponds to the data retransmission, and K is a positive integer; The first information set includes bits with bit indices less than N1 from the second information set. The second information set is the union of M sub-information sets, and the m-th sub-information set among the M sub-information sets includes (T) bits from a reliability sequence of length N2. m -T m-1 The first bit is defined as M bits, and there is no overlap between the M sub-information sets, m = 1, 2, ..., M, T m Greater than T m-1 T0 = ​​0, T M =K, N2 = 2 * N1, M is greater than or equal to 2, N1 is greater than or equal to K; The (T) m -T m-1 The first bit includes the bits in the reliability sequence other than the first m-1 sub-information sets and the m-th pre-frozen set (T) m -T m-1 The m-th pre-frozen set includes multiple consecutive second bits, which include a portion of consecutive bits in the sequence obtained after the first interleaving of the first bit set of length N1. The first bit set is {0,1,2,…,N1}.

8. The method according to claim 7, characterized in that, The first bit sequence is mapped to the bits of the first information set.

9. The method according to any one of claims 1-8, characterized in that, The number of bits in the plurality of consecutive second bits is (N1 / 2) M+2-m ).

10. The method according to any one of claims 1-9, characterized in that, The partial information bits include the information bits corresponding to the bits in the fourth information set in the input bit sequence, and the fourth information set is determined based on the third information set and the fifth information set; The third information set includes K third bits, and the K third bits correspond one-to-one with the K fourth bits in the bit set other than the first bit set in the reliability sequence. The bit number of the third bit corresponding to the fourth bit with bit number k-N1 is k, where k is greater than or equal to N1 and k is less than N2. The fifth information set includes one or more fifth bits, and the fifth bits with bit numbers i-N1 correspond to the first bit with bit number i in the second information set, where i is greater than or equal to N1 and i is less than N2.

11. The method according to claim 10, characterized in that, The fourth information set includes bits within the third information set that do not belong to the bit sequence number in the fifth information set.

12. The method according to any one of claims 1-11, characterized in that, The (T) m -T m-1 The first bit is the most reliable bit in the reliability sequence, excluding the first m-1 sub-information sets and the m-th pre-frozen set (T). m -T m-1 ) bits.

13. The method according to any one of claims 1-11, characterized in that, The (T) m -T m-1 The first bit includes the bits in the reliability sequence other than the first m-1 sub-information sets and the m-th pre-frozen set (T) m -T m-1 ) bits, including: The (T) m -T m-1 The first bit includes the bits in the reliability sequence other than the first m-1 sub-information sets, the m-th pre-frozen set, and the second bit set (T) m -T m-1 The second set of bits is determined based on the rate matching method of the input bit sequence, which includes puncturing and shortening.

14. The method according to claim 13, characterized in that, The (T) m -T m-1 The ) bits are the most reliable bits in the reliability sequence excluding the first m-1 sub-information sets, the m-th pre-frozen set, and the second bit set (T). m -T m-1 ) bits.

15. The method according to claim 13 or 14, characterized in that, The second set of bits includes at least one sixth bit; Wherein, when the rate matching method is puncturing, the sixth bit with bit number n+N1 corresponds to the puncturing bit with bit number n in the fourth bit sequence, and the fourth bit sequence is obtained by polar encoding of the input bit sequence, where n is greater than or equal to 0 and n is less than N1. When the rate matching method is shortening, the at least one sixth bit is the union of the third bit set and the fourth bit set. The third bit set includes at least one seventh bit. The seventh bit with bit number x+N1 corresponds to the shortened bit with bit number x in the fourth bit set. The fourth bit set includes the shortened bit in the fourth bit set. x is greater than or equal to 0 and x is less than N1.

16. The method according to any one of claims 1-15, characterized in that, When m=1, the first pre-frozen set is an empty set.

17. The method according to any one of claims 1-16, characterized in that, T m Related to K, or T m Related to K and N1.

18. The method according to claim 17, characterized in that, When K / N1 is greater than the first threshold, T m =K; When K / N1 is less than or equal to the first threshold, T m Greater than T m-1 .

19. The method according to claim 17, characterized in that, The T m Related to K include:

20. A communication device, characterized in that, The communication device includes a processor; the processor is configured to run a computer program or instructions that cause the method described in any one of claims 1-6, 9-19 to be executed, or cause the method described in any one of claims 7-19 to be executed.

21. A communication device, characterized in that, The communication device includes an interface circuit and a logic circuit; the interface circuit is used to input and / or output information; the logic circuit is used to perform the method as described in any one of claims 1-6, 9-19, or to perform the method as described in any one of claims 7-19, processing and / or generating the information based on the information.

22. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores computer instructions or programs that, when executed on a computer, cause the method described in any one of claims 1-6, 9-19 to be performed, or cause the method described in any one of claims 7-19 to be performed.

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

Images