WO2023226747A1 - 一种信息的重传方法和通信装置 - Google Patents

一种信息的重传方法和通信装置 Download PDF

Info

Publication number
WO2023226747A1
WO2023226747A1 PCT/CN2023/092986 CN2023092986W WO2023226747A1 WO 2023226747 A1 WO2023226747 A1 WO 2023226747A1 CN 2023092986 W CN2023092986 W CN 2023092986W WO 2023226747 A1 WO2023226747 A1 WO 2023226747A1
Authority
WO
WIPO (PCT)
Prior art keywords
bit sequence
bit
retransmission
positions
length
Prior art date
Application number
PCT/CN2023/092986
Other languages
English (en)
French (fr)
Inventor
闫永立
岳华伟
Original Assignee
海思技术有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 海思技术有限公司 filed Critical 海思技术有限公司
Publication of WO2023226747A1 publication Critical patent/WO2023226747A1/zh

Links

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1829—Arrangements specially adapted for the receiver end

Definitions

  • the embodiments of the present application relate to the field of communications, and more specifically, to an information retransmission method and a communications device.
  • Polar code is a linear block code. It has been theoretically proven that Polar code is currently the only coding method that can achieve the Shannon limit and has low coding and decoding complexity.
  • the existing technology uses the traditional incremental redundancy (IR) hybrid automatic repeat request (HARQ) technology to encode different codes by retransmitting
  • IR incremental redundancy
  • HARQ hybrid automatic repeat request
  • RV redundancy version
  • Embodiments of the present application provide a method for retransmitting information, which can reduce the complexity of encoding and decoding during the process of retransmitting information.
  • a method for retransmitting information includes: determining that the j-th retransmission fails;
  • the circular buffer consists 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 initial transmission.
  • the second bit sequence is the bit sequence obtained after rate matching the fourth bit sequence in the first retransmission
  • the third bit sequence is the bits composed of bits that were truncated or punctured when the information bit sequence was first transmitted.
  • sequence wherein the fourth bit sequence is the bit sequence obtained by polarization encoding of the fifth bit sequence during the first retransmission, and the fifth bit sequence is the sixth bit sequence obtained through bit mapping during the initial transmission and is re-bit mapped.
  • the order of reliability of the bit position corresponding to the sixth bit sequence and the bit position corresponding to the fifth bit sequence are different; sending the bit sequence of the first length to perform the j+1th retransmission, where, j+1 is less than the maximum number of retransmissions allowed, and j is a positive integer.
  • the sending end determines that the last retransmission failed, and determines a bit sequence of the first length from the circular buffer to make a retransmission sequence, where the circular buffer is passed through during the initial transmission.
  • the bit sequence after rate matching.
  • the information bit sequence undergoes two bit mappings and then undergoes polarization coding.
  • the bit sequence obtained after rate matching, and the bit sequence is truncated or punctured during the initial transmission.
  • the sender no longer needs to perform bit selection, polarization coding, rate matching and other calculation units on the information bits in sequence. It directly reads the first length bit sequence from the circular buffer and sends it, which simplifies the calculation during the retransmission process and can reduce the cost. Compile and code complexity.
  • the retransmitted information bit sequence may be the same as the initially transmitted information bit sequence, or the retransmitted information bit sequence may be part of the initially transmitted information bit sequence.
  • reading a bit sequence of a first length from a circular buffer includes: determining according to the first bit sequence, the second bit sequence and the third bit sequence. Reading position; reading the bit sequence of the first length from the circular buffer according to the reading position.
  • determining the starting position of reading the bit sequence of the first length according to different redundant versions in the circular buffer can improve the accuracy of retransmission, improve decoding performance, and ensure the reliability of the communication link.
  • the method further includes: dividing the bit sequence of the first length into m subsequences; interleaving the m subsequences to obtain interleaved m subsequences , m is not equal to q, q is a factor of the length N of the bit sequence of the first length, m, q, and N are all positive integers; sending the bit sequence of the first length includes: sending the interleaved bit sequence of the first length bit sequence.
  • the bit sequence of the first length is read from the circular buffer, and the corresponding read bit sequence is sent to the interleaving unit according to the available physical resources, and the bit sequence of the first length is divided into m subsequences, The m subsequences after the division are interleaved, where m is not a factor of the length of the bit sequence of the first length, make the interleaving process more complete, thereby improving the decoding performance.
  • bits included in one or more subsequences in the m subsequences are bit interleaved.
  • bit interleaving is performed on the interleaved m sub-blocks, and the bits contained in one or more sub-sequences in the m sub-sequences are interleaved.
  • the bit interleaving is more sufficient, discrete and corrected than the sub-block interleaving. Sudden errors, improved coding performance, and improved communication transmission characteristics.
  • the fourth bit sequence is subjected to polar coding to obtain the bit sequence of the fifth bit sequence and the sixth bit sequence is subjected to polar coding to obtain the bit sequence and is XORed The bit sequence obtained by the operation.
  • the second bit sequence in the circular buffer is used as the bit sequence after rate matching of the fourth bit sequence in the first retransmission process, where the fourth bit sequence is after polarization coding during the initial transmission.
  • the bit sequence obtained by performing an XOR operation on the bit sequence and the bit sequence after polarization encoding in the first retransmission.
  • the fifth bit sequence includes P bits
  • the sixth bit sequence includes P bits
  • the P bits correspond to P bit positions
  • the P bit positions in the sequence include K first positions
  • the reliability of the K first positions is not lower than the reliability of the remaining P-K bit positions
  • the P bit positions in the sixth bit sequence contains k second positions.
  • the reliability of the k second positions is not higher than the reliability of the remaining P-k bit positions.
  • the fifth bit sequence is the sixth bit sequence obtained through bit mapping during the initial transmission.
  • the information bit sequence undergoes two bit mappings.
  • the bits in the initial transmission are mapped to a bit sequence with lower reliability than other bit positions, and the second bit mapping is performed.
  • the second bit mapping maps the mapped bits to positions that are not less reliable than other bit positions. This effectively ensures the performance of encoding and decoding and improves transmission performance.
  • a second aspect provides an information retransmission device, which has the function of implementing the method in the above first aspect and any possible implementation thereof.
  • This function can be implemented by hardware, or by hardware executing corresponding software.
  • the hardware or software includes one or more units corresponding to the above functions.
  • the device when part or all of the function is implemented by hardware, the device includes: a processing unit, used to determine the j-th retransmission failure; the processing unit is also used to read from the circular buffer A bit sequence of a first length.
  • 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 through rate matching during initial transmission.
  • the second bit sequence is the bit sequence obtained after rate matching the fourth bit sequence in the first retransmission.
  • the third bit sequence is a bit sequence composed of bits that were truncated or punctured when the information bit sequence was first transmitted, wherein the third bit sequence is The four-bit sequence is the bit sequence obtained by polar coding of the fifth bit sequence in the first retransmission.
  • the fifth bit sequence is obtained by re-bit mapping the sixth bit sequence obtained through bit mapping in the initial transmission.
  • the sixth bit sequence is obtained by bit mapping again.
  • the order of reliability of the bit position corresponding to the bit sequence and the bit position 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+1th retransmission, where, j +1 is less than the maximum number of retransmissions allowed, and j is a positive integer.
  • the retransmission device may be a chip or an integrated circuit.
  • a bit sequence of a first length is read from the circular buffer, and the processing unit is also configured to determine the read based on the first bit sequence, the second bit sequence and the third bit sequence. position; the processing unit is also configured to read the bit sequence of the first length from the circular buffer according to the read position.
  • the processing unit is also configured to: determine m subsequences based on the bit sequence of the first length; interleave the m subsequences, m is not equal to q, and q is the first length
  • the factors of the bit sequence length N, m, q, and N are all positive integers; the transceiver unit is also used to send the interleaved bit sequence of the first length.
  • the processing unit is also configured to: perform bit interleaving on bits contained in one or more subsequences in the m subsequences.
  • the fourth bit sequence is a bit sequence obtained by performing an XOR operation on the bit sequence obtained by polar coding of the fifth bit sequence and the bit sequence obtained by polar coding of the sixth bit sequence.
  • the fifth bit sequence includes P bits
  • the sixth bit sequence includes P bits
  • the P bits correspond to P bit positions
  • the information retransmission device when part or all of the function is implemented by software, includes: a memory for storing computer programs; a processor for executing the computer program stored in the memory.
  • the encoding device can implement the information retransmission method in the above first aspect and any possible design of the first aspect.
  • the memory may be a physically separate unit or may be integrated with the processor.
  • the information retransmission device when part or all of the related functions are implemented by software, only includes a processor.
  • the memory used to store the program is located outside the information retransmission device, and the processor is connected to the memory through circuits/wires for reading and running the program stored in the memory to perform any one of the above-mentioned first aspect and the first aspect.
  • the present 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 send and receive signals
  • the memory is used to store computer programs
  • the processor is used to call and run the computer program stored in the memory, so that the network device executes the method in any possible implementation manner in the first aspect.
  • the network device when the network device serves as the sending end of information and/or data, the network device performs the information retransmission method in the above first aspect and any possible implementation thereof, and retransmits the information and/or data that needs to be sent. pass.
  • the terminal device serves as the receiving end of information and/or data, the terminal device performs the information retransmission method in the above-mentioned first aspect and any possible implementation of the first aspect.
  • the present application provides a computer-readable storage medium that stores instructions that, when run on a computer, cause the computer to execute the first aspect or any possible implementation of the first aspect. method in.
  • this application provides a computer program product.
  • the computer program product includes computer program code.
  • the computer program code When the computer program code is run on a computer, it causes the computer to execute the above-mentioned first aspect and any of its possible implementations. method.
  • this application provides a chip including a processor.
  • the processor is configured to read and execute the computer program stored in the memory to perform the method in the above-mentioned first aspect or any possible implementation of the first aspect.
  • the chip further includes a memory, and the memory and the processor are connected to the memory through circuits or wires.
  • the chip also includes a communication interface, and the processor is connected to the communication interface.
  • the communication interface is used to receive the 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.
  • the communication interface may be an input-output interface.
  • Figure 1 shows an architectural diagram of a wireless communication system 100 provided by an embodiment of the present application.
  • Figure 2 shows the communication link flow chart of Polar code channel coding.
  • Figure 3 shows a schematic flow chart of an information retransmission method provided by an embodiment of the present application.
  • Figure 4 shows a schematic diagram of a polar code encoding method provided by an embodiment of the present application.
  • Figure 5 shows a schematic diagram of another polar code encoding method provided by an embodiment of the present application.
  • Figure 6 shows a schematic diagram of another polar code encoding method provided by an embodiment of the present application.
  • Figure 7 shows a schematic diagram of another polar code encoding method provided by an embodiment of the present application.
  • Figure 8 shows a schematic diagram of another polar code encoding method provided by an embodiment of the present application.
  • Figure 9 shows a schematic diagram of an information retransmission method provided by this application.
  • Figure 10 shows a schematic diagram of a polar code first retransmission encoding method provided by an embodiment of the present application.
  • Figure 11 shows a schematic diagram of another first retransmission encoding method of polar codes provided by an embodiment of the present application.
  • Figure 12 shows a schematic diagram of another first retransmission encoding method of polar codes provided by an embodiment of the present application.
  • Figure 13 shows a schematic diagram of a Polar IR HARQ redundant version provided by an embodiment of the present application.
  • Figure 14 shows a schematic structural diagram of a communication device 1400 provided by an embodiment of the present application.
  • Figure 15 shows a schematic structural diagram of the terminal device 1500 provided by the embodiment of the present application.
  • GSM Global System of Mobile communication
  • CDMA Code Division Multiple Access
  • WCDMA broadband code division multiple access
  • GPRS General Packet Radio Service
  • LTE Long Term Evolution
  • FDD Frequency Division Duplex
  • TDD Time Division Duplex
  • UMTS Universal Mobile Telecommunication System
  • WiMAX Worldwide Interoperability for Microwave Access
  • the terminal equipment in the embodiment of this application may 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 equipment, user agent or User device.
  • the terminal device may also be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), or a device with wireless communications Functional handheld devices, computing devices or other processing devices connected to wireless modems, vehicle-mounted devices, wearable devices, terminal devices in future 5G networks or future evolved Public Land Mobile Communications Networks (Public Land Mobile Network, PLMN) Terminal equipment, etc., the embodiments of this application are not limited to this.
  • SIP Session Initiation Protocol
  • WLL Wireless Local Loop
  • PDA Personal Digital Assistant
  • the network device in the embodiment of the present application may be a device used to communicate with a terminal device.
  • the network device may be a Global System of Mobile communication (GSM) system or a Code Division Multiple Access (CDMA) system. It can be a base station (Base Transceiver Station, BTS) in a wideband code division multiple access (Wideband Code Division Multiple Access, WCDMA) system (NodeB, NB), or an evolutionary base station (Evolutional) in an LTE system.
  • GSM Global System of Mobile communication
  • CDMA Code Division Multiple Access
  • BTS Base Transceiver Station
  • WCDMA Wideband Code Division Multiple Access
  • NodeB NodeB
  • Evolutional evolutionary base station
  • NodeB, eNB or eNodeB or a wireless controller in a Cloud Radio Access Network (CRAN) scenario
  • the network device can be a relay station, access point, vehicle-mounted device, wearable device, and in the future
  • the embodiments of this application are not limited to network equipment in the 5G network or network equipment in the future evolved PLMN network.
  • FIG 1 is an architectural diagram of a wireless communication system 100 suitable for embodiments of the present application.
  • the wireless communication system 100 may include at least one network device and one or more terminal devices.
  • a network device (101 shown in Figure 1) can communicate wirelessly with the one or more terminal devices (102 and 103 shown in Figure 1).
  • Wireless technology is used to communicate between the network equipment and terminal equipment in Figure 1.
  • a network device sends a signal, it is the sending end, and when the network device receives the signal, it is the receiving end.
  • terminal equipment When the terminal equipment sends a signal, it is the sending end.
  • the terminal equipment When the terminal equipment receives the signal, it is the receiving end.
  • the network device determines to retransmit the information. If it fails, the network device reads the bit sequence of the first length from the circular buffer and sends the bit sequence of the first length to the terminal device.
  • the terminal device is the sender and the network device is the receiver, the information retransmission method corresponds to the above.
  • Polar code also known as Polar code, is a new coding method based on channel polarization. It has a deterministic construction method and is the only one known to be strictly proven to "reach" the channel capacity. Channel coding method. From the perspective of algebraic coding and probability coding, polar codes have their own characteristics.
  • Channel polarization includes channel combination and channel decomposition parts. When the number of combined channels is infinite, a polarization phenomenon will occur: some channels will tend to be noise-free channels, and the other will tend to be full-noise channels. This phenomenon is channel polarization linearity. The transmission rate for a noise-free channel will reach the channel capacity, while the transmission rate for a noisy channel will approach zero. The coding strategy of the Polar code applies the characteristics of this phenomenon, using the noise-free channel to transmit useful information for the user, and the full-noise channel to transmit the agreed information or no information.
  • some channels with a capacity close to 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 sending and receiving ends, which is the polarization coding method.
  • Polar code is a linear block code
  • its encoding matrix also called generating matrix
  • G N its encoding matrix
  • G N is an N ⁇ N matrix, Defined as the kronecker product of log2 N matrices F 2 ,
  • the addition and multiplication operations involved in the above formulas are all addition and multiplication operations on the binary Galois field.
  • the code generated by this method will produce polarization phenomena through the bit-by-bit cancellation (successive cancellation, SC) decoding method. That is, part of the bits in u pass through an equivalent high-reliability channel and will be translated correctly with a high probability, and the remaining bits pass through an equivalent low-reliability channel and will be translated correctly with a low probability. Therefore, people can use high-reliability channels for information transmission, and set the corresponding bits of low-reliability channels to zero (that is, freeze them) and not use them to transmit data, or to transmit data known to both communicating parties.
  • SC bit-by-bit cancellation
  • Figure 2 is a communication link flow chart using Polar code channel coding.
  • the sender uses Polar code to perform channel coding on the source from media access control (MAC), and the receiver sends the demodulated log likelihood ratio (LLR) soft information to Polar decoding device, and then restore the source information and upload it to the MAC.
  • LLR demodulated log likelihood ratio
  • the source of the transmitter When using wireless technology for communication, the source of the transmitter generally needs to be sent on the channel after source coding, channel coding, rate matching and modulation. After receiving the signal, the receiving end undergoes demodulation, rate matching, channel decoding and source decoding to obtain the information sink.
  • Channel coding and decoding is one of the core technologies in the field of wireless communications. Improvements in its performance will directly increase network coverage and user transmission rates. At present, polar codes are a channel coding technology that can be theoretically proven to reach the Shannon limit and have practical linear complexity coding and decoding capabilities.
  • Polar incremental redundancy hybrid automatic repeat request (polar incremental redundancy hybrid automatic repeat request,Polar IR HARQ)
  • hybrid automatic repeat request is a commonly used link adaptation technology.
  • HARQ improves link throughput by combining error correction codes with retransmission mechanisms.
  • HARQ technology is often used to improve communication link throughput.
  • traditional polar codes require that the code length must be a power of 2. Therefore, in the research of polar code HARQ system, a polar coding method is implemented that uses puncture operation to change the polar code length as needed. During polar code decoding, the polar code is punctured. The position is considered to be transmitted through a channel with zero capacity. Based on this idea, the existing technology has designed a rate-adapted punctured polar coding scheme.
  • polar code HARQ solutions are mainly divided into two types: one is a soft merge (chase combine, CC) HARQ solution, and the other is an enhanced redundancy (incremental redundancy, IR) HARQ solution.
  • the transmitter uses a different channel coding for each transmission, and the receiving end combines the newly received signal with all previously received signals, and combines the channel coding schemes used for each transmission, as It is to decode a code with a longer code length and a lower code rate.
  • HARQ retransmission can reduce the bit error rate on the system at a small cost and improve reliability.
  • IR HARQ can not only obtain energy accumulation gain by retransmitting different redundancy versions (RV), but also further reduce the code rate and obtain coding gain through the combination of different redundancy versions, thereby greatly improving decoding performance.
  • RV redundancy versions
  • the Polar IR HARQ retransmission scheme in the prior art often results in greater coding and decoding complexity during the Polar code encoding process, which is not conducive to hardware implementation.
  • this application provides an information retransmission method that can reduce the complexity in the Polar code encoding and decoding process.
  • Figure 3 shows a schematic flow chart of an information retransmission method provided by an embodiment of the present application.
  • Figure 3 includes the following steps.
  • the sending end sends the first bit sequence to the receiving end, where the first bit sequence is the encoded bit sequence transmitted by the sending end to the receiving end for the first time.
  • the polar coding process (also called Polar RV0 coding) during the first transmission (ie, 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 passing through the CRC coding unit is then mapped to a sequence of length N and used as the input of polar coding.
  • the CRC coded bits are mapped to a sequence of length N.
  • the bit sequence is finally obtained through rate matching to obtain the first bit sequence, which is used as the output of Polar RV0 encoding.
  • the detailed process of Polar RV0 encoding is described in Figure 4.
  • the sending end receives first response information from the receiving end, where the first response information is used to determine that the initial transmission failed, that is, the receiving end failed to correctly receive all the information sent by the sending end.
  • the sender will make the first retransmission.
  • the method also includes:
  • the sending end sends the second bit sequence to the receiving end.
  • the second bit sequence is the bit sequence after the polar coding process for the first retransmission.
  • the polar encoding process of the first retransmission (which can also be called Polar RV1 encoding)
  • the detailed encoding process of Polar RV1 encoding is shown in Figure 10.
  • the retransmitted content may be all or part of the content based on different methods, and this application does not limit this.
  • the method shown in Figure 3 also includes:
  • the sending end receives second response information from the receiving end, where the second response information is used to determine that the first retransmission failed.
  • the sending end will retransmit for the second time, that is, the method shown in Figure 3 also includes:
  • the sending end sends the bit sequence of the first length to the receiving end.
  • the sending end reads a bit sequence of the first length from the circular buffer, where 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 during the initial transmission by the sending end in the above-mentioned step S310.
  • the first bit sequence is the bit sequence obtained after rate matching during the initial transmission;
  • the second bit sequence is the bit sequence in the above-mentioned step S330.
  • the second bit sequence is the bit sequence obtained after rate matching in the first retransmission.
  • the third bit sequence is the Polar RV0 encoding process of the sending end in the above step S310.
  • the sending end will retransmit for the third time.
  • the third retransmission method is the same as the second retransmission. .
  • the first length is determined according to its own protocol regulations or indication information, which is not limited in this application.
  • Figure 4 shows a schematic diagram of a polar code encoding method provided by the embodiment of the present application. This method can be executed by the sender.
  • the sender first adds L bits of cyclic redundancy check to the input information bit sequence, as shown in Figure 5:
  • L bits of cyclic redundancy check (cyclic redundancy check, CRC) so that the receiving end can use the CRC-aided successive cancellation list (CRC-aided successive cancellation list, CA-SCL) decoding algorithm to enhance decoding performance, as shown in Figure 5
  • CRC CRC-aided successive cancellation list
  • the valid information in the bit map is called information bits (information bits), and the invalid information is called frozen bits (frozenbits).
  • the frozen bits are fixed values, which can be bit "0" or bit "1". in sequence
  • the reliability of each polarization channel is relatively high and low.
  • polarization channels with high reliability are first prioritized for bit mapping.
  • the metric table for the reliability of the polarized channel can be preset according to the protocol, or the metric table for the reliability of the polarized channel can be indicated through indication information, which is not limited in this application.
  • Figure 7 shows a schematic diagram of Polar code encoding.
  • the polarization coding unit is a sequence of length N Encoded as a sequence through Kronecker product operation
  • the encoding process is as shown in the above formula (1). In order to avoid redundancy, it will not be described again here.
  • the sequence is obtained after polar coding After that, it passes through the rate matching unit, where the rate matching unit punches, truncates or repeats the bit sequence.
  • Figure 8 shows a schematic diagram of bit selection in the rate matching unit in Polar code initial transmission encoding.
  • Bit selection will be the sequence after sub-block interleaving By matching to physical resources through repetition, puncturing or truncation, the bit sequence after rate matching is recorded as: As shown in Figure 8, the bold font indicates duplication, and the part marked by the "X" position indicates that the sequence is punctured or truncated. It should be understood that FIG. 8 is only an illustrative example and does not limit the technical solution in this application.
  • the rate matching unit further includes dividing the bit sequence into m subsequences, and interleaving the m subsequences.
  • the input sequence of sub-block interleaving is: The length is N.
  • the sequence after sub-block interleaving is: The length is N.
  • m is determined according to the length of the encoded bit sequence, where m is not equal to the factor of the length of the bit sequence, and sub-blocks are interleaved on the m sub-sequences determined by the bit sequence.
  • the number of sub-block interleavings is m.
  • the size can be changed and adjusted according to the code length of the encoded bit sequence, and m is not a unique value.
  • m 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.
  • m When m is 5, the bit sequence is divided into 5 subsequences with different numbers of bits. Interleaving these 5 subsequences can effectively interleave and disperse the wrong number of bits, improving the performance of encoding and decoding. , improve the transmission performance of communication links.
  • the subsequences in this application may also be called subblocks, and subsequence interleaving may also be called subblock interleaving.
  • the pseudo code of sub-block interleaving is as follows:
  • N represents the code length
  • m represents the depth of sub-block interleaving
  • n represents the index of the interleaved sequence
  • P(i) represents the interleaving pattern
  • y n represents the bit sequence after sub-block interleaving
  • d J(n) represents The bit sequence of the indexed sub-block before interleaving
  • J(n) represents the index of the sequence before interleaving.
  • the specific parameters in the above-mentioned sub-block interleaving process are not unique. According to the length of the bit sequence or protocol regulations, in different coding and decoding processes, the parameters in the sub-block interleaving can be adaptively changed to improve the ability to resist random interference. It is continuously enhanced with the adjustment of specific parameters.
  • the sequence number of each subsequence is represented by i
  • P(i) represents the corresponding sequence number after sub-block interleaving.
  • the position of i 3.
  • the rate matching unit further includes performing bit interleaving on the sub-block interleaved bit sequence, wherein the bit interleaving performs bit interleaving on bits within one or more sub-sequences.
  • bit interleaving is to spread the possible received errors as much as possible, and bit interleaving is to spread the bit-selected sequence After the interleaver, the output is The output of the interleaver is fed into the modulator for modulation.
  • Bit interleaving usually includes row-column interleaving, triangular interleaving, etc.
  • the present application adopts row-column interleaving in the bit interleaving process.
  • parameter adjustment is more flexible than that of triangular interleaving.
  • FIG. 4 to FIG. 8 exemplarily illustrate the schematic diagram of the Polar code initial transmission encoding method.
  • CRC encoding is performed on the information bits that need to be encoded by Polar code, and then the CRC-encoded sequence is mapped through the bit mapping unit. to bit positions with different reliability, and the bit sequence output by the bit mapping unit is used as the input of the polar coding unit.
  • bit mapping unit is used as the input of the polar coding unit.
  • bit selection and bit interleaving the possible received error sequences are dispersed, thereby improving The performance of information encoding and decoding improves the reliability of transmission links.
  • Figure 9 shows a schematic diagram of an information retransmission method proposed in this application.
  • the coding units in the initial transmission process are reused as much as possible, which not only reduces the complexity, but also improves the performance of Polar code encoding and decoding, effectively ensuring the reliability of the communication link.
  • the method includes the following steps.
  • the sending end determines that the j-th retransmission has failed, and further determines the bit sequence for retransmission.
  • the circular buffer is composed of a first bit sequence, a second bit sequence and a third bit sequence, wherein the first bit sequence is a bit sequence obtained through rate matching during initial transmission, and the second bit sequence is a bit sequence obtained through rate matching during initial transmission.
  • the third bit sequence is a bit sequence composed of bits that were truncated or punctured during the initial transmission.
  • the fourth bit sequence is the bit sequence obtained by polarization encoding of the fifth bit sequence during the first retransmission
  • the fifth bit sequence is the sixth bit sequence obtained through bit mapping during the initial transmission and is re-bit mapped. It is obtained that the order of reliability of the bit position corresponding to the sixth bit sequence and the bit position corresponding to the fifth bit sequence are different.
  • the sending end when reading a bit sequence of the first length from the circular buffer, can determine the starting position of the reading according to different redundancy versions, and the first length of the reading can be based on the protocol stipulations or the information indication. , this application does not limit this.
  • the bit sequence of the first length is sent to the interleaving unit for interleaving operation.
  • the interleaving is sub-block interleaving and/or bit interleaving.
  • the interleaving unit is sub-block interleaving
  • the bit sequence of the first length is first divided into m sub-sequences, and the divided m sub-sequences are interleaved.
  • m is not equal to q
  • q is N factors of the length of the bit sequence of the first length
  • m, q, and N are all positive integers.
  • sub-block interleaving please refer to the above-mentioned specific examples of sub-block interleaving.
  • interleaving unit also includes bit interleaving
  • bits included in one or more subsequences interleaved with m subsequences are bit interleaved.
  • bit interleaving please refer to the above-mentioned bit interleaving in Figures 7 to 8. specific examples.
  • the method shown in Figure 9 also includes:
  • S930 Send the bit sequence of the first length to perform the j+1th retransmission, where j+1 is not greater than the maximum allowed number of retransmissions.
  • the sending end when the sending end determines that the jth retransmission has failed, it directly reads the bit sequence of the first length that needs to be transmitted from the circular buffer and retransmits it, without having to retransmit the bit sequence that needs to be retransmitted.
  • the transmitted information bits are encoded and calculated, which reduces the complexity of hardware implementation and reduces resource overhead.
  • the circular buffer is a bit sequence obtained after rate matching during the initial transmission. After the first retransmission rate matching The obtained bit sequence and initial transmission rate The bit sequence composed of bits that are truncated or punctured during the matching process improves the reliability during information retransmission, ensures the performance of encoding and decoding, and improves the transmission performance.
  • Figure 10 mainly introduces the schematic diagram of the first retransmission encoding method of Polar code proposed by this application.
  • Figures 11 and 12 respectively introduce in detail the bit mapping unit in the first retransmission process of the Polar code and the detailed method schematic diagram of the polar coding unit in the first retransmission process.
  • Figure 10 shows a schematic diagram of the first retransmission encoding method of the Polar code proposed in this application.
  • the method includes: first performing CRC encoding on the information bit sequence, and adding a cyclic redundancy check CRC to the bit sequence as the input of the bit mapping unit.
  • the bit mapping unit is divided into two bit mappings.
  • the bit mapping unit in the initial transmission also called RV0 bit mapping unit
  • the bit mapping unit in the first retransmission is passed.
  • Mapping unit (can also be called RV1 bit mapping unit), as shown in Figure 10, the bit sequence output by the RV0 bit mapping unit is the sixth bit sequence, and the sixth bit sequence is used as the input of the RV1 bit mapping unit to perform the third Secondary bit mapping, the output bit sequence is the fifth bit sequence.
  • the order of reliability of the bit positions corresponding to the bit sequence obtained by the RV1 bit mapping unit and the bit positions corresponding to the bit sequence obtained by the RV0 bit mapping unit are different.
  • RV0 bit mapping in the sequence , the reliability of the polarized channel corresponding to each bit is relatively high and low. The receiving end is more likely to make errors when decoding the bits transmitted on the polarized channel with low reliability.
  • RV1 bit mapping is to map bits mapped to low-reliability positions in the RV0 bit mapping process to high-reliability positions in the RV1 bit sequence, so that the receiving end can use retransmission bit enhanced decoding.
  • the bit sequence with low reliability of the bit position of the RV0 bit mapping is mapped to the RV1 bit (RV1 bit mapping as shown in FIG. 11).
  • RV1 bit mapping the bit position corresponding to the RV1 bit sequence is mapped to a highly reliable bit position.
  • the bits obtained after RV0 bit mapping are the sixth bit sequence.
  • the sixth bit sequence contains P bits.
  • the P bits correspond to P bit positions.
  • the P bit positions contain k second bit positions. positions, where the reliability of the k second positions is no higher than the reliability of the remaining P-k bit positions.
  • the fifth bit sequence is obtained.
  • the fifth bit sequence contains P bits.
  • the P bits correspond to P bit positions.
  • the P bit positions include K first positions.
  • the K first positions are The reliability of the position is no less than the reliability of the remaining P-K bit positions.
  • 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.
  • K k+L
  • L represents the number of cyclic redundancy check CRC bits during RV1 bit mapping.
  • the available physical resource for the first retransmission of Polar code is E rv1 bits
  • the expected code rate is: R rv1
  • R rv1 satisfies
  • the number of retransmitted bits at this time is:
  • L rv1 represents the CRC bits added to the payload of k rv1 bits when RV1 retransmits.
  • the expected code rate R rv1 can be obtained based on simulation or empirical values, which is not limited in this application.
  • k rv1 bits with the lowest reliability are selected from the bit-mapped sequence of RV0. And after adding the L rv1 bit CRC, map to the sequence Among them, the K rv1 position with the highest reliability will be Enter the encoder with the same code length as RV0, and the encoded sequence is recorded as:
  • the fifth bit sequence output by the bit mapping unit will be input to the polarization coding unit.
  • the polar coding unit includes a polar coding unit during the initial transmission of multiplexing (which may be called an RV0 polar coding unit).
  • the polar coding unit also includes a polar coding unit of the first retransmission (which may be called an RV1 polar coding unit).
  • the polarization coding unit when the polarization coding unit only includes the RV0 polarization coding unit, the fifth bit sequence obtained through the bit mapping unit is directly used as the input of the RV0 polarization coding unit, and the polarity in the initial transmission is multiplexed. coding unit.
  • the bit sequence obtained through the polar coding unit (which may be called the fourth bit sequence) is used as the input bit sequence of the rate matching unit.
  • the fourth bit sequence is a fifth bit sequence that passes through the RV0 polar coding unit and the RV1 polar coding unit.
  • the resulting bit sequence the RV1 polarization coding unit performs an XOR operation on the bit sequence after the fifth bit sequence passes through the RV0 polarization coding unit and the bit sequence after the sixth bit sequence passes through the RV0 polarization coding unit.
  • the fourth bit sequence serves as the input bit sequence of the rate matching unit.
  • bit sequence after polarization coding represents the bit sequence after RV0 polarization encoding during the first retransmission
  • ⁇ u4,u5,u6,u7 ⁇ represents the bit sequence after RV0 during the initial transmission
  • the bit sequence after polarization coding, the bit sequence ⁇ u0,u1,u2,u3 ⁇ and the bit sequence ⁇ u4,u5,u6,u7 ⁇ are obtained by the XOR operation of the RV1 polarization coding unit as shown in Figure 10.
  • ⁇ d0,d1,d2,d3,d4,d5,d6,d7 ⁇ where the bit sequence ⁇ d0,d1,d2,d3 ⁇ is used as the input of rate matching.
  • the bit sequence output by RV0 polarization encoding is: In the first retransmission, the bit sequence from the RV0 polarization encoding is: Then the sequence sent by RV1 for rate matching is: The "+" operation represents the XOR operation.
  • the fourth bit sequence obtained by the polar coding unit is used as the input of the rate matching unit.
  • the rate matching unit multiplexes the rate matching unit when the Polar code is first transmitted. unit (i.e. RV0 rate matching unit), try to reuse the calculation unit during the initial transmission, reduce the complexity of hardware implementation, reduce resource overhead, and ensure transmission performance.
  • FIG. 10 to 12 mainly introduce the schematic diagram of the method in the first retransmission process of the Polar code proposed by this application.
  • the transmission performance is improved through RV0 bit mapping and RV1 bit mapping.
  • the polar coding unit and rate matching unit reuse the calculation units from the initial transmission as much as possible without introducing new calculation units, reducing the complexity of the system and saving resource overhead.
  • the sending end determines that after the first retransmission fails, reads the 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 second retransmission.
  • the circular buffer is composed of the first bit sequence after rate matching during the initial transmission, the second bit sequence after rate matching during the first retransmission, and the bits that have been truncated or punctured during the initial transmission. bit sequence (called the third bit sequence).
  • the sending end When the sending end reads the 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 different redundancy versions of Polar IR HARQ, and then determines the starting position of the bit sequence of the first length according to its own protocol or a certain indication information, or determine the length of the read bit sequence according to other methods, which is not limited by this application.
  • FIG. 13 shows a schematic diagram of different redundancy versions of Polar IR HARQ.
  • RV0_PS represents a bit sequence composed of truncated or punctured bits during initial transmission (i.e., the third bit sequence).
  • the length is: max(NE rv0,0 ), and RV0 represents the first bit sequence.
  • RV1 represents the second bit sequence. Then the sequence of the circular buffer composed of the first bit sequence, the second bit sequence and the third bit sequence is:
  • the sending end cyclically reads the corresponding bit sequence (that is, the bit sequence of the first length) from the circular buffer according to the available physical resources.
  • the sending end When the sending end reads the bit sequence of the first length from the circular buffer, it determines the starting position according to different redundant versions.
  • Table 2 shows the starting positions of different redundant versions of the Polar code, as shown in Table 2 , the starting position of RV0 is 0, the starting position of RV1 is E rv0 , the starting position of RV2 is E rv0 +E rv1 , and the starting position of RV3 is E rv0 .
  • the sending end when the sending end determines that the j-th retransmission fails, the sending end reads the 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+1th retransmission.
  • j+1 is not greater than the maximum number of retransmissions allowed.
  • the sending end no longer performs the above operations.
  • the information retransmission method proposed by this application is that when the previous retransmission fails, the sending end reads the bit sequence of the appropriate length from the circular buffer as the current retransmission. bit sequence.
  • the information retransmission method provided by this application simplifies the calculation during the retransmission process and reduces the complexity of coding and decoding.
  • energy gain and coding gain can be obtained, This further improves the decoding performance of Polar codes and effectively ensures the reliability of communication links.
  • Figure 14 is a schematic block diagram of a communication device 1400 provided by this application.
  • the device 1400 includes a processing unit 1410 and a transceiver unit 1420, where the transceiver unit 1420 may also be called a communication interface or a communication unit.
  • the processing unit 1410 is used to determine that the j-th retransmission fails
  • the processing unit 1410 is also used to read a bit sequence of a first length from a circular buffer.
  • the circular buffer is composed of a first bit sequence, a second bit sequence and a third bit sequence.
  • the first bit sequence is The bit sequence obtained through rate matching during the initial transmission
  • the second bit sequence is the bit sequence obtained through rate matching for the fourth bit sequence during the first retransmission
  • the third bit sequence is the information bit sequence initially transmitted
  • a bit sequence composed of truncated or punctured bits wherein the fourth bit sequence is the bit sequence obtained by polarization encoding of the fifth bit sequence during the first retransmission
  • the fifth bit sequence is the initial transmission
  • the sixth bit sequence obtained through bit mapping is obtained by re-bit mapping, and 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 transceiving unit 1420 is configured to send the bit sequence of the first length determined by the processing unit 1410.
  • the processing unit 1410 is also configured to process data according to the above-mentioned first bit sequence, second bit sequence and third bit sequence.
  • the bit sequence determines the starting position of the read; it is also used to read the first length of the bit sequence from the circular buffer through the starting position.
  • the processing unit 1410 is also configured to determine m subsequences based on the bit sequence of the first length; interleave the m subsequences, m is not equal to q, and q is a factor of the length N of the bit sequence of the first length, m ,q,N are all positive integers;
  • the transceiver unit is also configured to send the interleaved bit sequence of the first length.
  • the processing unit is also configured to: perform bit interleaving on bits contained in one or more subsequences in the m subsequences.
  • the fourth bit sequence is a bit sequence obtained by performing an XOR operation on the bit sequence obtained by polar coding of the fifth bit sequence and the bit sequence obtained by polar coding of the sixth bit sequence.
  • the fifth bit sequence includes P bits
  • the sixth bit sequence includes P bits
  • the P bits correspond to P bit positions
  • the P bit positions in the fifth bit sequence include K
  • the first position, the reliability of the K first positions is not lower than the reliability of the remaining P-K bit positions
  • the P bit positions in the sixth bit sequence include k second positions, the kth The reliability of the second position is not higher than the reliability of the remaining P-k bit positions.
  • the fifth bit sequence is obtained by re-bit mapping the sixth bit sequence obtained through bit mapping during the initial transmission, including: the sixth bit sequence
  • the processing unit 1410 may be a processor, a chip or an integrated circuit. This application is not limited to this.
  • the communication device 1400 provided by this application is used to implement the information retransmission method in the above method embodiment.
  • part or all of the processes in Figures 9 to 13 can be implemented by hardware, or can also be implemented by software.
  • the above-mentioned processing unit 1410 may be a processor.
  • Figure 15 is a schematic structural diagram of the terminal device 1500 provided by this application.
  • the terminal device 1500 includes: one or more processors 1510 , one or more memories 1520 , and one or more transceivers 1530 .
  • the processor 1510 is used to control the transceiver 1530 to send and receive signals.
  • the memory 1520 is used to store a computer program.
  • the processor 1510 is used to call and run the computer program from the memory 1520 to perform the information retransmission method provided by this application.
  • Figure 9 to The corresponding process in Figure 13. For the sake of brevity, no further details will be given here.
  • the terminal device 1500 may be the terminal device 102 or 103 in the wireless communication system shown in FIG. 1 .
  • the processor 1510 may correspond to the processing unit 1410 in FIG. 14
  • the transceiver 1530 may correspond to the transceiver unit 1420 shown in FIG. 14 .
  • the present application provides a computer-readable storage medium.
  • the computer-readable storage medium stores computer instructions.
  • the computer instructions When the computer instructions are run on the computer, the computer is caused to execute the information retransmission method provided by the embodiment of the application.
  • Figure 9 to the corresponding operations and/or processes in Figure 13.
  • the computer program product includes a computer program code.
  • the computer program code When the computer program code is run on a computer, it causes the computer to execute the information retransmission method provided by the embodiment of the application in Figures 9 to 13. corresponding operations and/or processes.
  • This application also provides a chip including a processor.
  • the processor is configured to read and execute the computer program stored in the memory to perform corresponding operations and/or processes in Figures 9 to 13 of the information retransmission method provided by this application.
  • the chip further includes a memory, and the memory and the processor are connected to the memory through circuits or wires.
  • the chip also includes a communication interface, and the processor is connected to the communication interface.
  • the communication interface is used to receive the bit sequence to be encoded.
  • the processor obtains the information bit sequence from the communication interface, and uses the information retransmission method provided by the embodiment of the present application to read the bit sequence of the first length from the circular buffer for retransmission. Transmit; the communication interface outputs a bit sequence of the first length.
  • the communication interface may be an input-output interface.
  • This application provides a computer-readable storage medium.
  • Computer instructions are stored in the computer-readable storage medium. When the computer instructions are run on a computer, they cause the computer to execute the corresponding steps in Figures 9 to 13 provided by the embodiments of this application. operations and/or processes.
  • the computer program product includes computer program code.
  • the computer program code When the computer program code is run on a computer, it causes the computer to perform the corresponding operations and/or operations in Figures 9 to 13 provided by the embodiments of this application. or process.
  • This application also provides a chip including a processor.
  • the processor is configured to read and execute the computer program stored in the memory to perform the corresponding operations and/or processes in Figures 9 to 13 provided by the embodiments of the present application.
  • the chip further includes a memory, and the memory and the processor are connected to the memory through circuits or wires. Further optionally, the chip also includes a communication interface, and the processor is connected to the communication interface. The communication interface is configured to send a bit sequence of a first length determined by the processor from the circular buffer. The communication interface may be an input-output interface.
  • each step of the above method can be completed by instructions in the form of hardware integrated logic circuits or software in the processor. The steps of the above method embodiments may be directly implemented by a hardware processor, or may be executed by a combination of hardware and software modules in the processor.
  • the software module can be located in random access memory, flash memory, read-only memory, programmable read-only memory or electrically erasable programmable memory, registers and other mature storage media in this field.
  • the storage medium is located in the memory, and the processor reads the information in the memory and completes the steps of the above method in combination with its hardware.
  • the memory in the embodiment of the present application may be a volatile memory or a non-volatile memory, or may include both volatile and non-volatile memories.
  • non-volatile memory can be read-only memory (ROM), programmable ROM (PROM), erasable programmable read-only memory (erasable PROM, EPROM), electrically removable memory. Erase electrically programmable read-only memory (EPROM, EEPROM) or flash memory.
  • Volatile memory can be random access memory (RAM), which is used as an external cache.
  • RAM static random access memory
  • DRAM dynamic random access memory
  • SDRAM synchronous dynamic random access memory
  • double data rate SDRAM double data rate SDRAM
  • DDR SDRAM double data rate SDRAM
  • ESDRAM enhanced synchronous dynamic random access memory
  • SLDRAM synchronous link dynamic random access memory
  • direct rambus RAM direct rambus RAM
  • the disclosed systems, devices and methods can be implemented in other ways.
  • the device embodiments described above are only illustrative.
  • the division of the units is only a logical function division. In actual implementation, there may be other division methods.
  • multiple units or components may be combined or can be integrated into another system, or some features can be ignored, or not implemented.
  • the coupling or direct coupling or communication connection between each other shown or discussed may be through some interfaces, and the indirect coupling or communication connection of the devices or units may be in electrical, mechanical or other forms.
  • the units described as separate components may or may not be physically separated, and the components shown as units may or may not be physical units, that is, they may be located in one place, or they may be distributed to multiple network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of this embodiment.
  • each functional unit in each embodiment of the present application can be integrated into one processing unit, each unit can exist physically alone, or two or more units can be integrated into one unit.
  • the functions are implemented in the form of software functional units and sold or used as independent products, they can be stored in a computer-readable storage medium.
  • the technical solution of the present application is essentially or the part that contributes to the existing technology or the part of the technical solution can be embodied in the form of a software product.
  • the computer software product is stored in a storage medium, including Several instructions are used to cause a computer device (which may be a personal computer, a server, or a network device, etc.) to execute all or part of the steps of the methods described in various embodiments of this application.
  • the aforementioned storage media include: U disk, mobile hard disk, read-only memory (ROM), random access memory (Random Access Memory, RAM), magnetic disk or optical disk and other media that can store program code. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)

