WO2022022298A1 - 一种重传方法及装置 - Google Patents

一种重传方法及装置 Download PDF

Info

Publication number
WO2022022298A1
WO2022022298A1 PCT/CN2021/106609 CN2021106609W WO2022022298A1 WO 2022022298 A1 WO2022022298 A1 WO 2022022298A1 CN 2021106609 W CN2021106609 W CN 2021106609W WO 2022022298 A1 WO2022022298 A1 WO 2022022298A1
Authority
WO
WIPO (PCT)
Prior art keywords
bits
encoded
sub
retransmission
bit sequence
Prior art date
Legal status (The legal status 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 status listed.)
Ceased
Application number
PCT/CN2021/106609
Other languages
English (en)
French (fr)
Inventor
戴胜辰
张公正
李榕
乔云飞
王献斌
王俊
童文
王坚
王键
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Huawei Technologies Co Ltd
Original Assignee
Huawei Technologies Co Ltd
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
Priority claimed from CN202110109625.1A external-priority patent/CN114070461A/zh
Application filed by Huawei Technologies Co Ltd filed Critical Huawei Technologies Co Ltd
Priority to JP2023506038A priority Critical patent/JP7682256B2/ja
Priority to EP21849200.7A priority patent/EP4187816B1/en
Publication of WO2022022298A1 publication Critical patent/WO2022022298A1/zh
Priority to US18/160,008 priority patent/US20230171033A1/en
Anticipated expiration legal-status Critical
Ceased legal-status Critical Current

Links

Images

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
    • 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/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H04L1/1819—Hybrid protocols; Hybrid automatic repeat request [HARQ] with retransmission of additional or different redundancy
    • 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/08—Arrangements for detecting or preventing errors in the information received by repeating transmission, e.g. Verdan system
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/03—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words
    • H03M13/05—Error detection or forward error correction by redundancy in data representation, i.e. code words containing more digits than the source words using block codes, i.e. a predetermined number of check bits joined to a predetermined number of information bits
    • H03M13/13—Linear codes
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/6306—Error control coding in combination with Automatic Repeat reQuest [ARQ] and diversity transmission, e.g. coding schemes for the multiple transmission of the same information or the transmission of incremental redundancy
    • H—ELECTRICITY
    • H03—ELECTRONIC CIRCUITRY
    • H03M—CODING; DECODING; CODE CONVERSION IN GENERAL
    • H03M13/00—Coding, decoding or code conversion, for error detection or error correction; Coding theory basic assumptions; Coding bounds; Error probability evaluation methods; Channel models; Simulation or testing of codes
    • H03M13/63—Joint error correction and other techniques
    • H03M13/635—Error control coding in combination with rate matching
    • H03M13/6362—Error control coding in combination with rate matching by puncturing
    • H03M13/6368—Error control coding in combination with rate matching by puncturing using rate compatible puncturing or complementary puncturing
    • 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/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0057—Block codes
    • 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/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0061—Error detection codes
    • 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/004—Arrangements for detecting or preventing errors in the information received by using forward error control
    • H04L1/0056—Systems characterized by the type of code used
    • H04L1/0067—Rate matching
    • 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/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1874—Buffer management

