A method of retransmission of information and a communication device

Abstract

Embodiments of the present application provide a method for retransmission of information and a communication device. The method comprises: reading a first length of bit sequences from a circular buffer and transmitting the first length of bit sequences in the case of determining that the jth retransmission fails. The circular buffer is composed of a first bit sequence, a second bit sequence and a third bit sequence. The first bit sequence is a bit sequence obtained by rate matching in initial transmission, the second bit sequence is a bit sequence obtained by rate matching on a fourth bit sequence in the first retransmission, and the third bit sequence is a bit sequence composed of bits truncated or punctured in the initial transmission. The method for retransmission of information provided by the present application can not only reduce the complexity of coding and decoding in the process of polar code retransmission, but also effectively guarantee the reliability of the communication link.

Description

Technical Field

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

[0002] In communication systems, channel coding is typically used to improve the reliability of data transmission and ensure communication quality. Polar codes are a type of linear block code. Theoretically, it has been proven that Polar codes are currently the only encoding method that can achieve the Shannon limit and has low encoding and decoding complexity.

[0003] In the encoding process of Polar codes, the existing technology uses the traditional incremental redundancy (IR) hybrid automatic repeat request (HARQ) technique to obtain the cumulative energy gain by retransmitting different redundancy versions (RV). Moreover, in the IR HARQ retransmission process, the traditional technical solution will lead to an irregular encoding matrix and an exponential increase in encoding and decoding complexity. Summary of the Invention

[0004] This application provides a method for retransmitting information, which can reduce the complexity of encoding and decoding during the information retransmission process.

[0005] Firstly, a method for retransmitting information is provided, the method comprising: determining that the j-th retransmission fails;

[0006] A first-length bit sequence is read from a circular buffer, which consists of a first bit sequence, a second bit sequence, and a third bit sequence. The first bit sequence is the bit sequence obtained by rate matching during the initial transmission. The second bit sequence is the bit sequence obtained by rate matching the fourth bit sequence during the first retransmission. The third bit sequence is the bit sequence composed of bits that were truncated or punched during the initial transmission of the information bit sequence. The fourth bit sequence is the bit sequence obtained by polar encoding the fifth bit sequence during the first retransmission. The fifth bit sequence is obtained by re-mapping the sixth bit sequence obtained by bit mapping during the initial transmission. The reliability order of the bit positions corresponding to the sixth bit sequence is different from that of the bit positions corresponding to the fifth bit sequence. The first-length bit sequence is then sent to perform the (j+1)th retransmission, where j+1 is less than the maximum allowed number of retransmissions, and j is a positive integer.

[0007] According to the information retransmission method provided in this application, the sending end determines that the previous retransmission failed, and determines a bit sequence of a first length from the circular buffer to create a retransmission sequence. The circular buffer consists of the bit sequence after rate matching during the initial transmission, the bit sequence obtained after two bit mappings, polar encoding, and rate matching during the first retransmission, and the bit sequence truncated or punctured from the initial transmission. The sending end no longer needs to perform bit selection, polar encoding, and rate matching calculations sequentially on the information bits; it can directly read the bit sequence of the first length from the circular buffer and send it, simplifying the calculations during retransmission and reducing the complexity of encoding and decoding.

[0008] Furthermore, the retransmission method provided in this application can obtain energy gain and coding gain, thereby improving the decoding performance of Polar codes and effectively ensuring the reliability of communication links.

[0009] It should be noted that the initial transmission and retransmission in this application refer to the same information bit sequence. The retransmitted information bit sequence may be the same as the initial transmission information bit sequence, or the retransmitted information bit sequence may be a part of the initial transmission information bit sequence.

[0010] In conjunction with the first aspect, in some implementations of the first aspect, reading a bit sequence of a first length from a circular buffer includes: determining a read position based on the first bit sequence, the second bit sequence, and the third bit sequence; and reading the bit sequence of the first length from the circular buffer based on the read position.

[0011] Based on the above scheme, determining the starting position of reading the first length bit sequence according to the different redundant versions in the circular buffer can improve the accuracy of retransmission, improve decoding performance, and ensure the reliability of the communication link.

[0012] In conjunction with the first aspect, in some implementations of the first aspect, the method further includes: dividing the bit sequence of the first length into m subsequences; interleaving the m subsequences to obtain interleaved m subsequences, where m is not equal to q, q is a factor of the length N of the bit sequence of the first length, and m, q, and N are all positive integers; and sending the bit sequence of the first length, including: sending the interleaved bit sequence of the first length.

[0013] Based on the above scheme, a bit sequence of the first length is read from the circular buffer. According to the available physical resources, the read bit sequence is sent to the interleaving unit, the bit sequence of the first length is divided into m subsequences, and the m subsequences after division are interleaved, where m is not a factor of the length of the bit sequence of the first length, so that the interleaving process is more thorough, thereby improving the decoding performance.

[0014] In conjunction with the first aspect, in some implementations of the first aspect, the bits contained in one or more of the m subsequences are bit-interleaved.

[0015] Based on the above scheme, bit interleaving is performed again on the interleaved m sub-blocks, and the bits contained in one or more sub-sequences of the m sub-sequences are interleaved. Bit interleaving is more thorough than sub-block interleaving, discretes and corrects burst errors, improves coding performance, and improves the transmission characteristics of communication.

[0016] In conjunction with the first aspect, in some implementations of the first aspect, the fourth bit sequence is a bit sequence obtained by XORing the fifth bit sequence obtained by polar encoding and the sixth bit sequence obtained by polar encoding.

[0017] Based on the above scheme, the second bit sequence in the circular buffer is used as the bit sequence after rate matching of the fourth bit sequence during the first retransmission. The fourth bit sequence is obtained by XORing the bit sequence after polar coding during the initial transmission and the bit sequence after polar coding during the first retransmission.

[0018] In conjunction with the first aspect, in some implementations of the first aspect, the fifth bit sequence contains P bits, the sixth bit sequence contains P bits, the P bits correspond to P bit positions, the P bit positions in the fifth bit sequence contain K first positions, the reliability of the K first positions is not lower than the reliability of the remaining Pk bit positions, the P bit positions in the sixth bit sequence contain k second positions, the reliability of the k second positions is not higher than the reliability of the remaining Pk bit positions, and the fifth bit sequence is obtained by re-mapping the sixth bit sequence obtained by bit mapping during the initial transmission, including: the bits located at the k second positions in the sixth bit sequence are mapped to the K first positions corresponding to the fifth bit sequence, where K = k + L, and L is the number of cyclic redundancy check (CRC) bits during the first retransmission.

[0019] Based on the above scheme, during the first retransmission of the Polar code, the information bit sequence undergoes two bit mappings. First, the initial bit mapping maps the bits from the first transmission to positions with lower reliability compared to other bit positions. Then, a second bit mapping maps the mapped bits to positions with reliability no lower than other bit positions. This effectively ensures the performance of encoding and decoding, and improves transmission performance.

[0020] Secondly, an information retransmission apparatus is provided, which has the function of implementing the methods in the first aspect and any possible implementation thereof. This function can be implemented in hardware or by hardware executing corresponding software, the hardware or software including one or more units corresponding to the above function.