Abstract

本申请实施例提供了一种信息的重传方法和通信装置。该方法包括：在确定第j次重传失败的情况下，从循环缓冲区中读取第一长度的比特序列，并发送该第一长度的比特序列。其中，该循环缓冲区由第一比特序列，第二比特序列和第三比特序列组成。该第一比特序列为初传时经过速率匹配获得的比特序列，该第二比特序列为第一次重传时对第四比特序列经过速率匹配后获得的比特序列，该第三比特序列为初传时被截短或打孔的比特组成的比特序列。本申请提供的信息的重传方法能够在极化码重传的过程中，不仅降低了编译码的复杂度，而且有效地保障了通信链路的可靠性。

Description

一种信息的重传方法和通信装置
本申请要求于2022年05月23日提交中国专利局、申请号为202210560446.4、申请名称为“一种信息的重传方法和通信装置”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请实施例涉及通信领域，并且更具体地，涉及一种信息的重传方法和通信装置。
背景技术
在通信系统中，通常采用信道编码提高数据传输的可靠性，以保证通信的质量。极化码(Polar code)是一种线性块码，在理论上已证明，Polar码为目前唯一可以取得香农极限的，且具有低编译码复杂度的编码方式。
在Polar码的编码过程中，现有技术中采用传统的增量冗余(incremental redundancy，IR)的混合自动重传请求(hybrid automatic repeat request，HARQ)技术编码的过程中，通过重传不同的冗余版本(redundancy version，RV)获得能量的累加增益，而且在IR HARQ重传过程中，传统的技术方案会导致编码矩阵不规则，编译码复杂度呈指数级增加。
发明内容
本申请实施例提供一种信息的重传方法，能够在信息重传的过程中，降低编译码的复杂度。
第一方面，提供了一种信息的重传方法，该方法包括：确定第j次重传失败；
从循环缓冲区读取第一长度的比特序列，该循环缓冲区由第一比特序列，第二比特序列和第三比特序列组成，该第一比特序列为初传时经过速率匹配获得的比特序列，该第二比特序列为第一次重传时对第四比特序列经过速率匹配后获得的比特序列，该第三比特序列为信息比特序列初传时被截短或打孔的比特组成的比特序列，其中，该第四比特序列为第一次重传时第五比特序列极化编码获得的比特序列，该第五比特序列为初传时经过比特映射获得的第六比特序列重新进行比特映射获得的，该第六比特序列对应的比特位置和该第五比特序列对应的比特位置的可靠性的排序不同；发送该第一长度的比特序列，以执行第j+1次重传，其中，j+1小于允许的最大重传次数，j为正整数。
根据本申请提供的一种信息的重传方法，发送端确定上一次重传失败，从循环缓冲区中确定第一长度的比特序列做出重传序列，其中该循环缓冲区由初传时经过速率匹配后的比特序列，第一次重传过程中信息比特序列经过两次比特映射之后，再进行极化编码，速率匹配后得到的比特序列，以及初传时比特序列被截短或者打孔的比特组成的比特序列。发送端不用再依次对信息比特进行比特选择，极化编码，速率匹配等计算单元，直接从循环缓冲区中读取第一长度的比特序列发送，简化了重传的过程中的计算，可以降低编译码 的复杂度。
另外，通过本申请提供的信息的重传方法，可以获得能量的增益和编码增益，进而提升Polar码的译码性能，有效保障通信链路的可靠性。
需要说明的是，本申请中的初传和重传是针对同一信息比特序列而言。其中，重传的信息比特序列可能与初传的信息比特序列相同，或者，重传的信息比特序列是初传的信息比特序列中的一部分。
结合第一方面，在第一方面的某些实现方式中，从循环缓冲区读取第一长度的比特序列，包括：根据该第一比特序列，该第二比特序列以及该第三比特序列确定读取位置；根据该读取位置从该循环缓冲区读取该第一长度的比特序列。
基于上述方案，根据循环缓冲区中不同的冗余版本，确定读取第一长度的比特序列的起始位置，能够提高重传的准确度，提高译码性能，保证通信链路的可靠性。
结合第一方面，在第一方面的某些实现方式中，该方法还包括：将该第一长度的比特序列划分为m个子序列；对该m个子序列进行交织，获得交织后的m个子序列，m不等于q，q为该第一长度的比特序列长度N的因数，m，q，N均为正整数；发送该第一长度的比特序列，包括：发送交织后的该第一长度的比特序列。
基于上述方案，从循环缓冲区中读取第一长度的比特序列，根据可用的物理资源，将读取的相应的比特序列送入交织单元，将第一长度的比特序列划分为m个子序列，对划分完成后的m个子序列进行交织，其中m不为该第一长度的比特序列长度的因数，使得交织的过程更为充分，进而提高了译码性能。
结合第一方面，在第一方面的某些实现方式中，对该m个子序列中的一个或多个子序列所包含的比特进行比特交织。
基于上述方案，对交织后的m子块再进行比特交织，对m个子序列中的一个或多个子序列中所包含的比特进行交织，比特交织相较于子块交织更为充分，离散并纠正突发性的差错，提高编码性能，改善通信的传输特性。
结合第一方面，在第一方面的某些实现方式中，该第四比特序列为该第五比特序列经过极化编码获得比特序列和该第六比特序列经过极化编码获得比特序列进行异或运算获得的比特序列。
基于上述方案，循环缓冲区中的第二比特序列作为第一次重传过程中对第四比特序列进行速率匹配之后的比特序列，其中，该第四比特序列为初传时经过极化编码后的比特序列和第一次重传时经过极化编码后的比特序列进行异或运算得到的比特序列。
结合第一方面，在第一方面的某些实现方式中，该第五比特序列包含P个比特，该第六比特序列包含P个比特，该P个比特对应P个比特位置，该第五比特序列中的该P个比特位置中包含K个第一位置，该K个第一位置的可靠性不低于剩余的P-K个比特位置的可靠性，该第六比特序列中的该P个比特位置中包含k个第二位置，该k个第二位置的可靠性不高于剩余的P-k个比特位置的可靠性，该第五比特序列是对初传时经过比特映射获得的该第六比特序列重新进行比特映射获得的，包括:该第六比特序列中位于该k个第二位置上的比特，被映射至该第五比特序列对应的该K个第一位置上，其中，该K＝k+L，该L为第一次重传时的循环冗余校验CRC比特的个数。
基于上述方案，在Polar码第一重传的过程，信息比特序列经过两个比特映射，首先 是通过初传时的比特映射，将初传时比特映射到可靠性相较于其他比特位置较低的比特序列，进行第二次比特映射。其中该第二次比特映射将被映射的比特映射至可靠性不低于其他比特位置上。从而有效保证了编译码的性能，提高传输性能。
第二方面，提供了一种信息的重传装置，该装置具有实现上述第一方面及其任意可能的实现方式中的方法的功能。该功能可以通过硬件实现，也可以通过硬件执行相应的软件实现，该硬件或者软件包括一个或多个与上述功能相应的单元。
在一种可能的设计中，当该功能的部分或全部通过硬件实现时，该装置包括：处理单元，用于确定第j次重传失败；该处理单元，还用于从循环缓冲区读取第一长度的比特序列，该循环缓冲区由第一比特序列，第二比特序列和第三比特序列组成，该第一比特序列为初传时经过速率匹配获得的比特序列，该第二比特序列为第一次重传时对第四比特序列经过速率匹配后获得的比特序列，该第三比特序列为信息比特序列初传时被截短或打孔的比特组成的比特序列，其中，该第四比特序列为第一次重传时第五比特序列极化编码获得的比特序列，该第五比特序列为初传时经过比特映射获得的第六比特序列重新进行比特映射获得的，该第六比特序列对应的比特位置和该第五比特序列对应的比特位置的可靠性的排序不同；收发单元，用于发送该第一长度的比特序列，以执行第j+1次重传，其中，j+1小于允许的最大重传次数，j为正整数。
在具体实现时，该重传装置可以是芯片或者集成电路。
在一种可能实现的设计中，从循环缓冲区读取第一长度的比特序列，该处理单元，还用于根据该第一比特序列，该第二比特序列以及该第三比特序列确定读取位置；该处理单元，还用于根据该读取位置从该循环缓冲区读取该第一长度的比特序列。
在一种可能的实现的设计中，该处理单元还用于：根据该第一长度的比特序列确定m个子序列；对该m个子序列进行交织，m不等于q，q为该第一长度的比特序列长度N的因数，m,q,N均为正整数；该收发单元，还用于发送交织后的该第一长度的比特序列。
在一种可能的实现的设计中，该处理单元还用于：对该m个子序列中的一个或多个子序列所包含的比特进行比特交织。
在一种可能实现的设计中，该第四比特序列为该第五比特序列经过极化编码获得比特序列和该第六比特序列经过极化编码获得比特序列进行异或运算获得的比特序列。
在一种可能实现的设计中，该第五比特序列包含P个比特，该第六比特序列包含P个比特，该P个比特对应P个比特位置，该第五比特序列中的该P个比特位置中包含K个第一位置，该K个第一位置的可靠性不低于剩余的P-K个比特位置的可靠性，该第六比特序列中的该P个比特位置中包含k个第二位置，该k个第二位置的可靠性不高于剩余的P-k个比特位置的可靠性，该第五比特序列是对初传时经过比特映射获得的该第六比特序列重新进行比特映射获得的，包括:该第六比特序列中位于该k个第二位置上的比特，被映射至该第五比特序列对应的该K个第一位置上，其中，该K＝k+L，该L为第一次重传时的循环冗余校验CRC比特的个数。
在一种可能的设计中，该功能的部分或全部通过软件实现时，该信息的重传装置包括：存储器，用于存储计算机程序；处理器，用于执行存储器中存储的计算机程序，当该计算机程序被执行时，该编码装置可以实现如上述第一方面和第一方面的任一种可能的设计中该的信息的重传方法。
可选地，存储器可以是物理上独立的单元，也可以与处理器集成在一起。
在一种可能的设计中，当所属功能的部分或全部通过软件实现时，该信息的重传装置仅包括处理器。用于存储程序的存储器位于信息的重传装置之外，处理器通过电路/电线与存储器连接，用于读取并运行存储器中存储的程序，以执行上述第一方面和第一方面的任一可能的实现方式中的信息的重传方法。
第三方面，本申请提供一种通信设备，该通信设备可以是网络设备或者终端设备，其中，该通信设备包括收发器、处理器和存储器。处理器用于控制收发器收发信号，存储器用于存储计算机程序，处理器用于调用并运行存储器中存储的计算机程序，使得网络设备执行第一方面中任意可能的实现方式中的方法。
具体地，在网络设备作为信息和/或数据的发送端时，网络设备执行上述第一方面及其任意可能的实现方式中的信息的重传方法，对需要发送的信息和/或数据进行重传。在终端设备作为信息和/或数据的接收端时，终端设备以执行上述第一方面和第一方面的任一可能的实现方式中的信息的重传方法。
第四方面，本申请提供一种计算机可读存储介质，该计算机可读存储介质中存储有指令，当其在计算机上运行时，使得计算机执行第一方面或第一方面的任意可能的实现方式中的方法。
第五方面，本申请提供一种计算机程序产品，该计算机程序产品包括计算机程序代码，当计算机程序代码在计算机上运行时，使得计算机执行上述第一方面及其任意一种可能的实现方式中的方法。
第六方面，本申请提供一种芯片，包括处理器。处理器用于读取并执行存储器中存储的计算机程序，以执行上述第一方面或第一方面任意可能的实现方式中的方法。可选地，该芯片还包括存储器，该存储器与该处理器通过电路或电线与存储器连接。
进一步可选地，该芯片还包括通信接口，处理器与该通信接口连接。通信接口用于接收待编码的比特序列，处理器从通信接口获取该信息比特序列，并采用第一方面描述的信息的重传方法，对该信息比特序列进行重传；通信接口输出编码后的比特序列。该通信接口可以是输入输出接口。
附图说明
图1示出了本申请实施例提供的无线通信系统100的架构图。
图2示出了Polar码信道编码的通信链路流程图。
图3示出了本申请实施例提供的一种信息的重传方法的示意性流程图。
图4示出了本申请实施例提供的一种极化码编码方法的示意图。
图5示出了本申请实施例提供的另一种极化码编码方法的示意图。
图6示出了本申请实施例提供的另一种极化码编码方法的示意图。
图7示出了本申请实施例提供的另一种极化码编码方法的示意图。
图8示出了本申请实施例提供的另一种极化码编码方法的示意图。
图9示出了本申请提供的一种信息的重传方法的示意图。
图10示出了本申请实施例提供的一种极化码第一次重传编码的方法示意图。
图11示出了本申请实施例提供的另一种极化码第一次重传编码的方法示意图。
图12示出了本申请实施例提供的另一种极化码第一次重传编码的方法示意图。
图13示出了本申请实施例提供的一种Polar IR HARQ冗余版本示意图。
图14示出了本申请实施例提供的通信装置1400的示意性结构图。
图15示出了本申请实施例提供的终端设备1500的示意性结构图。
具体实施方式
下面将结合附图，对本申请实施例中的技术方案进行描述。
本申请实施例的技术方案可以应用于各种通信系统，例如：全球移动通讯(Global System of Mobile communication，GSM)系统、码分多址(Code Division Multiple Access，CDMA)系统、宽带码分多址(Wideband Code Division Multiple Access，WCDMA)系统、通用分组无线业务(General Packet Radio Service，GPRS)、长期演进(Long Term Evolution，LTE)系统、LTE频分双工(Frequency Division Duplex，FDD)系统、LTE时分双工(Time Division Duplex，TDD)、通用移动通信系统(Universal Mobile Telecommunication System，UMTS)、全球互联微波接入(Worldwide Interoperability for Microwave Access，WiMAX)通信系统、未来的第五代(5th Generation，5G)系统或新无线(New Radio，NR)等。
本申请实施例中的终端设备可以指用户设备、接入终端、用户单元、用户站、移动站、移动台、远方站、远程终端、移动设备、用户终端、终端、无线通信设备、用户代理或用户装置。终端设备还可以是蜂窝电话、无绳电话、会话启动协议(Session Initiation Protocol，SIP)电话、无线本地环路(Wireless Local Loop，WLL)站、个人数字处理(Personal Digital Assistant，PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备，未来5G网络中的终端设备或者未来演进的公用陆地移动通信网络(Public Land Mobile Network，PLMN)中的终端设备等，本申请实施例对此并不限定。
本申请实施例中的网络设备可以是用于与终端设备通信的设备，该网络设备可以是全球移动通讯(Global System of Mobile communication，GSM)系统或码分多址(Code Division Multiple Access，CDMA)中的基站(Base Transceiver Station，BTS)，也可以是宽带码分多址(Wideband Code Division Multiple Access，WCDMA)系统中的基站(NodeB，NB)，还可以是LTE系统中的演进型基站(Evolutional NodeB，eNB或eNodeB)，还可以是云无线接入网络(Cloud Radio Access Network，CRAN)场景下的无线控制器，或者该网络设备可以为中继站、接入点、车载设备、可穿戴设备以及未来5G网络中的网络设备或者未来演进的PLMN网络中的网络设备等，本申请实施例并不限定。
参见图1，图1是适用于本申请实施例的无线通信系统100的架构图。如图1所示。无线通信系统100中可以包括至少一个网络设备、一个或多个终端设备。网络设备(如图1中所示的101)可以与该一个或多个终端设备(如图1中所示的102和103)进行无线通信。
图1中的网络设备与终端设备之间采用无线技术进行通信。当网络设备发送信号时，其为发送端，当网络设备接收信号时，其为接收端。终端设备也是一样的，当终端设备发送信号时，其为发送端，当终端设备接收信号时，其为接收端。
作为一种示例，当网络设备为发送端，终端设备为接收端时，网络设备确定信息重传 失败，网络设备从循环缓冲区中读取第一长度的比特序列，并向终端设备发送该第一长度的比特序列。当终端设备为发送端，网络设备为接收端时，信息的重传方法与上述相应。
为了便于理解本申请实施例，需要说明的是：
1.极化码
极化码也称为Polar码，是基于信道极化所给出的一种新的编码方式，具有确定性的构造方法，并且是已知的唯一一种被严格证明“达到”信道容量的信道编码方法。从代数编码和概率编码的角度来说，极化码具备了两者各自的特点。
Polar码的理论基础就是信道极化。信道极化包括信道组合和信道分解部分。当组合信道的数目区域无穷大时，则会出现极化现象：一部分信道将趋于无噪信道，另一部分则趋于全噪信道，这种现象就是信道极化线性。无噪信道的传输速率将会达到信道容量，而全噪信道的传输速率趋于零。Polar码的编码策略正是应用了这种现象的特性，利用无噪信道传输用户有用的信息，全噪信道传输约定的信息或者不传信息。
在信道极化完成之后，容量趋于1的部分信道可以用于承载信息比特，而其余信道可以用来承载收发端均一致的冻结比特，即为极化编码的方法。
其中，Polar码是一种线性块码，其编码矩阵(也称为生成矩阵)为GN，编码过程可以由下式表示：
其中，是一个二进制的行矢量(也即，信息比特序列)，长度为N，且N＝2n，n为正整数。GN是一个N×N的矩阵，定义为log2N个矩阵F2的克罗内克(kronecker)乘积，以上各式中涉及的加法、乘法操作均为二进制伽罗华域上的加法、乘法操作。
通过该方法生成的编码，通过逐比特消除(successive cancellation,SC)译码方法，会产生极化现象。即，u中的一部分比特经过一个等效的高可靠信道并以高概率会被译对，剩下的比特经过一个等效的低可靠度信道并以低概率被译对。由此，人们可以将高可靠信道用于信息传输，而将低可靠度信道对应的比特置零(也即，冻结)，不用于传输数据，或者传输通信双方已知的数据。
另外，图2是采用Polar码信道编码的通信链路流程图。发送端对来自媒体接入控制(media access control，MAC)的信源采用Polar码进行信道编码，接收端将解调的对数似然比(log likelihood ratio，LLR)软信息送入Polar译码器中，进而恢复出信源信息，上传至MAC。具体Polar码编码流程请参见图3中所示，为了避免冗余，此处不再赘述。
在采用无线技术进行通信时，发送端的信源一般要经过信源编码、信道编码、速率匹配和调制后在信道上发出。接收端收到信号后依次经过解调、解速率匹配、信道解码和信源解码后获得信宿。
信道编解码是无线通信领域的核心技术之一，其性能的改进将直接提升网络覆盖及用户传输速率。目前，极化码(polar codes)是可理论证明达到香农极限，并且具有可实用的线性复杂度编译码能力的信道编码技术。
2.极化码混合自动重传请求(polar incremental redundancy hybrid automatic repeat  request,Polar IR HARQ)
在对系统延时不敏感通信应用中，混合自动重传请求(hybrid automatic repeat request,HARQ)是一种常用的链路自适应技术。HARQ通过将纠错码与重传机制相结合，以提高链路吞吐率。一些现有的通信系统中，往往采用HARQ技术来提高通信链路吞吐率。然而，传统的极化码都要求码长必须为2的幂次。因此在极化码HARQ系统的研究中，实现了一种通过凿孔操作来使极化码码长根据需要改变的极化编码方法，在极化码译码时，将极化码凿孔的位置视作是传输时通过了一个容量为零的信道。基于这种思路，现有技术设计了一种速率适配的凿孔极化编码方案，目前以该速率匹配极化码为基础，已有两种极化码的HARQ方案，按照发送端在每次发送比特序列时，是否采用相同的信道编码来区分。其中，极化码的HARQ方案主要分为两种：一种为软合并(chase combine，CC)的HARQ的方案，另一种为增强冗余(incremental redundancy，IR)的HARQ的方案。
在IR HARQ方案中发送端每次发送均采用不同的信道编码，接收端则将新接收的信号与之前所有接收到的信号组合起来，并将各次传输所用的信道编码方案组合起来，视为是对一个码长更长、码率更低的码进行译码。
HARQ重传可以以较小的代价降低系统上的误码率，提升可靠度。其中，IR HARQ不仅可以通过重传不同的冗余版本(redundancy version,RV)获得能量累加增益，而且通过不同冗余版本的组合可以进一步地降低码率，获得编码增益，从而大大提升译码性能。但是现有技术中的Polar IR HARQ重传方案中往往会导致在Polar码编码过程中，编译码复杂度较大，不利于硬件的实现。
为此，本申请提供了一种信息的重传方法，可以降低Polar码编译码过程中的复杂度。
如图3所示，图3示出了本申请实施例提供的一种信息的重传方法的示意性流程图。图3包括如下步骤。
S310，发送端向接收端发送第一比特序列，其中第一比特序列是发送端向接收端第一次传输编码后的比特序列。
具体地，在第一次传输时(即，初传)的极化编码流程中(也可以称为Polar RV0编码)，包括CRC编码，比特映射，极化编码和速率匹配四个单元。信息比特序列首先通过CRC编码单元，经过CRC编码单元后的比特序列再通过比特映射，将CRC编码后的比特映射到一个长度为N的序列上并作为极化编码的输入，经过极化编码后的比特序列最后通过速率匹配得到第一比特序列，该第一比特序列作为Polar RV0编码的输出。Polar RV0编码的详细流程请参见图4所述。
S320，发送端接收来自接收端的第一响应信息，其中该第一响应信息用于确定初传失败，即接收端未能正确的接收到发送端发送的全部信息。发送端将进行第一次重传。如图3所示，该方法还包括：
S330，发送端向接收端发送第二比特序列。其中，该第二比特序列为第一次重传经过极化编码流程后的比特序列。第一次重传的极化编码流程(也可以称为Polar RV1编码)中，Polar RV1编码的详细编码流程请参见图10所示。
应理解，在重传过程中，重传的内容基于不同的方法可能是全部内容或者部分内容，对此本申请不做限定。
当接收端仍然未能正确的接收到发送端发送的全部信息时，即发送端与接收端的第一次重传失败，图3所示的方法还包括：
S340，发送端接收来自接收端的第二响应信息，其中该第二响应信息用于确定第一次重传失败。发送端将进行第二次重传，即图3所示的方法还包括：
S350，发送端向接收端发送第一长度的比特序列。其中，第二次重传的过程中，发送端从循环缓冲区中读取第一长度的比特序列，其中该循环缓冲区由第一比特序列，第二比特序列和第三比特序列组成。
具体地，该第一比特序列为上述步骤S310中发送端初传时的比特序列，该第一比特序列为初传时经过速率匹配后获得的比特序列；该第二比特序列为上述步骤S330中发送端第一次重传时的比特序列，该第二比特序列为第一次重传时经过速率匹配后获得的比特序列；该第三比特序列为上述步骤S310中发送端在Polar RV0编码过程中被截短或打孔的比特组成的比特序列。
应理解，经过第二次重传，接收端还未能正确的接收到发送端发送的全部信息，发送端将进行第三次重传，第三次重传与第二次重传的方法一致。
还应理解，当发送端确定第j次重传失败时，发送端将继续进行j+1次重传，其中j+1应不大于允许的最大重传次数。在第j+1次重传过程中，依据上述图3中的步骤S350中重传的方法，从循环缓冲区中读取第一长度的比特序列进行下一次重传。
需要说明的是，在从循环缓冲区中读取第一长度的比特序列，该第一长度是根据自身协议规定或者指示信息确定的，对此本申请不做限定。
进一步地，将结合图4介绍本申请实施例提供的Polar RV0编码的详细流程，如图4示出了本申请实施例提供的一种极化码编码方法的示意图。该方法可以由发送端执行。
在Polar RV0编码过程中，发送端首先对输入的信息比特序列添加L个比特的循环冗余校验，如图5中所示：对来自MAC的净荷添加L比特的循环冗余校验(cyclic redundancy check，CRC)，以便接收端可以采用CRC辅助连续消除列表(CRC-aided successive cancellation list，CA-SCL)译码算法增强译码性能，如图5所示，添加完CRC后的比特序列记为：
添加完成L个比特的循环冗余校验之后的K个比特序列通过比特映射(bitmapping)单元，如图6所示,映射到长度为N的序列上，作为极化编码单元的输入。
其中，在比特映射中有效的信息称为信息比特(information bits)，无效的信息称为冻结比特(frozenbits)，冻结比特为固定值，可以为比特“0”或比特“1”。在序列中，每个极化信道的可靠度有相对高低之分，在比特映射的过程中，首先优先对可靠度高的极化信道进行比特映射。其中，关于极化信道可靠度的度量表可以根据协议是预先设定，也可以通过指示信息的方式指示极化信道可靠度的度量表，对此本申请不做限定。
完成比特映射之后，将比特映射获得的比特序列作为极化编码单元的输入。如图7示出了Polar极化码编码示意图。图7中所示的符号代表二进制相加，其中，u0～u3经过两层极化编码得到d0～d3。具体地，d0＝mod(u0+u1+u2+u3,2)；d1＝mod(u1+u3,2)；d2＝mod(u2+u3,2)；d3＝mod(u3,2)。
极化编码单元是将长度为N的序列通过克罗内克积(kroneckerproduct)运算，编码为序列编码过程如上述公式(1)中所示，为了避免冗余，此处不再赘述。
进一步地，Polar码初传编码过程中，经过极化编码得到序列之后，再通过速率匹配单元，其中，该速率匹配单元是通对比特序列进行打孔，截短或者重复。
作为一种示例，如图8示出了Polar码初传编码中速率匹配单元中的比特选择的示意图。比特选择将经过子块交织后的序列通过重复，打孔或截短的方式匹配到物理资源上，速率匹配后的比特序列记为：如图8所示，加粗字体表示重复，“X”位置标识的部分表示该序列被打孔或截短。应理解，图8只是示例性地举例，并不对本申请中的技术方案做出限定。
可选地，该速率匹配单元还包括将比特序列划分为m个子序列，对该m个子序列进行交织。
应理解，在速率匹配过程中，子块交织的输入序列为：长度为N。
子块交织后的序列为：长度为N。
根据编码后的比特序列的长度确定m，其中，该m不等于该比特序列长度的因数，对该比特序列确定的m个子序列进行子块(sub-blocks)交织，子块交织的数量m的大小可以根据编码后的比特序列的码长进行变化调整，m并不是唯一值。
作为一种示例，当编码后的比特序列的长度为16bit时，其中，m不等于16的因数。即，m不等于2、4或8。当m取5时，则该比特序列被分为比特数不同的5个子序列，对这5个子序列进行交织运算，可以充分的将错误的比特数进行有效的交织分散，提高了编译码的性能，提高通信链路的传输性能。需要说明的是，本申请中的子序列也可以称为子块，子序列交织也可以称为子块交织。
其中，子块交织的伪代码如下：
应理解，N表示码长，m表示子块交织的深度,n表示交织后的序列的索引，P(i)表示交织图样，yn表示子块交织后的比特序列，dJ(n)表示索引到的子块交织前的比特序列；J(n)表示交织前的序列的索引。
还应理解，上述子块交织过程中的具体参数不唯一，可以根据比特序列的长度或者协议规定，在不同的编译码过程中，子块交织中的参数适应性地改变，抗随机干扰的能力随着具体参数的调整不断增强。
作为一种示例，当m＝32的子块交织的图样P(i)如表1所示：
表1 Polar码子块交织图样P(i)

以表1为例，可以看出，划分称为m＝32个子序列，每一个子序列的序列号用i进行表示，P(i)表示子块交织后的对应的序列号。例如：子块交织前，在i＝3时的子块，经过子块交织后，交织到了i＝4的位置上，而子块交织前i＝4的位置上的子块，交织后，交织到了i＝3的位置上。
可选地，该速率匹配单元还包括对子块交织后的比特序列再进行比特交织，其中该比特交织对一个或者多个子序列内的比特进行比特交织。
应理解，比特交织是将可能接收到的错误尽可能地分散开，比特交织是将经过比特选择的序列经过交织器输出为交织器的输出送入调制器进行调制。
比特交织通常有行列交织，三角交织等，其中本申请在比特交织的过程采用的是行列交织，在行列交织过程中，与三角交织相比参数调整较为灵活。
作为一种示例，如下是一种可能的X行，Y列的行列交织器，其中伪代码如下：
上述图4至图8示例性地示出了Polar码初传编码的方法示意图。首先对需要进行Polar码编码的信息比特进行CRC编码，再通过比特映射单元，将经过CRC编码后的序列映射 到可靠度不同的比特位置上，对通过比特映射单元输出的比特序列作为极化编码单元的输入，最后通过子块交织，比特选择以及比特交织，对可能接收到的错误序列进行分散，从而提高信息的编译码的性能，提高传输链路的可靠性。
在Polar码初传的过程中，接收端没有正确的接收到发送端发送的全部信息，发送端需要进行重传操作。为了确保编译码的性能以及通信链路的可靠性，下面将结合图9具体地说明Polar码在重传编码过程中的详细步骤。
如图9示出了本申请提出的一种信息的重传方法示意图。在信息重传的过程中，尽可能地复用初传过程中的编码单元，在降低复杂度的同时，还能够提高Polar码编译码的性能，有效地保证通信链路的可靠性。如图9所示的方法，该方法包括如下步骤。
S910，确定第j次重传失败。
发送端确定第j次重传失败，并进一步地确定重传的比特序列。
S920，从循环缓冲区读取第一长度的比特序列。
应理解，该循环缓冲区由第一比特序列，第二比特序列和第三比特序列组成，其中，该第一比特序列为初传时经过速率匹配获得的比特序列，该第二比特序列为第一次重传时对第四比特序列经过速率匹配后获得的比特序列，该第三比特序列为初传时被截短或打孔的比特组成的比特序列。
还应理解，该第四比特序列为第一次重传时第五比特序列极化编码获得的比特序列，该第五比特序列为初传时经过比特映射获得的第六比特序列重新进行比特映射获得的，该第六比特序列对应的比特位置和该第五比特序列对应的比特位置的可靠性的排序不同。
可选地，从循环缓冲区中读取第一长度的比特序列时，发送端可以根据不同的冗余版本确定读取的起始位置，读取的第一长度可以根据协议规定或者信息指示的，对此本申请不做限定。
可选地，从循环缓冲区中读取第一长度的比特序列之后，将该第一长度的比特序列送入交织单元进行交织运算。
应理解，该交织为子块交织和/或比特交织，当该交织单元为子块交织时，首先将该第一长度的比特序列划分为m个子序列，对划分得到的m个子序列进行交织，获得交织后的m个子序列。其中，m不等于q，该q为该第一长度的比特序列长度N个因数，m,q,N均为正整数，具体可以参见上述关于子块交织的具体举例。
还应理解，当该交织单元还包括比特交织时，对m个子序列交织后的一个或者多个子序列所包含的比特进行比特交织，具体地比特交织可以参见上述图7至图8中关于比特交织的具体示例。
进一步地，从循环缓冲区中读取第一长度的比特序列之后，如图9所示的方法，该方法还包括：
S930，发送该第一长度的比特序列，以执行第j+1次重传，其中，j+1不大于允许的最大重传次数。
上述图9中所示的方法，发送端在确定第j次重传失败的情况下，直接从循环缓冲区中读取需要传输的第一长度的比特序列，进行重传，不必再对需要重传的信息比特进行编码计算，降低了硬件实现的复杂度，减小了资源开销，其中，该循环缓冲区是由初传时经过速率匹配后得到的比特序列，第一次重传速率匹配之后得到的比特序列以及初传时速率 匹配过程中被截短或打孔的比特组成的比特序列，提高信息重传过程中的可靠性，保证编译码的性能，提高传输性能。
下面将结合图10至图12详细地介绍本申请提出的Polar码第一次重传的方法。图10主要介绍了本申请提出了Polar码第一次重传编码的方法示意图。图11和图12分别详细地址介绍了Polar码第一次重传过程中的比特映射单元以及第一次重传过程中的极化编码单元的详细方法示意图。
如图10示出了本申请提出的Polar码第一次重传编码的方法示意图。该方法包括：首先对信息比特序列进行CRC编码，对添加循环冗余校验CRC的比特序列作为比特映射单元的输入。
在第一次重传编码的方法中，比特映射单元分为两次比特映射，首先通过初传时的比特映射单元(也可以称为RV0比特映射单元)，再通过第一次重传的比特映射单元(也可以称为RV1比特映射单元)，如图10中所示，经过RV0比特映射单元输出的比特序列为第六比特序列，第六比特序列再作为RV1比特映射单元的输入，进行第二次比特映射，输出的比特序列为第五比特序列。其中RV1比特映射单元得到的比特序列对应的比特位置与RV0比特映射得到的比特序列对应的比特位置的可靠性的排序不同。
应理解，根据上述图6所示的RV0比特映射的示意图可知，在序列中，每个比特对应的极化信道的可靠性有相对高低之分，接收端在译码可靠性低的极化信道上传输的比特时，更容易发生错误。本申请提出了在Polar码第一次重传过程中，将初传时RV0比特映射到可靠性低的比特进行二次比特映射(即RV1比特映射)。具体地，RV1比特映射是将RV0比特映射过程中，映射到可靠性低的位置上的比特映射到RV1的比特序列中可靠性高的位置上，便于接收端可以采用重传比特增强译码。
可选地，在RV1比特映射单元中，将RV0比特映射的比特位置的可靠低的比特序列，进行RV1比特映射(如图11中示出的RV1比特映射)。在进行RV1比特映射时，映射到RV1比特序列对应的比特位置的可靠性高的比特位置上。
作为一种示例：经过RV0比特映射后获得的比特是第六比特序列，该第六比特序列包含P个比特，该P个比特对应P个比特位置，该P个比特位置中包含k个第二位置，其中该k个第二位置的可靠性不高于剩余的P-k个比特位置的可靠性。经过RV1比特映射得到是第五比特序列，该第五比特序列包含P个比特，该P个比特对应的P个比特位置，该P个比特位置中包含K个第一位置，该K个第一位置的可靠性不低于剩余P-K个比特位置的可靠性。在RV1比特映射的过程中，将第六比特序列中位于上述k个第二位置上的比特映射至该第五比特序列对应的该K个第一位置上。其中，该K＝k+L，L表示RV1比特映射时的循环冗余校验CRC比特的个数。
例如：Polar码第一次重传时的可用物理资源为Erv1比特，期望码率为：Rrv1，且Rrv1满足以保证重传比特的可靠性，此时重传比特数为： 其中Lrv1表示RV1重传时，为krv1比特的有效负载荷添加的CRC比特。通常，期望码率Rrv1可以根据仿真或者经验值得到，对此本申请不做限定。
在RV1重传时，从RV0经过比特映射后的序列中，挑选出krv1个可靠度最低的比特， 并添加Lrv1比特的CRC后，映射到序列中，可靠度最高的Krv1个位置上，并将送入和RV0相同码长的编码器，编码后的序列记为：
如图10所示，经过比特映射单元输出的第五比特序列，将作为极化编码单元输入。其中，该极化编码单元包括复用初传时的极化编码单元(可以称为RV0极化编码单元)。
可选地，该极化编码单元还包括第一次重传的极化编码单元(可以称为RV1极化编码单元)。
作为一种可能实现的方式，当极化编码单元中只包括RV0极化编码单元时，经过比特映射单元获得的第五比特序列直接作为RV0极化编码单元的输入，复用初传时的极化编码的单元。经过极化编码单元获得的比特序列(可以称为第四比特序列)作为速率匹配单元的输入比特序列。
作为另一种可能实现的方式，当极化编码单元包括RV0极化编码单元和RV1极化编码单元时，该第四比特序列是第五比特序列经过RV0极化编码单元和RV1极化编码单元得到的比特序列。其中，RV1极化编码单元是将第五比特序列经过RV0极化编码单元后的比特序列和第六比特序列经过RV0极化编码单元后的比特序列进行异或运算。该第四比特序列作为速率匹配单元的输入比特序列。例如：如图12所示，其中{u0,u1,u2,u3}表示第一次重传过程中RV0极化编码后的比特序列，{u4,u5,u6,u7}表示初传时经过RV0极化编码后的比特序列，比特序列{u0,u1,u2,u3}和比特序列{u4,u5,u6,u7}通过如图10所示的RV1极化编码单元的异或运算得到比特序列{d0,d1,d2,d3,d4,d5,d6,d7}，其中比特序列{d0,d1,d2,d3}作为速率匹配的输入。
应理解，假设初传时，RV0极化编码输出的比特序列为：在第一次重传时，RV0极化编码出处的比特序列为：则RV1送入速率匹配的序列为：其中“+”运算表示异或运算。
极化编码单元获得的第四比特序列作为速率匹配单元的输入，如图10所示，在Polar码第一次重传的过程中，该速率匹配单元复用Polar码初传时的速率匹配的单元(即RV0速率匹配单元)，尽量复用初传时的计算单元，降低对硬件实现的复杂度，降低资源的开销，保证传输性能。
上述图10至图12主要介绍了本申请提出的关于Polar码第一次重传过程中的方法示意图。在Polar码第一次重传过程中，通过RV0比特映射和RV1比特映射，提高传输性能。同时，在Polar码第一次重传过程中极化编码单元和速率匹配单元尽可能地复用初传时的计算单元，不引入新的计算单元，降低系统的复杂度，节省资源开销。
发送端确定在第一次重传失败之后，从循环缓冲区中读取第一长度的比特序列，并向接收端发送该第一长度的比特序列，以执行第二次重传。
具体地，该循环缓冲区由初传时经过速率匹配后的第一比特序列，第一次重传时经过速率匹配后的第二比特序列以及在初传时经过截短或者打孔的比特组成的比特序列(称为第三比特序列)。
发送端从循环缓冲区中读取第一长度的比特序列时，发送端首先根据Polar IR HARQ的不同冗余版本确定读取第一长度的比特序列的起始位置，再根据自身协议，或者某种指示信息，或者根据其他方式确定读取比特序列的长度，对此本申请不做限定。
图13示出了Polar IR HARQ不同冗余版本示意图。如图13所示，RV0_PS表示初传时经过截短或者打孔的比特组成的比特序列(即：第三比特序列)，该长度为：max(N-Erv0,0)，RV0表示第一比特序列，RV1表示第二比特序列。则第一比特序列，第二比特序列和第三比特序列构成的循环缓冲区的序列为：
在重传过程中，发送端根据可用的物理资源，从循环缓冲区中循环读取相应的比特序列(即：第一长度的比特序列)。
发送端从循环缓冲区中读取第一长度的比特序列时，根据不同的冗余版确定起始位置，表2示出了Polar码不同的冗余版本的起始位置，如表2所示，RV0的起始位置为0，RV1的起始位置为Erv0，RV2的起始位置为Erv0+Erv1，RV3的起始位置为Erv0。
表2 Polar码不同冗余版本的起始位置
上述图13中示出了，当发送端确定第j次重传失败时，发送端从循环缓冲区中读取第一长度的比特序列后，向接收端发送该第一长度的比特序列，以执行第j+1次重传。
需要说明的是，该j+1不大于允许的最大重传次数，当j+1大于最大重传次数时，发送端不再执行上述操作。
根据上述图13可以看出，本申请提出的一种信息的重传方法，在前一次重传失败的情况下，发送端从循环缓冲区中读取适应长度的比特序列，作为本次重传的比特序列。本申请提供的一种信息的重传的方法，简化了重传过程中的计算，降低编译码的复杂度，另外，通过本申请提供的信息的重传方法，可以获得能量增益和编码增益，进而提升Polar码的译码性能，有效保障通信链路的可靠性。
下面将结合图14至图15，说明本申请提供的通信装置、编码装置、网络设备和终端设备。应理解，装置实施例的描述与方法实施例的描述相互对应，因此，未详细描述的内容可以参见上文方法实施例，为了简洁，部分内容不再赘述。
参见图14，图14是本申请提供的通信装置1400的示意性框图。如图14所示，装置1400包括处理单元1410和收发单元1420，其中收发单元1420还可以称为通信接口或者通信单元。
其中，处理单元1410，用于确定第j次重传失败；
该处理单元1410，还用于从循环缓冲区读取第一长度的比特序列，所述循环缓冲区由第一比特序列，第二比特序列和第三比特序列组成，所述第一比特序列为初传时经过速率匹配获得的比特序列，所述第二比特序列为第一次重传时对第四比特序列经过速率匹配后获得的比特序列，所述第三比特序列为信息比特序列初传时被截短或打孔的比特组成的比特序列，其中，所述第四比特序列为第一次重传时第五比特序列极化编码获得的比特序列，所述第五比特序列为初传时经过比特映射获得的第六比特序列重新进行比特映射获得的，所述第六比特序列对应的比特位置和所述第五比特序列对应的比特位置的可靠性的排序不同。
收发单元1420，用于发送处理单元1410确定的第一长度的比特序列。
可选地，该处理单元1410，还用于根据上述第一比特序列，第二比特序列以及第三 比特序列确定读取的起始位置；还用于通过该起始位置从循环缓冲区读取第一长度的比特序列。
可选地，该处理单元1410，还用于根据第一长度的比特序列确定m个子序列；对m个子序列进行交织，m不等于q，q为第一长度的比特序列长度N的因数，m,q,N均为正整数；
可选地，该收发单元，还用于发送交织后的第一长度的比特序列。
可选地，处理单元还用于：对m个子序列中的一个或多个子序列所包含的比特进行比特交织。
可选地，该第四比特序列为该第五比特序列经过极化编码获得比特序列和该第六比特序列经过极化编码获得比特序列进行异或运算获得的比特序列。
可选地，该第五比特序列包含P个比特，该第六比特序列包含P个比特，该P个比特对应P个比特位置，该第五比特序列中的该P个比特位置中包含K个第一位置，该K个第一位置的可靠性不低于剩余的P-K个比特位置的可靠性，该第六比特序列中的该P个比特位置中包含k个第二位置，该k个第二位置的可靠性不高于剩余的P-k个比特位置的可靠性，该第五比特序列是对初传时经过比特映射获得的该第六比特序列重新进行比特映射获得的，包括:该第六比特序列中位于该k个第二位置上的比特，被映射至该第五比特序列对应的该K个第一位置上，其中，该K＝k+L，该L为第一次重传时的循环冗余校验CRC比特的个数。
需要说明的是，在具体实现时，该处理单元1410可以是处理器、芯片或者集成电路。对此本申请不做限定。
本申请提供的通信装置1400，用于实现上述方法实施例中的信息的重传方法。本申请实施例中图9至图13中的部分或者全部流程可以通过硬件来实现，或者也可以通过软件来实现。当通过硬件实现时，上述处理单元1410可以为处理器。
图15是本申请提供的终端设备1500的示意性结构图。如图15所示，如图15所示，终端设备1500包括：一个或多个处理器1510，一个或多个存储器1520，一个或多个收发器1530。处理器1510用于控制收发器1530收发信号，存储器1520用于存储计算机程序，处理器1510用于从存储器1520中调用并运行该计算机程序，以执行本申请提供的信息的重传方法图9至图13中的相应流程。为了简洁，此处不再赘述。
例如，终端设备1500可以是图1所示的无线通信系统中的终端设备102或103。处理器1510可以对应图14中的处理单元1410，收发器1530可以对应图14中所示的收发单元1420。
此外，本申请提供一种计算机可读存储介质，该计算机可读存储介质中存储有计算机指令，当该计算机指令在计算机上运行时，使得计算机执行本申请实施例提供的信息重传方法图9至图13中的相应操作和/或流程。
本申请还提供一种计算机程序产品，该计算机程序产品包括计算机程序代码，当该计算机程序代码在计算机上运行时，使得计算机执行本申请实施例的提供的信息重传方法图9至图13中的相应操作和/或流程。
本申请还提供一种芯片，包括处理器。处理器用于读取并执行存储器中存储的计算机程序，以执行本申请提供的信息重传方法图9至图13中的相应操作和/或流程。
可选地，该芯片还包括存储器，该存储器与该处理器通过电路或电线与存储器连接。进一步可选地，该芯片还包括通信接口，处理器与该通信接口连接。通信接口用于接收待编码的比特序列，处理器从通信接口获取该信息比特序列，并采用本申请实施例提供的信息重传方法，从循环缓冲区中读取第一长度的比特序列进行重传；通信接口输出第一长度的比特序列。该通信接口可以是输入输出接口。
本申请提供一种计算机可读存储介质，该计算机可读存储介质中存储有计算机指令，当该计算机指令在计算机上运行时，使得计算机执行本申请实施例提供的图9至图13中的相应操作和/或流程。
本申请还提供一种计算机程序产品，该计算机程序产品包括计算机程序代码，当该计算机程序代码在计算机上运行时，使得计算机执行本申请实施例提供的图9至图13中的相应操作和/或流程。
本申请还提供一种芯片，包括处理器。处理器用于读取并执行存储器中存储的计算机程序，以执行本申请实施例提供的图9至图13中的相应操作和/或流程。
可选地，该芯片还包括存储器，该存储器与该处理器通过电路或电线与存储器连接。进一步可选地，该芯片还包括通信接口，处理器与该通信接口连接。通信接口用于发送处理器从循环缓冲区中确定的第一长度的比特序列。该通信接口可以是输入输出接口。在实现过程中，上述方法的各步骤可以通过处理器中的硬件的集成逻辑电路或者软件形式的指令完成。上述方法实施例的步骤可以直接体现为硬件处理器执行完成，或者用处理器中的硬件及软件模块组合执行完成。软件模块可以位于随机存储器，闪存、只读存储器，可编程只读存储器或者电可擦写可编程存储器、寄存器等本领域成熟的存储介质中。该存储介质位于存储器，处理器读取存储器中的信息，结合其硬件完成上述方法的步骤。
本申请实施例中的存储器可以是易失性存储器或非易失性存储器，或可包括易失性和非易失性存储器两者。其中，非易失性存储器可以是只读存储器(read-only memory，ROM)、可编程只读存储器(programmable ROM，PROM)、可擦除可编程只读存储器(erasable PROM，EPROM)、电可擦除可编程只读存储器(electrically EPROM，EEPROM)或闪存。易失性存储器可以是随机存取存储器(random access memory，RAM)，其用作外部高速缓存。通过示例性但不是限制性说明，许多形式的RAM可用，例如静态随机存取存储器(static RAM，SRAM)、动态随机存取存储器(dynamic RAM，DRAM)、同步动态随机存取存储器(synchronous DRAM，SDRAM)、双倍数据速率同步动态随机存取存储器(double data rate SDRAM，DDR SDRAM)、增强型同步动态随机存取存储器(enhanced SDRAM，ESDRAM)、同步连接动态随机存取存储器(synchlink DRAM，SLDRAM)和直接内存总线随机存取存储器(direct rambus RAM，DR RAM)。应注意，本文描述的系统和方法的存储器旨在包括但不限于这些和任意其它适合类型的存储器。
本领域普通技术人员可以意识到，结合本文中所公开的实施例描述的各示例的单元及算法步骤，能够以电子硬件、或者计算机软件和电子硬件的结合来实现。这些功能究竟以硬件还是软件方式来执行，取决于技术方案的特定应用和设计约束条件。专业技术人员可以对每个特定的应用来使用不同方法来实现所描述的功能，但是这种实现不应认为超出本申请的范围。
所属领域的技术人员可以清楚地了解到，为描述的方便和简洁，上述描述的系统、装 置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的系统、装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。
所述功能如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(Read-Only Memory，ROM)、随机存取存储器(Random Access Memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，仅为本申请的具体实施方式，但本申请的保护范围并不局限于此，任何熟悉本技术领域的技术人员在本申请揭露的技术范围内，可轻易想到变化或替换，都应涵盖在本申请的保护范围之内。因此，本申请的保护范围应以所述权利要求的保护范围为准。

Claims (16)

  1. 一种信息的重传方法，其特征在于，包括：
    确定第j次重传失败；
    从循环缓冲区读取第一长度的比特序列，所述循环缓冲区由第一比特序列，第二比特序列和第三比特序列组成，所述第一比特序列为初传时经过速率匹配获得的比特序列，所述第二比特序列为第一次重传时对第四比特序列经过速率匹配后获得的比特序列，所述第三比特序列为初传时被截短或打孔的比特组成的比特序列，
    其中，所述第四比特序列为第一次重传时对第五比特序列进行极化编码获得的比特序列，所述第五比特序列为初传时经过比特映射获得的第六比特序列重新进行比特映射获得的，所述第六比特序列对应的比特位置和所述第五比特序列对应的比特位置的可靠性的排序不同；
    发送所述第一长度的比特序列，以执行第j+1次重传，
    其中，j+1不大于允许的最大重传次数，所述j为正整数。
  2. 根据权利要求1所述的方法，其特征在于，从循环缓冲区读取第一长度的比特序列，包括：
    根据所述第一比特序列、所述第二比特序列以及所述第三比特序列确定读取的起始位置；
    根据所述起始位置从所述循环缓冲区读取所述第一长度的比特序列。
  3. 根据权利要求1或2所述的方法，其特征在于，所述方法还包括：
    将所述第一长度的比特序列划分为m个子序列；
    对所述m个子序列进行交织，获得交织后的m个子序列，m不等于q，q为所述第一长度的比特序列长度N的因数，m，q，N均为正整数；
    发送所述第一长度的比特序列，包括：
    发送交织后的所述第一长度的比特序列。
  4. 根据权利要求3所述的方法，其特征在于，所述方法还包括：
    对所述m个子序列中的一个或多个子序列所包含的比特进行比特交织。
  5. 根据权利要求1至4中任一项所述的方法，其特征在于，所述第四比特序列为所述第五比特序列经过极化编码获得比特序列和所述第六比特序列经过极化编码获得比特序列进行异或运算获得的比特序列。
  6. 根据权利要求1至5中任一项所述的方法，其特征在于，所述第五比特序列包含P个比特，所述第六比特序列包含P个比特，所述P个比特对应P个比特位置，
    所述第五比特序列中的所述P个比特位置中包含K个第一位置，所述K个第一位置的可靠性不低于剩余的P-K个比特位置的可靠性，
    所述第六比特序列中的所述P个比特位置中包含k个第二位置，所述k个第二位置的可靠性不高于剩余的P-k个比特位置的可靠性，
    所述第五比特序列是对初传时经过比特映射获得的所述第六比特序列重新进行比特映射获得的，包括:
    所述第六比特序列中位于所述k个第二位置上的比特，被映射至所述第五比特序列对应的所述K个第一位置上，
    其中，所述K＝k+L，所述L为第一次重传时的循环冗余校验CRC比特的个数。
  7. 一种信息的重传装置，其特征在于，包括：
    处理单元，用于确定第j次重传失败；
    所述处理单元，还用于从循环缓冲区读取第一长度的比特序列，所述循环缓冲区由第一比特序列，第二比特序列和第三比特序列组成，所述第一比特序列为初传时经过速率匹配获得的比特序列，所述第二比特序列为第一次重传时对第四比特序列经过速率匹配后获得的比特序列，所述第三比特序列为信息比特序列初传时被截短或打孔的比特组成的比特序列，
    其中，所述第四比特序列为第一次重传时第五比特序列极化编码获得的比特序列，所述第五比特序列为初传时经过比特映射获得的第六比特序列重新进行比特映射获得的，所述第六比特序列对应的比特位置和所述第五比特序列对应的比特位置的可靠性的排序不同；
    收发单元，用于发送所述第一长度的比特序列，以执行第j+1次重传，
    其中，j+1小于允许的最大重传次数，所述j为正整数。
  8. 根据权利要求7所述的装置，其特征在于，所述处理单元，还用于根据所述第一比特序列，所述第二比特序列以及所述第三比特序列确定读取位置；
    所述处理单元，还用于根据所述读取位置从所述循环缓冲区读取所述第一长度的比特序列。
  9. 根据权利要求7或8所述的装置，其特征在于，所述处理单元还用于：
    根据所述第一长度的比特序列确定m个子序列；
    对所述m个子序列进行交织，m不等于q，q为所述第一长度的比特序列长度N的因数，m,q,N均为正整数；
    所述收发单元，还用于发送交织后的所述第一长度的比特序列。
  10. 根据权利要求9所述的装置，其特征在于，所述处理单元还用于：
    对所述m个子序列中的一个或多个子序列所包含的比特进行比特交织。
  11. 根据权利要求7至10中任一项所述的装置，其特征在于，所述第四比特序列为所述第五比特序列经过极化编码获得比特序列和所述第六比特序列经过极化编码获得比特序列进行异或运算获得的比特序列。
  12. 根据权利要求7至11中任一项所述的装置，其特征在于，所述第五比特序列包含P个比特，所述第六比特序列包含P个比特，所述P个比特对应P个比特位置，
    所述第五比特序列中的所述P个比特位置中包含K个第一位置，所述K个第一位置的可靠性不低于剩余的P-K个比特位置的可靠性，
    所述第六比特序列中的所述P个比特位置中包含k个第二位置，所述k个第二位置的可靠性不高于剩余的P-k个比特位置的可靠性，
    所述第五比特序列是对初传时经过比特映射获得的所述第六比特序列重新进行比特映射获得的，包括:
    所述第六比特序列中位于所述k个第二位置上的比特，被映射至所述第五比特序列对 应的所述K个第一位置上，
    其中，所述K＝k+L，所述L为第一次重传时的循环冗余校验CRC比特的个数。
  13. 一种通信装置，其特征在于，包括至少一个处理器，所述至少一个处理器与至少一个存储器耦合，所述至少一个处理器用于执行所述至少一个存储器中存储的计算机程序或指令，以使所述通信装置执行如权利要求1至6中任一项所述的方法。
  14. 一种计算机可读存储介质，其特征在于，所述计算机可读存储介质中存储有指令，当所述计算机指令在计算机上运行时，使得所述计算机执行如权利要求1至6中任一项所述的方法。
  15. 一种芯片，其特征在于，包括：
    存储器，用于存储计算机程序；
    处理器，用于读取并执行所述存储器中存储的所述计算机程序，当所述计算机程序被执行时，所述处理器执行如权利要求1至6中任一项所述的方法。
  16. 一种计算机程序产品，其特征在于，所述计算机程序产品包括计算机程序代码，当所述计算机程序代码在计算机上执行时，使得计算机执行如权利要求1至6中任一项所述的方法。
PCT/CN2023/092986 2022-05-23 2023-05-09 一种信息的重传方法和通信装置 WO2023226747A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN202210560446.4A CN117176293A (zh) 2022-05-23 2022-05-23 一种信息的重传方法和通信装置
CN202210560446.4 2022-05-23

Publications (1)

Publication Number Publication Date
WO2023226747A1 true WO2023226747A1 (zh) 2023-11-30

Family

ID=88918369

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2023/092986 WO2023226747A1 (zh) 2022-05-23 2023-05-09 一种信息的重传方法和通信装置

Country Status (2)

Country Link
CN (1) CN117176293A (zh)
WO (1) WO2023226747A1 (zh)

Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107819545A (zh) * 2016-09-12 2018-03-20 华为技术有限公司 极化码的重传方法及装置
US20190149176A1 (en) * 2017-02-10 2019-05-16 Telefonaktiebolaget Lm Ericsson (Publ) Circular buffer rate matching for polar codes
WO2020042161A1 (en) * 2018-08-31 2020-03-05 Nokia Shanghai Bell Co., Ltd. Incremental redundancy hybrid automatic repeat request transmissions for polar coded systems
CN114070461A (zh) * 2020-07-30 2022-02-18 华为技术有限公司 一种重传方法及装置
CN114124292A (zh) * 2020-08-29 2022-03-01 华为技术有限公司 一种重传方法及装置

Patent Citations (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107819545A (zh) * 2016-09-12 2018-03-20 华为技术有限公司 极化码的重传方法及装置
US20190149176A1 (en) * 2017-02-10 2019-05-16 Telefonaktiebolaget Lm Ericsson (Publ) Circular buffer rate matching for polar codes
WO2020042161A1 (en) * 2018-08-31 2020-03-05 Nokia Shanghai Bell Co., Ltd. Incremental redundancy hybrid automatic repeat request transmissions for polar coded systems
CN114070461A (zh) * 2020-07-30 2022-02-18 华为技术有限公司 一种重传方法及装置
CN114124292A (zh) * 2020-08-29 2022-03-01 华为技术有限公司 一种重传方法及装置

Also Published As

Publication number Publication date
CN117176293A (zh) 2023-12-05

Similar Documents

Publication Publication Date Title
US11277231B2 (en) Redundancy version design solution in communication systems
WO2017177926A1 (zh) 一种数据传输处理方法和装置
US11742987B2 (en) Method and apparatus for processing information, communications device, and communications system
US8156407B2 (en) Method and system for memory management in a HARQ communications system
CN101741527B (zh) 速率匹配方法和装置
WO2017215382A1 (zh) 一种数据传输方法、装置和设备
WO2010118606A1 (zh) 速率匹配方法和装置
CN108173621A (zh) 数据传输的方法、发送设备、接收设备和通信系统
CN112636879B (zh) 基于混合自动重传请求的码块处理的方法和装置
CN108023675A (zh) 数据传输方法及通信设备
WO2009026798A1 (fr) Procédé de retransmission basé sur un code de vérification basse densité et son dispositif
WO2018228553A1 (zh) 数据传输的方法、网络设备和终端设备
JP2023535500A (ja) 再送方法及び装置
US20230336273A1 (en) Hybrid automatic repeat request harq-based communication method and apparatus
CN108631928B (zh) 数据传输方法、发送设备及接收设备
WO2023226747A1 (zh) 一种信息的重传方法和通信装置
WO2010118590A1 (zh) 比特映射方式的指示方法
CN114124292A (zh) 一种重传方法及装置
CN112187418B (zh) Wlan中的harq通信方法
WO2022236719A1 (zh) 无线通信方法、终端设备和网络设备
WO2024165143A1 (en) Hybrid automatic repeat request with pre-configured redundancy versions
CN111988118A (zh) 一种无线局域网中的通信方法及设备

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 23810820

Country of ref document: EP

Kind code of ref document: A1