Definitions

  • the embodiments of the present application relate to the field of communication technologies, and in particular, to a retransmission method and apparatus.
  • Turbo codes As the most basic wireless access technology, channel coding plays a crucial role in ensuring the reliable transmission of data.
  • Turbo codes, low density parity check codes (low density parity check, LDPC) and polar codes are generally used for channel coding.
  • Turbo codes cannot support information transmission with too low or too high code rates.
  • Turbo codes and LDPC codes are difficult to achieve ideal performance under the limited code length due to their own coding and decoding characteristics.
  • Turbo codes and LDPC codes have high computational complexity in the process of encoding and decoding.
  • Polar code is a good code that can theoretically prove that Shannon capacity can be obtained, and has relatively simple coding and decoding complexity, so it has been more and more widely used.
  • the Polar code is determined as the coding method of the control channel. Therefore, the coding process of the Polar code is specified in the standard, including segmentation, determining the rate matching method, information bits and check bits (including cyclic redundancy check bits and/or parity bits) on the polar channel. mapping, coding, rate matching and other specific processes.
  • the embodiments of the present application provide a retransmission method and device applied to wireless communication, which have the advantage of being simple to implement.
  • a first aspect provides a retransmission method, characterized in that it includes:
  • the sending device obtains a to-be-coded bit sequence comprising K to-be-coded bits, where K is a positive integer;
  • the design in the existing standard is reused as much as possible, and on the other hand, the advantages of the existing HARQ mechanism are absorbed, so the implementation is simple and the performance can meet the requirements.
  • the determining the retransmission version RV1 according to the initial transmission code rate R0 includes:
  • the RV1 is the E1 bits read from the first circular buffer of the initial transmission.
  • the obtaining RV1 according to the second bit sequence is:
  • the Q1 includes K elements, and the K elements are the sequence numbers of the K sub-channels used to place the K bits to be encoded in the initial transmission;
  • the K bits to be encoded are subjected to Polar code encoding with a mother code length of N1 to obtain the second bit sequence.
  • the Q3 is determined according to a reliability ordering sequence with a length of N1 and a retransmission rate matching manner.
  • performing Polar code encoding with a mother code length of N1 on the K bits to be encoded according to the Q2, the Q3, the Qext, and the Qchk includes:
  • bit values on the sub-channels in the Qchk are selected and copied to the corresponding sub-channels of the Qext one by one.
  • the obtaining RV1 according to the second bit sequence is:
  • RV1 is obtained from the first N0 bits of the second bit sequence according to the retransmission rate matching manner.
  • the method before the transmitting apparatus acquires the to-be-coded bit sequence including the K to-be-coded bits, the method further includes:
  • Segmentation is performed according to the transport block size TBS.
  • the segment number C of the segment is:
  • TBcrc is the TB-level CRC bit number of the transport block
  • K_threshold is a preset first threshold
  • CBcrc is the number of CRC bits at the CB level of the code block.
  • n2 is the quantization unit
  • n2 is a positive integer
  • N′ iefo is the amount of data that can be transmitted.
  • Ninfo is based on the quantization level.
  • the N' info is:
  • N' info max(TBSmin,2 n *round((N info -TBcrc)/2 n ))
  • TBSmin refers to the minimum transmission block size
  • round is the rounding operation
  • n is the quantization level of the transmission block to be transmitted
  • n min is the minimum quantization level
  • n0 is the quantization adjustment amount
  • the method further includes:
  • the sending device cascades RV0 and RV1 into the second circular buffer
  • the transmitting apparatus performs retransmission according to RV0 and RV1.
  • a retransmission method characterized in that:
  • the receiving device receives the received signal containing the information of K bits to be encoded, and the corresponding mother code length N0 of the received signal determines the initial transmission version RV0;
  • Decoding is performed according to the RV0 and RV1.
  • the determining the retransmission version RV1 according to the initial transmission code rate R0 includes:
  • the RV1 is the E1 bits read from the first circular buffer of the initial transmission.
  • the obtaining RV1 according to the second bit sequence is:
  • the Q1 includes K elements, and the K elements are the sequence numbers of the K sub-channels used to place the K bits to be encoded in the initial transmission;
  • the K bits to be encoded are subjected to Polar code encoding with a mother code length of N1 to obtain the second bit sequence.
  • the Q3 is determined according to a reliability ordering sequence with a length of N1 and a retransmission rate matching manner.
  • performing Polar code encoding with a mother code length of N1 on the K bits to be encoded according to the Q2, the Q3, the Qext, and the Qchk includes:
  • bit values on the sub-channels in the Qchk are selected and copied to the corresponding sub-channels of the Qext one by one.
  • the obtaining RV1 according to the second bit sequence is:
  • RV1 is obtained from the first N0 bits of the second bit sequence according to the retransmission rate matching manner.
  • the method further includes segmenting the received transport block to be decoded according to the transport block size TBS.
  • the segment number C of the segment is:
  • TBcrc is the TB-level CRC bit number of the transport block
  • K_threshold is a preset first threshold
  • CBcrc is the number of CRC bits at the CB level of the code block.
  • n2 is the quantization unit
  • n2 is a positive integer
  • N' info is the amount of data that can be transmitted.
  • Ninfo is calculated according to the quantization level.
  • the N' info is:
  • N' info max(TBSmin,2 n *round((N info -TBcrc)/2 n ))
  • TBSmin refers to the minimum transmission block size
  • round is the rounding operation
  • n is the quantization level of the transmission block to be transmitted
  • n min is the minimum quantization level
  • n0 is the quantization adjustment amount
  • the method further includes:
  • the sending device cascades RV0 and RV1 into the second circular buffer
  • the transmitting apparatus performs retransmission according to RV0 and RV1.
  • a third aspect provides a sending device, the device having the function of implementing the method described in the first aspect and any possible design of the first aspect.
  • the functions can be implemented by hardware, or can be implemented by hardware executing corresponding software.
  • the hardware or software includes one or more modules corresponding to the above functions.
  • the sending device when part or all of the functions are implemented by hardware, includes: an input interface circuit for acquiring the transmission block to be transmitted; a logic circuit for implementing the above first aspect and the first The behavior described in any possible design of an aspect; an output interface circuit for outputting the encoded sequence or the retransmitted sequence.
  • the sending device may be a chip or an integrated circuit.
  • the sending device when part or all of the functions are implemented by software, the sending device includes: a memory for storing a program; a processor for executing the program stored in the memory, when the When the program is executed, the sending device may implement the method described in the first aspect and any possible design of the first aspect.
  • the above-mentioned memory may be a physically independent unit, or may be integrated with the processor.
  • the sending means when part or all of the functions are implemented by software, includes a processor.
  • the memory for storing the program is located outside the transmitting device, and the processor is connected to the memory through a circuit/wire for reading and executing the program stored in the memory.
  • the apparatus is a network device or a terminal.
  • a receiving apparatus has the function of implementing the method described in any possible design of the second aspect and the second aspect.
  • the functions can be implemented by hardware, or can be implemented by hardware executing corresponding software.
  • the hardware or software includes one or more modules corresponding to the above functions.
  • the receiving device when part or all of the functions are implemented by hardware, includes: an input interface circuit for acquiring the received signal; and a logic circuit for implementing the second aspect and the second aspect above The behavior described in any possible design of ; output interface circuit for outputting the decoded result.
  • the receiving device may be a chip or an integrated circuit.
  • the receiving device when part or all of the functions are implemented by software, the receiving device includes: a memory for storing a program; a processor for executing the program stored in the memory, when the When the program is executed, the sending device may implement the method described in the first aspect and any possible design of the first aspect.
  • the above-mentioned memory may be a physically independent unit, or may be integrated with the processor.
  • the receiving device includes a processor when some or all of the functions are implemented in software.
  • a memory for storing a program is located outside the receiving device, and a processor is connected to the memory through a circuit/wire for reading and executing the program stored in the memory.
  • the apparatus is a network device or a terminal.
  • a computer storage medium storing a computer program, the computer program comprising instructions for performing the method of any one of the first aspect and any possible design of the first aspect.
  • a computer storage medium storing a computer program, the computer program comprising instructions for performing the method of any one of the second aspect and any possible design of the second aspect.
  • embodiments of the present application provide a computer program product containing instructions, which, when run on a computer, cause the computer to execute the methods described in the above aspects.
  • a wireless device including a transmitter and a transceiver for implementing the first aspect and any possible design of the first aspect
  • the transceiver is used to receive or transmit signals.
  • the wireless device is a terminal or a network device.
  • a wireless device comprising a receiving apparatus and a transceiver for implementing any possible design of the second aspect and the second aspect,
  • the transceiver is used to receive or transmit signals.
  • the wireless device is a terminal or a network device.
  • FIG. 1 is a schematic diagram of a communication system architecture applied in an embodiment of the application
  • FIG. 2 is a schematic flowchart of a segmentation method in an embodiment of the present application.
  • FIG. 3 is a schematic flowchart of RV version confirmation in an embodiment of the present application.
  • FIG. 4 is a schematic flowchart of RV1 version confirmation in an embodiment of the present application.
  • FIG. 5 is a schematic diagram of bit replication in an embodiment of the present application.
  • FIG. 6 is one of the schematic structural diagrams of the sending device in the embodiment of the present application.
  • FIG. 7 is the second schematic diagram of the structure of the sending device in the embodiment of the application.
  • FIG. 8 is a schematic diagram of a sending device in an embodiment of the present application.
  • FIG. 9 is one of the schematic structural diagrams of a receiving apparatus in an embodiment of the present application.
  • FIG. 10 is the second schematic diagram of the structure of the receiving apparatus in the embodiment of the application.
  • FIG. 11 is a schematic diagram of a receiving device in an embodiment of the present application.
  • the embodiments of the present application provide a Polar code encoding method, specifically, including a novel data segmentation and HARQ method.
  • the coding strategy of the Polar code uses the noiseless channel to transmit the useful information of the user, and the full noise channel transmits the agreed information or does not transmit the information.
  • Polar code is also a linear block code, its encoding matrix is G N , and the encoding process is in is a binary row vector with a length of N (that is, the code length, it can be seen that the lengths of the sequences x and u before and after encoding are N, and N is also called the code length of the mother code);
  • G N is an N ⁇ N matrix, and Defined as the Kronecker product of log 2 N matrices F 2 .
  • the above matrix In some embodiments, G N also includes a transposed matrix B N , but it does not affect the essence of Polar coding, so it is not limited, and this application still takes the solution without introducing B N as an example.
  • a part of the bits are used to carry information, which is called the information bit set, and the set of indexes of these bits is denoted as A; the other part of the bits is set to a fixed value pre-agreed by the receiver and the sender, which is called the frozen bit set or frozen bit set.
  • a set of frozen bits whose index set is represented by A's complement Ac .
  • the encoding process of the Polar code is equivalent to:
  • G N (A) is the submatrix in G N obtained by those rows corresponding to the indices in set A
  • G N (A C ) is the submatrix in G N obtained by those rows corresponding to the indices in set A c matrix.
  • u A is The set of information bits in the set, the number is K, generally, including but not limited to cyclic redundancy check (Cyclic Redundancy Check, referred to as CRC) bits, parity check (Parity Check, referred to as PC) bits including various checks
  • CRC Cyclic Redundancy Check
  • PC parity check
  • One or more of the bits may also be included in the set of information bits; for The set of frozen bits in , whose number is (NK), are known bits.
  • These freeze bits are usually set to 0, but as long as the receiver and the sender agree in advance, the freeze bits can be set arbitrarily.
  • u A is The information bit set in , u A is a row vector of length K, that is,
  • K,
  • the construction process of the Polar code is the selection process of the set A, which determines the performance of the Polar code.
  • the construction process of the Polar code is usually: According to the code length N of the mother code, it is determined that N polar sub-channels coexist, corresponding to the N rows of the coding matrix. The indices of the polarized sub-channels are used as elements of the set A, and the indices corresponding to the remaining (NK) polarized sub-channels are used as the elements of the index set Ac of frozen bits.
  • Set A determines the location of the information bits, and set A c determines the location of the frozen bits.
  • the serial number of the polarized sub-channel is the position index of the information bit or frozen bit, that is, in the The position index in .
  • NE polarized sub-channels that need to be punctured or shortened (ie deleted) are determined first, where E is the target code length , that is, the length of the bit sequence after rate matching.
  • the NE polarized sub-channels selected here are used to place frozen bits.
  • some additionally determined It is called a pre-frozen polarized sub-channel, and it is also used to place frozen bits.
  • the number of pre-frozen polarized sub-channels may be defined as P, and P is greater than or equal to 0 (for the shortened case, P is obviously 0, at this time It is not necessary to consider P), and then select K polarized subchannels with higher reliability among the remaining EP polarized subchannels for placing K information bits according to the reliability.
  • P is greater than or equal to 0 (for the shortened case, P is obviously 0, at this time It is not necessary to consider P)
  • E-P-K sub-channels with lower reliability can also be selected first for placing frozen bits, and the remaining K sub-channels are used for placing information bits.
  • the reliability of any one of the K polarized sub-channels for placing K information bits is higher than that of any one of the E-P-K sub-channels for placing frozen bits.
  • the value of P is not limited.
  • P can be 0, and even in the case of shortening, P can be taken as greater than 0, which does not affect the implementation of the technical solutions of the present application. , whether it is the coding end or the decoding end, the principles and methods for confirming that the K sub-channels are used to place the K information bits are consistent.
  • the sequence after sub-block interleaving (for example, divided into 32 sub-blocks) is placed on the circular buffer (circular buffer in English, equivalent to the rate matching sequence), If it is punching, start reading from the NEth position on the circular buffer, discard the bits from 0 to NE-1, if it is shortening, start reading from the 0th position on the circular buffer until the th E-1 positions, while discarding bits from E-th to N-1 positions.
  • This approach does not consider the relationship between rate matching sequences between different mother code lengths.
  • the relative relationship of reliability mentioned here is based on a given calculation method of reliability. Different reliability calculation methods may lead to changes in the relative reliability of polarized sub-channels. The method is the same for the polarized subchannels of the bits.
  • information bits can also be considered to be placed in the last punctured or shortened polarized sub-channels. This application does not limit the selection of polarized sub-channels in which information bits must be placed in accordance with the 5G NR standard.
  • TBS Transport Block Size
  • FIG. 1 is a schematic structural diagram of a wireless communication network according to an embodiment of the present invention.
  • FIG. 1 is just an example, and other wireless networks that can use the method or apparatus for segmentation and retransmission according to the embodiments of the present invention are also within the protection scope of the present invention.
  • the wireless communication network 100 includes a network device 110 , and a terminal 112 .
  • the network device 110 may also be connected to the core network 102 .
  • the network device 110 may also communicate with an IP network 104, such as the Internet, a private IP network, or other data network, or the like.
  • IP network 104 such as the Internet, a private IP network, or other data network, or the like.
  • the network equipment provides services to the terminals within the coverage area.
  • the network device 110 provides wireless access to one or more terminals 112 within the coverage of the network device 110 .
  • the network devices may also communicate with each other, for example, the network device 110 may communicate with the network device 120 .
  • the above-mentioned network device may be a device for communicating with a terminal device.
  • a terminal device can be an evolved base station (Evolved Node B, eNB or eNodeB) in an LTE system, a gNB in a 5G network, a satellite in satellite communication, or a network-side device in a future communication system.
  • the network device may also be a relay station, an access point, a vehicle-mounted device, or the like.
  • D2D device-to-device
  • M2M machine-to-machine
  • the network device can also be a terminal that functions as a base station.
  • the above-mentioned terminal may refer to a user equipment (User Equipment, UE), an access terminal, a subscriber unit, a mobile station, a remote station, a remote terminal, a mobile device, a user terminal, a wireless communication device, a user agent or a user equipment.
  • the access terminal may be a cellular phone, a cordless phone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), a wireless communication Functional handheld devices, computing devices or other processing devices connected to wireless modems, in-vehicle devices, wearable devices, end devices in future communication networks, etc.
  • SIP Session Initiation Protocol
  • WLL Wireless Local Loop
  • PDA Personal Digital Assistant
  • the execution subject of the Polar code encoding method may be the above-mentioned network device or terminal.
  • the network device or terminal acts as the sender to send data or information
  • this Polar code encoding method when a network device or terminal acts as a receiver to receive data or information, it is also necessary to confirm the segmentation and the HARQ mechanism according to the method of the present invention to perform corresponding decoding.
  • the segmentation and/or retransmission methods provided by the embodiments of the present application will be described in detail below.
  • the present application first provides a mechanism for how to judge and perform data segmentation.
  • Step 210 Determine the amount of data N info actually transmitted
  • N info N RE *R *Qm*v
  • Step 220 determine the number of segments
  • N' info max(TBSmin,2 n *round((N info -TBcrc)/2 n ))
  • TBSmin refers to the minimum transport block size, usually 24 bits
  • round is a rounding operation. In practical applications, this operation can also be changed to rounding up or rounding down, which has a certain impact on subsequent operations.
  • the N' info obtained by rounding up is not less than the N' obtained by round operation. info , and the N' info obtained by the round operation is not less than the N' info obtained by the rounding down, so that the rounding up method will make the final number of segments greater than or equal to the number of segments obtained by the round operation, and the round operation will get The number of segments is greater than or equal to the number of segments obtained by rounding down;
  • TBcrc represents the number of bits used for the CRC check at the transport block (TB) level, typically 16, 24, 32, etc. If TB does not perform CRC check, TBcrc can also be 0;
  • n is the quantization level of the current transport block
  • n min is the minimum quantization level of the transport block.
  • n0 is the quantization adjustment amount, typically 4, 5, 6, etc.;
  • log2() represents a base-2 logarithmic operation.
  • N' info can be regarded as the adjustment of N info according to the quantization level, so as to ensure that the number of included data units is an integer.
  • K_threshold be the preset segment threshold
  • the value of the number of segments C is:
  • the round-up operation note that only the round-up operation can be used here, and the round operation or the round-down operation cannot be used, else means other.
  • the ">” in it can also be “ ⁇ ”, which means that the segmentation is also performed when the threshold value is obtained. In specific applications, it can be determined whether to segment it as needed, which is not limited here.
  • K_threshold Kcb-CBcrc (Formula 3)
  • Kcb is the maximum number of bits to be encoded that can be included in a channel coding coding block, which also includes the number of bits CBcrc of the code block (Code Block, CB) level CRC.
  • CBcrc is 6, 8, 16, 24, 32 equivalent.
  • Nmax is the maximum number of bits that can be transmitted in a single time.
  • Nmax is exactly equal to the maximum mother code length supported during initial transmission.
  • the rounding up it can also be replaced by the round operation or the rounding down. It can be seen from the above formula that the larger the Kcb, the smaller the possibility of segmentation or the smaller the number of segments.
  • Step 230 Determine the TBS and the number of bits to be encoded in each segment
  • the actual TBS that should be transmitted can be obtained as:
  • TBS can be regarded as the result of further adjustment of N' info according to the segmentation situation.
  • TBS here is the size of the data payload that has not yet been checked by CRC, and 2 n2 represents the quantization unit.
  • n2 n1
  • n2 can also be taken as 3
  • 2 n2 can also be directly written as 8.
  • the number K of bits to be encoded included in each segment is:
  • the above method shown in Figure 2 is based on the fact that the TBS has not yet been determined. If the size of the TBS has been clearly known, it is easier to determine whether to segment or not.
  • the number of segments C can be:
  • the ">” can also be “ ⁇ ”, which means that segmentation is also performed when the threshold value is obtained, which is not limited here.
  • the number K of bits to be encoded included in each segment can also be calculated by formula 6.
  • CRC is also referred to as CB-level CRC when involved. That is, the sender performs segmentation after acquiring the transport block, and then encodes the K bits to be encoded in each segment to obtain an encoded sequence or a retransmitted sequence and sends it, while the receiver receives the transport block to be decoded. , wherein each corresponding segment is a received signal (ie, an encoded sequence or a retransmitted sequence) containing K bits of information to be encoded, and is decoded accordingly.
  • the initial transmission scheme of the data channel can consider the multiplexing of the existing 3GPP technology, including the selection of the rate matching scheme and the selection principle of information bits, but Since the transport block supported by the data channel is relatively large, Nmax must be increased, and the corresponding reliability sorting sequence must also be designed, but this is not the scope of the present invention, so it is not limited.
  • a retransmission method is first provided here: that is, when an error occurs in the initial transmission, the first retransmission adopts the incremental redundancy (IR) method, and the subsequent retransmission adopts the chasing combination ( chase combining, CC).
  • IR incremental redundancy
  • CC chase combining
  • RV redundancy version
  • Operation 310 The transmitting end performs Polar encoding on the acquired bit sequence to be encoded, obtains the encoded first bit sequence, and acquires the initial transmission version RV0 according to the rate matching method.
  • This step can adopt the existing technology.
  • the encoded first bit sequence is interleaved and written into the first circular buffer.
  • R0 the original code transmission rate
  • RV0 is The last E0 bits in the first circular buffer; and when R0 is greater than 7/16, a shortened rate matching method is adopted, and at this time RV0 is the first E0 bits in the first circular buffer.
  • R0 K/E0
  • E0 is the number of bits actually transmitted by the air interface in the initial transmission.
  • Operation 320 Determine the length E1 of the retransmission version RV1.
  • E1 is the number of bits that can be transmitted by the air interface of the first retransmission, and the specific value method is the same as the method for determining E0.
  • Operation 330 Determine RV1 according to the initial transmission code rate R0 and the retransmission rate matching manner.
  • RV1 When R0 is less than or equal to the preset code rate threshold R_threshold (ie, R0 ⁇ R_threshold), the RV1 version with the length E1 can be directly read from the first circular buffer of the initial transmission.
  • the R_threshold can take any value between 1/4 and 1/2, such as 1/4, 3/8, 7/16, 15/32, 1/2 and so on.
  • RV1 may be the first E1 bits in the first circular buffer or the E1 bits read in clockwise order from the starting point of the first circular buffer. In this way, the bits not transmitted in the initial transmission can be preferentially put into RV1. It is also possible to determine how to read RV1 from the first circular buffer according to the rate matching method of retransmission in a similar manner to the initial transmission. It is not limited here.
  • an IR method can be used to generate the encoded second bit sequence, and according to including but not limited to code rate, Nmax, mother code length N0, E0 used in the initial transmission encoding , E1 and other parameters to perform rate matching to obtain RV1.
  • the rate matching method of retransmission is repetition; otherwise, when R0 is less than or equal to the preset code rate threshold R_threshold_initial, the rate matching method of retransmission is puncturing, and R0 is greater than the preset rate threshold R_threshold_initial.
  • the code rate threshold is R_threshold_initial, the rate matching mode of retransmission is shortened.
  • R_threshold_initial is the threshold for judging the rate matching method during initial transmission. In the 5G NR standard, its value is 7/16. Of course, it can also be other preset values.
  • the rate matching mode of retransmission can be shortening, puncturing, or a combination of the two.
  • the rate matching bits during retransmission are composed of two parts: punctured bits and shortened bits, wherein the number and position of shortened bits are the same as the number and position of shortened bits when the initial transmission rate is matched;
  • the number of puncturing bits is E0-E1, and the position of puncturing bits can be determined according to the puncturing method of NR rate matching.
  • the rate matching bits during retransmission are composed of punctured bits, where the number of punctured bits is N0-E1, and the position of the punctured bits can be determined according to the puncturing method of NR rate matching.
  • part of the bit positions can also be pre-frozen, but different from the way in which the existing NR protocol determines the pre-frozen bit positions, this application proposes a new method for determining the pre-frozen bit positions. ,details as follows:
  • the number of punctured bits P i in the i-th sub-block exceeds a preset value, then other polarized sub-channels corresponding to this sub-block are determined as pre-frozen polarized sub-channels, wherein the preset value can be A constant, such as 0, 1, 10, 16, etc.; or
  • the number of punctured bits P i in the i-th sub-block exceeds the preset ratio of the total number of polarized sub-channels corresponding to this sub-block, then other polar sub-channels corresponding to this sub-block are determined as pre-frozen polarized sub-channels. channel, wherein the preset ratio may be 1/16, 1/8, 1/4, 1/2, etc.
  • Operation 330a Obtain the sub-channel set Q1, and Q1 includes K elements, and these elements are the sequence numbers of the K sub-channels used to place the K bits to be encoded in the initial transmission, which can be obtained together in operation 310;
  • the sub-channel sequence numbers are numbered from 0 as an example for description. If the numbering starts from 1, you can add 1 accordingly, and will not repeat them;
  • the reason for not being 0 is that some CRC checks may need to be performed again during retransmission to improve the reliability of retransmission.
  • the value of CBcrc1 can be set as follows Either way determine:
  • ⁇ Method 1 set to 0;
  • Operation 330d determine the extended to-be-coded bit set Qext, the elements of which are elements less than N0 in Q3;
  • CBcrc1 when
  • Chk_threshold is the preset threshold value, the typical value can be 10, 50, etc.
  • the value of CBcrc1 is adjusted to the second preset value, and the second preset value is smaller than the first A preset value, for example, adjusted from 8 to 6 or adjusted to 3, etc.;
  • Operation 330f Select part or all of the bit values on the sub-channels in the Qchk and copy them to the corresponding sub-channels of the Qext one by one.
  • -CBcrc1 sub-channels from Qchk can be from front to back or from back to front in natural order, or from front to back according to the reliability of these sub-channels
  • the selection method can be consistent or inconsistent, and there is no limitation here; when
  • Operation 330g Perform retransmission coding on the K bits to be coded with a Polar code whose mother code length is N1 according to the positions and values determined above, to obtain a polar coded second bit sequence, and then according to the retransmission rate matching method from RV1 is obtained from the first N0 bits of the second bit sequence.
  • the manner of obtaining RV1 from the first N0 bits may be consistent with the manner of obtaining RV0 from the first bit sequence.
  • E1 is exactly equal to E0, which is also equal to 60
  • the 8 subchannels except 31 and 46 in Qext can be used to carry the newly added CRC bits.
  • the values of sub-channels 70 and 71 selected in Qchk can be copied to sub-channels 46 and 31 respectively.
  • the 8 CRC bits are used to perform CRC check on the 2 bits. It can be seen that in this case, the 8 CRC bits are obviously redundant, so in practical applications, there is another possibility, that is, when the number of bits to be encoded is in the first interval, it is not necessary to add CRC bits, but in the second interval In the interval, CRC bits need to be added, or fewer CRC bits are added in the third interval, and more CRC bits are added in the fourth interval.
  • the 8 sub-channels 47, 51, 53, 54, 55, 57, 58, and 59 of Qext can be used to carry the newly added CRC bits, and the bits on the 6 sub-channels in Qchk can be copied to 29, 30, 31,
  • the bits of sub-channel 70 are copied to sub-channel 46
  • the bits of sub-channel 74 are copied to sub-channel 45
  • the bits of sub-channel 97 are copied to sub-channel 29.
  • Operation 340 cascading RV0 and RV1 into the second circular buffer
  • Operation 350 Further retransmission.
  • the bit transmitted in the xth time can be the Ex bits (the number of bits transmitted by the air interface) that are read from the first bit after the last bit position of the previous transmission, or it can be the RV version used in the previous transmission ( The first bit position after the last bit position of RV0 or RV1) starts to read Ex bits, x is greater than 1.
  • step 330 of determining RV1 (330 solution 1) can also be implemented in another way:
  • RV1 is changed from the first
  • the bits from the mod(N0-(E0+E1), N0)th position to the mod(N0-E0-1, N0)th position in the circular buffer are arranged in the order in which they are in the first circular buffer, wherein mod represents the modulo operation. Note that the position number here starts from 0; or, when the initial code transmission rate R0 is greater than R_threshold, RV1 is determined by the first circular buffer.
  • the bits from the E0, N0)) position to the mod(min(E0, N0)-1, min(E0, N0)) position are arranged according to their order in the first circular buffer.
  • the 330 scheme 2 gives priority to the bits that were not involved in the transmission during the initial transmission during retransmission, and the process is simplified. Therefore, in practice, either the retransmission method shown in 330 scheme 1 or the retransmission method shown in 330 scheme 2 can be adopted. In particular, these two modes can also be supported at the same time to meet different needs. In this case, the downlink control signaling DCI or radio resource control signaling RRC or other control signaling can be used to explicitly or implicitly inform The specific retransmission mode makes it clear that the retransmission mode adopted by the receiving end and the transmitting end in a unified manner is the 330 scheme one or the 330 scheme two.
  • the channel interleaving operation can also be performed on the transmitted bits after rate matching.
  • the bits to be transmitted can be input into the channel interleaver and then the interleaved bits can be transmitted, which is generally optional.
  • the interleaver is a row-column interleaver, which can be written in rows, read out in columns, or write in columns and read out in rows; in order to make the transmission bits more evenly distributed in the interleaver and ensure random performance, the row-column interleaver
  • RV1 is determined in separate steps as shown in FIG. 3 , in practical applications, some of the steps can be combined or the sequence of computation can be changed without affecting the final result.
  • an embodiment of the present application further provides a sending apparatus 600 .
  • Part or all of the segmentation method shown in FIG. 2 and the retransmission method shown in FIG. 3 and FIG. 4 may be implemented by hardware or by software.
  • the sending apparatus 600 is configured to execute the segmentation and retransmission methods shown in FIGS. 2-5.
  • the sending device 600 includes: an input interface circuit 601 for acquiring a transmission block to be transmitted; a logic circuit 602 for executing the segmentation and retransmission methods shown in Figures 2-5 above.
  • the output interface circuit 603 is configured to output the encoded sequence or the retransmitted sequence.
  • the encoded sequence or the retransmitted sequence is output to the transceiver 620, and the transceiver 620 performs corresponding processing (including but not limited to digital-to-analog conversion and/or frequency conversion, etc.) on the encoded sequence or the retransmitted sequence. sent out through the antenna 630.
  • the sending apparatus 600 may be a chip or an integrated circuit during specific implementation.
  • the sending apparatus 700 includes: a memory 701 for storing programs; a processor 702 for using For executing the program stored in the memory 701, when the program is executed, the sending apparatus 700 can implement the segmentation and retransmission methods provided by the above embodiments.
  • the above-mentioned memory 701 may be a physically independent unit, or may be integrated with the processor 702 .
  • the sending apparatus 700 may only include the processor 702 .
  • the memory 701 for storing programs is located outside the transmitting device 700 , and the processor 702 is connected to the memory 701 through circuits/wires for reading and executing the programs stored in the memory 701 .
  • an embodiment of the present application further provides a sending device 800 for executing the segmentation and retransmission method shown in FIG. 2-5 , the sending device 800 includes:
  • an obtaining unit 801 configured to obtain a transmission block to be transmitted
  • a segmentation unit 802 configured to segment the transport block to be transmitted according to the segmentation method in the embodiment shown in FIG. 2;
  • an encoding unit 803, configured to encode or retransmit encoding for each segment of the segmented transport block
  • the determining unit 804 is configured to determine the RV0 version and the RV1 version according to the retransmission method of the embodiment shown in FIG. 3-5 .
  • the device at the receiving end can also be similarly designed.
  • the receiving apparatus 900 includes: an input interface circuit 901 for inputting a received signal, a logic circuit 902 for performing the foregoing segmentation and retransmission methods for decoding to obtain a decoding result; an output interface circuit 903 for Output the decoded result.
  • the receiving apparatus 900 may further include the transceiver 920 to obtain the received signal through the antenna 930 . In specific implementation, it may be a chip or an integrated circuit.
  • the receiving apparatus 1000 includes: a memory 1001 for storing programs; a processor 1002 for using For executing the program stored in the memory 1001, when the program is executed, the receiving apparatus 1000 can implement the segmentation and retransmission methods provided by the above embodiments.
  • the above-mentioned memory 1001 may be a physically independent unit, or the processor 1002 may be integrated together.
  • the receiving 1000 may only include the processor 1002 .
  • the memory 1001 for storing programs is located outside the receiving device 1000 , and the processor 1002 is connected to the memory 1001 through circuits/wires for reading and executing the programs stored in the memory 1001 .
  • Processor 702 and/or processor 1002 may be a central processing unit (CPU), a network processor (NP), or a combination of CPU and NP.
  • CPU central processing unit
  • NP network processor
  • the processor 702 and/or the processor 1002 may further include hardware chips.
  • the above-mentioned hardware chip may be an application-specific integrated circuit (ASIC), a programmable logic device (PLD) or a combination thereof.
  • the above-mentioned PLD may be a complex programmable logic device (CPLD), a field-programmable gate array (FPGA), a general-purpose array logic (generic array logic, GAL) or any combination thereof.
  • the memory in the above-mentioned embodiments may include volatile memory (volatile memory), such as random-access memory (RAM); the memory may also include non-volatile memory (non-volatile memory), such as flash memory Memory (flash memory), hard disk drive (HDD) or solid-state drive (solid-state drive, SSD); the memory may also include a combination of the above-mentioned types of memory.
  • volatile memory such as random-access memory (RAM)
  • non-volatile memory such as flash memory Memory (flash memory), hard disk drive (HDD) or solid-state drive (solid-state drive, SSD
  • flash memory flash memory Memory
  • HDD hard disk drive
  • SSD solid-state drive
  • an embodiment of the present application further provides a receiving device 1100.
  • the receiving apparatus 1100 is configured to execute the foregoing segmentation and retransmission method.
  • the receiving apparatus 1100 includes:
  • a segmentation unit 1102 configured to segment the transport block to be transmitted according to the segmentation method in the embodiment shown in FIG. 2;
  • a determining unit 1103, configured to determine the RV0 version and the RV1 version according to the retransmission method of the embodiment shown in Figures 3-5;
  • the decoding unit 1104 is configured to decode each received transport block.
  • Embodiments of the present application further provide a computer storage medium storing computer program instructions, and when the computer program instructions are executed by a computer, the foregoing segmentation and retransmission methods are executed.
  • Embodiments of the present application also provide a computer program product containing instructions, which, when executed on a computer, cause the foregoing segmentation and retransmission method to be executed.
  • the embodiments of the present application may be provided as a method, a system, or a computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment, or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, etc.) having computer-usable program code embodied therein.
  • computer-usable storage media including, but not limited to, disk storage, CD-ROM, optical storage, etc.
  • These computer program instructions may also be stored in a computer-readable memory capable of directing a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory result in an article of manufacture comprising instruction means, the instructions
  • the apparatus implements the functions specified in the flow or flow of the flowcharts and/or the block or blocks of the block diagrams.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Physics & Mathematics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Theoretical Computer Science (AREA)
  • Detection And Prevention Of Errors In Transmission (AREA)
  • Error Detection And Correction (AREA)