[0021] In one possible design, when the function is partially or entirely implemented in hardware, the device includes: a processing unit for determining that the j-th retransmission has failed; the processing unit is further configured to read a bit sequence of a first length from a circular buffer, the circular buffer consisting of a first bit sequence, a second bit sequence, and a third bit sequence, wherein the first bit sequence is a bit sequence obtained by rate matching during the initial transmission, the second bit sequence is a bit sequence obtained by rate matching the fourth bit sequence during the first retransmission, and the third bit sequence is a bit sequence composed of bits that were truncated or punctured during the initial transmission of the information bit sequence, wherein the fourth bit sequence is a bit sequence obtained by polar encoding of the fifth bit sequence during the first retransmission, and the fifth bit sequence is a bit sequence obtained by re-mapping the sixth bit sequence obtained by bit mapping during the initial transmission, wherein the reliability order of the bit positions corresponding to the sixth bit sequence is different from that of the bit positions corresponding to the fifth bit sequence; and a transceiver unit for transmitting the bit sequence of the first length to perform the (j+1)-th retransmission, wherein j+1 is less than the maximum allowed number of retransmissions, and j is a positive integer.

[0022] In practice, the retransmission device can be a chip or an integrated circuit.

[0023] In one possible implementation design, the processing unit reads a bit sequence of a first length from a circular buffer, and is further configured to determine a read position based on the first bit sequence, the second bit sequence, and the third bit sequence; the processing unit is further configured to read the bit sequence of the first length from the circular buffer based on the read position.

[0024] In one possible implementation, the processing unit is further configured to: determine m subsequences based on the bit sequence of the first length; interleave the m subsequences, where m is not equal to q, q is a factor of the length N of the bit sequence of the first length, and m, q, and N are all positive integers; the transceiver unit is further configured to transmit the interleaved bit sequence of the first length.

[0025] In one possible implementation, the processing unit is also used to perform bit interleaving on the bits contained in one or more of the m subsequences.

[0026] In one possible design, the fourth bit sequence is obtained by XORing the fifth bit sequence obtained by polar encoding and the sixth bit sequence obtained by polar encoding.

[0027] In one possible design, the fifth bit sequence contains P bits, the sixth bit sequence contains P bits, the P bits correspond to P bit positions, the P bit positions in the fifth bit sequence include K first positions, the reliability of the K first positions is not less than the reliability of the remaining Pk bit positions, the P bit positions in the sixth bit sequence include k second positions, the reliability of the k second positions is not higher than the reliability of the remaining Pk bit positions, and the fifth bit sequence is obtained by re-mapping the sixth bit sequence obtained by bit mapping during the initial transmission, including: the bits located at the k second positions in the sixth bit sequence are mapped to the K first positions corresponding to the fifth bit sequence, where K = k + L, and L is the number of cyclic redundancy check (CRC) bits during the first retransmission.

[0028] In one possible design, when the function is partially or entirely implemented by software, the information retransmission device includes: a memory for storing a computer program; and a processor for executing the computer program stored in the memory. When the computer program is executed, the encoding device can implement the information retransmission method as described in the first aspect and any possible design of the first aspect above.

[0029] Alternatively, the memory can be a physically separate unit or integrated with the processor.

[0030] In one possible design, when some or all of the functionality is implemented in software, the information retransmission device comprises only a processor. A memory for storing the program is located outside the information retransmission device. The processor is connected to the memory via circuitry / wires to read and run the program stored in the memory to execute the information retransmission method described in the first aspect and any possible implementation thereof.

[0031] Thirdly, this application provides a communication device, which may be a network device or a terminal device, wherein the communication device includes a transceiver, a processor, and a memory. The processor is used to control the transceiver to transmit and receive signals, the memory is used to store computer programs, and the processor is used to call and run the computer programs stored in the memory, causing the network device to execute the methods in any possible implementation of the first aspect.

[0032] Specifically, when the network device acts as the sender of information and / or data, the network device executes the information retransmission method in the first aspect and any possible implementation thereof, retransmitting the information and / or data to be sent. When the terminal device acts as the receiver of information and / or data, the terminal device executes the information retransmission method in the first aspect and any possible implementation thereof.

[0033] Fourthly, this application provides a computer-readable storage medium storing instructions that, when executed on a computer, cause the computer to perform the method of the first aspect or any possible implementation thereof.

[0034] Fifthly, this application provides a computer program product comprising computer program code that, when executed on a computer, causes the computer to perform the methods described in the first aspect and any possible implementation thereof.

[0035] Sixthly, this application provides a chip including a processor. The processor is used to read and execute a computer program stored in a memory to perform the methods described in the first aspect or any possible implementation thereof. Optionally, the chip further includes a memory, which is connected to the processor via a circuit or wire.

[0036] Optionally, the chip further includes a communication interface to which the processor is connected. The communication interface receives a bit sequence to be encoded; the processor obtains the information bit sequence from the communication interface and retransmits the information bit sequence using the information retransmission method described in the first aspect; the communication interface outputs the encoded bit sequence. This communication interface can be an input / output interface. Attached Figure Description

[0037] Figure 1 An architecture diagram of a wireless communication system 100 provided in an embodiment of this application is shown.

[0038] Figure 2 A flowchart of the communication link for Polar code channel encoding is shown.

[0039] Figure 3 A schematic flowchart of an information retransmission method provided in an embodiment of this application is shown.

[0040] Figure 4 A schematic diagram of a polar code encoding method provided in an embodiment of this application is shown.

[0041] Figure 5 A schematic diagram of another polar code encoding method provided in an embodiment of this application is shown.

[0042] Figure 6 A schematic diagram of another polar code encoding method provided in an embodiment of this application is shown.

[0043] Figure 7 A schematic diagram of another polar code encoding method provided in an embodiment of this application is shown.

[0044] Figure 8 A schematic diagram of another polar code encoding method provided in an embodiment of this application is shown.

[0045] Figure 9 A schematic diagram of an information retransmission method provided in this application is shown.

[0046] Figure 10 The illustration shows a schematic diagram of a polar code first retransmission encoding method provided in an embodiment of this application.

[0047] Figure 11 This illustration shows a schematic diagram of another polar code first retransmission encoding method provided in an embodiment of this application.

[0048] Figure 12 This illustration shows a schematic diagram of another polar code first retransmission encoding method provided in an embodiment of this application.

[0049] Figure 13 A schematic diagram of a Polar IR HARQ redundant version provided in an embodiment of this application is shown.

[0050] Figure 14 A schematic structural diagram of the communication device 1400 provided in an embodiment of this application is shown.

[0051] Figure 15 A schematic structural diagram of a terminal device 1500 provided in an embodiment of this application is shown. Detailed Implementation

[0052] The technical solutions in the embodiments of this application will now be described with reference to the accompanying drawings.

[0053] The technical solutions of this application embodiment can be applied to various communication systems, such as: Global System of Mobile communication (GSM) system, Code Division Multiple Access (CDMA) system, Wideband Code Division Multiple Access (WCDMA) system, General Packet Radio Service (GPRS), Long Term Evolution (LTE) system, LTE Frequency Division Duplex (FDD) system, LTE Time Division Duplex (TDD) system, Universal Mobile Telecommunication System (UMTS), Worldwide Interoperability for Microwave Access (WiMAX) communication system, future 5th Generation (5G) system, or New Radio (NR), etc.

[0054] The terminal device in this application embodiment can refer to user equipment, access terminal, user unit, user station, mobile station, mobile station, remote station, remote terminal, mobile device, user terminal, terminal, wireless communication device, user agent, or user device. The terminal device can also be a cellular phone, cordless phone, Session Initiation Protocol (SIP) phone, Wireless Local Loop (WLL) station, Personal Digital Assistant (PDA), handheld device with wireless communication capabilities, computing device or other processing device connected to a wireless modem, in-vehicle device, wearable device, terminal device in future 5G networks, or terminal device in future evolved Public Land Mobile Network (PLMN), etc., and this application embodiment does not limit this to these categories.

