A method and apparatus for retransmission of polar codes

Abstract

A retransmission method and device of a polar code, wherein initial transmission construction and retransmission construction are based on the same reliability sequence, which helps to avoid complexity overhead caused by different reliability sequences of initial transmission and retransmission, thereby improving transmission performance. Moreover, when the first reliability sequence adopts an existing extraction manner, the complexity of the IR-HARQ construction based on the polar code can be reduced without changing the existing reliability sequence extraction manner.

Description

Technical Field

[0001] This application relates to the field of communications, and more specifically, to a method and apparatus for retransmitting polar codes. Background Technology

[0002] The construction process of a polar code is used to determine the information bits and frozen bits. Currently, the standard specifies a reliability sequence Q, where each value represents a sub-channel index, and the position of the index in sequence Q characterizes the reliability of the corresponding sub-channel. To construct a Polar code of length N, the K indices corresponding to the K most reliable sub-channels can be determined based on the reliability sequence of length N. The K data bits from the bits to be encoded are placed in the bits corresponding to the K indices, and the remaining (NK) bits are placed with frozen bits, which are typically 0. The reliability sequence of length N can be obtained from sequence Q.

[0003] Polar codes are suitable for incremental redundancy hybrid automatic repeat request (IR-HARQ) mechanisms. When constructing a Polar code-based IR-HARQ, a first code is first constructed for initial transmission, and then a second code is jointly constructed with the first code to support retransmission. Currently, the retransmission construction process for Polar code-based IR-HARQ is relatively complex, affecting transmission performance. Summary of the Invention

[0004] This application provides a method and apparatus for retransmitting polar codes, aiming to reduce the complexity of constructing IR-HARQ based on polar codes, thereby improving transmission performance.

[0005] In a first aspect, embodiments of this application provide a method for retransmitting polar codes. This method can be applied to a first communication device, which is an encoding-side device. The first communication device can be an encoding device, a module (e.g., a circuit, a chip, or a chip system (e.g., a modem chip, also known as a baseband chip, or a system-on-chip (SoC) chip containing a modem core, or a system-in-package (SIP) chip) within the encoding device, or a logical node, logical module, or software that can implement all or part of the encoding device. The encoding device can be a terminal device or a network device.

[0006] The method includes: obtaining a first reliability sequence, wherein the first reliability sequence is a reliability sequence used for initial transmission; obtaining a first set based on the first reliability sequence, wherein the first set includes a first index of retransmitted information bits; determining a first bit sequence based on the first set; performing polar coding on the first bit sequence to obtain a second bit sequence; and outputting the second bit sequence.

[0007] Based on the above method, the initial transmission construction and retransmission construction are based on the same reliability sequence, which helps to avoid the complexity overhead caused by the different reliability sequences of the initial transmission and retransmission, thereby improving transmission performance.

[0008] In some implementations, the first set includes K1 of the first indices, where K1 is determined based on the first reliability sequence and the number of information bits transmitted initially.

[0009] Based on the above implementation, the number of retransmitted information bits is determined based on the first reliability sequence and the number of information bits in the initial transmission. The retransmission is constructed based on the reliability sequence of the initial transmission, which helps to avoid the complexity overhead caused by the difference between the reliability sequences of the initial transmission and the retransmission, thereby improving the transmission performance.

[0010] In some other implementations, the K1 first indices are determined based on the first reliability sequence. For example, the K1 first indices are selected from the first reliability sequence based on reliability.

[0011] In some other implementations, the first bit sequence includes the retransmitted information bits, which are determined based on a second set, which includes K1 second indices, which are the K1 least reliable indices among the indices of the initially transmitted information bits.

[0012] Based on the above implementation, the retransmitted information bits are determined based on a second set, which is determined by the number of retransmitted information bits, the index of the initial transmitted information bits, and a first reliability sequence. The number of retransmitted information bits is determined based on the first reliability sequence and the number of initial transmitted information bits. Retransmission is constructed based on the initial reliability sequence, which helps avoid the complexity overhead caused by differences between the initial and retransmitted reliability sequences, thereby improving transmission performance. Furthermore, information bits located at low reliability positions are more prone to transmission errors. In this implementation, the retransmitted information bits are determined based on the low reliability index of the initial transmitted information bits, which supports retransmission of information bits located at low reliability positions in the initial transmitted information bits, thus helping to increase the probability of successful decoding.

[0013] In some other implementations, the values ​​of the information bits corresponding to the K1 first indices of the first bit sequence are the same as the values ​​of the information bits corresponding to the K1 second indices of the initially transmitted information bits.

[0014] In other words, the retransmitted information bits are those that were located at a low reliability position in the initial transmission. Information bits at low reliability positions are typically more prone to transmission errors; therefore, retransmitting these bits helps increase the probability of successful decoding. Furthermore, this implementation method is simple to implement.

[0015] In other implementations, K1 satisfies: K1 = 2S; where S is the number of indices in the third set whose size is less than the threshold value T, and the third set includes... A third index, the The third index is the one with high reliability in the first reliability sequence. There are several indices, where K is the number of bits of information initially transmitted. This indicates rounding down to the nearest integer.

[0016] Based on the above implementation, the allocation of information bits based on the first reliability sequence of length N1 can be achieved. Furthermore, the number of retransmitted information bits can be adjusted using a threshold value T.

[0017] In other implementations, K1 satisfies: K1 = 2S; where S is the number of indices in the third set whose size is less than the threshold value T; the third set includes... A third index, the The third index is the one with high reliability in the first reliability sequence. An index, where K is the number of information bits initially transmitted and K is an even number, or, the third set includes... A third index, the The third index is the one with high reliability in the first reliability sequence. There are several indices, where K is the number of information bits transmitted initially and K is an odd number; This indicates rounding down to the nearest integer.

[0018] Based on the above implementation, the allocation of information bits based on the first reliability sequence of length N1 can be achieved. Furthermore, the number of retransmitted information bits can be adjusted using a threshold value T.

[0019] In some other implementations, T is associated with at least one of the following parameters: the length of the first reliability sequence, the retransmission length, or the number of initial transmitted information bits.

[0020] In some other implementations, T = N1 / 2. Here, N1 is the length of the first reliability sequence. This implementation is simple.

[0021] In some other implementations, when K / N1 is less than or equal to the first threshold, T = N1 / 2, or when K / N1 is greater than the first threshold, T < N1 / 2. Here, N1 is the length of the first reliability sequence, and K is the number of information bits of the initial transmission.

[0022] Exemplarily, when K / N1 is greater than the first threshold, T = (63 / 128)N1.

[0023] K / N1 is the ratio of the number of information bits of the initial transmission to the length of the initial mother code, and can correspond to the initial transmission code rate. Based on the above implementations, different initial transmission code rates can correspond to different threshold values T, so as to support flexible retransmission lengths. And when the initial transmission code rate is small, the threshold value T can be a little larger to retransmit more information bits, and when the initial transmission code rate is large, the threshold value T can be a little smaller to reduce the number of retransmitted information bits, so as to better match the retransmission capacity, help avoid placing information bits at unreliable positions during retransmission, and thus improve the transmission performance.

[0024] In some other implementations, when E / N1 is greater than or equal to the second threshold, T = N1 / 2, or when E / N1 is less than the second threshold, T < N1 / 2. Here, N1 is the length of the first reliability sequence, K is the number of information bits of the initial transmission, and E is the retransmission length.

[0025] Exemplarily, when E / N1 is less than the second threshold, T = (63 / 128)N1.

[0026] Based on the above implementations, different retransmission lengths E correspond to different threshold values T, so as to support flexible retransmission lengths. And when E / N1 is large, the threshold value T can be a little larger to retransmit more information bits, and when E / N1 is small, the threshold value T can be a little smaller to reduce the number of retransmitted information bits, so as to better match the retransmission capacity and help avoid placing information bits at unreliable positions during retransmission.

[0027] In some other implementations, T < N1 / 2. Here, N1 is the length of the first reliability sequence.

[0028] Exemplarily, T = (63 / 128)N1.

[0029] Based on the above implementations, regardless of whether the initial transmission code rate is large or small, the threshold value T can be a little smaller to reduce the number of retransmitted information bits, which helps avoid placing information bits at unreliable positions during retransmission. And this implementation is simple.

[0030] In some implementations, the first threshold is 130 / 512. Simulation results show that this value yields good performance.

[0031] In some implementations, the second threshold is 1 / 2 or 5 / 8. Simulation results show that these values ​​yield good performance.

[0032] In some other implementations, the first set is determined based on a second reliability sequence, the length of which is greater than the length of the first reliability sequence, and the second reliability sequence is determined based on the first reliability sequence.

[0033] Based on the above implementation method, the first reliability sequence can be expanded into a second reliability sequence, and then the first bit sequence can be constructed according to the second reliability sequence. This helps to avoid the complexity overhead caused by the different reliability sequences of the initial transmission and retransmission, thereby improving the transmission performance.

[0034] In some other implementations, the first set includes K2 first indices, the K2 first indices being indices of a size less than N1 in the fourth set, the fourth set including K indices with high reliability in the second reliability sequence, where K is the number of initially transmitted information bits and N1 is the length of the first reliability sequence.

[0035] Based on the above implementation method, the existing deterministic set of copy bits can be reused. The method of determining the first set reduces the complexity of constructing IR-HARQ based on polar codes with minimal changes to the standard. Furthermore, based on this implementation, retransmitted information bits can be placed in high-reliability positions. Whether decoding the initial bits alone or jointly decoding the initial and retransmitted bits, the information bits are always carried in high-reliability positions, helping to ensure decoding performance.

[0036] In some other implementations, the first bit sequence includes the retransmitted information bits, which are determined based on a second set, which includes K2 fourth indices, which are indices in a fifth set that are different from the indices in the fourth set. The fifth set includes K fifth indices, which are determined based on K sixth indices of the initially transmitted information bits.

[0037] Based on the above implementation method, an existing set of bits to be copied can be reused. The second set is determined in a way that reduces the complexity of constructing IR-HARQ based on polar codes with minimal changes to the standard. Furthermore, the fourth index in the second set corresponds to the index of the position selected as an information bit in the initial transmission but not selected as an information bit in the retransmission; that is, the index of the low-reliability bits in the initial transmission. This allows for the retransmission of information bits located at low-reliability positions in the initial transmission, thereby helping to improve the probability of successful decoding.

[0038] In some other implementations, the i-th fifth index among the K fifth indices is the sum of the i-th sixth index among the K sixth indices and N1, where i = 0, 1, ..., K-1.

[0039] In some other implementations, the values ​​of the information bits corresponding to the K2 first indices of the first bit sequence are the same as the values ​​of the information bits corresponding to the K2 fourth indices of the initially transmitted information bits.

[0040] Based on the above implementation method, information bits located in low reliability positions in the initial transmission can be retransmitted, thereby helping to improve the probability of successful decoding.

[0041] In some other implementations, the length of the first reliability sequence is N1, and the length of the second reliability sequence is 2N1; the second reliability sequence is obtained based on a third sequence, wherein the 2i-th index and the (2i+1)-th index of the third sequence are the same, and the 2i-th index and the (2i+1)-th index of the third sequence are determined based on the i-th index of the first reliability sequence, i = 0, 1, ..., N1-1.

[0042] Based on the above implementation, a reliability sequence of length N1 can be extended to a reliability sequence of length 2N1 without introducing other reliability indices.

[0043] In some other implementations, the second reliability sequence satisfies:

[0044] Q N2 (I v )=Q N1 ;

[0045] Q N2 (I u )=Q N1 +N1;

[0046] I v =kron(Q N1 ,[1,1]) <N1 / 2;

[0047] I u =kron(QN1 ,[1,1])≥N1 / 2;

[0048] Among them, Q N2 For the second reliability sequence, Q N1 For the first reliability sequence, kron(Q) N1 [1,1]) represents the third sequence, and kron() represents the Kronecker operation.