Abstract

本申请公开了一种用于分段和重传的方法及装置，包括：发送装置获取待传传输块后进行分段，然后对每一段中的待编码比特进行新的编码，得到编码后的第一比特序列，所述第一比特序列的长度为N0，确定初传版本RV0；确定重传版本RV1的长度E1；根据初传码率R0确定重传版本RV1；根据RV0和/或RV1确定重传的数据。该方法能在兼顾现有标准的基础上以较为简便的方式实现了重传。

Description

一种重传方法及装置 技术领域
本申请实施例涉及通信技术领域，尤其涉及一种重传方法及装置。
背景技术
信道编码作为最基本的无线接入技术，在保证数据的可靠性传输方面起到至关重要的作用。在现有的无线通信系统中，一般采用Turbo码、低密度奇偶校验码(low density parity check，LDPC)和极化(Polar)码进行信道编码。Turbo码不能够支持过低或过高码率的信息传输。而对于中短包传输，Turbo码和LDPC码也由于自身编译码的特点，在有限码长下很难达到理想的性能。在实现方面，Turbo码和LDPC码在编译码实现过程中具有较高的计算复杂度。Polar码是理论上证明可以取得香农容量，且具有相对简单的编译码复杂度的好码，因而得到了越来越广泛的应用。在第五代(5th generation，5G)通信系统中，将Polar码确定为控制信道的编码方式。因此在标准中详细的规定了Polar码的编码流程，包括分段、确定速率匹配方式、信息比特和校验比特(包括循环冗余校验比特和/或奇偶校验比特)在极化信道上的映射、编码、速率匹配等具体的过程。
但也正因为在5G标准中Polar码只用于控制信道，因此不涉及混合自动重传请求(Hybrid Automatic Repeat reQuest，HARQ)的机制设计。而在数据信道中，HARQ的引入将有效的增强传输的可靠性并进而增大系统的吞吐量。所以如何针对Polar码的编码机制，设计合适的HARQ方案，就成为将Polar码应用到数据信道传输这一课题亟需解决的问题。
发明内容
本申请实施例提供一种应用于无线通信的重传方法及装置，具有实现简单的优点。
本申请实施例提供的具体技术方案如下：
第一方面，提供一种重传方法，其特征在于，包括：
发送装置获取包括K待编码比特的待编码比特序列，K为正整数；
对所述待编码序列进行极化编码，得到编码后的第一比特序列，所述第一比特序列的长度为N0，确定初传版本RV0；
确定重传版本RV1的长度E1；
根据初传码率R0确定重传版本RV1；
发送所述RV1。
通过这样的实施方法，一方面尽量复用了现有标准中的设计，另一方面又吸纳了现有HARQ机制的优点，因此实现简单，性能也能满足需求。
在一种可能的设计中，所述根据初传码率R0确定重传版本RV1包括：
当R0小于或等于预设的码率门限R_threshold时，所述RV1为从初传的第一循环缓存中读取的E1个比特；或者
当R0大于R_threshold时，采用增量冗余IR的方式生成编码后的第二比特序列，根据所述第二比特序列获取RV1，所述第二比特序列长度为N1，N1＝2*N0。
在一种可能的设计中，所述根据所述第二比特序列获取RV1为：
获取子信道集合Q1，所述Q1中包括K个元素，所述K个元素是初传中用于放置所述K个待编码比特的K个子信道的序号；
获取子信道集合Q2，其中Q2(i)＝Q1(i)+N0,其中i＝0,1,…,K-1，其中N0为初传时采用的极化码的母码长度；
获取子信道集合Q3，其中Q3(i)<N0或者Q3(i)∈Q2其中i＝0,1,…,K-1；
确定扩展待编码比特集合Qext，其中的元素为所述Q3中小于N0的元素；
确定复制比特集合Qchk＝Q2\(Q3\Qext)；
根据所述Q2、所述Q3、所述Qext、所述Qchk对所述K个待编码比特进行母码长度为N1的Polar码编码，得到所述第二比特序列。
在一种可能的设计中，所述Q3是根据长度为N1的可靠度排序序列以及重传的速率匹配方式确定的。
在一种可能的设计中，所述根据所述Q2、所述Q3、所述Qext、所述Qchk对所述K个待编码比特进行母码长度为N1的Polar码编码包括：
选取部分或全部Qchk中的子信道上的比特值逐个复制到对应的Qext的子信道上。
在一种可能的设计中，所述根据所述第二比特序列获取RV1为：
根据重传的速率匹配方式从第二比特序列的前N0个比特中得到RV1。
在一种可能的设计中，在所述发送装置获取包括K待编码比特的待编码比特序列前，还包括：
根据传输块大小TBS进行分段。
在一种可能的设计中，
所述分段的段数C为：
Figure PCTCN2021106609-appb-000001
其中TBcrc为传输块TB级的循环冗余校验CRC比特个数，K_threshold为预设的第一门限。
在一种可能的设计中，
Figure PCTCN2021106609-appb-000002
其中CBcrc为码块CB级的CRC比特个数。
在一种可能的设计中，
Figure PCTCN2021106609-appb-000003
其中2 n2为量化单位，n2为正整数，N′ iefo为可传输的数据量Ninfo根据量化级别进
行的调整。
在一种可能的设计中，所述N′ info为：
N′ info＝max(TBSmin,2 n*round((N info-TBcrc)/2 n))
Figure PCTCN2021106609-appb-000004
其中：TBSmin为指最小的传输块大小，round为四舍五入取整操作，n为待传输的传输块的量化级别，n min为最小量化级别，n0为量化调整量，
Figure PCTCN2021106609-appb-000005
为下取整操作。
在一种可能的设计中，所述方法还包括：
所述发送装置将RV0和RV1级联输入第二循环缓存；
所述发送装置根据RV0和RV1进行重传。
第二方面，提供一种重传方法，其特征在于：
接收装置接收包含K个待编码比特的信息的接收信号，所述接收信号对应的母 码长度N0，确定初传版本RV0；
确定重传版本RV1的长度E1；
根据初传码率R0确定重传版本RV1；
根据所述RV0和RV1进行解码。
在一种可能的设计中，所述根据初传码率R0确定重传版本RV1包括：
当R0小于或等于预设的码率门限R_threshold时，所述RV1为从初传的第一循环缓存中读取的E1个比特；或者
当R0大于R_threshold时，采用增量冗余IR的方式生成编码后的第二比特序列，根据所述第二比特序列获取RV1，所述第二比特序列长度为N1，N1＝2*N0。
在一种可能的设计中，所述根据所述第二比特序列获取RV1为：
获取子信道集合Q1，所述Q1中包括K个元素，所述K个元素是初传中用于放置所述K个待编码比特的K个子信道的序号；
获取子信道集合Q2，其中Q2(i)＝Q1(i)+N0,其中i＝0,1,…,K-1，其中N0为初传时采用的极化码的母码长度；
获取子信道集合Q3，其中Q3(i)<N0或者Q3(i)∈Q2其中i＝0,1,…,K-1；
确定扩展待编码比特集合Qext，其中的元素为所述Q3中小于N0的元素；
确定复制比特集合Qchk＝Q2\(Q3\Qext)；
根据所述Q2、所述Q3、所述Qext、所述Qchk对所述K个待编码比特进行母码长度为N1的Polar码编码，得到所述第二比特序列。
在一种可能的设计中，所述Q3是根据长度为N1的可靠度排序序列以及重传的速率匹配方式确定的。
在一种可能的设计中，所述根据所述Q2、所述Q3、所述Qext、所述Qchk对所述K个待编码比特进行母码长度为N1的Polar码编码包括：
选取部分或全部Qchk中的子信道上的比特值逐个复制到对应的Qext的子信道上。
在一种可能的设计中，所述根据所述第二比特序列获取RV1为：
根据重传的速率匹配方式从第二比特序列的前N0个比特中得到RV1。
在一种可能的设计中，还包括对接收的待解码传输块根据传输块大小TBS进行分段。
在一种可能的设计中，
所述分段的段数C为：
Figure PCTCN2021106609-appb-000006
其中TBcrc为传输块TB级的循环冗余校验CRC比特个数，K_threshold为预设的第一门限。
在一种可能的设计中，
Figure PCTCN2021106609-appb-000007
其中CBcrc为码块CB级的CRC比特个数。
在一种可能的设计中，
Figure PCTCN2021106609-appb-000008
其中2 n2为量化单位，n2为正整数，N′ info为可传输的数据量Ninfo根据量化级别进
行的调整。
在一种可能的设计中，所述N′ info为：
N′ info＝max(TBSmin,2 n*round((N info-TBcrc)/2 n))
Figure PCTCN2021106609-appb-000009
其中：TBSmin为指最小的传输块大小，round为四舍五入取整操作，n为待传输的传输块的量化级别，n min为最小量化级别，n0为量化调整量，
Figure PCTCN2021106609-appb-000010
为下取整操作。
在一种可能的设计中，所述方法还包括：
所述发送装置将RV0和RV1级联输入第二循环缓存；
所述发送装置根据RV0和RV1进行重传。
第三方面，提供一种发送装置，该装置具有实现上述第一方面和第一方面的任一种可能的设计中所述的方法的功能。所述功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个与上述功能相对应的模块。
在一个可能的设计中，当所述功能的部分或全部通过硬件实现时，所述发送装置包括：输入接口电路，用于获取待传传输块；逻辑电路，用于执行上述第一方面和第一方面的任一种可能的设计中所述的行为；输出接口电路，用于输出编码后的序列或者重传的序列。
可选的，所述发送装置可以是芯片或者集成电路。
在一个可能的设计中，当所述功能的部分或全部通过软件实现时，所述发送装置包括：存储器，用于存储程序；处理器，用于执行所述存储器存储的所述程序，当所述程序被执行时，所述发送装置可以实现如上述第一方面和第一方面的任一种可能的设计中所述的方法。
可选的，上述存储器可以是物理上独立的单元，也可以与处理器集成在一起。
在一个可能的设计中，当所述功能的部分或全部通过软件实现时，所述发送装置包括处理器。用于存储程序的存储器位于所述发送装置之外，处理器通过电路/电线与存储器连接，用于读取并执行所述存储器中存储的程序。
在一个可能的设计中，所述装置为网络设备或终端。
第四方面，提供一种接收装置，该装置具有实现上述第二方面和第二方面的任一种可能的设计中所述的方法的功能。所述功能可以通过硬件实现，也可以通过硬件执行相应的软件实现。所述硬件或软件包括一个或多个与上述功能相对应的模块。
在一个可能的设计中，当所述功能的部分或全部通过硬件实现时，所述接收装置包括：输入接口电路，用于获取接收信号；逻辑电路，用于执行上述第二方面和第二方面的任一种可能的设计中所述的行为；输出接口电路，用于输出解码结果。
可选的，所述接收装置可以是芯片或者集成电路。
在一个可能的设计中，当所述功能的部分或全部通过软件实现时，所述接收装置包括：存储器，用于存储程序；处理器，用于执行所述存储器存储的所述程序，当所述程序被执行时，所述发送装置可以实现如上述第一方面和第一方面的任一种可能的设计中所述的方法。
可选的，上述存储器可以是物理上独立的单元，也可以与处理器集成在一起。
在一个可能的设计中，当所述功能的部分或全部通过软件实现时，所述接收装置包括处理器。用于存储程序的存储器位于所述接收装置之外，处理器通过电路/电线与存储器连接，用于读取并执行所述存储器中存储的程序。
在一个可能的设计中，所述装置为网络设备或终端。
第五方面，提供了一种计算机存储介质，存储有计算机程序，该计算机程序包括用于 执行第一方面和第一方面的任一可能设计中任一种所述的方法的指令。
第六方面，提供了一种计算机存储介质，存储有计算机程序，该计算机程序包括用于执行第二方面和第二方面的任一可能设计中任一种所述的方法的指令。
第七方面，本申请实施例提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述各方面所述的方法。
第八方面，提供了一种无线设备，包括用于实施第一方面和第一方面的任一可能设计的发送装置和收发器，
所述收发器用于接收或发送信号。
在一个可能的设计中，所述无线设备为终端或者网络设备。
第九方面，提供了一种无线设备，包括用于实施第二方面和第二方面的任一可能设计的接收装置和收发器，
所述收发器用于接收或发送信号。
在一个可能的设计中，所述无线设备为终端或者网络设备。
附图说明
图1为本申请实施例中应用的通信系统架构示意图；
图2为本申请实施例中分段方法的流程示意图；
图3为本申请实施例中RV版本确认的流程示意图；
图4为本申请实施例中RV1版本确认的流程示意图；
图5为本申请实施例中比特复制示意图；
图6为本申请实施例中发送装置结构示意图之一；
图7为本申请实施例中发送装置结构示意图之二；
图8为本申请实施例中发送设备示意图；
图9为本申请实施例中接收装置结构示意图之一；
图10为本申请实施例中接收装置结构示意图之二；
图11为本申请实施例中接收设备示意图。
具体实施方式
下面将结合附图，对本申请实施例进行详细描述。
在考虑将Polar码推广到数据信道时，一个合理的想法是尽量复用现有5G标准中的Polar码编码方法，例如不同长度的母码序列之间的嵌套特性，速率匹配方式的选取原则等等，当然在本申请中，对此也并不限制。
本申请实施例提供一种Polar码编码方法，具体地，包括新型的数据分段和HARQ方法。
为方便对本申请实施例的理解，下面对Polar码作简单介绍。
Polar码的编码策略利用无噪信道传输用户有用的信息，全噪信道传输约定的信息或者不传信息。Polar码也是一种线性块码，其编码矩阵为G N，编码过程为
Figure PCTCN2021106609-appb-000011
其中
Figure PCTCN2021106609-appb-000012
是一个二进制的行矢量，长度为N(即码长，可以看到，编码前后的序列x和u的长度均为N，N也称为母码码长)；G N是一个N×N的矩阵，且
Figure PCTCN2021106609-appb-000013
Figure PCTCN2021106609-appb-000014
定义为log 2N个矩阵F 2的克罗内克(Kronecker)乘积。上述矩阵
Figure PCTCN2021106609-appb-000015
在有些实施方案中，G N中还包括一个转置矩阵B N，不过不影响Polar编码的实质，因此不做限定，本申请还是以不引入B N的方案为例。
Polar码的编码过程中，
Figure PCTCN2021106609-appb-000016
中的一部分比特用来携带信息，称为信息比特集合，这些比特的索引的集合记作A；另外的一部分比特设置为接收端和发送端预先约定的固定值，称之为冻结比特集合或冻结比特(frozen bits)集合，其索引的集合用A的补集A c表示。Polar码的编码过程相当于：
Figure PCTCN2021106609-appb-000017
这里，G N(A)是G N中由集合A中的索引对应的那些行得到的子矩阵，G N(A C)是G N中由集合A c中的索引对应的那些行得到的子矩阵。u A为
Figure PCTCN2021106609-appb-000018
中的信息比特集合，数量为K，一般地，包括但不限于循环冗余校验(Cyclic Redundancy Check，简称CRC)比特、奇偶校验(Parity Check，简称PC)比特在内的各类校验比特中的一种或多种也可以都包括在信息比特集合中；
Figure PCTCN2021106609-appb-000019
为
Figure PCTCN2021106609-appb-000020
中的冻结比特集合，其数量为(N-K)，是已知比特。这些冻结比特通常被设置为0，但是只要接收端和发送端预先约定，冻结比特可以被任意设置。从而，Polar码的编码输出可简化为：
Figure PCTCN2021106609-appb-000021
这里u A为
Figure PCTCN2021106609-appb-000022
中的信息比特集合，u A为长度K的行矢量，即|A|＝K，|·|表示集合中元素的个数，K为信息块大小，G N(A)是矩阵G N中由集合A中的索引对应的那些行得到的子矩阵，G N(A)是一个K×N的矩阵。
在确定母码码长N后，Polar码的构造过程即集合A的选取过程，决定了Polar码的性能。Polar码的构造过程通常是，根据母码码长N确定共存在N个极化子信道，分别对应编码矩阵的N个行，在不考虑速率匹配的情况下，将可靠度较高的前K个极化子信道的索引作为集合A的元素，剩余(N-K)个极化子信道对应的索引作为冻结比特的索引集合A c的元素。集合A决定了信息比特的位置，集合A c决定了冻结比特的位置。极化子信道的序号即为信息比特或者冻结比特的位置索引，也即在
Figure PCTCN2021106609-appb-000023
中的位置索引。
当考虑速率匹配的时候，主要是考虑打孔(puncture)或缩短(shorten)的时候，一般是先确定需要打孔或缩短(即删除)的N-E个极化子信道，这里E是目标码长，即速率匹配后的比特序列长度，这里选出的N-E个极化子信道用于放置冻结比特，在5G新空口(New Radio，NR)标准中，针对打孔的情形，还额外确定了一些称为预冻结的极化子信道，也用于放置冻结比特，这里不妨将预冻结的极化子信道数量定义为P，P大于或者等于0(对于缩短的情形，P显然为0，这时候是可以不需要考虑P的)，然后在剩下的E-P个极化子信道中按照可靠度挑选其中可靠度较高的K个极化子信道用于放置K个信息比特。当然，也可以先选择可靠度较低的E-P-K个子信道用于放置冻结比特，而余下的K个子信道则用于放置信息比特。放置K个信息比特的K个极化子信道中的任意一个极化子信道的可靠度都高于用于放置冻结比特的E-P-K个子信道中的任意一个子信道的可靠度。在本申请中，对P的取值不做限制，即使对于打孔的情形，P也可以为0，即使对于缩短的情形，P也可以取为大于0，并不影响本申请技术方案的实施，无论是编码端还是解码端，确认K个子信道用于放置K个信息比特的原则和方法是一致的。同时，5G NR标准中，对于N-E个极化子信道 的选取，是将子块交织(例如分成32个子块)后的序列放到循环缓存(英文为circular buffer，相当于速率匹配序列)上，如果是打孔，则在循环缓存上从第N-E个位置开始读取，丢弃从0到N-E-1位置上的比特，如果是缩短，则在循环缓存上从第0个位置开始读取直至第E-1个位置，而丢弃从第E到N-1位置上的比特。这种方式并未考虑不同母码长度之间的速率匹配序列之间的关系。
需要说明的是，这里说的可靠度的相对关系是基于一个给定的可靠度的计算方式，不同的可靠度计算方式可能会导致极化子信道的可靠度相对关系发生变化，但选择放置信息比特的极化子信道的方法是一样的。在5G NR标准之外，信息比特也可以考虑放置于最后被打孔或者缩短的极化子信道。本申请并不限制必须按照5G NR的标准选择放置信息比特的极化子信道。
当数据信道的传输块大小(Transport Block Size，TBS)过大时，需要将传输块分段，以上的介绍涉及的方案可以认为是对每一个分段进行Polar编码的实施方案。
图1为本发明实施例无线通信网络的结构示意图。图1只是一种示例，其它能用到本发明实施例的分段、重传方法或装置的无线网络也都在本发明的保护范围内。
如图1所示，无线通信网络100包括网络设备110，和终端112。当无线通信网络100包括核心网102时，该网络设备110还可以与核心网102相连。网络设备110还可以与IP网络104进行通信，例如，因特网(internet)，私有的IP网，或其它数据网等。网络设备为覆盖范围内的终端提供服务。例如，参见图1所示，网络设备110为网络设备110覆盖范围内的一个或多个终端112提供无线接入。除此之外，网络设备之间的覆盖范围可以存在重叠的区域，例如网络设备110和120。网络设备之间还可以可以互相通信，例如，网络设备110可以与网络设备120之间进行通信。
上述网络设备可以是用于与终端设备进行通信的设备。例如，可以是LTE系统中的演进型基站(Evolved Node B，eNB或eNodeB)，还可以是5G网络中的gNB，还可以是卫星通信中的卫星，或者未来通信系统中的网络侧设备等。或者该网络设备还可以是中继站、接入点、车载设备等。在设备对设备(Device to Device，D2D)通信系统、机器对机器(Machine to Machine，M2M)通信系统和车联网系统中，该网络设备还可以是担任基站功能的终端。
上述终端可以指用户设备(User Equipment，UE)、接入终端、用户单元、移动站、远方站、远程终端、移动设备、用户终端、无线通信设备、用户代理或用户装置。接入终端可以是蜂窝电话、无绳电话、会话启动协议(Session Initiation Protocol，SIP)电话、无线本地环路(Wireless Local Loop，WLL)站、个人数字处理(Personal Digital Assistant，PDA)、具有无线通信功能的手持设备、计算设备或连接到无线调制解调器的其它处理设备、车载设备、可穿戴设备，未来通信网络中的终端设备等。
基于图1所示的通信系统架构，本申请实施例中，执行Polar码编码方法的执行主体可以为上述网络设备或终端，当网络设备或终端作为发送端发送数据或信息时，均可以采用此Polar码编码方法。相应的，当网络设备或终端作为接收端接收数据或信息时，也需要根据本发明所述的方法确认分段和HARQ机制以进行相应的解码。下面将对本申请实施例提供的分段和/或重传方法做详细介绍。
基于图1所示的通信系统架构，如图2所示，本申请首先提供了一种如何判断及进行 数据分段的机制。
步骤210：确定实际传输的数据量N info；
根据系统调度的资源数量N RE(Resource Element，资源单元)、码率(R)、调制阶数(Qm)、流数(v)，确定空口可传输的数据量为N info＝N RE*R*Qm*v，需要注意的是，实际应用中Ninfo也可以通过其他方式确认，例如在多输入多输出系统中，有可能支持的多个流支持不同的调制方式，那么这种情况下的计算方式就是各个流可传输的数据量之和而不再是乘积。本申请不作限定；
步骤220：确定分段数目；
令：
N′ info＝max(TBSmin,2 n*round((N info-TBcrc)/2 n))
其中
Figure PCTCN2021106609-appb-000024
TBSmin是指最小的传输块大小，通常可取为24比特；
round为四舍五入取整操作，实际应用中该操作也可以改为上取整或下取整，对后续的操作有一定的影响，比如上取整得到的N′ info不小于round操作得到的N′ info，而round操作得到的N′ info不小于下取整得到的N′ info，这样就使得上取整方式会使得最终的分段数目大于或等于round操作得到的分段数目，而round操作得到的分段数目大于或者等于下取整方式得到的分段数目；
TBcrc表示用于传输块(Tansport Block，TB)级的CRC校验的比特数，典型的可以取16、24、32等值，如果TB不进行CRC校验，TBcrc还可以为0；
n为当前传输块的量化级别，n min为传输块的最小量化级别，这里的量化指的是传输块包括的数据单元数，一般取n min＝3，表示一个数据单元包括2的3次方个比特，即8个比特，相当于一个字节，如果n＝3，所谓量化就可以指传输块包括了多少个字节。n0为量化调整量，典型的可以取4,5,6等值；
Figure PCTCN2021106609-appb-000025
为下取整操作，这里也可以改成round操作或者上取整，对系统的影响主要看是导致N′ info变大还是变小；
log2()表示2为底的对数操作。
从上述描述可以看成，N′ info可以看成N info根据量化级别进行的调整，从而确保包括数据单元的数量是整数。
设K_threshold为预设的分段门限，则分段段数C的取值为：
Figure PCTCN2021106609-appb-000026
其中为
Figure PCTCN2021106609-appb-000027
上取整操作，注意这里只能是上取整操作，而不能用round操作或者下取 整操作，else表示其他。另外，其中的“>”也可以为“≥”，表示在取到门限值时也进行分段，在具体应用中可根据需要确定是否将之分段，这里不做限制。
K_threshold＝Kcb-CBcrc          (公式三)
Kcb为一个信道编码编码块所能包括的最多待编码比特数，其中也包括码块(Code Block，CB)级CRC的比特数CBcrc，CBcrc的典型取值为6,8,16,24,32等值。一个较为常用的取法是
Figure PCTCN2021106609-appb-000028
其中Nmax为单次可传输的最大比特数，当应用于Polar码编码时，Nmax数值上正好等于初次传输时支持的最大母码长度，2 n1表示量化单位，可以对应上述的最小量化级别，例如n1＝3，即按字节为单位进行量化，因此2 n1也可以直接写成8。至于其中的上取整也可以换成round操作或者下取整，从上述公式可以看出，Kcb越大，则意味着分段的可能性变小或者段数趋向于变小。
步骤230：确定TBS和每一段的待编码比特数量
确定段数C后，就可以得到实际应传的TBS为：
Figure PCTCN2021106609-appb-000029
由上式可以看出TBS可以看成是N′ info根据分段情况进一步调整的结果。注意这里的TBS是尚未进行CRC校验的数据载荷大小，2 n2表示量化单位，一般地取n2＝n1，因此n2也可以取为3，2 n2也可以直接写成8。
相应地，每一段中包括的待编码比特数K为：
Figure PCTCN2021106609-appb-000030
注意C＝1的时候，由于没有分段，也即TB等于CB，因此只需进行一次CRC校验即可。公式六中采用了TB级CRC，实际应用中也可以根据规定改为CBcrc，只需收发两端统一即可。
虽然如图2中以分开的多个步骤多个公式进行分段的判断和TBS的计算，实际应用中可以合并其中的部分甚至全部公式及步骤或者在不影响最终结果的前提下对计算的前后顺序做出改变。
以上如图2所示的方法是基于尚未确定TBS的情况下，如果已经明确知道TBS的大小，那么判断是否分段就更简单了，分段数目C可以是：
Figure PCTCN2021106609-appb-000031
类似的，其中的“>”也可以为“≥”，表示在取到门限值时也进行分段，这里不做限制。
至于每一段中包括的待编码比特数K同样可以采用公式六计算。
需要指出的是，上述的分段方式适用于包括Polar编码、LDPC编码在内的多种信道编码。
由于分段后的每一段传输块的处理原则和方法都一致，因此以下实施例均按C＝1的情况进行叙述，其中涉及到CRC时也是指CB级的CRC。也即，发送端在获取传输块后进行分段，然后在每一段中对K个待编码比特进行编码得到编码后的序列或者重传的序列然后发送，而在接收端则接收待解码传输块，其中相应的每一段为包含K个待编码比特的信息的接收信号(即编码后的序列或者重传的序列)，并进行相应的解码。
那么，在采用Polar码作为数据信道的信道编码方式时，如果在初次传输(简称初传)出错后，又如何进行重传呢？在现有的3GPP协议中并未规定Polar码的HARQ方案，因此，一方面，数据信道的初次传输方案可以考虑复用现有3GPP技术，包括速率匹配方案的选择，信息比特的选取原则，但由于数据信道支持的传输块较大，因此Nmax肯定要提高，相应的可靠度排序序列也要设计，不过这并非本发明的涉及范围，所以不作限制。另一方面，这里首先提供一种重传的方法：即初次传输出错的时候，第一次重传采用增量冗余(incremental redundancy,IR)的方式，而之后的重传则采用追逐合并(chase combining，CC)的方式。这个方式既可以利用到IR方式的优点，又可以简化设计，是个比较好的折中。
如图3所示，揭示了一种如何构造冗余版本(redundancy version，RV)用于HARQ传输的重传方法的实施例。
操作310：发送端对获取待编码比特序列进行Polar编码，得到编码后的第一比特序列，并根据速率匹配方式获取初传版本RV0。
本步骤可以采用现有技术。例如，按照3GPP的标准，编码后的第一比特序列经过交织后写入第一循环缓存，当初传码率R0小于或等于7/16的时候，采用打孔的速率匹配方式，这时RV0就是第一循环缓存中的后E0个比特；而当R0大于7/16的时候，则采用缩短的速率匹配方式，这时RV0就是第一循环缓存中的前E0个比特。其中R0＝K/E0，E0为初传中空口实际传输的比特数量。
操作320：确定重传版本RV1的长度E1。
E1为第一次重传的空口可以传输的比特数量，具体的取值方法和确定E0的方法一致。
操作330：根据初传码率R0和重传的速率匹配方式确定RV1。
当R0小于或等于预设的码率门限R_threshold(即R0≤R_threshold)时，可以直接从初传的第一循环缓存中直接读取长度为E1的RV1版本。其中R_threshold可以采用在1/4和1/2之间的任意一个值，例如1/4、3/8、7/16、15/32、1/2等等。RV1可以是第一循环缓存中的前E1个比特或者说是从第一循环缓存的起点顺时针依次读取的E1个比特，这种取法可以把初传中未传的比特优先放入RV1。也可以用与初传类似的方式根据重传的速率匹配方式确定如何从第一循环缓存中读取RV1。这里并不限定。
而当R0大于R_threshold(即R0>R_threshold)时，可以采用IR的方式生成编码后的第二比特序列，并根据包括但不限于码率、Nmax、初传编码所采用的母码长度N0、E0、E1等参数中的一个或多个来进行速率匹配，从而获得RV1。
具体而言，若E1≥N0，则重传的速率匹配方式为重复，否则当R0小于或等于预设的码率门限R_threshold_initial时，重传的速率匹配方式就是打孔，而R0大于预设的码率门限 R_threshold_initial时，重传的速率匹配方式为缩短。其中R_threshold_initial为初传时判断速率匹配方式的门限，在5G NR标准中其取值为7/16，当然也可以是其他预先设定的值。为了简便起见，可以令R_threshold_initial＝R_threshold。当然，R0＝R_threshold的时候也可以采用和R0>R_threshold的时候一样的方式，具体看收发两端约定。
在一种可能的设计中，若E1≥N0，则重传的速率匹配方式为重复，否则当R0大于预设的码率门限R_threshold_initial且重传版本RV1的长度E1小于初传版本RV0的长度E0时，重传的速率匹配方式可以为缩短，打孔，或两者的组合。
可选的，当初传的速率匹配方式为缩短时，重传时速率匹配比特由打孔比特和缩短比特两部分组成，其中缩短比特数量和位置与初传速率匹配时缩短比特数量和位置相同；打孔比特数量为E0-E1，打孔比特位置可以根据NR速率匹配的打孔方式确定。
可选的，当初传的速率匹配方式为重复时，重传时速率匹配比特由打孔比特组成，其中打孔比特数量为N0-E1，打孔比特位置可以根据NR速率匹配的打孔方式确定。
可选的，在确定打孔比特的位置后，还可以预冻结部分比特位置，但与现有NR协议确定预冻结比特位置的方式不同，本申请提出一种新的确定预冻结比特位置的方法，具体如下：
1.第i个子块中被打孔的比特数量P i超过预设值，则将该子块对应的其它极化子信道确定为预冻结极化子信道，其中，所述预设值可以是常数，例如0、1、10、16等；或者
2.第i个子块中被打孔的比特数量P i超过该子块对应的极化子信道总数的预设比例，则将该子块对应的其它极化子信道确定为预冻结极化子信道，其中，所述预设比例可以是1/16,1/8,1/4,1/2等。
当然，若某一子块对应的所有极化子信道均被打孔，则该子块中不存在预冻结的极化子信道。
具体来说，如图4所示实施例，可采用如下的操作：
操作330a：获取子信道集合Q1，Q1中包括K个元素，这些元素是初传中用于放置K个待编码比特的K个子信道的序号，这可以在操作310一并获取；
操作330b：将Q1中的所有子信道序号增加N0，获取子信道集合Q2，其中，Q2(i)＝Q1(i)+N0,其中i＝0,1,…,K-1；不失一般性，本申请中还是以子信道序号从0开始编号为例说明。如果是从1开始编号，相应加1即可，不再赘述；
操作330c：根据长度为N1＝2*N0的可靠度排序序列以及重传的速率匹配方式确定在母码长度为N1时K1个待编码比特的子信道集合Q3。Q3中的元素满足：Q3(i)<N0或者Q3(i)∈Q2其中i＝0,1,…,K1-1，这里K1＝K+K_adjust，K_adjust为新增的待编码比特，其值为0或CBcrc1，CBcrc1可以为0也可以不为0，不为0的原因是考虑到重传的时候有可能需要重新进行一些CRC校验以提高重传的可靠性，CBcrc1取值可以由如下任一方式确定：
●方式一：设置为0；
●方式二：基于条件判断，当N0＝4096，设置为第一预设值，例如6,8，16,24等，否则设置为0；
●方式三：基于条件判断，当N0＝4096，且E1>＝Alpha*E0，设置为第一预设值，第一预设值可以设置为例如6，8，16，24等，否则设置为0，其中Alpha取值可以为[1/2,1]区间内任一值，例如1/2，3/4,7/8,1等；
CBcrc1可以和初传的CRC采用相同的方式，也可以用短一些的CRC多项式，例如，初传用24比特的CRC，重传则采用8比特的CRC(即CBcrc1＝8)；
操作330d：确定扩展待编码比特集合Qext，其中的元素为Q3中小于N0的元素；
当CBcrc1取值方式为上述的方式二且取值不为0时，还需要执行如下的操作330e0(图中未示出)。需要指出的是，CBcrc1为0的时候当然也可以执行操作330e0，但对结果没有影响，因此一般建议当CBcrc1为0时不执行操作330e0。
操作330e0：
当|Qchk|＝0(也即|Qext|＝CBcrc1)，则CBcrc1的取值调整为0，否则不调整；
可选的，当|Qchk|≠0，CBcrc1的取值还可以进行进一步的判断调整，例如：
●0<|Qchk|<＝Chk_threshold(Chk_threshold为预设的门限值，典型取值可以为10，50等)，则CBcrc1的取值调整为第二预设值，第二预设值小于第一预设值，例如由8调整为6或者调整为3等等；
操作330e：确定复制比特集合Qchk＝Q2\(Q3\Qext)，其中的“\”代表的是集合的差运算，即A\B表示所有属于A且不属于B的元素；
操作330f：选取部分或全部Qchk中的子信道上的比特值逐个复制到对应的Qext的子信道上。图5给出了一个示意图：在Qext中先选出CBcrc1个子信道用于放置CRC比特(CBcrc1＝0的时候此步骤省略)，从Qchk中选取|Qext|-CBcrc1个子信道上的比特复制到Qext中余下的|Qext|-CBcrc1个子信道，这CBcrc1个CRC比特即用于对这|Qext|-CBcrc1个复制比特进行CRC校验，其中操作|A|表示取集合A的元素个数。Qext中先选出CBcrc1个子信道以及从Qchk中选取|Qext|-CBcrc1个子信道的方法可以是按自然序从前到后或从后到前依次选取，也可以是按照这些子信道的可靠度从前到后或从后到前依次选取的，它们的取法可以一致也可以不一致，这里不做限定；当|Qext|较大而|Qchk|较小时，也需要在Qext中选取|Qchk|个位置用于放置复制比特时，选取的方法也是类似的，即既可以是按自然序从前到后或从后到前依次选取，也可以是按照这些子信道的可靠度从前到后或从后到前依次选取的。无论是哪种选取方法，只需发送端和接收端约定统一即可。
操作330g：根据上述确定的位置和取值对K个待编码比特进行母码长度为N1的Polar码重传编码，得到极化编码后的第二比特序列，然后根据重传的速率匹配方式从第二比特序列的前N0个比特中得到RV1。具体从这前N0个比特中得到RV1的方式与从第一比特序列中得到RV0的方式可以一致。
为更好的说明上述步骤，下面举一个具体的例子。
假设N0＝64，N1＝128，不妨直接采用3GPP 5G NR标准中的可靠度排序序列：
N0＝64：S0＝[0,1,2,4,8,16,32,3,5,9,6,17,10,18,12,33,20,34,24,36,7,11,40,19,13,48,14,21,35,26,37,25,22,38,41,28,42,49,44,50,15,52,23,56,27,39,29,43,30,45,51,46,53,54,57,58,60,31,47,55,59,61,62,63]；
N1＝128：S1＝[0,1,2,4,8,16,32,3,5,64,9,6,17,10,18,12,33,65,20,34,24,36,7,66,11,40,68,19,13,48,14,72,21,35,26,80,37,25,22,38,96,67,41,28,69,42,49,74,70,44,81,50,73,15,52,23,76,82,56,27,97,39,84,29,43,98,88,30,71,45,100,51,46,75,104,53,77,54,83,57,112,78,85,58,99,86,60,89,101,31,90,102,105,92,47,106,55,113,79,108,59,114,87,116,61,91,120,62,103,93,107,94,109,115,110,117,118,121,122,63,124, 95,111,119,123,125,126,127]。
假设E0＝60，K＝50，因此R＝5/6，R_threshold＝7/16，因此需要用IR方式构造RV1，初传采用缩短的速率匹配方式。
Q1＝[6 7 10 11 12 13 14 15 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59]；
相应的：
Q2＝[70 71 74 75 76 77 78 79 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123]；
假设E1正好等于E0，也等于60，在子信道64～127中也同样采用缩短的速率匹配方式，因此所有缩短的子信道为Q RM＝[60 61 62 63 124 125 126 127]；
K_adjust为0时：
Q3＝[31 46 47 51 53 54 55 57 58 59 75 77 78 79 83 85 86 87 89 90 91 92 93 94 95 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123]；
Qext＝[31 46 47 51 53 54 55 57 58 59]；
Qchk＝[70 71 74 76 81 82 84 88 97 98]；
若CBcrc1＝0，则将Qchk中的子信道的比特复制到Qext中，可以就按上述的顺序依次复制，也可以在考虑译码顺序的前提下将Qchk中较大序号的子信道的比特复制到Qext中序号比较小的子信道，即子信道98的比特复制到子信道31，子信道97的比特复制到子信道46，依次类推，子信道70的比特复制到子信道59。
若CBcrc1＝8，则可将Qext中除31、46之外的8个子信道用于承载新增的CRC比特。而Qchk中选取子信道70和71的值分别复制到子信道46和31即可。这8个CRC比特即用于对这2个比特进行CRC校验。可以看出，在这种情况下8个CRC比特显然冗余了，所以实际应用中，还有一种可能，即待编码比特的数量在第一区间时不需要新增CRC比特，而在第二区间则需要新增CRC比特，或者在第三区间时新增较少的CRC比特，而在第四区间则新增较多的CRC比特。具体区间划分、是否新增CRC以及到底新增多少CRC比特，只需要发送端和接收端统一即可。
K_adjust为8时，Q3可取为：
Q3＝[29 30 31 43 45 46 47 51 53 54 55 57 58 59 71 75 77 78 79 83 84 85 86 87 88 89 90 91 92 93 94 95 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123]；
相应的，相应的Q2、Qext、Qchk为：
Q2＝[70 71 74 75 76 77 78 79 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123]；
Qext＝[29 30 31 43 45 46 47 51 53 54 55 57 58 59]；
Qchk＝[70 74 76 81 82 97]。
可将Qext这个47、51、53、54、55、57、58、59这8个子信道用于承载新增的CRC比特，而将Qchk中6个子信道上的比特复制到29、30、31、43、45、46这6个子信道上，具体地，子信道70的比特复制到子信道46，子信道74的比特复制到子信道45，依次类推，子信道97的比特复制到子信道29。
可以看到，即使对于相同的CBcrc1，K_adjust的取值不同也会影响到最后的结果。因此必须在发送端和接收端统一。
操作340：将RV0和RV1级联输入第二循环缓存；
操作350：进一步重传。
若第一次重传发送的RV1已经正确解码，则无需进行操作340、350，因此以虚线表示，若第一次重传还是未能正确解码，则还需进一步重传，如前所述，这时候采用CC重传，这时发送端可直接从第二循环缓存中读取相应的版本发送即可。例如，第x次传输的比特可以是上一次传输的最后一个比特位置之后的第一个比特位开始读取的Ex个比特(空口传输的比特数)，也可以是上一次传输所用RV版本(RV0或者RV1)的最后一个比特位置之后的第一个比特位开始读取的Ex个比特，x大于1。
在实际应用中，为了简化操作，确定RV1的步骤330(330方案一)还可以通过另一种方式实现：
330方案二：当初传码率R0小于或等于预设的码率门限R_threshold(即R0≤R_threshold，R_threshold的取值可以和前述的各取值示例一致，例如7/16)时，RV1由第一循环缓存中的第mod(N0-(E0+E1)，N0)个位置到第mod(N0-E0-1，N0)个位置上的比特按照它们在第一循环缓存中的顺序排列组成，其中mod表示取模操作，注意这里的位置编号是从0开始的；或者，当初传码率R0大于R_threshold时，RV1由第一循环缓存中的第mod(min(E0,N0)–E1，min(E0,N0))个位置到第mod(min(E0,N0)-1，min(E0,N0))个位置上的比特按照它们在第一循环缓存中的顺序排列组成。
可以看到，330方案二在重传的时候优先考虑传输初传的时候没有参与传输的比特，流程上有所简化。因此在实践中既可以采用330方案一所示的重传方式，也可以采用330方案二所示的重传方式。特别地，还可以同时支持这两种方式，以适应不同的需求，在这种情况下，可以通过下行控制信令DCI或者无线资源控制信令RRC或者其他控制信令显式或者隐式的告知具体的重传方式，使得接收端和发送端统一明确采用的重传方式到底是330方案一还是330方案二。
无论是初传还是重传，为克服信道影响，还可以对经过速率匹配后的发送比特进行信道交织的操作，具体的可以将待发送比特输入信道交织器然后发送交织后的比特，一般可选该交织器为行列交织器，按行写入、按列读出，或者按列写入、按行读出；为了让发送比特在交织器中分布更均匀、保证随机性能，所述行列交织器的行数可以是14，则第x次传输的列数为
Figure PCTCN2021106609-appb-000032
其中x为大于或等于0的整数，x＝0的时候表示是初传，x为其他值的时候表示是第几次重传。
虽然如图3中以分开的多个步骤确定RV1，实际应用中可以合并其中的部分步骤或者在不影响最终结果的前提下对计算的前后顺序做出改变。
以上对图3的实施例描述是针对发送端的，但事实上，接收端的操作也极其类似，区 别在于操作310中不是进行编码，而是进行解码，得到的是解码后的第一比特序列，其余确定RV0和RV1的方法和原则都是完全一致的，只是将RV0和RV1在各次重传中用于IR合并或CC合并，从而得到并输出解码结果。当然操作350中的发送也要相应改为接收。因此不再赘述。
如图6所示，本申请实施例中还提供一种发送装置600。图2所示的分段方法和图3、图4所示的重传方法中的部分或全部可以通过硬件来实现也可以通过软件来实现。
对于发送装置600，基于图2-5所示的分段、重传方法的同一发明构思，该发送装置600用于执行图2-5所示的分段、重传方法。当通过硬件实现时，发送装置600包括：输入接口电路601，用于获取待传传输块；逻辑电路602，用于执行上述图2-5所示的分段、重传方法，具体请见前面方法实施例中的描述，此处不再赘述；输出接口电路603，用于输出编码后的序列或者重传的序列。进一步地，编码后的序列或者重传的序列输出给收发器620，收发器620对编码后的序列或者重传的序列进行相应处理(包括但不限于数模变换和/或变频等处理)后通过天线630发送出去。可选的，发送装置600在具体实现时可以是芯片或者集成电路。
可选的，当上述实施例的分段、重传方法中的部分或全部通过软件来实现时，如图7所示，发送装置700包括：存储器701，用于存储程序；处理器702，用于执行存储器701存储的程序，当程序被执行时，使得发送装置700可以实现上述实施例提供的分段、重传方法。
可选的，上述存储器701可以是物理上独立的单元，也可以与处理器702集成在一起。
可选的，当上述实施例的分段、重传方法中的部分或全部通过软件实现时，发送装置700也可以只包括处理器702。用于存储程序的存储器701位于发送装置700之外，处理器702通过电路/电线与存储器701连接，用于读取并执行存储器701中存储的程序。
基于图2-5所示的分段、重传方法，如图8所示，本申请实施例还提供了一种发送设备800，用于执行图2-5所示的分段、重传方法，发送设备800包括：
获取单元801，用于获取待传传输块；
分段单元802，用于对按照如图2所示实施例的分段方法所述待传传输块分段；
编码单元803，用于对分段后的每一段传输块进行编码或者重传编码；
确定单元804，用于按照如图3-5所示实施例的重传方法确定RV0版本和RV1版本。
与发送端相对应，接收端的装置也可以进行类似的设计。
如图9所述，接收装置900包括：输入接口电路901用于输入接收信号，逻辑电路902用于执行前述的分段、重传方法用于解码，以获取解码结果；输出接口电路903用于输出解码结果。接收装置900还可以包括收发器920通过天线930获取接收信号。在具体实现时可以是芯片或者集成电路。
可选的，当上述实施例的分段、重传方法中的部分或全部通过软件来实现时，如图10所示，接收装置1000包括：存储器1001，用于存储程序；处理器1002，用于执行存储器1001存储的程序，当程序被执行时，使得接收装置1000可以实现上述实施例提供的分段、重传方法。
可选的，上述存储器1001可以是物理上独立的单元，也可以处理器1002集成在一起。
可选的，当上述实施例的分段、重传方法中的部分或全部通过软件实现时，接收1000 也可以只包括处理器1002。用于存储程序的存储器1001位于接收装置1000之外，处理器1002通过电路/电线与存储器1001连接，用于读取并执行存储器1001中存储的程序。
处理器702和/或处理器1002可以是中央处理器(central processing unit，CPU)，网络处理器(network processor，NP)或者CPU和NP的组合。
处理器702和/或处理器1002还可以进一步包括硬件芯片。上述硬件芯片可以是专用集成电路(application-specific integrated circuit，ASIC)，可编程逻辑器件(programmable logic device，PLD)或其组合。上述PLD可以是复杂可编程逻辑器件(complex programmable logic device，CPLD)，现场可编程逻辑门阵列(field-programmable gate array，FPGA)，通用阵列逻辑(generic array logic,GAL)或其任意组合。
上述实施例中的存储器可以包括易失性存储器(volatile memory)，例如随机存取存储器(random-access memory，RAM)；存储器也可以包括非易失性存储器(non-volatile memory)，例如快闪存储器(flash memory)，硬盘(hard disk drive，HDD)或固态硬盘(solid-state drive，SSD)；存储器还可以包括上述种类的存储器的组合。
基于上述的分段、重传方法，如图11所示，本申请实施例还提供了一种接收设备1100，接收装置1100用于执行前述的分段、重传方法，接收装置1100包括：
获取单元1101，用于获取接收信号；
分段单元1102，用于对按照如图2所示实施例的分段方法所述待传传输块分段；
确定单元1103，用于按照如图3-5所示实施例的重传方法确定RV0版本和RV1版本；
解码单元1104，用于对接收到的每一段传输块进行解码。
本申请实施例还提供了一种计算机存储介质，存储有计算机程序指令，该计算机程序指令由计算机执行时，使得前述的分段、重传方法被执行。
本申请实施例还提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得前述的分段、重传方法被执行。
本领域内的技术人员应明白，本申请的实施例可提供为方法、系统、或计算机程序产品。因此，本申请可采用完全硬件实施例、完全软件实施例、或结合软件和硬件方面的实施例的形式。而且，本申请可采用在一个或多个其中包含有计算机可用程序代码的计算机可用存储介质(包括但不限于磁盘存储器、CD-ROM、光学存储器等)上实施的计算机程序产品的形式。
本申请是参照根据本申请实施例的方法、设备(系统)、和计算机程序产品的流程图和/或方框图来描述的。应理解可由计算机程序指令实现流程图和/或方框图中的每一流程和/或方框、以及流程图和/或方框图中的流程和/或方框的结合。可提供这些计算机程序指令到通用计算机、专用计算机、嵌入式处理机或其他可编程数据处理设备的处理器以产生一个机器，使得通过计算机或其他可编程数据处理设备的处理器执行的指令产生用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的装置。
这些计算机程序指令也可存储在能引导计算机或其他可编程数据处理设备以特定方式工作的计算机可读存储器中，使得存储在该计算机可读存储器中的指令产生包括指令装置的制造品，该指令装置实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能。
这些计算机程序指令也可装载到计算机或其他可编程数据处理设备上，使得在计算机 或其他可编程设备上执行一系列操作步骤以产生计算机实现的处理，从而在计算机或其他可编程设备上执行的指令提供用于实现在流程图一个流程或多个流程和/或方框图一个方框或多个方框中指定的功能的步骤。
在本申请实施例之外，本领域内的技术人员一旦得知了基本创造性概念，则可对这些实施例作出另外的变更和修改。所以，所附权利要求意欲解释为包括优选实施例以及落入本申请范围的所有变更和修改。
显然，本领域的技术人员可以对本申请实施例进行各种改动和变型而不脱离本申请实施例的精神和范围。这样，倘若本申请实施例的这些修改和变型属于本申请权利要求及其等同技术的范围之内，则本申请也意图包含这些改动和变型在内。