[0055] The network device in this application embodiment can be a device for communicating with terminal devices. The network device can be a base station (BTS) in a Global System of Mobile communication (GSM) system or Code Division Multiple Access (CDMA), a base station (NodeB, NB) in a Wideband Code Division Multiple Access (WCDMA) system, an evolved NodeB (eNB or eNodeB) in an LTE system, a radio controller in a Cloud Radio Access Network (CRAN) scenario, or a relay station, access point, vehicle-mounted device, wearable device, or a network device in a future 5G network or a network device in a future evolved PLMN network, etc. The embodiments of this application are not limited.

[0056] See Figure 1 , Figure 1 This is an architecture diagram of a wireless communication system 100 applicable to embodiments of this application. (As shown...) Figure 1 As shown. The wireless communication system 100 may include at least one network device and one or more terminal devices. Network devices (such as...) Figure 1 101 shown can be used with one or more terminal devices (such as...) Figure 1 Wireless communication is performed using 102 and 103 shown in the figure.

[0057] Figure 1 In this system, network devices and terminal devices communicate using wireless technology. When a network device sends a signal, it acts as the transmitter; when it receives a signal, it acts as the receiver. The same applies to terminal devices: when a terminal device sends a signal, it acts as the transmitter; when it receives a signal, it acts as the receiver.

[0058] As an example, when the network device is the sender and the terminal device is the receiver, if the network device determines that retransmission has failed, it reads a bit sequence of a first length from the circular buffer and sends that bit sequence to the terminal device. When the terminal device is the sender and the network device is the receiver, the retransmission method is the same as described above.

[0059] To facilitate understanding of the embodiments of this application, it should be noted that:

[0060] 1. Polar codes

[0061] Polar codes, also known as polar codes, are a novel coding method based on channel polarization. They possess a deterministic construction method and are the only known channel coding method that has been rigorously proven to "achieve" channel capacity. From the perspectives of algebraic coding and probabilistic coding, polar codes possess the characteristics of both.

[0062] The theoretical basis of Polar codes is channel polarization. Channel polarization includes channel combination and channel decomposition. When the number of combined channels becomes infinitely large, polarization occurs: some channels tend towards noise-free channels, while others tend towards noisy channels; this phenomenon is called channel polarization linearity. The transmission rate of the noise-free channel will reach the channel capacity, while the transmission rate of the noisy channel tends towards zero. The encoding strategy of Polar codes utilizes this characteristic, using the noise-free channel to transmit useful information to the user, and the noisy channel to transmit agreed-upon information or no information at all.

[0063] After channel polarization is completed, the channels with a capacity approaching 1 can be used to carry information bits, while the remaining channels can be used to carry frozen bits that are consistent at both the transmitting and receiving ends. This is the polarization coding method.

[0064] Among them, Polar codes are linear block codes, and their encoding matrix (also called the generator matrix) is G. N The encoding process can be represented by the following formula:

[0065]

[0066] in, It is a binary row vector (i.e., a sequence of information bits) with a length of N, where N = 2. n , where n is a positive integer. G N It is an N×N matrix. Defined as log2 N The Kronecker product of matrices F2, The addition and multiplication operations involved in the above formulas are all addition and multiplication operations on the binary Galois field.

[0067] The encoding generated by this method will exhibit polarization when decoded using a successive cancellation (SC) decoding method. That is, a portion of the bits in u will be decoded correctly with a high probability after passing through an equivalent high-reliability channel, while the remaining bits will be decoded correctly with a low probability after passing through an equivalent low-reliability channel. Therefore, the high-reliability channel can be used for information transmission, while the bits corresponding to the low-reliability channel can be set to zero (i.e., frozen) and not used for data transmission, or for transmitting data already known to both communicating parties.

[0068] in addition, Figure 2 This is a flowchart of a communication link using Polar code channel coding. The transmitting end uses Polar codes to channel code the signal from the media access control (MAC) source. The receiving end sends the demodulated log likelihood ratio (LLR) soft information to the Polar decoder to recover the source information, which is then uploaded to the MAC. For detailed Polar code encoding procedures, please refer to [link to Polar code encoding flowchart]. Figure 3 As shown in the figure, to avoid redundancy, it will not be repeated here.

[0069] When using wireless technology for communication, the signal source at the transmitting end typically undergoes source coding, channel coding, rate matching, and modulation before being transmitted over the channel. The receiving end, upon receiving the signal, sequentially performs demodulation, rate matching de-matching, channel decoding, and source decoding to obtain the final signal.

[0070] Channel coding and decoding is one of the core technologies in the field of wireless communication, and its performance improvement will directly enhance network coverage and user transmission rates. Currently, polar codes are a channel coding technique that can be theoretically proven to reach the Shannon limit and has practical linear complexity coding and decoding capabilities.

[0071] 2. Polar incremental redundancy hybrid automatic repeat request (Polar IR HARQ)

[0072] In latency-insensitive communication applications, Hybrid Automatic Repeat Request (HARQ) is a commonly used link adaptation technique. HARQ improves link throughput by combining error correction codes with retransmission mechanisms. Many existing communication systems employ HARQ to enhance communication link throughput. However, traditional polar codes require code lengths to be powers of 2. Therefore, in the research of polar code HARQ systems, a polar coding method was implemented that uses puncturing operations to change the polar code length as needed. During polar code decoding, the puncture position is treated as if the transmission passed through a channel with zero capacity. Based on this idea, a rate-adaptive puncturing polar coding scheme has been designed. Currently, based on this rate-matching polar code, two polar code HARQ schemes exist, distinguished by whether the transmitter uses the same channel coding for each bit sequence transmitted. Among them, the HARQ schemes for polar codes are mainly divided into two types: one is the soft-combine (CC) HARQ scheme, and the other is the incremental redundancy (IR) HARQ scheme.

[0073] In the IR HARQ scheme, the transmitter uses a different channel code for each transmission, while the receiver combines the newly received signal with all previously received signals and combines the channel coding schemes used in each transmission, treating it as decoding a code with a longer code length and a lower code rate.

[0074] HARQ retransmission can reduce the bit error rate and improve reliability of a system at a relatively low cost. IR HARQ not only gains energy accumulation by retransmitting different redundant versions (RVs), but also further reduces the code rate and gains coding gain by combining different redundant versions, thus significantly improving decoding performance. However, existing Polar IR HARQ retransmission schemes often result in high encoding and decoding complexity during Polar code encoding, which is detrimental to hardware implementation.

[0075] To address this, this application provides a method for retransmitting information, which can reduce the complexity of the Polar code encoding and decoding process.

[0076] like Figure 3 As shown, Figure 3 A schematic flowchart of an information retransmission method provided in an embodiment of this application is shown. Figure 3 It includes the following steps.

[0077] S310, the transmitting end sends the first bit sequence to the receiving end, wherein the first bit sequence is the bit sequence encoded by the transmitting end in the first transmission to the receiving end.

[0078] Specifically, the polar coding process (also known as Polar RV0 coding) during the first transmission (i.e., the initial transmission) includes four units: CRC coding, bit mapping, polar coding, and rate matching. The information bit sequence first passes through the CRC coding unit. The bit sequence after CRC coding then undergoes bit mapping, mapping the CRC-coded bits onto a sequence of length N, which serves as the input for polar coding. Finally, the polar-coded bit sequence undergoes rate matching to obtain the first bit sequence, which is the output of Polar RV0 coding. For a detailed explanation of the Polar RV0 coding process, please refer to [link to Polar RV0 coding process]. Figure 4 As stated above.

[0079] S320, the sending end receives a first response message from the receiving end, which is used to determine that the initial transmission failed, meaning the receiving end failed to correctly receive all the information sent by the sending end. The sending end will then perform an first retransmission. Figure 3 As shown, the method also includes:

[0080] S330, the transmitting end sends the second bit sequence to the receiving end. This second bit sequence is the bit sequence after the polar coding process from the first retransmission. For details on the polar coding process (also known as Polar RV1 coding) for the first retransmission, please refer to [link to Polar RV1 coding process]. Figure 10 As shown.

[0081] It should be understood that during the retransmission process, the retransmitted content may be all or part of the content depending on the method used, and this application does not limit this.

[0082] If the receiving end still fails to correctly receive all the information sent by the sending end, that is, the first retransmission between the sending and receiving ends fails. Figure 3 The method shown also includes:

[0083] S340, the sending end receives a second response message from the receiving end, which is used to determine that the first retransmission failed. The sending end will then perform a second retransmission. Figure 3 The method shown also includes:

[0084] S350, the transmitting end sends a bit sequence of the first length to the receiving end. During the second retransmission, the transmitting end reads the bit sequence of the first length from the circular buffer, which consists of the first bit sequence, the second bit sequence, and the third bit sequence.

[0085] Specifically, the first bit sequence is the bit sequence of the initial transmission at the transmitting end in step S310 above, and the first bit sequence is the bit sequence obtained after rate matching during the initial transmission; the second bit sequence is the bit sequence of the first retransmission at the transmitting end in step S330 above, and the second bit sequence is the bit sequence obtained after rate matching during the first retransmission; the third bit sequence is the bit sequence composed of bits that were truncated or punched during the Polar RV0 encoding process at the transmitting end in step S310 above.

[0086] It should be understood that if the receiving end still fails to correctly receive all the information sent by the sending end after the second retransmission, the sending end will perform a third retransmission, and the method of the third retransmission is the same as that of the second retransmission.

[0087] It should also be understood that when the sender determines that the j-th retransmission has failed, the sender will continue with j+1 retransmissions, where j+1 should not exceed the maximum allowed number of retransmissions. During the j+1-th retransmission process, based on the above... Figure 3 The retransmission method in step S350 reads a bit sequence of the first length from the circular buffer for the next retransmission.

[0088] It should be noted that the first length of the bit sequence read from the circular buffer is determined according to its own protocol or indication information, and this application does not limit it.

[0089] Furthermore, it will be combined Figure 4 This application describes the detailed process of Polar RV0 encoding provided in its embodiments, such as... Figure 4 A schematic diagram of a polar code encoding method provided in an embodiment of this application is shown. This method can be executed by the sending end.

[0090] During Polar RV0 encoding, the transmitting end first adds L bits of cyclic redundancy check to the input information bit sequence, such as... Figure 5 As shown: Net payload from MAC Adding an L-bit cyclic redundancy check (CRC) allows the receiver to employ a CRC-aided successive cancellation list (CA-SCL) decoding algorithm to enhance decoding performance, such as... Figure 5 As shown, the bit sequence after adding CRC is denoted as:

[0091] The K-bit sequence after adding L bits of cyclic redundancy check (CRC) Through bitmapping units, such as Figure 6As shown, it maps to a sequence of length N. The above serves as the input to the polarization coding unit.

[0092] In the bitmap, valid information is called information bits, and invalid information is called frozen bits. Frozen bits have fixed values ​​and can be either bit "0" or bit "1". In the sequence... In this process, each polarization channel has a relative level of reliability. During bit mapping, polarization channels with higher reliability are prioritized for bit mapping. The reliability metric for polarization channels can be pre-defined according to the protocol or indicated by indication information; this application does not impose any limitations on this.

[0093] After completing the bit mapping, the bit sequence obtained from the bit mapping is used as the input to the polar coding unit. For example... Figure 7 A schematic diagram of Polar code encoding is shown. Figure 7 The symbols shown This represents binary addition, where u0 to u3 are obtained by two layers of polarization encoding to obtain d0 to d3. Specifically, d0 = mod(u0 + u1 + u2 + u3, 2); d1 = mod(u1 + u3, 2); d2 = mod(u2 + u3, 2); d3 = mod(u3, 2).

[0094] Polar coding units are sequences of length N. Encode into a sequence using the Kronecker product operation. The encoding process is as shown in the above formula (1). To avoid redundancy, it will not be described again here.

[0095] Furthermore, during the initial encoding process of Polar codes, a sequence is obtained through polar coding. Then, it passes through a rate matching unit, which punches, truncates, or repeats the bit sequence.

[0096] As an example, such as Figure 8 This diagram illustrates bit selection in the rate matching unit during the initial transmission encoding of a Polar code. Bit selection involves selecting bits from the sequence after sub-block interleaving. The bit sequence after rate matching is denoted as follows: (This is achieved by matching the bit to physical resources using repetition, punching, or truncation.) like Figure 8 As shown, bold text indicates repetition, and the "X" marks indicate that the sequence has been punched or truncated. It should be understood that... Figure 8 This is merely an illustrative example and does not limit the technical solutions in this application.

[0097] Optionally, the rate matching unit further includes dividing the bit sequence into m subsequences and interleaving the m subsequences.

[0098] It should be understood that, during rate matching, the input sequence for sub-block interleaving is: The length is N.

[0099] The sequence after sub-block interleaving is: The length is N.

[0100] The length m is determined based on the length of the encoded bit sequence, where m is not equal to a factor of the bit sequence length. Sub-blocks are interleaved on the m sub-sequences determined from the bit sequence. The number of sub-blocks interleaved, m, can be adjusted according to the code length of the encoded bit sequence. m is not a unique value.

[0101] As an example, when the length of the encoded bit sequence is 16 bits, m is not equal to a factor of 16. That is, m is not equal to 2, 4, or 8. When m is 5, the bit sequence is divided into 5 subsequences with different bit counts. Interleaving these 5 subsequences can effectively distribute erroneous bits, improving the performance of encoding and decoding, and enhancing the transmission performance of the communication link. It should be noted that the subsequences in this application can also be called subblocks, and subsequence interleaving can also be called subblock interleaving.

[0102] The pseudocode for sub-block interleaving is as follows:

[0103]

[0104] It should be understood that N represents the code length, m represents the sub-block interleaving depth, n represents the index of the interleaved sequence, P(i) represents the interleaving pattern, and y n d represents the bit sequence after sub-block interleaving. J(n) J(n) represents the bit sequence before interleaving of the indexed sub-block; J(n) represents the index of the sequence before interleaving.

[0105] It should also be understood that the specific parameters in the above sub-block interleaving process are not unique. Depending on the length of the bit sequence or the protocol specifications, the parameters in the sub-block interleaving process can be adaptively changed in different encoding and decoding processes, and the ability to resist random interference is continuously enhanced as the specific parameters are adjusted.

[0106] As an example, the pattern P(i) of the sub-block interleaving when m=32 is shown in Table 1:

[0107] Table 1. Polar code block interleaving pattern P(i)

[0108] i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) i P(i) 0 0 4 3 8 8 12 10 16 12 20 14 24 24 28 27 1 1 5 5 9 16 13 18 17 20 21 22 25 25 29 29 2 2 6 6 10 9 14 11 18 13 22 15 26 26 30 30 3 4 7 7 11 17 15 19 19 21 23 23 27 28 31 31

[0109] Taking Table 1 as an example, it can be seen that the division is called m = 32 subsequences, and the sequence number of each subsequence is represented by i. P(i) represents the corresponding sequence number after the sub-blocks are interleaved. For example, before the sub-blocks are interleaved, the sub-block at i = 3 is interleaved to the position i = 4 after the sub-blocks are interleaved, and the sub-block at the position i = 4 before the sub-blocks are interleaved to the position i = 3 after the sub-blocks are interleaved.