[0049] Secondly, embodiments of this application provide a method for retransmitting polar codes. This method can be applied to a second communication device, which is a decoding-side device. The second communication device can be a decoding device, a module within the decoding device (e.g., a circuit, a chip, or a chip system (such as a modem chip, also known as a baseband chip, or a SoC chip or SIP chip containing a modem core), or a logical node, logical module, or software that can implement all or part of the decoding device. The decoding device can be a network device or a terminal device. The second aspect is a decoding-side method corresponding to the first aspect. The description of the same terms can refer to the first aspect or its implementation. The beneficial effects of the second aspect or its implementation can refer to the beneficial effects of the first aspect or its corresponding implementation, and will not be repeated here.

[0050] The method includes: acquiring a first symbol sequence and a second symbol sequence, wherein the first symbol sequence corresponds to the information transmitted initially and the second symbol sequence corresponds to the information transmitted retransmitted; acquiring a first reliability sequence, wherein the first reliability sequence is the reliability sequence used in the initial transmission; obtaining a first set based on the first reliability sequence, wherein the first set includes a first index of the information bits transmitted retransmitted; and performing joint polarization decoding on the first symbol sequence and the second symbol sequence based on the first set.

[0051] In some implementations, the first set includes K1 of the first indices, where K1 is determined based on the first reliability sequence and the number of information bits transmitted initially.

[0052] In some other implementations, the K1 first indices are determined based on the first reliability sequence. For example, the K1 first indices are selected from the first reliability sequence based on reliability.

[0053] In some other implementations, the retransmitted information bits are determined based on a second set, which includes K1 second indices, the K1 second indices being the K1 least reliable indices among the indices of the initially transmitted information bits.

[0054] In some other implementations, the values ​​of the information bits corresponding to the K1 first indices are the same as the values ​​of the information bits corresponding to the K1 second indices.

[0055] In some other implementations, K1 satisfies: K1 = 2S; where S is the number of indices in the third set that are smaller than the threshold value T, and the third set includes a number of third indices, and the number of third indices are the indices with high reliability in the first reliability sequence, K is the number of information bits in the initial transmission, and represents rounding down. represents rounding down.

[0056] In some other implementations, K1 satisfies: K1 = 2S; where S is the number of indices in the third set that are smaller than the threshold value T; the third set includes a number of third indices, and the number of third indices are the indices with high reliability in the first reliability sequence, K is the number of information bits in the initial transmission and K is an even number, or the third set includes a number of third indices, and the number of third indices are the indices with high reliability in the first reliability sequence, K is the number of information bits in the initial transmission and K is an odd number; and represents rounding down. represents rounding down.

[0057] In some other implementations, T is related to at least one of the following parameters: the length of the first reliability sequence, the retransmission length, or the number of information bits in the initial transmission.

[0058] In some other implementations, T = N1 / 2. Where N1 is the length of the first reliability sequence.

[0059] In some other implementations, when K / N1 is less than or equal to the first threshold, T = N1 / 2, or when K / N1 is greater than the first threshold, T < N1 / 2. Where N1 is the length of the first reliability sequence and K is the number of information bits in the initial transmission.

[0060] Exemplarily, when K / N1 is greater than the first threshold, T = (63 / 128)N1.

[0061] In some other implementations, when E / N1 is greater than or equal to the second threshold, T = N1 / 2, or when E / N1 is less than the second threshold, T < N1 / 2. Where N1 is the length of the first reliability sequence, K is the number of information bits in the initial transmission, and E is the retransmission length.

[0062] Exemplarily, when E / N1 is less than the second threshold, T = (63 / 128)N1.

[0063] In some other implementations, T < N1 / 2, where N1 is the length of the first reliability sequence.

[0064] Exemplarily, T = (63 / 128)N1.

[0065] In some other implementations, the first threshold is 130 / 512.

[0066] In some other implementations, the second threshold is 1 / 2 or 5 / 8.

[0067] In some other implementations, the first set is determined based on a second reliability sequence, the length of the second reliability sequence is greater than the length of the first reliability sequence, and the second reliability sequence is determined based on the first reliability sequence.

[0068] In some other implementations, the first set includes K2 first indices, and the K2 first indices are indices in a fourth set that are smaller than N1 in size. The fourth set includes K indices with high reliability in the second reliability sequence, K is the number of information bits in the initial transmission, and N1 is the length of the first reliability sequence.

[0069] In some other implementations, the retransmitted information bits are determined based on a second set, the second set includes K2 fourth indices, and the K2 fourth indices are indices in a fifth set that are different from the indices in the fourth set. The fifth set includes K fifth indices, and the K fifth indices are determined based on K sixth indices of the initial transmission information bits.

[0070] In some other implementations, the i-th fifth index among the K fifth indices is the sum of the i-th sixth index among the K sixth indices and N1, where i = 0, 1,..., K - 1.

[0071] In some other implementations, the values of the information bits corresponding to the K2 first indices are the same as the values of the information bits corresponding to the K2 fourth indices.

[0072] In some other implementations, the length of the first reliability sequence is N1, and the length of the second reliability sequence is 2N1; the second reliability sequence is obtained based on a third sequence, and the 2i-th index and the 2i + 1-th index of the third sequence are the same. The 2i-th index and the 2i + 1-th index of the third sequence are determined based on the i-th index of the first reliability sequence, where i = 0, 1,..., N1 - 1.

[0073] In some other implementations, the second reliability sequence satisfies:

[0074] Q N2 (I v )=Q N1 ;

[0075] Q N2 (I u )=Q N1 +N1;

[0076] I v =kron(Q N1 ,[1,1]) <N1 / 2;

[0077] I u =kron(Q N1 ,[1,1])≥N1 / 2;

[0078] Among them, Q N2 For the second reliability sequence, Q N1 For the first reliability sequence, kron(Q) N1 [1,1]) represents the third sequence, and kron() represents the Kronecker operation.

[0079] Thirdly, embodiments of this application provide a communication device that has the function of implementing the first aspect or any of its implementations. For example, the communication device includes modules, units, or means corresponding to the operations involved in the first aspect or any of its implementations. These modules, units, or means can be implemented in software, hardware, or a combination of software and hardware. This communication device can be the first communication device in the first aspect described above.

[0080] Fourthly, embodiments of this application provide a communication device that has the function of implementing the second aspect or any of its implementations. For example, the communication device includes modules, units, or means corresponding to the operations involved in the second aspect or any of its implementations. These modules, units, or means can be implemented in software, hardware, or a combination of software and hardware. This communication device can be the second communication device described in the second aspect.

[0081] Fifthly, embodiments of this application provide a communication device including an interface circuit and one or more processors. The one or more processors are coupled to a memory. The memory stores part or all of the necessary computer program or instructions for implementing the functions involved in the first aspect or any of its implementations. The one or more processors can execute the computer program or instructions, causing the communication device to implement the methods in the first aspect or any of its implementations when executed. The interface circuit is used to implement the communication functions within the communication device and / or the communication functions between the communication device and other devices or components.

[0082] In one possible implementation, the processor is used to communicate with other devices or components through the interface circuit.

[0083] In one possible implementation, the communication device may also include the memory. Optionally, the memory and processor are integrated together.

[0084] The aforementioned communication device may be a terminal, or a communication module in a terminal, or a chip in a terminal that is responsible for communication functions, such as a modem chip or a SoC or SIP chip containing a modem module.

[0085] The aforementioned communication device may also be a network device, a module (e.g., a circuit, chip, or chip system) within a network device, or a logical node, logical module, or software that can implement all or part of a network device.

[0086] Sixthly, embodiments of this application provide a communication device including an interface circuit and one or more processors. The one or more processors are coupled to a memory. The memory stores part or all of the necessary computer program or instructions for implementing the functions involved in the second aspect or any of its implementations. The one or more processors can execute the computer program or instructions, causing the communication device to implement the methods in the second aspect or any of its implementations when executed. The interface circuit is used to implement the communication functions within the communication device and / or the communication functions between the communication device and other devices or components.

[0087] In one possible implementation, the processor is used to communicate with other devices or components through the interface circuit.

[0088] In one possible implementation, the communication device may also include the memory. Optionally, the memory and processor are integrated together.

[0089] The aforementioned communication device may be a terminal, or a communication module in a terminal, or a chip in a terminal that is responsible for communication functions, such as a modem chip or a SoC or SIP chip containing a modem module.

[0090] The aforementioned communication device may also be a network device, a module (e.g., a circuit, chip, or chip system) within a network device, or a logical node, logical module, or software that can implement all or part of a network device.

[0091] In a seventh aspect, embodiments of this application provide a communication system including at least one of the first communication device or the second communication device described above.

[0092] Eighthly, embodiments of this application provide a computer-readable storage medium storing computer-readable instructions that, when read and executed by a computer, cause the computer to perform any of the above aspects or any implementation thereof.

[0093] Ninthly, embodiments of this application provide a computer program product that, when read and executed by a computer, causes the computer to perform the method in any of the above aspects or any of its implementations.

[0094] In a tenth aspect, embodiments of this application provide a computer program that, when run on a computer, causes the methods provided in any of the foregoing aspects or their possible implementations to be executed. Attached Figure Description

[0095] Figure 1 This is a schematic diagram of a network architecture applicable to embodiments of this application.

[0096] Figure 2 This is an example of an open wireless access network architecture in this application.

[0097] Figure 3 This is a schematic diagram of a Polar code encoding of length 8.

[0098] Figure 4 This is a schematic diagram of IR-HARQ based on Polar codes.

[0099] Figure 5 This is a schematic flowchart of the information processing method 500 provided in this application.

[0100] Figure 6 This is an example of the IR-HARQ construction method based on Polar codes in this application.

[0101] Figure 7 This is a schematic flowchart of the information processing method 700 provided in this application.

[0102] Figure 8 This is a schematic diagram of the structure of an apparatus provided in an embodiment of this application.

[0103] Figure 9 This is another schematic diagram of the device provided in the embodiments of this application.

[0104] Figure 10 This is a schematic diagram of a chip system provided in an embodiment of this application. Detailed Implementation

[0105] To facilitate understanding of the embodiments of this application, the following points will be explained before introducing the embodiments of this application.

[0106] "System" and "network" can be used interchangeably. "At least one" refers to one or more, and "multiple" refers to two or more. "And / or" describes the relationship between related objects, indicating that three relationships can exist. For example, A and / or B can represent: A alone, A and B simultaneously, or B alone, 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 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 of A, B, or C" includes A, B, C, AB, AC, BC, or ABC. "At least one of A, B, and C" can also be understood as including A, B, C, AB, AC, BC, or ABC, where A, B, and C can be single or multiple. And, unless otherwise specified, the ordinal numbers such as "first" and "second" mentioned in the embodiments of this application are used to distinguish multiple objects and are not used to limit the order, sequence, priority, or importance of multiple objects. The term "protocol" may refer to standard protocols in the field of communications, such as the Long Term Evolution (LTE) protocol, the New Radio (NR) protocol, and related protocols applied to future communication systems; this application does not limit this. Words such as "exemplary," "for example," "exemplarily," and "as (another) example" are used to indicate that something is being described as an example, illustration, or description. Any embodiment or design described as "exemplary" in this application should not be construed as being more preferred or advantageous than other embodiments or designs. The terms "comprising," "including," "having," and variations thereof all mean "including but not limited to," unless otherwise specifically emphasized.