Claims (52)

  1. 一种重传方法，其特征在于，包括：
    发送装置获取包括K待编码比特的待编码比特序列，K为正整数；
    对所述待编码序列进行极化编码，得到编码后的第一比特序列，所述第一比特序列的长度为N0，确定初传版本RV0；
    确定重传版本RV1的长度E1；
    根据初传码率R0确定重传版本RV1；
    发送所述RV1。
  2. 如权利要求1所述的方法，其特征在于，所述根据初传码率R0确定重传版本RV1包括：
    当R0小于或等于预设的码率门限R_threshold时，所述RV1为从初传的第一循环缓存中读取的E1个比特；或者
    当R0大于R_threshold时，采用增量冗余IR的方式生成编码后的第二比特序列，根据所述第二比特序列获取RV1，所述第二比特序列长度为N1，N1＝2*N0。
  3. 如权利要求2所述的方法，其特征在于，所述根据所述第二比特序列获取RV1为：
    获取子信道集合Q1，所述Q1中包括K个元素，所述K个元素是初传中用于放置所述K个待编码比特的K个子信道的序号；
    获取子信道集合Q2，其中Q2(i)＝Q1(i)+N0,其中i＝0,1,…,K-1，其中N0为初传时采用的极化码的母码长度；
    获取子信道集合Q3，其中Q3(i)<N0或者Q3(i)∈Q2其中i＝0,1,…,K-1；
    确定扩展待编码比特集合Qext，其中的元素为所述Q3中小于N0的元素；
    确定复制比特集合Qchk＝Q2\(Q3\Qext)；
    根据所述Q2、所述Q3、所述Qext、所述Qchk对所述K个待编码比特进行母码长度为N1的Polar码编码，得到所述第二比特序列。
  4. 如权利要求3所述的方法，所述Q3是根据长度为N1的可靠度排序序列以及重传的速率匹配方式确定的。
  5. 如权利要求3或4所述的方法，其特征在于，所述根据所述Q2、所述Q3、所述Qext、所述Qchk对所述K个待编码比特进行母码长度为N1的Polar码编码包括：
    选取部分或全部Qchk中的子信道上的比特值逐个复制到对应的Qext的子信道上。
  6. 如权利要求2-5中任意一项所述的方法，其特征在于，所述根据所述第二比特序列获取RV1为：
    根据重传的速率匹配方式从第二比特序列的前N0个比特中得到RV1。
  7. 如权利要求1-6中任意一项所述的方法，其特征在于，在所述发送装置获取包括K待编码比特的待编码比特序列前，还包括：
    根据传输块大小TBS进行分段。
  8. 如权利要求7所述的方法，其特征在于，
    所述分段的段数C为：
    Figure PCTCN2021106609-appb-100001
    其中TBcrc为传输块TB级的循环冗余校验CRC比特个数，K_threshold为预设的第一门限。
  9. 如权利要求8所述的方法，其特征在于，
    Figure PCTCN2021106609-appb-100002
    其中CBcrc为码块CB级的CRC比特个数。
  10. 如权利要求8或9所述的方法，其特征在于，
    Figure PCTCN2021106609-appb-100003
    其中2 n2为量化单位，n2为正整数，N′ info为可传输的数据量Ninfo根据量化级别进行的调整。
  11. 如权利要求10所述的方法，其特征在于，所述N i ′ nfo为：
    N′ info＝max(TBSmin,2 n*round((N info-TBcrc)/2 n))
    Figure PCTCN2021106609-appb-100004
    其中：TBSmin为指最小的传输块大小，round为四舍五入取整操作，n为待传输的传输块的量化级别，n min为最小量化级别，n0为量化调整量，
    Figure PCTCN2021106609-appb-100005
    为下取整操作。
  12. 如权利要求1～11所述的方法，其特征在于，所述方法还包括：
    所述发送装置将RV0和RV1级联输入第二循环缓存；
    所述发送装置根据RV0和RV1进行重传。
  13. 一种发送设备，其特征在于，包括：
    获取单元，用于获取包括K待编码比特的待编码比特序列，K为正整数；
    编码单元，对所述待编码序列进行极化编码，得到编码后的第一比特序列，所述第一比特序列的长度为N0；
    确定单元，用于确定初传版本RV0、重传版本RV1的长度E1，以及根据初传码率R0确定重传版本RV1。
  14. 如权利要求13所述的设备，其特征在于，所述根据初传码率R0确定重传版本RV1包括：
    当R0小于或等于预设的码率门限R_threshold时，所述RV1为从初传的第一循环缓存中读取的E1个比特；或者
    当R0大于R_threshold时，采用增量冗余IR的方式生成编码后的第二比特序列，根据所述第二比特序列获取RV1，所述第二比特序列长度为N1，N1＝2*N0。
  15. 如权利要求14所述的设备，其特征在于，所述根据所述第二比特序列获取RV1为：
    获取子信道集合Q1，所述Q1中包括K个元素，所述K个元素是初传中用于放置所述K个待编码比特的K个子信道的序号；
    获取子信道集合Q2，其中Q2(i)＝Q1(i)+N0,其中i＝0,1,…,K-1，其中N0为初传时采用的极化码的母码长度；
    获取子信道集合Q3，其中Q3(i)<N0或者Q3(i)∈Q2其中i＝0,1,…,K-1；
    确定扩展待编码比特集合Qext，其中的元素为所述Q3中小于N0的元素；
    确定复制比特集合Qchk＝Q2\(Q3\Qext)；
    根据所述Q2、所述Q3、所述Qext、所述Qchk对所述K个待编码比特进行母码长度为N1的Polar码编码，得到所述第二比特序列。
  16. 如权利要求15所述的设备，其特征在于，所述Q3是根据长度为N1的可靠度排序序列以及重传的速率匹配方式确定的。
  17. 如权利要求15或16所述的设备，其特征在于，所述根据所述Q2、所述Q3、所述Qext、所述Qchk对所述K个待编码比特进行母码长度为N1的Polar码编码包括：
    选取部分或全部Qchk中的子信道上的比特值逐个复制到对应的Qext的子信道上。
  18. 如权利要求14-17中任意一项所述的设备，其特征在于，所述根据所述第二比特序列获取RV1为：
    根据重传的速率匹配方式从第二比特序列的前N0个比特中得到RV1。
  19. 如权利要求13-18中任意一项所述的设备，其特征在于，所述设备还包括：
    分段单元，用于根据传输块大小TBS进行分段。
  20. 如权利要求19所述的设备，其特征在于，
    所述分段的段数C为：
    Figure PCTCN2021106609-appb-100006
    其中TBcrc为传输块TB级的循环冗余校验CRC比特个数，K_threshold为预设的第一门限。
  21. 如权利要求20所述的设备，其特征在于，
    Figure PCTCN2021106609-appb-100007
    其中CBcrc为码块CB级的CRC比特个数。
  22. 如权利要求20或21所述的设备，其特征在于，
    Figure PCTCN2021106609-appb-100008
    其中2 n2为量化单位，n2为正整数，N′ info为可传输的数据量Ninfo根据量化级别进行的调整。
  23. 如权利要求22所述的设备，其特征在于，所述N′ info为：
    N′ info＝max(TBSmin,2 n*round((N info-TBcrc)/2 n))
    Figure PCTCN2021106609-appb-100009
    其中：TBSmin为指最小的传输块大小，round为四舍五入取整操作，n为待传输的传输块的量化级别，n min为最小量化级别，n0为量化调整量，
    Figure PCTCN2021106609-appb-100010
    为下取整操作。
  24. 如权利要求13～23所述的设备，其特征在于，所述确定单元还用于：
    将RV0和RV1级联输入第二循环缓存。
  25. 一种发送装置，其特征在于，包括：
    输入接口电路，用于获取待传传输块；
    逻辑电路，用于基于所述待传传输块按照如权利要求1～12中任意一项所述的方法 得到编码后的序列或者重传的序列；
    输出接口电路，用于输出所述编码后的序列或者重传的序列。
  26. 一种重传方法，其特征在于：
    接收装置接收包含K个待编码比特的信息的接收信号，所述接收信号对应的母码长度N0，确定初传版本RV0；
    确定重传版本RV1的长度E1；
    根据初传码率R0确定重传版本RV1；
    根据所述RV0和RV1进行解码。
  27. 如权利要求26所述的方法，其特征在于，所述根据初传码率R0确定重传版本RV1包括：
    当R0小于或等于预设的码率门限R_threshold时，所述RV1为从初传的第一循环缓存中读取的E1个比特；或者
    当R0大于R_threshold时，所述RV1为根据采用增量冗余IR的方式生成编码后的第二比特序列获取的，所述第二比特序列长度为N1，N1＝2*N0。
  28. 如权利要求27所述的方法，其特征在于，所述第二比特序列通过以下方式得到：
    获取子信道集合Q1，所述Q1中包括K个元素，所述K个元素是初传中用于放置所述K个待编码比特的K个子信道的序号；
    获取子信道集合Q2，其中Q2(i)＝Q1(i)+N0,其中i＝0,1,…,K-1，其中N0为初传时采用的极化码的母码长度；
    获取子信道集合Q3，其中Q3(i)<N0或者Q3(i)∈Q2其中i＝0,1,…,K-1；
    确定扩展待编码比特集合Qext，其中的元素为所述Q3中小于N0的元素；
    确定复制比特集合Qchk＝Q2\(Q3\Qext)；
    根据所述Q2、所述Q3、所述Qext、所述Qchk对所述K个待编码比特进行母码长度为N1的Polar码编码，得到所述第二比特序列。
  29. 如权利要求28所述的方法，其特征在于，所述Q3是根据长度为N1的可靠度排序序列以及重传的速率匹配方式确定的。
  30. 如权利要求28或29所述的方法，其特征在于，所述根据所述Q2、所述Q3、所述Qext、所述Qchk对所述K个待编码比特进行母码长度为N1的Polar码编码包括：
    选取部分或全部Qchk中的子信道上的比特值逐个复制到对应的Qext的子信道上。
  31. 如权利要求27-30中任一项所述的方法，其特征在于，所述RV1为根据采用增量冗余IR的方式生成编码后的第二比特序列获取为：
    根据重传的速率匹配方式从第二比特序列的前N0个比特中得到RV1。
  32. 如权利要求26-31中任一项所述的方法，其特征在于，还包括对接收的待解码传输块根据传输块大小TBS进行分段。
  33. 如权利要求32所述的方法，其特征在于，
    所述分段的段数C为：
    Figure PCTCN2021106609-appb-100011
    其中TBcrc为传输块TB级的循环冗余校验CRC比特个数，K_threshold为预设的第一门限。
  34. 如权利要求33所述的方法，其特征在于，
    Figure PCTCN2021106609-appb-100012
    其中CBcrc为码块CB级的CRC比特个数。
  35. 如权利要求33或34所述的方法，其特征在于，
    Figure PCTCN2021106609-appb-100013
    其中2 n2为量化单位，n2为正整数，N′ info为可传输的数据量Ninfo根据量化级别进行的调整。
  36. 如权利要求35所述的方法，其特征在于，所述N′ info为：
    N′ info＝max(TBSmin,2 n*round((N info-TBcrc)/2 n))
    Figure PCTCN2021106609-appb-100014
    其中：TBSmin为指最小的传输块大小，round为四舍五入取整操作，n为待传输的传输块的量化级别，n min为最小量化级别，n0为量化调整量，
    Figure PCTCN2021106609-appb-100015
    为下取整操作。
  37. 一种接收设备，其特征在于，包括：
    获取单元，用于接收包含K个待编码比特的信息的接收信号，所述接收信号对应的母码长度N0，确定初传版本RV0；
    确定单元，用于确定重传版本RV1的长度E1；以及根据初传码率R0确定重传版本RV1；
    解码单元，用于根据所述RV0和RV1进行解码。
  38. 如权利要求37所述的设备，其特征在于，所述根据初传码率R0确定重传版本RV1包括：
    当R0小于或等于预设的码率门限R_threshold时，所述RV1为从初传的第一循环缓存中读取的E1个比特；或者
    当R0大于R_threshold时，所述RV1为根据采用增量冗余IR的方式生成编码后的第二比特序列获取的，所述第二比特序列长度为N1，N1＝2*N0。
  39. 如权利要求37所述的设备，其特征在于，所述第二比特序列通过以下方式得到：
    获取子信道集合Q1，所述Q1中包括K个元素，所述K个元素是初传中用于放置所述K个待编码比特的K个子信道的序号；
    获取子信道集合Q2，其中Q2(i)＝Q1(i)+N0,其中i＝0,1,…,K-1，其中N0为初传时采用的极化码的母码长度；
    获取子信道集合Q3，其中Q3(i)<N0或者Q3(i)∈Q2其中i＝0,1,…,K-1；
    确定扩展待编码比特集合Qext，其中的元素为所述Q3中小于N0的元素；
    确定复制比特集合Qchk＝Q2\(Q3\Qext)；
    根据所述Q2、所述Q3、所述Qext、所述Qchk对所述K个待编码比特进行母码长度为N1的Polar码编码，得到所述第二比特序列。
  40. 如权利要求39所述的设备，其特征在于，所述Q3是根据长度为N1的可靠度排序序列以及重传的速率匹配方式确定的。
  41. 如权利要求39或40所述的设备，其特征在于，所述根据所述Q2、所述Q3、所述Qext、所述Qchk对所述K个待编码比特进行母码长度为N1的Polar码编码包括：
    选取部分或全部Qchk中的子信道上的比特值逐个复制到对应的Qext的子信道上。
  42. 如权利要求37-41中任一项所述的方法，其特征在于，所述RV1为根据采用增 量冗余IR的方式生成编码后的第二比特序列获取为：
    根据重传的速率匹配方式从第二比特序列的前N0个比特中得到RV1。
  43. 如权利要求37-42中任一项所述的设备，其特征在于，还包括分段单元，用于对接收的待解码传输块根据传输块大小TBS进行分段。
  44. 如权利要求43所述的设备，其特征在于，
    所述分段的段数C为：
    Figure PCTCN2021106609-appb-100016
    其中TBcrc为传输块TB级的循环冗余校验CRC比特个数，K_threshold为预设的第一门限。
  45. 如权利要求44所述的设备，其特征在于，
    Figure PCTCN2021106609-appb-100017
    其中CBcrc为码块CB级的CRC比特个数。
  46. 如权利要求44或45所述的设备，其特征在于，
    Figure PCTCN2021106609-appb-100018
    其中2 n2为量化单位，n2为正整数，N′ info为可传输的数据量Ninfo根据量化级别进行的调整。
  47. 如权利要求46所述的设备，其特征在于，所述N′ info为：
    N′ info＝max(TBSmin,2 n*round((N info-TBcrc)/2 n))
    Figure PCTCN2021106609-appb-100019
    其中：TBSmin为指最小的传输块大小，round为四舍五入取整操作，n为待传输的传输块的量化级别，n min为最小量化级别，n0为量化调整量，
    Figure PCTCN2021106609-appb-100020
    为下取整操作。
  48. 一种接收装置，其特征在于，包括：
    输入接口电路，用于获取接收信号；
    逻辑电路，用于基于所述接收信号按照如权利要求26-36中任意一项所述的方法获取解码结果；
    输出接口电路，用于输出所述解码结果。
  49. 一种通信装置，其特征在于，包括：处理器，用于在执行程序指令时执行如权利要求1-12中任意一项或者如权利要求26-36中任意一项所述的方法。
  50. 如权利要求49所述的装置，其特征在于，还包括：存储器，用于存储所述程序指令。
  51. 一种计算机可读介质，其特征在于，存储有计算机程序指令，当所述计算机程序指令由计算机执行时，使得如权利要求1-12中任意一项所述的方法或者如权利要求26-36中任意一项所述的方法被执行。
  52. 一种计算机程序产品，其特征在于，包含指令，当所述指令由计算机执行时，使得如权利要求1-12中任意一项所述的方法或者如权利要求26-36中任意一项所述的方法被执行。