[0110] Optionally, the rate matching unit further includes bit interleaving the bit sequence after sub-block interleaving, wherein the bit interleaving performs bit interleaving on bits within one or more sub-sequences.

[0111] It should be understood that bit interleaving disperses potential errors as much as possible; bit interleaving is the process of selecting a sequence of bits. The output after the interleaver is The output of the interleaver is fed into the modulator for modulation.

[0112] Bit interleaving typically includes row-column interleaving, triangular interleaving, etc. This application uses row-column interleaving in the bit interleaving process. Compared with triangular interleaving, the parameter adjustment is more flexible in the row-column interleaving process.

[0113] As an example, the following is a possible row-column interleaver with X rows and Y columns, where The pseudocode is as follows:

[0114]

[0115] The above Figures 4 to 8 An exemplary schematic diagram of the Polar code initial transmission encoding method is shown. First, the information bits that need to be encoded using Polar codes are CRC encoded. Then, through a bit mapping unit, the CRC-encoded sequence is mapped to bit positions with different reliability levels. The bit sequence output by the bit mapping unit is used as the input to the polar coding unit. Finally, through sub-block interleaving, bit selection, and bit interleaving, potentially received erroneous sequences are dispersed, thereby improving the encoding and decoding performance of information and enhancing the reliability of the transmission link.

[0116] During the initial transmission of Polar codes, the receiving end may not receive all the information sent by the sending end correctly, requiring the sending end to retransmit. To ensure the performance of encoding and decoding and the reliability of the communication link, the following will combine... Figure 9 This section details the steps involved in the retransmission encoding process using Polar codes.

[0117] like Figure 9A schematic diagram of an information retransmission method proposed in this application is shown. During information retransmission, the encoding units from the initial transmission process are reused as much as possible. This reduces complexity while improving the performance of Polar code encoding and decoding, effectively ensuring the reliability of the communication link. Figure 9 The method shown includes the following steps.

[0118] S910, confirming that the j-th retransmission failed.

[0119] The sender determines that the j-th retransmission has failed and further determines the bit sequence to be retransmitted.

[0120] S920 reads a bit sequence of the first length from the circular buffer.

[0121] It should be understood that the circular buffer consists of a first bit sequence, a second bit sequence, and a third bit sequence. The first bit sequence is the bit sequence obtained by rate matching during the initial transmission. The second bit sequence is the bit sequence obtained by rate matching the fourth bit sequence during the first retransmission. The third bit sequence is the bit sequence composed of bits that were truncated or punched during the initial transmission.

[0122] It should also be understood that the fourth bit sequence is the bit sequence obtained by polar coding of the fifth bit sequence during the first retransmission, and the fifth bit sequence is the bit sequence obtained by re-mapping the sixth bit sequence obtained by bit mapping during the initial transmission. The reliability order of the bit positions corresponding to the sixth bit sequence is different from that of the bit positions corresponding to the fifth bit sequence.

[0123] Optionally, when reading a bit sequence of the first length from the circular buffer, the sending end may determine the starting position of the reading according to different redundancy versions. The first length to be read may be specified by the protocol or indicated by information, and this application does not limit this.

[0124] Optionally, after reading a bit sequence of the first length from the circular buffer, the bit sequence of the first length is sent to the interleaving unit for interleaving operation.

[0125] It should be understood that this interleaving is sub-block interleaving and / or bit interleaving. When the interleaving unit is sub-block interleaving, the first-length bit sequence is first divided into m sub-sequences, and the m sub-sequences are interleaved to obtain the interleaved m sub-sequences. Here, m is not equal to q, where q is a factor of the length N of the first-length bit sequence, and m, q, and N are all positive integers. For details, please refer to the specific examples of sub-block interleaving mentioned above.

[0126] It should also be understood that when the interleaving unit further includes bit interleaving, bit interleaving is performed on the bits contained in one or more subsequences after the interleaving of m subsequences. For details on bit interleaving, please refer to the above. Figures 7 to 8 A specific example of bit interleaving.

[0127] Further, after reading the bit sequence of the first length from the circular buffer, as follows: Figure 9 The method shown further includes:

[0128] S930, send the bit sequence of the first length to perform the (j+1)th retransmission, where j+1 is not greater than the maximum allowed number of retransmissions.

[0129] The above Figure 9 The method shown allows the sending end to directly read the first-length bit sequence to be transmitted from the circular buffer and retransmit it when the j-th retransmission fails. This eliminates the need to encode and calculate the information bits to be retransmitted, reducing the complexity of hardware implementation and minimizing resource overhead. The circular buffer consists of a bit sequence obtained after rate matching during the initial transmission, a bit sequence obtained after rate matching during the first retransmission, and bits that were truncated or punched during the rate matching process during the initial transmission. This improves the reliability of information retransmission, ensures the performance of encoding and decoding, and enhances transmission performance.

[0130] The following will combine Figures 10 to 12 This application describes in detail the method for the first retransmission of Polar codes. Figure 10 This paper mainly introduces a schematic diagram of the Polar code first retransmission encoding method proposed in this application. Figure 11 and Figure 12 The document provides detailed schematic diagrams illustrating the bit mapping unit and polar coding unit in the first retransmission process of Polar codes.

[0131] like Figure 10 A schematic diagram of the Polar code first retransmission encoding method proposed in this application is shown. The method includes: firstly, performing CRC encoding on the information bit sequence, and using the bit sequence with added cyclic redundancy check (CRC) as input to the bit mapping unit.

[0132] In the first retransmission encoding method, the bit mapping unit is divided into two bit mappings: first, through the bit mapping unit of the initial transmission (also called the RV0 bit mapping unit), and then through the bit mapping unit of the first retransmission (also called the RV1 bit mapping unit), as follows. Figure 10As shown, the bit sequence output by the RV0 bit mapping unit is the sixth bit sequence. This sixth bit sequence is then used as the input to the RV1 bit mapping unit for a second bit mapping, and the output bit sequence is the fifth bit sequence. The reliability order of the bit positions in the bit sequence obtained by the RV1 bit mapping unit differs from that in the bit sequence obtained by the RV0 bit mapping unit.

[0133] It should be understood that, based on the above Figure 6 As shown in the schematic diagram of the RV0 bit mapping, in the sequence In Polar codes, the reliability of the polarization channel corresponding to each bit varies, and the receiver is more prone to errors when transmitting bits on a polarization channel with low decoding reliability. This application proposes a secondary bit mapping (RV1 bit mapping) during the first retransmission of the Polar code, mapping the RV0 bits (which were initially mapped to low-reliability bits) to higher-reliability bits. Specifically, RV1 bit mapping maps the bits mapped to low-reliability positions during the RV0 bit mapping process to higher-reliability positions in the RV1 bit sequence, facilitating the receiver's use of retransmission bit enhancement decoding.