[0107] In this application, "sending information" can be understood as one device sending information to another device, or it can also be understood as one logic module within a device sending information to another logic module. For example, "the encoding device sending information" can be understood as the encoding device sending information to another device (such as a decoding device), or it can be understood as logic module 1 in the encoding device sending information to logic module 2 in the encoding device.

[0108] In this application, "receiving information" can be understood as one device receiving information from another device, or it can also be understood as a logic module within a device receiving information from another logic module. For example, "decoding device receiving information" can be understood as the decoding device receiving information from another device (such as an encoding device), or it can be understood as logic module 1 in the decoding device receiving information from logic module 2 in the decoding device.

[0109] In this application, the phrase "sending information to... (e.g., a decoding device)" or the related illustrations in the accompanying drawings can be understood as the destination of the information being a decoding device. This can include sending information directly or indirectly to a terminal. Similarly, the phrases "receiving information from... (e.g., an encoding device)," "receiving information from... (e.g., an encoding device)," or "receiving information sent (e.g., by an encoding device)," or the related illustrations in the accompanying drawings, can be understood as the source of the information being an encoding device. This can include receiving information directly or indirectly from an encoding 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. Similar expressions in this application can be interpreted similarly, and will not be elaborated further here.

[0110] Furthermore, the network architecture and business scenarios described in the embodiments of this application are for the purpose of more clearly illustrating the technical solutions of the embodiments of this application, and do not constitute a limitation on the technical solutions provided in the embodiments of this application. As those skilled in the art will know, with the evolution of network architecture and the emergence of new business scenarios, the technical solutions provided in the embodiments of this application are also applicable to similar technical problems.

[0111] The following describes a communication system to which embodiments of this application can be applied.

[0112] The embodiments of this application can be applied to various communication systems, including but not limited to: 5th generation (5G) systems or NR systems, LTE systems, long term evolution-advanced (LTE-A) systems, LTE frequency division duplex (FDD) systems, LTE time division duplex (TDD) systems, etc. They can also be applied to future communication systems. Furthermore, they can be applied to device-to-device (D2D) communication, vehicle-to-everything (V2X) communication, long term evolution-vehicle (LTE-V) communication, long term evolution-machine (LTE-M) communication, machine-to-machine (M2M) communication, machine-type communication (MTC), Internet of Things (IoT) communication systems, narrow band Internet of Things (NB-IoT) systems, or other communication systems. The embodiments of this application can also be applied to satellite communication systems, high altitude platform station (HAPS) communications, and non-terrestrial network (NTN) systems such as unmanned aerial vehicles (UAVs), for example, integrated communication and navigation (ICAN) systems, global navigation satellite systems (GNSS), and ultra-dense low-Earth orbit (LEO) satellite communication systems. Furthermore, it can be extended to similar wireless communication systems, such as wireless local area networks (WLANs), wireless-fidelity (WiFi), worldwide interoperability for microwave access (WIMAX), and other communication systems related to the 3rd generation partnership project (3GPP).

[0113] The communication system applicable to embodiments of this application may include one or more transmitting devices and one or more receiving devices. Optionally, one of the transmitting device and the receiving device may be a terminal, and the other may be a network device. Optionally, both the transmitting device and the receiving device may be terminals. Optionally, both the transmitting device and the receiving device may be network devices.

[0114] In this application, the transmitting device can be understood as a device that transmits data or information, and may also be called an encoding device. The receiving device can be understood as a device that receives data or information, and may also be called a decoding device.

[0115] For example, Figure 1 A schematic diagram of a network architecture applicable to embodiments of this application is shown.

[0116] Figure 1 A possible, non-limiting system schematic diagram is shown. For example... Figure 1 As shown, the communication system 1000 includes a radio access network (RAN) 100 and a core network (CN) 200. RAN 100 includes at least one RAN node (e.g., ...). Figure 1 110a and 110b (collectively referred to as 110) and at least one terminal (such as Figure 1 RAN 100, denoted as RAN 120a-120j, is collectively referred to as RAN 120. RAN 100 may also include other RAN nodes, such as wireless relay equipment and / or wireless backhaul equipment. Figure 1 (Not shown in the image). Terminal 120 is connected to RAN node 110 wirelessly. RAN node 110 is connected to core network 200 wirelessly or via wired connection. The core network equipment in core network 200 and RAN node 110 in RAN 100 can be different physical devices, or they can be the same physical device integrating core network logical functions and radio access network logical functions.

[0117] RAN 100 can be a cellular system related to the 3rd Generation Partnership Project (3GPP), such as 4G, 5G mobile communication systems, or future-oriented evolution systems. RAN 100 can also be an open access network (O-RAN or ORAN), a cloud radio access network (CRAN), or a wireless fidelity (WiFi) system. RAN 100 can also be a communication system that integrates two or more of the above systems.

[0118] RAN node 110, sometimes also referred to as access network equipment, RAN entity, or access node, constitutes part of the communication system and is used to help terminals achieve wireless access. Multiple RAN nodes 110 in communication system 10 can be of the same type or different types. In some scenarios, the roles of RAN node 110 and terminal 120 are relative, for example... Figure 1 Network element 120i can be a helicopter or a drone, and it can be configured as a mobile base station. For terminals 120j that access RAN 100 through network element 120i, network element 120i is a base station; however, for base station 110a, network element 120i is a terminal. RAN node 110 and terminal 120 are sometimes referred to as communication devices, for example... Figure 1 Network elements 110a and 110b can be understood as communication devices with base station functions, while network elements 120a-120j can be understood as communication devices with terminal functions.

[0119] In one possible scenario, a RAN node can be a base station, an evolved NodeB (eNodeB), an access point (AP), a transmission reception point (TRP), a next-generation NodeB (gNB), a base station in a future mobile communication system, or an access node in a WiFi system, etc. Figure 1 110a), micro base stations or indoor stations (such as Figure 1 The RAN node can be a relay node or donor node (as described in section 110b), or a wireless controller in a CRAN scenario. Optionally, the RAN node can also be a server, wearable device, vehicle, or in-vehicle equipment. For example, the access network equipment in vehicle-to-everything (V2X) technology can be a roadside unit (RSU). All or part of the functions of the RAN node in this application can also be implemented through software functions running on hardware, or through virtualization functions instantiated on a platform (e.g., a cloud platform). The RAN node can also be equipped with communication modules, circuits, or chips that perform corresponding communication functions. The RAN node can also be configured with program instructions for performing corresponding communication functions and corresponding program instructions. The RAN node in this application can also be a logical node, logical module, or software capable of implementing all or part of the RAN node functions.

[0120] In another possible scenario, multiple RAN nodes collaborate to assist the terminal in achieving wireless access, with different RAN nodes each implementing a portion of the base station's functions. For example, RAN nodes can be central units (CUs), distributed units (DUs), CU-control plane (CPs), CU-user plane (UPs), or radio units (RUs), etc. CUs and DUs can be set up separately or included in the same network element, such as a baseband unit (BBU). RUs can be included in radio frequency equipment or radio frequency units, such as remote radio units (RRUs), active antenna units (AAUs), or remote radio heads (RRHs).

[0121] In different systems, CU (or CU-CP and CU-UP), DU, or RU may have different names, but those skilled in the art will understand their meaning. For example, in an ORAN 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 and hardware modules.

[0122] For ease of understanding, combined with Figure 2 This paper briefly introduces the O-RAN architecture of embodiments of this application. From Figure 2 As can be seen from this, the O-RAN architecture includes: the first network unit, the second network unit, the third network unit, O-eNB, O-CU-CP, O-CU-UP, O-DU, O-RU, and O-cloud.

[0123] Figure 2The network elements (also called nodes) can be interconnected. For example, the first network unit connects to the O-cloud via the O2 interface; the first network unit connects to the third network unit, O-eNB, O-CU-CP, O-CU-UP, O-DU, and O-RU via the O1 interface; the first network unit connects to the O-RU via the open fronthaul M-Plane interface; the O-DU connects to the O-RU via the open fronthaul M-Plane interface and the open fronthaul C / U / S-Plane interface; the third network unit connects to the O-eNB, O-CU-CP, O-CU-UP, and O-DU via the E2 interface; the O-CU-CP connects to the O-DU via the F1-c interface; the O-CU-UP connects to the O-DU via the F1-u interface; and the O-CU-CP connects to the O-CU-UP via the E1 interface. Figure 2 For a detailed description of the interface shown, please refer to the existing standards; it will not be repeated here.

[0124] One possible example is that the first network unit could be a service management and orchestration framework (SMO), or a network unit with similar functionality to an SMO; there is no limitation on which one.

[0125] One possible example is that the second network element can be a Non-RT RIC, or a network element with similar functionality to a Non-RT RIC; there is no limitation on this.

[0126] One possible example is that the third network unit could be a Near-RT RIC, or a network unit with similar functionality to Near-RT RIC; there is no limitation on this.

[0127] O-RAN aims to achieve an intelligent and open access network. A key feature of the O-RAN architecture is the separation of hardware and software, enabling the virtualization of network functions and the standardization of hardware. Furthermore, O-RAN can incorporate artificial intelligence (AI).

[0128] In the embodiments of this application, the access network device may also be simply referred to as a network device.

[0129] A terminal is a device or module that connects to the aforementioned communication system and possesses corresponding communication functions. Terminals can also be called terminal equipment, user equipment (UE), mobile station, mobile terminal, etc. Terminals can be widely used in various scenarios, such as device-to-device (D2D), vehicle-to-everything (V2X) communication, machine-type communication (MTC), Internet of Things (IoT), virtual reality, augmented reality, industrial control, autonomous driving, telemedicine, smart grids, smart furniture, smart offices, smart wearables, smart transportation, and smart cities. The terminal can be a mobile phone, tablet computer, computer with wireless transceiver capabilities, wearable device, vehicle device (such as a complete vehicle device, vehicle module, vehicle chip, on-board unit (OBU) or telematics box (T-BOX)), flight equipment (e.g., drone, helicopter, airplane, hot air balloon), ship, robot, robotic arm, smart home device, transportation vehicle with wireless communication capabilities, communication module, smart point of sale (POS) machine, customer-premises equipment (CPE), light user equipment (light UE), reduced capability user equipment (REDCAP UE), vehicle-mounted equipment (e.g., car, bicycle, electric vehicle, airplane, ship, train, high-speed rail, etc.), satellite terminal, etc. The embodiments of this application do not limit the device form of the terminal. The terminal typically contains a communication module, circuit, or chip that performs the corresponding communication function. The terminal can also be configured with program instructions for performing the corresponding communication function.

[0130] Unless otherwise specified, the means for implementing the functions of a terminal or network device in this application can refer to the terminal or network device itself, or it can refer to a means that enables the terminal or network device to implement the function, such as a system-on-a-chip (SoC) or a chip, specifically a SoC or a modem. This means can be installed in the terminal or network device. In the embodiments of this application, the SoC can be composed of chips, or it can include chips and other discrete devices.

[0131] It should also be noted that some embodiments in this article use a 5G system as an example to introduce specific solution details. It is understood that when this solution is used in other communication systems, such as LTE systems, or future communication systems, the messages, channels, or information in the solution can be replaced with messages, channels, or information in other communication systems that can achieve the corresponding functions, and this application does not limit this.

[0132] To facilitate understanding of the embodiments of this application, some concepts or terms involved in the embodiments of this application will be briefly explained.

[0133] The concepts and terms described below are based on those specified in the agreement, but do not imply that the embodiments of this application can only be applied to existing systems. The concepts and terms involved in the embodiments of this application can be applied to future systems. Furthermore, the specific names of the concepts or terms (e.g., concepts or terms related to functional descriptions) may be adjusted as future systems develop.

[0134] 1. Polar codes

[0135] Polar codes are the first channel coding scheme that can be rigorously proven to "achieve" Shannon channel capacity. They feature good error correction performance and low decoding complexity, and have been selected by 3GPP as the coding scheme for the control channels (uplink / downlink) in 5G enhanced mobile broadband (eMBB) scenarios. The following is a brief introduction to the encoding, construction, and decoding process of Polar codes.

[0136] Figure 3 This is a schematic diagram of an 8-bit Polar code encoding. The encoding process includes several polarization kernel operations (the polarization kernels are shown with a gray background). The polarization kernel ANDs the two input bits... Multiplying them yields two output bits. It can be seen that the Polar code is constructed recursively. An 8-length Polar code can be seen as a result of coupling two 4-length Polar codes (corresponding to the two dashed boxes in the diagram), and a 4-length Polar code can be seen as a result of coupling two 2-length Polar codes.

[0137] The construction process of Polar codes is used to determine the information bits and frozen bits. Currently, the standard specifies a reliability sequence Q, where each value represents the index of a subchannel. The position of the index in sequence Q characterizes the reliability of the corresponding subchannel. For example, for a sequence of length 8, Q = [0 1 2 4 3 5 6 7], it means that the subchannel with index 7 is the most reliable subchannel, and the subchannel with index 6 is the second most reliable subchannel. The subchannel index can also be an index. For example, to construct a Polar code of length N, where N is the parent code sequence, the K indices corresponding to the K most reliable subchannels are determined based on the reliability sequence Q of length N. The K information (data) bits are placed in the bits corresponding to the K indices in the N bits, and the remaining (NK) bits are placed with frozen bits, which are usually 0. In this application, the position carrying K information bits can be called an information bit position, and the position carrying frozen bits can be called a frozen bit position, and the frozen bit position is known at both the sending and receiving ends during actual transmission. For example, as shown... Figure 3 As shown, N=8, and 8 bits are used to carry 8 bits to be encoded. The 8 bits to be encoded are the leftmost u0 to u7. Among the bits to be encoded, there are 4 information bits (i.e., u7, u6, u5, u3), and the remaining 4 bits are used to place the freeze bits (u4, u2, u1, u0). Figure 3 As shown, after encoding, the rightmost 8 codeword bits 01010101 are denoted as c0 to c7 respectively. The transmitting end sends c0 to c7 to channel W.

[0138] For Polar code decoding, mainstream decoding methods can be divided into two categories based on their decoding timing: time-sequential decoding and non-time-sequential decoding. Time-sequential decoding refers to the decoder decoding according to the natural timing of the Polar code design. Non-time-sequential decoding refers to the decoder outputting the decoding result in parallel based on other structures of the Polar code (such as Tanner graphs, trellis diagrams, etc.). The main time-sequential decoding algorithms include successive cancellation decoding (SC), successive cancellation list (SCL) decoding, successive cancellation stack (SCS) decoding, and cyclic redundancy check-aided successive cancellation list (CA-SCL) decoding. The main non-sequential decoding methods include belief propagation (BP) decoding. Among these decoding algorithms, SC decoding has the worst decoding performance, while SCL decoding offers a significant performance improvement over SC decoding. Furthermore, CA-SCL decoding, which incorporates cyclic redundancy check (CRC), can make Polar codes perform better than low-density parity check codes and Turbo codes. Therefore, SCL decoding and CA-SCL decoding are primarily used in practical systems.

[0139] 2. Hybrid Automatic Repeat Request (HARQ)

[0140] HARQ is a common technique in wireless communication. The combined use of forward error correction (FEC) and automatic repeat request (ARQ) in HARQ can significantly improve spectral efficiency. The basic workflow of incremental redundancy hybrid automatic repeat request (IR-HARQ) in HARQ is as follows:

[0141] 1) The sending end sends an encoded packet as the initial transmission.