PCT/CN2021/106609 2020-07-30 2021-07-15 一种重传方法及装置 Ceased WO2022022298A1 (zh)

Priority Applications (3)

Application Number Priority Date Filing Date Title
JP2023506038A JP7682256B2 (ja) 2020-07-30 2021-07-15 再送方法及び装置
EP21849200.7A EP4187816B1 (en) 2020-07-30 2021-07-15 Retransmission method and device
US18/160,008 US20230171033A1 (en) 2020-07-30 2023-01-26 Retransmission method and apparatus

Applications Claiming Priority (8)

Application Number Priority Date Filing Date Title
CN202010754266.0 2020-07-30
CN202010754266 2020-07-30
CN202010797814 2020-08-10
CN202010797814.8 2020-08-10
CN202010809384.7 2020-08-12
CN202010809384 2020-08-12
CN202110109625.1A CN114070461A (zh) 2020-07-30 2021-01-26 一种重传方法及装置
CN202110109625.1 2021-01-26

Related Child Applications (1)

Application Number Title Priority Date Filing Date
US18/160,008 Continuation US20230171033A1 (en) 2020-07-30 2023-01-26 Retransmission method and apparatus

Publications (1)

Publication Number Publication Date
WO2022022298A1 true WO2022022298A1 (zh) 2022-02-03