[0134] Optionally, in the RV1 bit mapping unit, the reliable low bit sequence of the bit position of the RV0 bit mapping is used for RV1 bit mapping (e.g., Figure 11 (The RV1 bit mapping is shown in the figure). When performing RV1 bit mapping, the bit position is mapped to the bit position with high reliability corresponding to the bit position of the RV1 bit sequence.

[0135] As an example: After RV0 bit mapping, the resulting bit sequence is the sixth bit sequence, containing P bits. These P bits correspond to P bit positions, and each of these P bit positions contains k second positions, where the reliability of these k second positions is no higher than the reliability of the remaining Pk bit positions. After RV1 bit mapping, the resulting bit sequence is the fifth bit sequence, containing P bits. These P bits correspond to P bit positions, and each of these P bit positions contains K first positions, where the reliability of these K first positions is no lower than the reliability of the remaining Pk bit positions. During the RV1 bit mapping process, the bits located at the aforementioned k second positions in the sixth bit sequence are mapped to the corresponding K first positions in the fifth bit sequence. Here, K = k + L, where L represents the number of cyclic redundancy check (CRC) bits used in the RV1 bit mapping.

[0136] For example: the available physical resources for the first retransmission of a Polar code are E. rv1 Bits, expected code rate: R rv1 And R rv1 satisfy To ensure the reliability of retransmitted bits, the number of retransmitted bits is as follows: Where L rv1 Indicates that k is used when RV1 retransmits. rv1 The CRC bits are added to the bit payload. Typically, the expected code rate R... rv1 The value can be obtained based on simulation or experience, and this application does not limit this.

[0137] During RV1 retransmission, k is selected from the bit-mapped sequence of RV0. rv1 The least reliable bit, and add L rv1 After the CRC of the bits, it is mapped to the sequence. Among them, K has the highest reliability. rv1 In each position, and The sequence is fed into an encoder with the same code length as RV0, and the encoded sequence is denoted as:

[0138] like Figure 10 As shown, the fifth bit sequence output by the bit mapping unit will be used as the input to the polar coding unit. This polar coding unit includes the polar coding unit used during the initial multiplexing (which can be called the RV0 polar coding unit).

[0139] Optionally, the polar coding unit also includes the polar coding unit for the first retransmission (which may be called the RV1 polar coding unit).

[0140] As one possible implementation, when the polar coding unit only includes the RV0 polar coding unit, the fifth bit sequence obtained through the bit mapping unit is directly used as the input of the RV0 polar coding unit, multiplexing the polar coding unit from the initial transmission. The bit sequence obtained through the polar coding unit (which can be called the fourth bit sequence) is used as the input bit sequence of the rate matching unit.

[0141] As another possible implementation, when the polarization coding unit includes RV0 and RV1 polarization coding units, the fourth bit sequence is the bit sequence obtained by passing the fifth bit sequence through the RV0 and RV1 polarization coding units. Specifically, the RV1 polarization coding unit performs an XOR operation on the bit sequence obtained by passing the fifth bit sequence through the RV0 polarization coding unit and the bit sequence obtained by passing the sixth bit sequence through the RV0 polarization coding unit. This fourth bit sequence serves as the input bit sequence for the rate matching unit. For example: Figure 12As shown, {u0,u1,u2,u3} represents the bit sequence after RV0 polar coding during the first retransmission, and {u4,u5,u6,u7} represents the bit sequence after RV0 polar coding during the initial transmission. The bit sequences {u0,u1,u2,u3} and {u4,u5,u6,u7} are encoded as follows: Figure 10 The XOR operation of the RV1 polar coding unit shown yields the bit sequence {d0,d1,d2,d3,d4,d5,d6,d7}, where the bit sequence {d0,d1,d2,d3} serves as the input for rate matching.

[0142] It should be understood that, assuming the initial transmission, the bit sequence output by the RV0 polar coding is as follows: During the first retransmission, the bit sequence from the RV0 polar code source is: The rate-matched sequence sent to RV1 is: The "+" operator represents the XOR operation.

[0143] The fourth bit sequence obtained by the polar coding unit is used as the input to the rate matching unit, such as Figure 10 As shown, during the first retransmission of the Polar code, the rate matching unit reuses the rate matching unit (i.e., the RV0 rate matching unit) from the initial transmission of the Polar code, making the most of the computational units from the initial transmission, reducing the complexity of hardware implementation, reducing resource overhead, and ensuring transmission performance.

[0144] The above Figures 10 to 12 This paper primarily introduces a schematic diagram of the method proposed in this application for the first retransmission of Polar codes. During the first retransmission of Polar codes, RV0 bit mapping and RV1 bit mapping are used to improve transmission performance. Simultaneously, during the first retransmission of Polar codes, the polar coding unit and rate matching unit reuse the computational units from the initial transmission as much as possible, avoiding the introduction of new computational units, thus reducing system complexity and saving resource overhead.

[0145] After the first retransmission fails, the sending end reads a bit sequence of a first length from the circular buffer and sends the bit sequence of the first length to the receiving end to perform a second retransmission.

[0146] Specifically, the circular buffer consists of a first bit sequence after rate matching during the initial transmission, a second bit sequence after rate matching during the first retransmission, and a bit sequence (called the third bit sequence) composed of bits that have been truncated or punched during the initial transmission.

[0147] When the sending end reads a bit sequence of the first length from the circular buffer, the sending end first determines the starting position of reading the bit sequence of the first length according to the different redundancy versions of Polar IRHARQ, and then determines the length of the bit sequence to be read according to its own protocol, or some indication information, or according to other methods. This application does not limit this.

[0148] Figure 13 A schematic diagram of different redundancy versions of Polar IR HARQ is shown. For example... Figure 13 As shown, RV0_PS represents the bit sequence composed of bits that have been truncated or punctured during the initial transmission (i.e., the third bit sequence), and its length is: max(NE rv0 Let RV0 represent the first bit sequence and RV1 represent the second bit sequence. Then the sequence of the circular buffer formed by the first bit sequence, the second bit sequence, and the third bit sequence is:

[0149]

[0150] During retransmission, the sending end reads the corresponding bit sequence (i.e., the bit sequence of the first length) from the circular buffer according to the available physical resources.

[0151] When the transmitting end reads the first bit sequence of length from the circular buffer, it determines the starting position according to different redundancy versions. Table 2 shows the starting positions of different redundancy versions of the Polar code. As shown in Table 2, the starting position of RV0 is 0, and the starting position of RV1 is E. rv0 The starting position of RV2 is E. rv0 +E rv1 The starting position of RV3 is E rv0 .

[0152] Table 2 Starting positions of different redundancy versions of Polar codes

[0153] RV0 RV1 RV2 RV3 Starting position 0 <![CDATA[E rv0 ]]> <![CDATA[E rv0 +E rv1 ]]> <![CDATA[E rv0 ]]>

[0154] The above Figure 13 As shown, when the sending end determines that the j-th retransmission has failed, the sending end reads a bit sequence of the first length from the circular buffer and sends the bit sequence of the first length to the receiving end to perform the (j+1)-th retransmission.

[0155] It should be noted that j+1 is not greater than the maximum allowed number of retransmissions. When j+1 is greater than the maximum number of retransmissions, the sending end will no longer perform the above operation.

[0156] According to the above Figure 13As can be seen, the information retransmission method proposed in this application, in the event of a previous retransmission failure, involves the sending end reading a bit sequence of appropriate length from the circular buffer as the bit sequence for the current retransmission. This information retransmission method simplifies the calculations during the retransmission process, reduces the complexity of encoding and decoding, and further enhances the energy gain and coding gain, thereby improving the decoding performance of Polar codes and effectively ensuring the reliability of the communication link.

[0157] The following will combine Figures 14 to 15 This application describes the communication device, encoding device, network device, and terminal device provided. It should be understood that the descriptions of the device embodiments correspond to the descriptions of the method embodiments; therefore, any content not described in detail can be found in the above method embodiments. For brevity, some content is omitted.

[0158] See Figure 14 , Figure 14 This is a schematic block diagram of the communication device 1400 provided in this application. Figure 14 As shown, the device 1400 includes a processing unit 1410 and a transceiver unit 1420, wherein the transceiver unit 1420 may also be referred to as a communication interface or a communication unit.

[0159] The processing unit 1410 is used to determine that the j-th retransmission failed.

[0160] The processing unit 1410 is further configured to read a bit sequence of a first length from a circular buffer, the circular buffer being composed of a first bit sequence, a second bit sequence, and a third bit sequence. The first bit sequence is a bit sequence obtained by rate matching during the initial transmission. The second bit sequence is a bit sequence obtained by rate matching the fourth bit sequence during the first retransmission. The third bit sequence is a bit sequence composed of bits that were truncated or punched during the initial transmission of the information bit sequence. The fourth bit sequence is a bit sequence obtained by polar encoding of the fifth bit sequence during the first retransmission. The fifth bit sequence is obtained by re-mapping the sixth bit sequence obtained by bit mapping during the initial transmission. The reliability order of the bit positions corresponding to the sixth bit sequence and the bit positions corresponding to the fifth bit sequence are different.

[0161] The transceiver unit 1420 is used to transmit a bit sequence of a first length determined by the processing unit 1410.

[0162] Optionally, the processing unit 1410 is further configured to determine the starting position for reading based on the first bit sequence, the second bit sequence, and the third bit sequence; and to read a bit sequence of a first length from the circular buffer through the starting position.

[0163] Optionally, the processing unit 1410 is further configured to determine m subsequences based on a bit sequence of the first length; interleave the m subsequences, where m is not equal to q, q is a factor of the length N of the bit sequence of the first length, and m, q, and N are all positive integers;

[0164] Optionally, the transceiver unit is also used to transmit a bit sequence of the first length after interleaving.

[0165] Optionally, the processing unit is also configured to: perform bit interleaving on the bits contained in one or more of the m subsequences.

[0166] Optionally, the fourth bit sequence is a bit sequence obtained by XORing the fifth bit sequence obtained by polar encoding and the sixth bit sequence obtained by polar encoding.

[0167] Optionally, the fifth bit sequence contains P bits, the sixth bit sequence contains P bits, the P bits correspond to P bit positions, the P bit positions in the fifth bit sequence include K first positions, the reliability of the K first positions is not lower than the reliability of the remaining Pk bit positions, the P bit positions in the sixth bit sequence include k second positions, the reliability of the k second positions is not higher than the reliability of the remaining Pk bit positions, the fifth bit sequence is obtained by re-mapping the sixth bit sequence obtained by bit mapping during the initial transmission, including: the bits located at the k second positions in the sixth bit sequence are mapped to the K first positions corresponding to the fifth bit sequence, where K = k + L, and L is the number of cyclic redundancy check (CRC) bits during the first retransmission.

[0168] It should be noted that, in specific implementations, the processing unit 1410 may be a processor, a chip, or an integrated circuit. This application does not impose any limitations on this.

[0169] The communication device 1400 provided in this application is used to implement the information retransmission method in the above-described method embodiments. (This application embodiment) Figures 9 to 13 Some or all of the processes can be implemented in hardware or software. When implemented in hardware, the processing unit 1410 can be a processor.

[0170] Figure 15 This is a schematic structural diagram of the terminal device 1500 provided in this application. Figure 15 As shown, Figure 15As shown, the terminal device 1500 includes: one or more processors 1510, one or more memories 1520, and one or more transceivers 1530. The processors 1510 control the transceivers 1530 to transmit and receive signals. The memories 1520 store computer programs. The processors 1510 retrieve and run the computer programs from the memories 1520 to execute the information retransmission method provided in this application. Figures 9 to 13 The corresponding process is described below. For the sake of brevity, it will not be elaborated here.

[0171] For example, terminal device 1500 could be Figure 1 The terminal device 102 or 103 in the wireless communication system shown. Processor 1510 can correspond to... Figure 14 The processing unit 1410 and transceiver 1530 in the middle can correspond to Figure 14 The transceiver unit 1420 shown is illustrated.

[0172] Furthermore, this application provides a computer-readable storage medium storing computer instructions that, when executed on a computer, cause the computer to perform the information retransmission method provided in the embodiments of this application. Figures 9 to 13 The corresponding operations and / or processes within.

[0173] This application also provides a computer program product, which includes computer program code. When the computer program code is run on a computer, it causes the computer to execute the information retransmission method provided in the embodiments of this application. Figures 9 to 13 The corresponding operations and / or processes within.

[0174] This application also provides a chip, including a processor. The processor is used to read and execute a computer program stored in a memory to perform the information retransmission method provided in this application. Figures 9 to 13 The corresponding operations and / or processes within.

[0175] Optionally, the chip further includes a memory, which is connected to the processor via a circuit or wire. More optionally, the chip also includes a communication interface, to which the processor is connected. The communication interface receives a bit sequence to be encoded. The processor obtains the information bit sequence from the communication interface and, using the information retransmission method provided in this embodiment, reads a bit sequence of a first length from the circular buffer for retransmission; the communication interface outputs a bit sequence of the first length. This communication interface can be an input / output interface.

[0176] This application provides a computer-readable storage medium storing computer instructions that, when executed on a computer, cause the computer to perform actions provided in the embodiments of this application. Figures 9 to 13 The corresponding operations and / or processes within.

[0177] This application also provides a computer program product, which includes computer program code. When the computer program code is run on a computer, it causes the computer to execute the functions provided in the embodiments of this application. Figures 9 to 13 The corresponding operations and / or processes within.

[0178] This application also provides a chip, including a processor. The processor is used to read and execute a computer program stored in a memory to perform the functions provided in the embodiments of this application. Figures 9 to 13 The corresponding operations and / or processes within.

[0179] Optionally, the chip further includes a memory, which is connected to the processor via a circuit or wire. More optionally, the chip also includes a communication interface, to which the processor is connected. The communication interface is used to send a bit sequence of a first length determined by the processor from a circular buffer. This communication interface can be an input / output interface. In implementation, each step of the above method can be completed by integrated logic circuits in the processor's hardware or by instructions in software form. The steps of the above method embodiments can be directly implemented by the hardware processor, or by a combination of hardware and software modules in the processor. The software modules can reside in random access memory, flash memory, read-only memory, programmable read-only memory, electrically erasable programmable memory, registers, or other mature storage media in the art. The storage medium is located in the memory, and the processor reads information from the memory and, in conjunction with its hardware, completes the steps of the above method.

[0180] The memory in this application embodiment can be volatile memory or non-volatile memory, or it can include both volatile and non-volatile memory. The non-volatile memory can be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. The volatile memory can be random access memory (RAM), which is used as an external cache. By way of example, but not limitation, many forms of RAM are available, such as static random access memory (SRAM), dynamic random access memory (DRAM), synchronous dynamic random access memory (SDRAM), double data rate synchronous dynamic random access memory (DDRSDRAM), enhanced synchronous dynamic random access memory (ESDRAM), synchronous linked dynamic random access memory (SLDRAM), and direct rambus RAM (DR RAM). It should be noted that the memory used in the systems and methods described herein is intended to include, but is not limited to, these and any other suitable types of memory.

[0181] Those skilled in the art will recognize that the units and algorithm steps of the various examples described in conjunction with the embodiments disclosed herein can be implemented in electronic hardware, or a combination of computer software and electronic hardware. Whether these functions are implemented in hardware or software depends on the specific application and design constraints of the technical solution. Those skilled in the art can use different methods to implement the described functions for each specific application, but such implementation should not be considered beyond the scope of this application.

[0182] Those skilled in the art will understand that, for the sake of convenience and brevity, the specific working processes of the systems, devices, and units described above can be referred to the corresponding processes in the foregoing method embodiments, and will not be repeated here.

[0183] In the several embodiments provided in this application, it should be understood that the disclosed systems, apparatuses, and methods can be implemented in other ways. For example, the apparatus embodiments described above are merely illustrative; for instance, the division of units is only a logical functional division, and in actual implementation, there may be other division methods. For example, multiple units or components may be combined or integrated into another system, or some features may be ignored or not executed. Furthermore, the coupling or direct coupling or communication connection shown or discussed may be through some interfaces; the indirect coupling or communication connection between apparatuses or units may be electrical, mechanical, or other forms.

[0184] The units described as separate components may or may not be physically separate. The components shown as units may or may not be physical units; that is, they may be located in one place or distributed across multiple network units. Some or all of the units can be selected to achieve the purpose of this embodiment according to actual needs.

[0185] In addition, the functional units in the various embodiments of this application can be integrated into one processing unit, or each unit can exist physically separately, or two or more units can be integrated into one unit.

[0186] If the aforementioned functions are implemented as software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium. Based on this understanding, the technical solution of this application, in essence, or the part that contributes to the prior art, or a portion of the technical solution, can be embodied in the form of a software product. This computer software product is stored in a storage medium and includes several instructions to cause a computer device (which may be a personal computer, server, or network device, etc.) to execute all or part of the steps of the methods described in the various embodiments of this application. The aforementioned storage medium includes various media capable of storing program code, such as USB flash drives, portable hard drives, read-only memory (ROM), random access memory (RAM), magnetic disks, or optical disks.

[0187] The above description is merely a specific embodiment of this application, but the scope of protection of this application is not limited thereto. Any variations or substitutions that can be easily conceived by those skilled in the art within the scope of the technology disclosed in this application should be included within the scope of protection of this application. Therefore, the scope of protection of this application should be determined by the scope of the claims.

Claims

1. A method for retransmitting information, characterized in that, include: It is confirmed that the j-th retransmission failed; A bit sequence of a first length is read from a circular buffer, which consists of a first bit sequence, a second bit sequence, and a third bit sequence. The first bit sequence is the bit sequence obtained by rate matching during the initial transmission. The second bit sequence is the bit sequence obtained by rate matching the fourth bit sequence during the first retransmission. The third bit sequence is a bit sequence composed of bits that were truncated or punched during the initial transmission. The fourth bit sequence is a bit sequence obtained by polar coding the fifth bit sequence during the first retransmission. The fifth bit sequence is a bit sequence obtained by re-mapping the sixth bit sequence obtained by bit mapping during the initial transmission. The reliability order of the bit positions corresponding to the sixth bit sequence and the bit positions corresponding to the fifth bit sequence are different. Send the bit sequence of the first length to perform the (j+1)th retransmission. Where j+1 is not greater than the maximum allowed number of retransmissions, and j is a positive integer.

2. The method according to claim 1, characterized in that, Read a bit sequence of the first length from the circular buffer, including: The starting position for reading is determined based on the first bit sequence, the second bit sequence, and the third bit sequence; The first length of bit sequence is read from the circular buffer according to the starting position.

3. The method according to claim 1 or 2, characterized in that, The method further includes: Divide the bit sequence of the first length into m subsequences; The m subsequences are interleaved to obtain m interleaved subsequences, where m is not equal to q, q is a factor of the length N of the first bit sequence, and m, q, and N are all positive integers. Sending the bit sequence of the first length includes: Send the interleaved bit sequence of the first length.

4. The method according to claim 3, characterized in that, The method further includes: Bit interleaving is performed on the bits contained in one or more of the m subsequences.

5. The method according to any one of claims 1 to 4, characterized in that, The fourth bit sequence is obtained by XORing the fifth bit sequence obtained by polar encoding and the sixth bit sequence obtained by polar encoding.

6. The method according to any one of claims 1 to 5, characterized in that, The fifth bit sequence contains P bits, the sixth bit sequence contains P bits, and the P bits correspond to P bit positions. The fifth bit sequence contains P bit positions, including K first positions, and the reliability of the K first positions is no less than the reliability of the remaining PK bit positions. The sixth bit sequence contains k second positions among the P bit positions, and the reliability of the k second positions is no higher than the reliability of the remaining Pk bit positions. The fifth bit sequence is obtained by re-mapping the sixth bit sequence obtained during the initial transmission, including: The bits located at the k second positions in the sixth bit sequence are mapped to the k first positions corresponding to the fifth bit sequence. Wherein, K = k + L, and L is the number of cyclic redundancy check (CRC) bits during the first retransmission.

7. An information retransmission device, characterized in that, include: The processing unit is used to determine if the j-th retransmission fails. The processing unit is further configured to read a bit sequence of a first length from a circular buffer, the circular buffer consisting of a first bit sequence, a second bit sequence, and a third bit sequence. The first bit sequence is a bit sequence obtained through rate matching during the initial transmission; the second bit sequence is a bit sequence obtained after rate matching of the fourth bit sequence during the first retransmission; and the third bit sequence is a bit sequence composed of bits that were truncated or punched during the initial transmission of the information bit sequence. The fourth bit sequence is the bit sequence obtained by polar coding of the fifth bit sequence during the first retransmission. The fifth bit sequence is the bit sequence obtained by re-mapping the sixth bit sequence obtained by bit mapping during the initial transmission. The reliability order of the bit positions corresponding to the sixth bit sequence and the bit positions corresponding to the fifth bit sequence are different. The transceiver unit is used to send the bit sequence of the first length to perform the (j+1)th retransmission. Where j+1 is less than the maximum allowed number of retransmissions, and j is a positive integer.

8. The apparatus according to claim 7, characterized in that, The processing unit is further configured to determine the read position based on the first bit sequence, the second bit sequence, and the third bit sequence; The processing unit is further configured to read a bit sequence of the first length from the circular buffer according to the read position.

9. The apparatus according to claim 7 or 8, characterized in that, The processing unit is also used for: Determine m subsequences based on the bit sequence of the first length; The m subsequences are interleaved, where m is not equal to q, q is a factor of the length N of the first bit sequence, and m, q, and N are all positive integers. The transceiver unit is also used to transmit the interleaved bit sequence of the first length.

10. The apparatus according to claim 9, characterized in that, The processing unit is also used for: Bit interleaving is performed on the bits contained in one or more of the m subsequences.

11. The apparatus according to any one of claims 7 to 10, characterized in that, The fourth bit sequence is obtained by XORing the fifth bit sequence obtained by polar encoding and the sixth bit sequence obtained by polar encoding.

12. The apparatus according to any one of claims 7 to 11, characterized in that, The fifth bit sequence contains P bits, the sixth bit sequence contains P bits, and the P bits correspond to P bit positions. The fifth bit sequence contains P bit positions, including K first positions, and the reliability of the K first positions is no less than the reliability of the remaining PK bit positions. The sixth bit sequence contains k second positions among the P bit positions, and the reliability of the k second positions is no higher than the reliability of the remaining Pk bit positions. The fifth bit sequence is obtained by re-mapping the sixth bit sequence obtained during the initial transmission, including: The bits located at the k second positions in the sixth bit sequence are mapped to the k first positions corresponding to the fifth bit sequence. Wherein, K = k + L, and L is the number of cyclic redundancy check (CRC) bits during the first retransmission.

13. A communication device, characterized in that, The device includes at least one processor coupled to at least one memory, the at least one processor being configured to execute a computer program or instructions stored in the at least one memory to cause the communication device to perform the method as described in any one of claims 1 to 6.

14. A computer-readable storage medium, characterized in that, The computer-readable storage medium stores instructions that, when executed on a computer, cause the computer to perform the method as described in any one of claims 1 to 6.

15. A chip, characterized in that, include: Memory, used to store computer programs; A processor for reading and executing the computer program stored in the memory, wherein when the computer program is executed, the processor performs the method as described in any one of claims 1 to 6.

16. A computer program product, characterized in that, The computer program product includes computer program code that, when executed on a computer, causes the computer to perform the method as described in any one of claims 1 to 6.

Images