[0142] 2) The receiver receives the symbol sequence and attempts to decode it:

[0143] If decoding is successful, the receiver sends an acknowledgment (ACK) to the sender; the sender then stops sending based on the ACK.

[0144] If decoding fails, the receiver will buffer the received symbol sequence (or the corresponding demodulation soft information) and send a negative acknowledgement (NACK) to the sender or not send a response. If the sender receives a NACK or does not receive an ACK, it will continue to send a re-encoded bit sequence as incremental redundancy (IR). The receiver will then use the two received sequences for joint decoding.

[0145] Compared to sending data in multiple transmissions during a single HARQ transmission, HARQ allows transmission to stop upon successful decoding in the middle, thus improving system throughput.

[0146] If the initial transmission is successful, there is no need to retransmit, which saves spectrum resources and improves spectrum efficiency.

[0147] If the initial transmission fails, the receiving end will jointly decode the two received sequences, which can still achieve the error correction performance of long code.

[0148] 3. IR-HARQ based on Polar codes

[0149] Polar codes are applicable to IR-HARQ.

[0150] Figure 4 This is a schematic diagram of IR-HARQ based on Polar codes.

[0151] Figure 4 The lower gray line corresponds to the initial transmission (length N=8), denoted as U code, while the upper black line corresponds to the retransmission (length N=8), denoted as V code. Looking at the leftmost side, white nodes represent frozen bits, while black, diagonal, and gray nodes represent information bits. Gray nodes and their connected diagonal nodes hold the same information bit value. Diagonal nodes correspond to copied bits, and gray nodes correspond to copied bits. It should be noted that the terms U code and V code are used for convenience and are not limited to these terms; they can also be called first code and second code, A code and B code, etc.

[0152] During decoding:

[0153] • If the U code is decoded separately, the black nodes and the diagonal nodes are information bits.

[0154] If the U code and V code are decoded together, the initial sequence and the retransmitted sequence can be combined to form a Polar code of length 16. The black and gray nodes are information bits. When decoding the diagonal node, the result of that diagonal node has already been obtained through decoding the same gray node, thus the diagonal node becomes a known value, which can be understood as dynamically freezing bits.

[0155] With the above framework, whether decoding U code alone or decoding U code and V code together, the information bits are always carried in a highly reliable position, which helps to ensure decoding performance.

[0156] The construction of IR-HARQ based on Polar codes can be carried out as follows.