Family

ID=80037543

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2021/106609 Ceased WO2022022298A1 (zh) 2020-07-30 2021-07-15 一种重传方法及装置

Country Status (4)

Country Link
US (1) US20230171033A1 (zh)
EP (1) EP4187816B1 (zh)
JP (1) JP7682256B2 (zh)
WO (1) WO2022022298A1 (zh)

Cited By (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115051775A (zh) * 2022-04-27 2022-09-13 北京理工大学 宽带自组网中的高效自动重传方法
CN115642985A (zh) * 2022-09-06 2023-01-24 星骋(广州)科技应用有限公司 一种数据编码方法、通信装置以及计算机可读存储介质
CN116170115A (zh) * 2023-04-19 2023-05-26 华南师范大学 基于码本的数字喷泉编解码方法、装置以及系统

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN120017209A (zh) * 2023-11-15 2025-05-16 华为技术有限公司 一种用于通信的方法、装置、系统、存储介质和程序产品

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2020034332A1 (en) * 2018-09-28 2020-02-20 Zte Corporation Bit selection for hybrid automatic repeat requests
WO2020042161A1 (en) * 2018-08-31 2020-03-05 Nokia Shanghai Bell Co., Ltd. Incremental redundancy hybrid automatic repeat request transmissions for polar coded systems
CN111434042A (zh) * 2017-11-15 2020-07-17 Idac控股公司 利用极性码进行urllc传输

Family Cites Families (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2019095362A1 (en) * 2017-11-20 2019-05-23 Qualcomm Incorporated Techniques and apparatuses for hybrid automatic repeat request design of polar codes for ultra-reliable low latency communications
WO2019157764A1 (en) * 2018-02-15 2019-08-22 Qualcomm Incorporated Self-decodable redundancy versions for polar codes

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111434042A (zh) * 2017-11-15 2020-07-17 Idac控股公司 利用极性码进行urllc传输
WO2020042161A1 (en) * 2018-08-31 2020-03-05 Nokia Shanghai Bell Co., Ltd. Incremental redundancy hybrid automatic repeat request transmissions for polar coded systems
WO2020034332A1 (en) * 2018-09-28 2020-02-20 Zte Corporation Bit selection for hybrid automatic repeat requests

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
NTT DOCOMO, INC. (RAPPORTEUR): "RAN WG’s progress on NR WI in the November meeting 2017", 3GPP DRAFT; R2-1800217, vol. RAN WG2, 12 January 2018 (2018-01-12), Vancouver, Canada, XP051386086 *
See also references of EP4187816A4 *

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115051775A (zh) * 2022-04-27 2022-09-13 北京理工大学 宽带自组网中的高效自动重传方法
CN115051775B (zh) * 2022-04-27 2023-07-07 北京理工大学 宽带自组网中的高效自动重传方法
CN115642985A (zh) * 2022-09-06 2023-01-24 星骋(广州)科技应用有限公司 一种数据编码方法、通信装置以及计算机可读存储介质
CN116170115A (zh) * 2023-04-19 2023-05-26 华南师范大学 基于码本的数字喷泉编解码方法、装置以及系统
CN116170115B (zh) * 2023-04-19 2023-06-27 华南师范大学 基于码本的数字喷泉编解码方法、装置以及系统

Also Published As

Publication number Publication date
JP7682256B2 (ja) 2025-05-23
EP4187816C0 (en) 2025-10-22
EP4187816A4 (en) 2024-01-10
EP4187816A1 (en) 2023-05-31
JP2023535500A (ja) 2023-08-17
US20230171033A1 (en) 2023-06-01
EP4187816B1 (en) 2025-10-22

Similar Documents

Publication Publication Date Title
US11742987B2 (en) Method and apparatus for processing information, communications device, and communications system
KR102343666B1 (ko) 통신 시스템에서의 리던던시 버전 설계 솔루션
WO2022042214A1 (zh) 一种重传方法及装置
CN113810060B (zh) 一种Polar码速率匹配方法及装置
JP6731115B2 (ja) 情報送信方法、送信端デバイス及び受信端デバイス
CN110166167B (zh) 编码的方法、译码的方法、编码设备和译码设备
CN106817195B (zh) 用于极化码的速率匹配的方法和装置
CN111200476B (zh) Polar码编码方法及装置
WO2022022298A1 (zh) 一种重传方法及装置
CN114070461A (zh) 一种重传方法及装置
US12483274B2 (en) Polar code encoding and rate-matched sequence outputting method and apparatus
CN109756307B (zh) 数据重传方法及装置
WO2020147527A1 (zh) 一种极化编译码方法及装置
CN113328828B (zh) 信息处理方法、终端、芯片及存储介质
CN112636879B (zh) 基于混合自动重传请求的码块处理的方法和装置
WO2018177258A1 (zh) 标识信息的处理方法及设备
CN110890949B (zh) 配置无线网络临时标识rnti的方法和装置
WO2025098179A1 (zh) polar码的速率匹配的方法以及通信装置
WO2025200394A1 (zh) 编码方法、解码方法、装置、程序产品及存储介质
WO2025092679A1 (zh) 一种数据传输方法和装置
WO2025092677A1 (zh) 一种数据传输方法和装置
CN121970278A (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: 21849200

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2023506038

Country of ref document: JP

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 202337010866

Country of ref document: IN

WWE Wipo information: entry into national phase

Ref document number: 2021849200

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 2021849200

Country of ref document: EP

Effective date: 20230223

NENP Non-entry into the national phase

Ref country code: DE

WWG Wipo information: grant in national office

Ref document number: 202337010866

Country of ref document: IN

WWG Wipo information: grant in national office

Ref document number: 2021849200

Country of ref document: EP