[0157] When constructing IR-HARQ based on Polar codes, a U code is first constructed for initial transmission, and then a V code and a U code are jointly constructed to support retransmission. The current NR standard pre-stores a reliability sequence Q with a maximum length of 1024, from which the reliability sequences used to construct initial and retransmissions can be extracted. For the current Polar codes, reliability sequences of different lengths are needed to construct the initial and retransmission sequences. For example, taking an initial and retransmission length of 8 and the number of information bits as K, an 8-bit reliability sequence is used to construct the initial transmission, and K positions are selected as the set of information bits for the initial transmission. (like Figure 4 (The set consisting of black nodes and diagonal nodes). A retransmission is constructed using a reliability sequence of length 16, from which K positions are selected, denoted as... Further comparison and To determine the set (like Figure 4 The set of nodes formed by the middle diagonal lines) and (like Figure 4 (The set of gray nodes) and A one-to-one verification relationship is formed between them.

[0158] From the perspective of IR-HARQ, the above construction method actually uses the reliability sequence corresponding to the retransmission when constructing the initial transmission information bits.

[0159] If the reliability sequence used to construct the initial transmission is the same as the reliability sequence used to construct the retransmission, then it can be directly constructed using the following concise method. and yes A subset consisting of elements less than 8. It is a set Right now Belonging to But not belonging to The elements that make up the composition of the elements Depend on Add 8 to each element to get the result.

[0160] However, due to the asymmetric nature of the NR reliability sequence, the reliability sequence extracted using the current sequence extraction method for constructing the initial transmission differs from the reliability sequence used for constructing the retransmission. For example, there might be cases where bits not selected as information bits in the initial transmission are selected as information bits in the retransmission. This introduces additional complexity into the code construction process. The current NR sequence extraction method involves extracting indices less than N from the pre-stored reliability sequence Q to form a subsequence for determining the information bits when constructing shorter Polar codes such as N=512 or 256.

[0161] For example, suppose so Since {11, 12, 13, 14} were actually used as information bits when constructing the initial transmission sequence, therefore ( (elements less than 8), corresponding Reliable only on the initial transmission

[0162] The lowest information bit density is 11. The construction mentioned above does not apply to this case. and It is difficult to quickly obtain a unified principle using this method. and Increase construction complexity.

[0163] To address the aforementioned issues, this application provides a method and apparatus for retransmitting Polar codes, aiming to reduce the construction complexity of Polar codes and thereby improve transmission performance.

[0164] The method embodiments of this application are described below with reference to the accompanying drawings.

[0165] Figure 5 This is a schematic flowchart of the information processing method 500 provided in this application.

[0166] Method 500 can be applied to a first communication device, which is an encoding-side device. For example, the first communication device can be an encoding device, a module within the encoding device, or a logic node, logic module, or software capable of implementing all or part of the functions of the encoding device. A module within the encoding device can be, for example, a circuit, a chip, or a chip system (such as a modem chip, or a SoC chip or SIP chip containing a modem core). The encoding device can be a terminal device or a network device.

[0167] Method 500 may include at least a portion of the following.

[0168] Step 501: Obtain the first reliability sequence.

[0169] The first reliability sequence is the reliability sequence used in the initial transmission. In other words, the first reliability sequence is the same as the reliability sequence used in the initial transmission. The reliability sequence used in the initial transmission can refer to: the reliability sequence used in the initial transmission construction process; the reliability sequence used for initial transmission construction; the reliability sequence used to determine the information bits and frozen bits in the initial transmission; or the reliability sequence used to construct the bit sequence of the initial transmission, etc.

[0170] The first reliability sequence can consist of multiple indices, each corresponding to a subchannel. An index can refer to a bit index or a subchannel index. Indices can also be called sequence numbers, numerical values, etc., and subchannels can be called channels or polarization channels, etc., without limitation. The indices in the first reliability sequence can be sorted according to the reliability of the corresponding subchannels. For example, the indices in the first reliability sequence can be arranged in ascending order of the reliability of the corresponding subchannels. For instance, for a reliability sequence of length 8 [0 1 2 4 3 5 6 7], the subchannel with index 7 is the most reliable subchannel, the subchannel with index 6 is the second most reliable subchannel, and the subchannel with index 0 is the least reliable subchannel. For example, the indices in the first reliability sequence can be arranged in descending order of the reliability of the corresponding sub-channels. For instance, for a reliability sequence of length 8 [7 6 5 3 4 2 1 0], the sub-channel with index 7 is the most reliable sub-channel, the sub-channel with index 6 is the second most reliable sub-channel, and the sub-channel with index 0 is the least reliable sub-channel.

[0171] The embodiments of this application do not limit the method of obtaining the first reliability sequence.

[0172] In some implementations, a first reliability sequence can be extracted from a pre-stored reliability sequence of maximum length Q based on the initial transmitted master code length N1. The length of the first reliability sequence is N1. The embodiments of this application do not limit the specific extraction method; one possible method is to extract the indices less than N1 from the reliability sequence Q to form the first reliability sequence.

[0173] In some other implementations, the first reliability sequence used in the initial transmission is stored after the initial transmission is constructed. In this case, the stored first reliability sequence can be read directly.

[0174] Step 502: Determine the first bit sequence based on the first reliability sequence.

[0175] The first bit sequence includes retransmitted information bits. The first bit sequence may also include freeze bits.

[0176] The first bit sequence can be determined based on at least one of the following: the number of retransmitted information bits, the position of the retransmitted information bits in the first bit sequence, or the value of the retransmitted information bits (which can also be simply referred to as retransmitted information bits).

[0177] The embodiments of this application are not limited to the implementation method of determining the first bit sequence based on the first reliability sequence.

[0178] Method 1: Construct the first bit sequence directly based on the first reliability sequence.

[0179] For method 1, the number of retransmitted information bits can be determined based on the first reliability sequence, the threshold value, and the number of information bits initially transmitted.

[0180] In some implementations, the number of retransmitted information bits K1 satisfies: K1 = 2S. Here, S is the number of indices in the third set whose size is less than the threshold value T. The third set includes... A third index, The third index is the one with high reliability in the first reliability sequence. There are several indices, where K is the number of bits of information initially transmitted. This indicates rounding down to the nearest integer.

[0181] Optionally, when K is odd, the reliability levels in the first reliability sequence can be further compared. The index is the size of the threshold value T. If the index is greater than or equal to the threshold value T, then keep K1 = 2S. If the index is less than the threshold value T, then update K1 = K1 + 1, that is, K1 = 2S + 1.

[0182] It should be noted that the terms "less than" and "greater than or equal to" in the size relationships described in the embodiments of this application can be replaced with "less than or equal to" and "greater than" respectively. Similarly, "less than or equal to" and "greater than" can also be replaced with "less than" and "greater than or equal to" respectively. This will not be explained further below.

[0183] In some implementations, the number of retransmitted information bits K1 satisfies: K1 = 2S. Here, S is the number of indices in the third set whose size is less than the threshold value T. When the number of initially transmitted information bits K is even, the third set includes... A third index, The third index is the one with high reliability in the first reliability sequence. An index, or, when the number of bits K of the initially transmitted information is odd, the third set includes... A third index, The third index is the one with high reliability in the first reliability sequence. an index. Among them, represents rounding down.

[0184] In some other implementations, the number K1 of retransmitted information bits satisfies: K1 = 2S. Where S is the number of indexes in the third set whose size is less than the threshold value T, and the third set includes third indexes, the third indexes are the indexes with high reliability in the first reliability sequence, K is the number of information bits transmitted initially, represents rounding up.

[0185] The embodiments of the present application do not limit the value of the threshold T.

[0186] In some implementations, T is related to at least one of the following parameters: the length N1 of the first reliability sequence, the retransmission length E, or the number K of information bits transmitted initially.

[0187] As an example, T = N1 / 2.

[0188] As another example, when K / N1 is less than or equal to the first threshold, T = N1 / 2; when K / N1 is greater than the first threshold, T < N1 / 2. K / N1 is the ratio of the number of information bits transmitted initially to the length of the mother code transmitted initially, and can correspond to the initial transmission code rate. That is, different initial transmission code rates can correspond to different threshold values T, so as to support any retransmission length. And when the initial transmission code rate is small, the threshold value T can be a little larger to retransmit some more information bits, and when the initial transmission code rate is large, the threshold value T can be a little smaller, so as to reduce the number of retransmitted information bits, which can better match the retransmission capacity and help avoid placing information bits in unreliable positions when retransmitting. Exemplarily, when K / N1 is greater than the first threshold, T = (63 / 128)N1, (31 / 64)N1, (127 / 256)N1, or (125 / 256)N1, etc. The embodiments of the present application do not limit the value of the first threshold. Exemplarily, the first threshold is 130 / 512, 2 / 5, 3 / 8, 1 / 2, etc. The second threshold can be a code rate threshold.

[0189] As another example, when E / N1 is greater than or equal to the second threshold, T = N1 / 2; when E / N1 is less than the second threshold, T < N1 / 2. Different retransmission lengths E correspond to different threshold values T, which can support any retransmission length. Moreover, when E / N1 is large, the threshold value T can be a bit larger to retransmit more information bits, and when E / N1 is small, the threshold value T can be smaller, thereby reducing the number of information bits for retransmission, which can better match the retransmission capacity and help avoid placing information bits at unreliable positions during retransmission. Exemplarily, when E / N1 is less than the second threshold, T = (63 / 128)N1, (31 / 64)N1, (127 / 256)N1, or (125 / 256)N1, etc. The embodiments of the present application do not limit the value of the second threshold. Exemplarily, the second threshold is 1 / 2, 5 / 8, etc.

[0190] As another example, T < N1 / 2. That is, regardless of whether the initial transmission code rate is large or small, or regardless of whether E / N1 is large or small, the threshold value T can be made smaller, thereby reducing the number of information bits for retransmission, which helps avoid placing information bits at unreliable positions during retransmission. Exemplarily, T = (63 / 128)N1, (31 / 64)N1, (127 / 256)N1, or (125 / 256)N1, etc.

[0191] For Method 1, the position of the retransmitted information bits in the first bit sequence can be determined according to the first reliability sequence. In some implementation manners, a first set can be determined according to the first reliability sequence, where the first set includes the first indexes of the retransmitted information bits, and the first indexes of the retransmitted information bits can represent the positions of the retransmitted information bits in the first bit sequence. Exemplarily, the first set can be determined according to the first reliability sequence and the number K1 of the retransmitted information bits. The first set includes K1 first indexes, and the K1 first indexes are selected from the first reliability sequence according to the reliability. For example, the K1 first indexes can be the K1 indexes with high reliability in the first reliability sequence. It should be understood that the K1 indexes with high reliability in the first reliability sequence can refer to the K1 indexes with high reliability among the indexes after removing the indexes of the information bits not sent due to rate matching, or can refer to the K1 indexes with high reliability among all the indexes of the first reliability sequence. It should also be understood that the reliability of an index can refer to the reliability of the subchannel corresponding to the index, and the index with high reliability can refer to the index corresponding to the subchannel with high reliability.

[0192] For method 1, the values ​​of the retransmitted information bits (or retransmitted information bits) can be determined based on the first reliability sequence. In some implementations, a second set can be determined based on the first reliability sequence and the number K1 of retransmitted information bits. This second set includes K1 second indices, which are the K1 indices with the lowest reliability from the initial transmitted information bit indices. The retransmitted information bits are then determined based on this second set. For example, the values ​​of the information bits corresponding to the K1 first indices of the first bit sequence are the same as the values ​​of the information bits corresponding to the K1 second indices of the initial transmitted information bits. In other words, the retransmitted information bits are determined based on the second set, which in turn is determined based on the first reliability sequence and the number K1 of retransmitted information bits.

[0193] Method 2: First, expand the first reliability sequence into a second reliability sequence, and then construct a first bit sequence based on the second reliability sequence. The length of the second reliability sequence is greater than the length of the first reliability sequence. For example, if the length of the first reliability sequence is N1, the length of the second reliability sequence is 2N1.

[0194] The embodiments of this application are not limited to the way in which the first reliability sequence is extended to the second reliability sequence.

[0195] In some implementations, taking a first reliability sequence of length N1 and a second reliability sequence of length 2N1 as an example, the second reliability sequence is obtained based on a third sequence. The 2i-th and 2i+1-th indices of the third sequence are determined based on the ith index of the first reliability sequence. The 2i-th and 2i+1-th indices of the third sequence are the same, where i = 0, 1, ..., N1-1. For example, the 2i-th and 2i+1-th indices of the third sequence are the same as the ith index of the first reliability sequence.

[0196] For example, the second reliability sequence can satisfy:

[0197] Q N2 (I v )=Q N1 ;

[0198] Q N2 (I u )=Q N1 +N1;

[0199] I v =kron(Q N1 ,[1,1]) <N1 / 2;

[0200] I u =kron(Q N1 ,[1,1])≥N1 / 2;

[0201] Among them, Q N2 The second reliability sequence, Q N1 For the first reliability sequence, the indicator vector I v Indicates the position of the index in the third sequence whose size is less than N1 / 2, indicating the vector I. u Indicates the position of the index in the third sequence that is greater than or equal to N1 / 2, kron() represents the Kronecker operation, kron(Q N1 ,[1,1]) represents the third sequence.

[0202] For method 2, the position of the retransmitted information bit in the first bit sequence can be determined based on the second reliability sequence. In some implementations, a first set can be determined based on the second reliability sequence, where the first set includes the first index of the retransmitted information bit, and the first index of the retransmitted information bit can represent the position of the retransmitted information bit in the first bit sequence. For example, the first set can be determined based on the second reliability sequence and the number K of the initially transmitted information bits, where the first set includes K2 first indices, and the K2 first indices are indices of size less than N1 in the fourth set, which includes K indices with high reliability in the second reliability sequence. That is, the index of the retransmitted information bit is the index among the K indices with high reliability in the second reliability sequence that is smaller than the length of the initially transmitted master code. In method 2, it is not necessary to determine K2 in advance, which is different from method 1. It should be understood that the reliability of the index can refer to the reliability of the sub-channel corresponding to the index, and the index with high reliability can refer to the index corresponding to the sub-channel with high reliability.

[0203] For method 2, the value of the retransmitted information bits (or retransmitted information bits) can be determined based on the second reliability sequence. In some implementations, a second set can be determined based on the second reliability sequence, the index of the initially transmitted information bits, and the number K of the initially transmitted information bits. This second set includes K² fourth indices, which are indices in the fifth set that differ from those in the fourth set. The fifth set includes K fifth indices, which are determined based on the K sixth indices of the initially transmitted information bits. Then, the retransmitted information bits are determined based on the second set. For example, the value of the information bit corresponding to the K² first indices of the first bit sequence is the same as the value of the information bit corresponding to the K² fourth indices of the initially transmitted information bits. In other words, the retransmitted information bits are determined based on the second set, which in turn is determined based on the first reliability sequence, the index of the initially transmitted information bits, and the number K of the initially transmitted information bits.

[0204] The embodiments of this application are not limited to obtaining K sixth indices from K sixth indices. In some implementations, the i-th fifth index among the K fifth indices is the sum of the i-th sixth index among the K sixth indices and N1, where i = 0, 1, ..., K-1.

[0205] Step 503: Polarize the first bit sequence to obtain the second bit sequence.

[0206] The first bit sequence can be polar-coded independently to obtain the second bit sequence, or the first bit sequence and the initially transmitted bit sequence can be concatenated together and polar-coded to obtain the third bit sequence including the second bit sequence; there is no restriction.

[0207] Step 504: Output the second bit sequence.

[0208] Based on method 500, the initial transmission construction and retransmission construction are based on the same reliability sequence, which can avoid the complexity overhead caused by the different reliability sequences of the initial transmission and retransmission. Furthermore, method 500 does not limit the extraction method of the first reliability sequence. When the extraction method in NR is adopted, the complexity of the Polar code-based IR-HARQ construction can be reduced without changing the existing reliability sequence extraction method.

[0209] The following describes in detail the IR-HARQ construction method based on Polar codes of this application, with examples. All examples below assume the initial transmission mother code length is N1 and the retransmission mother code length is 2N1, but the relationship between the initial and retransmission mother code lengths is not limited to this. The V code and Q code... N1 Q N2 , These can be the first bit sequence, the first reliability sequence, the second reliability sequence, the first set, the second set, the fourth set, and the fifth set, respectively, as described above. The terms used in the following examples that are the same as or corresponding to those in Method 500 can be referenced or cited interchangeably.

[0210] Example 1

[0211] Figure 6 This is an example of the IR-HARQ construction method based on Polar codes in this application.

[0212] like Figure 6 As shown, it can be based on the pre-stored N max A reliability sequence Q of length N1 is obtained by sequence extraction. N1 Then, based on the reliability sequence Q of N1 N1 Obtain the IR-HARQ configuration (including the configuration of the initial transmission and retransmission).

[0213] The two specific methods are as follows:

[0214] Method 1: Method 1 can correspond to Way 1 above. Specifically, when constructing the 2N1 equivalent long code, according to Q N1 determine the number and positions of the information bits of the V code in IR-HARQ, and then according to Q N1 determine the set of bits to be replicated of the U code, so as to obtain the construction of IR-HARQ. Optionally, it is possible to support any retransmission length by controlling the method of determining the number of information bits of the V code in IR-HARQ according to the reliability sequence Q N1 The following will describe Method 1 in detail in combination with Examples 2 and 3.

[0215] Method 2: Method 2 can correspond to Way 2 above. Specifically, when constructing the 2N1 equivalent long code, first according to the reliability sequence Q with length N1 N1 determine the reliability sequence Q with length 2N1 N2 , and then according to Q N2 obtain the construction of the Polar code with length 2N1, so as to obtain the construction of IR-HARQ. The following will describe Method 2 in detail in combination with Example 4.

[0216] Example 2

[0217] The construction of IR-HARQ based on Polar code can be carried out in the following manner:

[0218] 1) Obtain the coding parameters

[0219] Specifically, obtain the information bit sequence to be encoded with length K, and obtain the coding bit lengths N1 and N2. Among them, K ≤ N1 < N2. N1 represents the length of the mother code for the initial transmission, N2 represents the length of the mother code after adding retransmissions, and N2 = 2N1.

[0220] 2) Obtain the reliability sequence

[0221] Specifically, according to the pre-stored reliability sequence Q with length N max , obtain the reliability sequence Q with length N1 N1 for constructing the Polar code.

[0222] The embodiments of the present application do not limit the manner of obtaining the reliability sequence Q with length N1 according to the pre-stored reliability sequence Q with length N max . One method is to reuse the extraction method of NR, that is, extract the subsequence composed of indices less than N1 from the reliability sequence Q with length N N1 as Q max N1 ..

[0223] 3) Based on Q N1Determine the construction of Polar codes

[0224] a. Initial transmission structure:

[0225] Based on Q N1 Select K locations with high reliability as the initial set of information bits. For example, from Q N1 After removing the pre-frozen positions, select the K positions with the highest reliability from the remaining positions to obtain... The location of the pre-freeze can be determined based on the rate matching method; or, from Q... N1 Select the K positions with the highest reliability to obtain

[0226] b. Retransmission construction:

[0227] According to Q N1 The number of information bits in the V code is determined to construct the IR-HARQ long code. One specific method is to determine the number of information bits based on Q. N1 Choose the one with high reliability Each index, statistics The number of indices less than T = N1 / 2 is used as the number of information bits K1 in the V code, which is twice the number of indices. Optionally, when K is odd, it can be further determined based on Q. N1 From back to front The relationship between the index and T = N1 / 2 determines whether to update K1. If the index is greater than or equal to T, K1 remains unchanged. If the index is greater than or equal to T, K1 is updated to K1+1, and the updated value is used as the number of information bits of the V code.

[0228] • Based on K1 and Q N1 Determine the set of information bits for the V code. The set of copied bits in the U code For example, according to Q N1 Choose from Q N1 Select K1 indices as For example, it can be derived from Q N1 From the indexes excluding those corresponding to bits not sent due to rate mismatch, select K1 indices with high reliability as... For example, according to Q N1 ,from Select K1 indexes with low reliability as...

[0229] Example 2.1

[0230] Taking K=14, N1=16, N2=2N1=32, Q={0, 1, 2, 4, 8, 16, 3, 5, 9, 6, 17, 10, 18, 12, 20, 24, 7, 11, 19, 13, 14, 21, 26, 25, 22, 28, 15, 23, 27, 29, 30, 31} as an example, Q N1 ={0, 1, 2, 4, 8, 3, 5, 9, 6, 10, 12, 7, 11, 13, 14, 15}, Q N1 High reliability Given the index {10, 12, 7, 11, 13, 14, 15}, the number of indices less than 8 in {10, 12, 7, 11, 13, 14, 15} is 1, K1 = 1 * 2 = 2, Q N1 The K1 index, which has high reliability, consists of two indices: {14, 15}. For the K1=2 index with low reliability, the indices are {2, 4}. = {2, 4}.

[0231] Example 2.2

[0232] Taking K=4, N1=8, N2=2N1=16, Q={0, 1, 2, 4, 8, 3, 5, 9, 6, 10, 12, 7, 11, 13, 14, 15} as an example, Q N1 ={0, 1, 2, 4, 3, 5, 6, 7}, Q N1 High reliability The index is {6, 7}, and the number of indices less than 4 in {6, 7} is 0, so K1 = 0. and It is an empty set.

[0233] 4) Encoding

[0234] The information bits to be encoded are polarized according to the above IR-HARQ construction method to obtain the encoded bit sequence.

[0235] Example 3

[0236] Example 3 is similar to Example 2 in its approach, the difference being the definition of the threshold value T.

[0237] The construction of IR-HARQ based on Polar codes can be performed as follows:

[0238] 1) Obtain encoding parameters

[0239] Specifically, obtain an information bit sequence to be encoded with length K, and obtain the encoded bit lengths N1 and N2. Among them, K ≤ N1 < N2. N1 represents the length of the mother code for the initial transmission, N2 represents the length of the mother code after adding retransmission, and N2 = 2N1.

[0240] 2) Obtain the reliability sequence

[0241] Specifically, according to the pre-stored reliability sequence Q with length N max obtain the reliability sequence Q with length N1 N1 for constructing the Polar code.

[0242] The embodiments of this application do not limit the manner of obtaining the reliability sequence Q with length N1 from the pre-stored reliability sequence Q with length N max One method is to reuse the extraction method of NR, that is, extract the subsequence composed of indices less than N1 from the reliability sequence Q with length N N1 as Q max N1 N1 .

[0243] 3) Determine the Polar code construction based on Q N1

[0244]

[0244] a. Initial transmission construction:

[0245] " Based on Q N1 select K positions with high reliability as the information bit set for the initial transmission Exemplarily, after removing the pre-frozen positions from Q N1 select the K positions with the highest reliability from the remaining positions to obtain Among them, the pre-frozen positions can be determined according to the rate matching method; or select the K positions with the highest reliability from Q N1 to obtain

[0246] b. Retransmission construction:

[0247] · Determine the number of information bits of the V code according to the retransmission length E and Q N1 for constructing the IR-HARQ long code.

[0248] A specific method is to select the N1 indices with high reliability from Q count the number of indices less than the threshold value T among the indices, and take twice the obtained number as the number of information bits K1 of the V code.

[0249] Optionally, when K is odd, further according to Q N1 from the back to the front, the The relationship between the index and the threshold value T determines whether to update K1. If the index is greater than or equal to T, K1 remains unchanged. If the index is greater than or equal to T, K1 is updated to K1+1, and the updated value is used as the number of information bits in the V code.

[0250] For example, the threshold value T is related to N1 and K. A specific implementation is as follows: when K / N1 is less than or equal to the first threshold, T = N1 / 2; when K / N1 is greater than the first threshold, T = (63 / 128)N1. The first threshold can be 130 / 512. K / N1 is the ratio of the number of initially transmitted information bits to the length of the initially transmitted master code, which can correspond to the initial transmission code rate. In this method, different initial transmission code rates can correspond to different threshold values ​​T. When the initial transmission code rate is small, the threshold value T can be larger to retransmit more information bits; when the initial transmission code rate is large, the threshold value T can be smaller to reduce the number of retransmitted information bits. This can better match the retransmission capacity and help avoid information bits being placed in unreliable positions during retransmission. Therefore, the performance of Polar codes is better in this method.

[0251] For example, the threshold value T is related to N1. One specific implementation is: T = (63 / 128)N1. This method is simple to implement.

[0252] For example, the threshold value T is related to the retransmission length E and K. A specific implementation is as follows: when E / N1 is greater than or equal to the second threshold, T = N1 / 2; when E / N1 is less than the second threshold, T = (63 / 128)N1. The second threshold can be 1 / 2, 5 / 8, etc. In this method, different retransmission lengths E can correspond to different threshold values ​​T. When E / N1 is large, the threshold value T can be larger to retransmit more information bits; when E / N1 is small, the threshold value T can be smaller, thereby reducing the number of retransmitted information bits. This better matches the retransmission capacity and helps avoid information bits being placed in unreliable positions during retransmission. Therefore, the performance of Polar codes is better in this method.

[0253] • Based on K1 and Q N1 Determine the set of information bits for the V code. The set of copied bits in the U code For example, according to Q N1 Choose from Q N1 Select K1 indices as For example, it can be derived from Q N1 In addition to the index corresponding to the bit not sent due to rate mismatch

[0254] Select K1 indexes with high reliability from the remaining indexes as... For example, according to Q N1,from Select K1 indexes with low reliability as...

[0255] Example 3.1

[0256] Taking K=14, N1=16, N2=2N1=32, Q={0, 1, 2, 4, 8, 16, 3, 5, 9, 6, 17, 10, 18, 12, 20, 24, 7, 11, 19, 13, 14, 21, 26, 25, 22, 28, 15, 23, 27, 29, 30, 31}, and a first threshold of 130 / 512 as an example, Q N1 ={0, 1, 2, 4, 8, 3, 5, 9, 6, 10, 12, 7, 11, 13, 14, 15}, 11, 13, 14, 15}, K / N1=7 / 16>130 / 512,T=(63 / 128)N1=63 / 8,Q N1 High reliability Given an index {10, 12, 7, 11, 13, 14, 15}, the number of indices less than 63 / 8 in {10, 12, 7, 11, 13, 14, 15} is 1, K1 = 2, Q N1 The K1 index, which has high reliability, consists of two indices: {14, 15}. For the K1=2 index with low reliability, the indices are {2, 4}.

[0257] Example 3.2

[0258] Taking K=4, N1=8, N2=2N1=16, Q={0, 1, 2, 4, 8, 3, 5, 9, 6, 10, 12, 7, 11, 13, 14, 15} as an example, Q N1 ={, 1, 2, 4, 3, 5, 6, 7}, K / N1=1 / 2>130 / 512,T=(63 / 128)N1=63 / 16,Q N1 High reliability The index is {6, 7}. The number of indices in {6, 7} that are less than 63 / 16 is 0, so K1 = 0. and It is an empty set.

[0259] Example 3.3

[0260] Taking a second threshold of 1 / 2, E = 32, K = 4, N1 = 8, N2 = 2N1 = 16, and Q = {0, 1, 2, 4, 8, 3, 5, 9, 6, 10, 12, 7, 11, 13, 14, 15} as an example, Q N1= {, 1, 2, 4, 3, 5, 6, 7}, E / N1 = 4 > 1 / 2, T = N1 / 2 = 4, Q N1 with high reliability The indices are {6, 7}, the number of indices less than 4 in {6, 7} is 0, K1 = 0, and is an empty set.

[0261] 4) Encoding

[0262] Perform polarization encoding on the information bits to be encoded according to the above IR - HARQ construction method to obtain an encoded bit sequence.

[0263] Example 4

[0264] Example 4 is an example of the above method 2.

[0265] The construction of IR - HARQ based on Polar code can be carried out as follows:

[0266] 1) Obtain encoding parameters

[0267] Specifically, obtain an information bit sequence to be encoded with length K, and obtain the encoding bit lengths N1 and N2. Among them, K ≤ N1 < N2. N1 represents the length of the mother code for the initial transmission, N2 represents the length of the mother code after adding re - transmission, and N2 = 2N1.

[0268] 2) Obtain the reliability sequence

[0269] Specifically, according to the pre - stored reliability sequence Q with length N max obtain a reliability sequence Q with length N1 N1 for constructing the Polar code.

[0270] The embodiments of this application do not limit the method of obtaining the reliability sequence Q with length N1 from the pre - stored reliability sequence Q with length N max One method is to reuse the extraction method of NR, that is, extract a subsequence composed of indices less than N1 from the reliability sequence Q with length N N1 as Q max . N1 .

[0271] 3) Determine the Polar code construction based on Q N1 a. Initial transmission construction:

[0272] a. Initial transmission construction:

[0273] Based on Q N1 select K positions with high reliability as the set of information bits for the initial transmission

[0274] b. Retransmission construction:

[0275] • Based on Q of length N1 N1 Obtain Q of length N2 = 2N1 as follows: N2 .

[0276] One possible implementation is: using Q N1 Based on this, kron(Q) is generated. N1 [1,1]), and generate the indicator vector I accordingly. v and I u Then according to Q N1 I v and I u Generate a Q of length 2N1 N2 The details are as follows:

[0277] I v =kron(Q N1 ,[1,1]) <N1 / 2;

[0278] I u =kron(Q N1 ,[1,1])≥N1 / 2;

[0279] Q N2 (I v )=Q N1 ;

[0280] Q N2 (I u )=Q N1 +N1.

[0281] According to Q N2 Select Q N2 The K most reliable indices are used as the information bit set. based on and Sure and The retransmitted Polar code is constructed. Among them, yes A subset consisting of indices less than N1; yes in, index i in The index j in the table has a one-to-one correspondence, and a specific implementation method is i = j + N1.

[0282] Example 4.1

[0283] Taking K=14, N1=16, N2=2N1=32, Q={0, 1, 2, 4, 8, 16, 3, 5, 9, 6, 17, 10, 18, 12, 20, 24, 7, 11, 19, 13, 14, 21, 26, 25, 22, 28, 15, 23, 27, 29, 30, 31} as an example:

[0284] Q N1 ={0, 1, 2, 4, 8, 3, 5, 9, 6, 10, 12, 7, 11, 13, 14, 15};

[0285]

[0286] kron(Q N1 ,[1,1])={0,0,1,1,2,2,4,4,8,8,3,3,5,5,9,9,6,6,10,10,12,12,7,7,11,11,13,13,14,14,15,15};

[0287] N1 / 2 = 8;

[0288] I v = {0, 1, 2, 3, 4, 5, 6, 7, 10, 11, 12, 13, 16, 17, 22, 23}, I v The element in is kron(Q) N1 In kron(Q, [1,1]), indices smaller than N1 / 2 = 8 are in kron(Q). N1 The position in [1,1]);

[0289] I u = {8, 9, 14, 15, 18, 19, 20, 21, 24, 25, 26, 27, 28, 29, 30, 31}, I u The element in is kron(Q) N1 In the kron(Q) array, indices of size N1 / 2 = 8 that are greater than or equal to N1 / 2 = 8 are in kron(Q) arrays. N1 The position in [1,1]);

[0290] Q N2 in I v The indices at the 16 indicated positions are Q, in sequence. N1 The 16 indices in Q N2 (I v )=Q N1 ={0, 1, 2, 4, 8, 3, 5, 9, 6, 10, 12, 7, 11, 13, 14, 15};

[0291] Q N2 in I uThe indices at the 16 indicated positions are Q, in sequence. N1 The 16 indices plus 16, that is Q N2 (I u )=Q N1 +N1=Q N1 +16 = {16, 17, 18, 20, 24, 19, 21, 25, 22, 26, 28, 23, 27, 29, 30, 31};

[0292] Q N2 ={0, 1, 2, 4, 8, 3, 5, 9, 16, 17, 6, 10, 12, 7, 18, 20, 11, 13, 24, 19, 21, 25, 14,

[0293] 15, 22, 26, 28, 23, 27, 29, 30, 31};

[0294] Q N2 The K=14 indices with medium reliability are {24, 19, 21, 25, 14, 15, 22, 26, 28, 23, 27, 29, 30, 31};

[0295]

[0296] The set of indices less than N1 = 16 is {14, 15}.

[0297]

[0298] Example 4.2

[0299] Taking K=4, N1=8, N2=2N1=16, Q={0, 1, 2, 4, 8, 3, 5, 9, 6, 10, 12, 7, 11, 13, 14, 15} as an example:

[0300] Q N1 ={0, 1, 2, 4, 3, 5, 6, 7};

[0301]

[0302] kron(Q N1 ,[1,1])={0,0,1,1,2,2,4,4,3,3,5,5,6,6,7,7};

[0303] N1 / 2 = 4;

[0304] I v = {0, 1, 2, 3, 4, 5, 8, 9}, I v The element in is kron(Q) N1In kron(Q, [1,1]), indices smaller than N1 / 2 = 4 are in kron(Q). N1 The position in [1,1]);

[0305] I u = {6, 7, 10, 11, 12, 13, 14, 15}, I u The element in is kron(Q) N1 In the kron(Q) array, indices of size N1 / 2 = 4 that are greater than or equal to N1 / 2 = 4 are in kron(Q) arrays. N1 The position in [1,1]);

[0306] Q N2 in I v The indices at the eight indicated positions are Q, in order. N1 The eight indices, namely Q N2 (I v )=Q N1 ={0, 1, 2, 4, 3, 5, 6, 7};

[0307] Q N2 in I u The indices at the eight indicated positions are Q, in order. N1 The 8 indices plus 8, that is Q N2 (I u )=Q N1 +N1=Q N1 +8 = {8, 9, 10, 12, 11, 13, 14, 15};

[0308] Q N2 ={0, 1, 2, 4, 3, 5, 8, 9, 6, 7, 10, 12, 11, 13, 14, 15};

[0309] Q N2 The K=4 indices with medium to high reliability are {11, 13, 14, 15}.

[0310] The set of indices less than N1 = 8 is an empty set. It is an empty set;

[0311]

[0312]

[0313] 4) Encoding

[0314] The information bits to be encoded are polarized according to the above IR-HARQ construction method to obtain the encoded bit sequence.

[0315] The above describes the method embodiments of the encoding side of this application. The following describes the method embodiments of the decoding side of this application.

[0316] Figure 7 This is a schematic flowchart of the information processing method 700 provided in this application.

[0317] Method 700 can be applied to a second communication device, which is an encoding-side device. For example, the second communication device can be a decoding device, a module within the decoding device, or a logic node, logic module, or software capable of implementing all or part of the functions of the decoding device. A module within the decoding device can be, for example, a circuit, a chip, or a chip system (such as a modem chip, or a SoC chip or SIP chip containing a modem core). The decoding device can be a terminal device or a network device.

[0318] Method 700 may include at least a portion of the following.

[0319] Step 701: Obtain the first symbol sequence and the second symbol sequence.

[0320] The first symbol sequence corresponds to the information transmitted initially, or in other words, the first symbol sequence is the symbol sequence of the initial transmission. The second symbol sequence corresponds to the information transmitted retransmitted, or in other words, the second symbol sequence is the symbol sequence of the retransmission.

[0321] Step 702: Obtain the first reliability sequence.

[0322] For example, step 702 is implemented in the same way as step 501, and can be referred to the relevant description in step 501, which will not be described in detail here.

[0323] Step 703: Obtain the initial transmission structure and retransmission structure based on the first reliability sequence.

[0324] The process of obtaining the retransmission structure includes obtaining the number of retransmitted information bits K1, a second reliability sequence, a first set, and a second set. For example, the implementation of obtaining the retransmission structure based on the first reliability sequence is the same as the implementation of obtaining the retransmission structure based on the first reliability sequence in method 500, and can be referred to the description on the encoding side, which will not be repeated here.

[0325] Step 704: Perform joint polarization decoding on the first symbol sequence and the second symbol sequence based on the initial transmission construction and the retransmission construction.

[0326] Based on the above method, the initial transmission construction and retransmission construction are based on the same reliability sequence, which helps to avoid the complexity overhead caused by different reliability sequences for the initial transmission and retransmission, thereby improving transmission performance. Furthermore, when the first reliability sequence adopts the existing extraction method, the complexity of IR-HARQ construction based on Polar codes can be reduced without changing the existing reliability sequence extraction method.

[0327] The above text combined Figures 1 to 7 The present application provides a detailed description of the method embodiments, which will be discussed below in conjunction with... Figures 8 to 10 This describes an embodiment of the apparatus described in this application.

[0328] It is understandable that, in order to achieve the functions described in the above embodiments, Figures 8 to 10 The apparatus includes hardware structures and / or software modules that perform various functions. These apparatuses can be used to implement the functions of the first or second communication device in the above method embodiments, and thus can also achieve the beneficial effects of the above method embodiments. Those skilled in the art should readily recognize that, based on the units and method steps of the various examples described in conjunction with the embodiments disclosed in this application, this application can be implemented in hardware or a combination of hardware and computer software.

[0329] Figure 8 This is a schematic diagram of the structure of an apparatus provided in an embodiment of this application.

[0330] In this application embodiment, the first communication device or the second communication device can be divided into functional units according to the above method example. For example, each function can be divided into different functional units, or two or more functions can be integrated into one unit. Each function can be implemented in hardware or in the form of software functional modules. It should be noted that... Figure 8 The division shown is illustrative and represents only one logical functional division. In actual implementation, there may be other division methods.

[0331] like Figure 8 As shown, the device 10 includes a transceiver unit 11 and a processing unit 12.

[0332] When device 10 is used to implement the function of the first communication device in the above method embodiments, transceiver unit 11 is used to execute the transceiver steps of the first communication device, and processing unit 12 is used to execute the processing steps of the first communication device, such as steps 501-504. When device 10 is used to implement the function of the second communication device in the above method embodiments, transceiver unit 11 is used to execute the transceiver steps of the second communication device, and processing unit 12 is used to execute the processing steps of the second communication device, such as steps 701-704.

[0333] Optionally, the device 10 also includes a storage unit 13 for storing instructions and / or data.

[0334] For a more detailed description of the transceiver unit 11 and the processing unit 12, please refer to the relevant descriptions in the above method embodiments, which will not be repeated here.

[0335] Figure 9 This is another schematic diagram of the device provided in the embodiments of this application.

[0336] The device 20 includes a processing circuit 21. The processing circuit 21 is coupled to a memory 23, which stores instructions. When the device 20 is used to implement the method described above, the processing circuit 21 executes the instructions in the memory 23 to implement the function of the processing unit 12 described above.

[0337] Optionally, the device 20 further includes a memory 23 for implementing the functions of the aforementioned storage unit 13. Optionally, the memory 13 and the processing circuitry 21 are integrated together.

[0338] Optionally, the device 20 further includes a transceiver circuit 22. The transceiver circuit can be referred to as a communication interface. The processing circuit 21 and the transceiver circuit 22 are coupled to each other. It is understood that the transceiver circuit 22 can be a transceiver or an input / output interface. When the device 20 is used to implement the method described above, the processing circuit 21 executes instructions to implement the function of the processing unit 12, and the transceiver circuit 22 implements the function of the transceiver unit 11.

[0339] Optionally, device 20 can be a first communication device or a second communication device, and correspondingly, the transceiver circuit can be a transceiver.

[0340] Optionally, device 20 can be a chip used in a first communication device or a second communication device, and correspondingly, the transceiver circuit can be an input / output interface.

[0341] For example, when device 20 is a chip applied to a first communication device or a second communication device, the chip implements the functions of the first communication device or the second communication device in the above method embodiments. The chip receives information from other modules (such as radio frequency modules or antennas) in the first communication device or the second communication device, which is sent to the first communication device or the second communication device by other devices; or, the chip sends information to other modules (such as radio frequency modules or antennas) in the first communication device or the second communication device, which is sent to other devices by the first communication device or the second communication device.

[0342] Figure 10This is a schematic diagram of a chip system provided in an embodiment of this application. The chip system 30 (or may also be called a processing system) includes logic circuitry 31 and an input / output interface 32.

[0343] The logic circuit 31 can be a processing circuit in the chip system 30. The logic circuit 31 can be coupled to a memory unit, calling instructions from the memory unit, enabling the chip system 30 to implement the methods and functions of the embodiments of this application. The input / output interface 32 can be an input / output circuit in the chip system 30, outputting processed information from the chip system 30, or inputting data or signaling information to be processed into the chip system 30 for processing.

[0344] As an alternative, the chip system 30 may also include a memory unit.

[0345] As one option, the chip system 30 is used to implement the operations performed by the first communication device or the second communication device in the various method embodiments described above.

[0346] For example, logic circuit 31 is used to implement processing-related operations performed by the first communication device or the second communication device in the above method embodiments; input / output interface 32 is used to implement sending and / or receiving-related operations performed by the first communication device or the second communication device in the above method embodiments.

[0347] This application also provides a communication device including a processing circuit coupled to a memory for storing computer programs or instructions and / or data. The processing circuit is used to execute the computer programs or instructions stored in the memory, or to read the data stored in the memory, to perform the methods in the above-described method embodiments. Optionally, the processing circuit may be one or more. Optionally, the communication device includes a memory. Optionally, the memory may be one or more. Optionally, the memory may be integrated with the processing circuit, or may be separately disposed.

[0348] This application also provides a chip including a processing circuit coupled to a memory. The memory stores computer programs or instructions, and the processing circuit executes the computer programs or instructions stored in the memory to implement the methods executed by the first or second communication device in the above-described method embodiments. The memory may be located within the chip or independently of the chip, and is not limited thereto.

[0349] This application also provides a computer-readable storage medium having stored thereon computer instructions for implementing the methods executed by the first communication device or the second communication device in the above-described method embodiments.

[0350] This application also provides a computer program product comprising instructions that, when executed by a computer, implement the methods performed by the first communication device or the second communication device in the above-described method embodiments.

[0351] This application also provides a computer program that, when executed by a computer, implements the methods performed by the first communication device or the second communication device in the above-described method embodiments.

[0352] This application also provides a communication system, which includes at least one of the first communication device or the second communication device in the above embodiments.

[0353] The explanations and beneficial effects of the relevant contents in any of the devices provided above can be found in the corresponding method embodiments provided above, and will not be repeated here.

[0354] It is understood that the processing circuit in the embodiments of this application may be a processor or a circuit in a processor for performing processing operations. The processor may include one or more of the following: a central processing unit (CPU), a digital signal processor (DSP), a microprocessor unit (MPU), a microcontroller unit (MCU), a graphics processing unit (GPU), a field programmable gate array (FPGA), an artificial intelligence processor (AI processor), or a neural processing unit (NPU).

[0355] The aforementioned memory may include one or more of the following storage media: random access memory (RAM), static random access memory (SRAM), dynamic random access memory (DRAM), phase-change memory (PCM), resistive random access memory (ReRAM), magnetoresistive random access memory (MRAM), ferroelectric random access memory (FRAM), cache, register, read-only memory (ROM), flash memory, erasable programmable read-only memory (EPROM), hard disk, etc. In one example, computer program instructions for executing the above embodiments may be stored in non-volatile memory, such as the aforementioned memory 23 or at least a portion of the storage cells (e.g., one or more of ROM, flash memory, EPROM, or hard disk).

[0356] The method steps in the embodiments of this application can be implemented in hardware or by a processor executing software instructions. The software instructions can consist of corresponding software modules, which can be stored in random access memory, flash memory, read-only memory, programmable read-only memory, erasable programmable read-only memory, electrically erasable programmable read-only memory, registers, hard disks, portable hard disks, compact disc read-only memory (CD-ROM), or any other form of storage medium known in the art. An exemplary storage medium is coupled to a processor, enabling the processor to read information from and write information to the storage medium. Of course, the storage medium can also be a component of the processor. The processor and storage medium can reside in an application-specific integrated circuit (ASIC). Furthermore, the ASIC can be located in a first communication device or a second communication device. Alternatively, the processor and storage medium can exist as discrete components in the first or second communication device.

[0357] In the above embodiments, implementation can be achieved entirely or partially through software, hardware, firmware, or any combination thereof. When implemented using software, it can be implemented entirely or partially in the form of a computer program product. The computer program product includes one or more computer programs or instructions. When the computer program or instructions are loaded and executed on a computer, the processes or functions described in the embodiments of this application are performed entirely or partially. The computer can be a general-purpose computer, a special-purpose computer, a computer network, a network device, a user equipment, or other programmable device. The computer program or instructions can be stored in a computer-readable storage medium or transferred from one computer-readable storage medium to another. For example, the computer program or instructions can be transferred from one website, computer, server, or data center to another website, computer, server, or data center via wired or wireless means. The computer-readable storage medium can be any available medium that a computer can access or a data storage device such as a server or data center that integrates one or more available media. The available medium can be a magnetic medium, such as a floppy disk, hard disk, or magnetic tape; it can also be an optical medium, such as a digital video optical disc; or it can be a semiconductor medium, such as a solid-state drive.

[0358] In the various embodiments of this application, unless otherwise specified or in case of logical conflict, the terminology and / or descriptions of different embodiments are consistent and can be referenced by each other. The technical features of different embodiments can be combined to form new embodiments according to their inherent logical relationship.

[0359] Unless otherwise stated, all technical and scientific terms used in the embodiments of this application have the same meaning as commonly understood by one of ordinary skill in the art. The terminology used in this application is for the purpose of describing specific embodiments only and is not intended to limit the scope of this application. It should be understood that the above are illustrative examples, and the examples above are merely to help those skilled in the art understand the embodiments of this application, and are not intended to limit the embodiments of the application to the specific numerical values ​​or specific scenarios exemplified. Those skilled in the art can obviously make various equivalent modifications or variations based on the examples given above, and such modifications and variations also fall within the scope of the embodiments of this application.

Claims

1. A method for retransmitting polar codes, characterized in that, The method includes: Obtain a first reliability sequence, where the first reliability sequence is the reliability sequence used for the initial transmission; Based on the first reliability sequence, obtain a first set, where the first set includes first indices of retransmitted information bits; Based on the first set, determine a first bit sequence; Perform polar coding on the first bit sequence to obtain a second bit sequence; Output the second bit sequence.

2. A method for retransmitting polar codes, characterized in that, The method includes: Obtain a first symbol sequence and a second symbol sequence, where the first symbol sequence corresponds to the information of the initial transmission, and the second symbol sequence corresponds to the information of the retransmission; Obtain a first reliability sequence, where the first reliability sequence is the reliability sequence used for the initial transmission; Based on the first reliability sequence, obtain a first set, where the first set includes first indices of retransmitted information bits; Based on the first set, perform joint polar decoding on the first symbol sequence and the second symbol sequence.

3. The method according to claim 1 or 2, wherein The first set includes K1 of the first indices, and K1 is determined based on the first reliability sequence and the number of information bits of the initial transmission.

4. The method according to claim 3, wherein The K1 first indices are determined based on the first reliability sequence.

5. The method according to claim 3 or 4, wherein The retransmitted information bits are determined based on a second set, where the second set includes K1 second indices, and the K1 second indices are the K1 indices with low reliability among the indices of the information bits of the initial transmission.

6. The method according to claim 5, wherein The values of the information bits corresponding to the K1 first indices are the same as the values of the information bits corresponding to the K1 second indices.

7. The method according to any one of claims 3 to 6, wherein K1 satisfies: K1 = 2S; Where S is the number of indices in the third set whose size is less than the threshold value T, and the third set includes... A third index, the The third index is the one with high reliability in the first reliability sequence. There are several indices, where K is the number of bits of information initially transmitted. This indicates rounding down to the nearest integer.

8. The method according to claim 7, characterized in that, T is related to at least one of the following parameters: the length of the first reliability sequence, the retransmission length, or the number of information bits of the initial transmission.

9. The method according to claim 8, wherein T = N1 / 2; or, When K / N1 is less than or equal to a first threshold, T = N1 / 2, or when K / N1 is greater than the first threshold, T < N1 / 2; or, When E / N1 is greater than or equal to a second threshold, T = N1 / 2, or when E / N1 is less than the second threshold, T < N1 / 2; or, T < N1 / 2; where, N1 is the length of the first reliability sequence, K is the number of information bits of the initial transmission, and E is the retransmission length.

10. The method according to claim 1 or 2, wherein The first set is determined based on a second reliability sequence, the length of the second reliability sequence is greater than the length of the first reliability sequence, and the second reliability sequence is determined based on the first reliability sequence.

11. The method according to claim 10, wherein The first set includes K2 first indices, and the K2 first indices are indices in the fourth set whose size is less than N1. The fourth set includes K indices with high reliability in the second reliability sequence, where K is the number of information bits transmitted initially and N1 is the length of the first reliability sequence.

12. The method according to claim 11, characterized in that, The retransmitted information bits are determined based on a second set, which includes K2 fourth indices. The K2 fourth indices are indices in a fifth set that are different from the indices in the fourth set. The fifth set includes K fifth indices, which are determined based on the K sixth indices of the initially transmitted information bits.

13. The method according to claim 12, characterized in that, The i-th fifth index among the K fifth indices is the sum of the i-th sixth index among the K sixth indices and N1, where i = 0, 1, ..., K-1.

14. The method according to claim 13, characterized in that, The values ​​of the information bits corresponding to the K2 first indices are the same as the values ​​of the information bits corresponding to the K2 fourth indices.

15. The method according to any one of claims 10 to 14, characterized in that, The length of the first reliability sequence is N1, and the length of the second reliability sequence is 2N1; The second reliability sequence is obtained based on the third sequence, where the 2i-th index and the (2i+1)-th index of the third sequence are the same. The 2i-th index and the (2i+1)-th index of the third sequence are determined based on the 1-th index of the first reliability sequence, where i = 0, 1, ..., N1-1.

16. The method according to claim 15, characterized in that, The second reliability sequence satisfies: Q N2 (I v )=Q N1 ; Q N2 (I u )=Q N1 +N1; I v =kron(Q N1 ,[1,1])<N1 / 2; I u =kron(Q N1 ,[1,1])≥N1 / 2; Among them, Q N2 For the second reliability sequence, Q N1 For the first reliability sequence, kron(Q) N1 [1,1]) represents the third sequence, and kron() represents the Kronecker operation.

17. A communication device, characterized in that, Includes modules or units for performing the method as described in any one of claims 1 to 16.

18. A communication device, characterized in that, The device includes a processor and an interface circuit, wherein the interface circuit is used to receive signals from other communication devices besides the communication device and transmit them to the processor, or to send signals from the processor to other communication devices besides the communication device, and the processor is used to implement the method as described in any one of claims 1 to 16 through logic circuits or by executing computer instructions.

19. The communication device according to claim 18, characterized in that, The communication device is a terminal device, network device, chip, or chip system.

20. The communication device according to claim 18 or 19, characterized in that, It also includes a memory for storing the computer instructions.

21. A computer-readable storage medium, characterized in that, The storage medium stores a computer program or instructions, which, when executed by a communication device, implement the method as described in any one of claims 1 to 16.

22. A computer program product, characterized in that, Includes a computer program that, when run, implements the method as described in any one of claims 1 to 16.

Images