CN114070461A

CN114070461A - Retransmission method and device

Info

Publication number: CN114070461A
Application number: CN202110109625.1A
Authority: CN
Inventors: 戴胜辰; 张公正; 李榕; 乔云飞; 王献斌; 王俊; 童文; 王坚; 王键
Original assignee: Huawei Technologies Co Ltd
Current assignee: Huawei Technologies Co Ltd
Priority date: 2020-07-30
Filing date: 2021-01-26
Publication date: 2022-02-18

Abstract

The application discloses a method and a device for segmentation and retransmission, which comprise the following steps: the method comprises the steps that a sending device carries out segmentation after obtaining a transmission block to be transmitted, then new coding is carried out on bits to be coded in each segment to obtain a coded first bit sequence, the length of the first bit sequence is N0, and an initial transmission version RV0 is determined; determining the length E1 of the retransmission version RV 1; determining a retransmission version RV1 according to the initial transmission code rate R0; the retransmitted data is determined from RV0 and/or RV 1. The method can realize retransmission in a simpler and more convenient mode on the basis of considering the existing standard.

Description

Retransmission method and device

Technical Field

The embodiment of the application relates to the technical field of communication, in particular to a retransmission method and a retransmission device.

Background

Channel coding, the most basic radio access technology, plays a crucial role in ensuring reliable transmission of data. In the existing wireless communication system, a Turbo code, a Low Density Parity Check (LDPC) code, and a Polar (Polar) code are generally used for channel coding. Turbo codes cannot support information transmission at too low or too high code rates. For medium and short packet transmission, Turbo codes and LDPC codes are difficult to achieve ideal performance under limited code length due to the characteristics of self coding and decoding. In the implementation aspect, Turbo codes and LDPC codes have higher computational complexity in the implementation process of coding and decoding. Polar codes are good codes which theoretically demonstrate that shannon capacity can be achieved and have relatively simple coding and decoding complexity, and thus are increasingly widely used. In a fifth generation (5th generation, 5G) communication system, Polar codes are determined as the coding mode of a control channel. Therefore, the encoding flow of Polar codes is specified in the standard in detail, and comprises the specific processes of segmentation, rate matching mode determination, mapping of information bits and check bits (including cyclic redundancy check bits and/or parity check bits) on the polarized channel, encoding, rate matching and the like.

However, just as the Polar code is only used for the control channel in the 5G standard, the mechanism design of Hybrid Automatic Repeat reQuest (HARQ) is not involved. In the data channel, the introduction of the HARQ will effectively enhance the reliability of the transmission and further increase the throughput of the system. Therefore, how to design a suitable HARQ scheme for the coding mechanism of Polar codes becomes an urgent problem to be solved for applying Polar codes to data channel transmission.

Disclosure of Invention

The embodiment of the application provides a retransmission method and a retransmission device applied to wireless communication, and the method and the device have the advantage of simple implementation.

The embodiment of the application provides the following specific technical scheme:

in a first aspect, a retransmission method is provided, and includes:

a sending device acquires a bit sequence to be coded, which comprises K bits to be coded, wherein K is a positive integer;

carrying out polarization coding on the to-be-coded sequence to obtain a coded first bit sequence, wherein the length of the first bit sequence is N0, and determining a primary version RV 0;

determining the length E1 of the retransmission version RV 1;

determining a retransmission version RV1 according to the initial transmission code rate R0;

and sending the RV 1.

By the implementation method, on one hand, 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 that the implementation is simple, and the performance can meet the requirements.

In one possible design, the determining the retransmission version RV1 according to the initial transmission code rate R0 includes:

when R0 is less than or equal to a preset code rate threshold R _ threshold, RV1 is E1 bits read from the first circular buffer of the initial transmission; or

When R0 is greater than R _ threshold, generating a second encoded bit sequence in an incremental redundancy IR manner, and obtaining RV1 according to the second bit sequence, where the length of the second bit sequence is N1, and N1 is 2 × N0.

In one possible design, the obtaining RV1 from the second bit sequence is:

acquiring a subchannel set Q1, wherein the Q1 comprises K elements, and the K elements are serial numbers of K subchannels used for placing the K bits to be coded in initial transmission;

acquiring a subchannel set Q2, wherein Q2(i) ═ Q1(i) + N0, wherein i ═ 0,1, …, K-1, and N0 is a mother code length of a polarization code used in initial transmission;

acquiring a sub-channel set Q3, wherein Q3(i) < N0 or Q3(i) ∈ Q2, wherein i is 0,1, …, K-1;

determining an extended set of bits to be encoded Qext, wherein elements in the set of bits to be encoded Qext are elements smaller than N0 in the Q3;

determining a copy bit set Qchk-Q2 \ Q3\ Qext;

and performing Polar code coding with the mother code length of N1 on the K bits to be coded according to the Q2, the Q3, the Qext and the Qchk to obtain the second bit sequence.

In one possible design, the Q3 is determined based on a reliability-ordered sequence of length N1 and a rate-matching manner of retransmissions.

In one possible design, said performing Polar code encoding of mother code length N1 on said K bits to be encoded according to said Q2, said Q3, said Qext, said Qchk comprises:

and selecting bit values on the sub-channels in part or all of the Qchk to copy the bit values on the corresponding sub-channels of Qext one by one.

In one possible design, the obtaining RV1 from the second bit sequence is:

RV1 is obtained from the first N0 bits of the second bit sequence according to the retransmission rate matching mode.

In one possible design, before the sending apparatus obtains the bit sequence to be coded including K bits to be coded, the method further includes:

segmentation is performed according to the transport block size TBS.

In one possible design of the system, the system may be,

the segmented segment number C is as follows:

wherein TBcrc is the number of CRC bits at the TB level of the transport block, and K _ threshold is a preset first threshold.

In one possible design of the system, the system may be,

where CBcrc is the number of CRC bits at the code block CB level.

In one possible design of the system, the system may be,

wherein 2ⁿ²N2 is a positive integer, N 'in quantization units'_infoThe adjustment is made for the transmittable data amount Ninfo according to the quantization level.

In one possible design, the N'_infoComprises the following steps:

N′_info＝max(TBSmin，2ⁿ*round((N_info-TBcrc)/2ⁿ))

wherein: TBSmin is the smallest transport block size, round is four-contained five-input rounding operation, n is the quantization level of the transport block to be transmitted_minFor the minimum quantization level, n0 is the quantization adjustment,

for the lower rounding operation.

In one possible design, the method further includes:

the transmitting device inputs RV0 and RV1 in a cascade mode into a second circular buffer;

the transmitting device retransmits according to RV0 and RV 1.

In a second aspect, a retransmission method is provided, where:

a receiving device receives a received signal containing information of K bits to be coded, the length of a mother code N0 corresponding to the received signal determines a primary transmission version RV 0;

determining the length E1 of the retransmission version RV 1;

and decoding according to the RV0 and the RV 1.

In one possible design, the obtaining RV1 from the second bit sequence is:

determining a copy bit set Qchk-Q2 \ Q3\ Qext;

In one possible design, the obtaining RV1 from the second bit sequence is:

In one possible design, the method further includes segmenting the received transport block to be decoded according to a transport block size, TBS.

In one possible design of the system, the system may be,

the segmented segment number C is as follows:

In one possible design of the system, the system may be,

where CBcrc is the number of CRC bits at the code block CB level.

In one possible design of the system, the system may be,

In one possible design, the N'_infoComprises the following steps:

N′_info＝max(TBSmin，2ⁿ*round((N_info-TBcrc)/2ⁿ))

for the lower rounding operation.

In one possible design, the method further includes:

the transmitting device retransmits according to RV0 and RV 1.

In a third aspect, there is provided a transmitting apparatus having the functionality to implement the method as described in any one of the possible designs of the first aspect and the first aspect described above. The functions can be realized by hardware, and the functions can also be realized by executing corresponding software by hardware. The hardware or software includes one or more modules corresponding to the above-described functions.

In one possible design, when part or all of the functions are implemented by hardware, the transmitting device includes: the input interface circuit is used for acquiring a transmission block to be transmitted; logic circuitry for performing the acts recited in any one of the possible designs of the first aspect and the first aspect above; and the output interface circuit is used for outputting the coded sequence or the retransmitted sequence.

Alternatively, the transmitting device may be a chip or an integrated circuit.

In one possible design, when part or all of the functions are implemented by software, the transmitting device includes: a memory for storing a program; a processor for executing the program stored in the memory, the transmitting apparatus being capable of implementing the method as set forth in any one of the possible designs of the first aspect and the first aspect as described above when the program is executed.

Alternatively, the memory may be a physically separate unit or may be integrated with the processor.

In one possible design, when part or all of the functions are implemented by software, the transmitting device includes a processor. The memory for storing the program is located outside the transmitting device, and the processor is connected with the memory through a circuit/wire and is used for reading and executing the program stored in the memory.

In one possible design, the apparatus is a network device or a terminal.

In a fourth aspect, there is provided a receiving apparatus having a function of implementing the method as set forth in any one of the possible designs of the second aspect and the second aspect described above. The functions can be realized by hardware, and the functions can also be realized by executing corresponding software by hardware. The hardware or software includes one or more modules corresponding to the above-described functions.

In one possible design, when part or all of the functions are implemented by hardware, the receiving apparatus includes: an input interface circuit for acquiring a received signal; logic circuitry for performing the acts recited in any one of the possible designs of the second aspect and the second aspect above; and the output interface circuit is used for outputting the decoding result.

Alternatively, the receiving means may be a chip or an integrated circuit.

In one possible design, when part or all of the functions are implemented by software, the receiving apparatus includes: a memory for storing a program; a processor for executing the program stored in the memory, the transmitting apparatus being capable of implementing the method as set forth in any one of the possible designs of the first aspect and the first aspect as described above when the program is executed.

In one possible design, when part or all of the functions are implemented by software, the receiving device includes a processor. The memory for storing the program is located outside the receiving device, and the processor is connected with the memory through a circuit/wire and is used for reading and executing the program stored in the memory.

In one possible design, the apparatus is a network device or a terminal.

In a fifth aspect, there is provided a computer storage medium storing a computer program comprising instructions for performing the method of any one of the first aspect and any one of the possible designs of the first aspect.

In a sixth aspect, there is provided a computer storage medium storing a computer program comprising instructions for carrying out the method of any one of the second aspect and any one of the possible designs of the second aspect.

In a seventh aspect, the present application provides a computer program product containing instructions, which when run on a computer, causes the computer to perform the method of the above aspects.

In an eighth aspect, there is provided a wireless device comprising transmitting means and a transceiver for implementing the first aspect and any possible design of the first aspect,

the transceiver is used for receiving or transmitting signals.

In one possible design, the wireless device is a terminal or a network device.

In a ninth aspect, there is provided a wireless device comprising receiving means and a transceiver for implementing the second aspect and any one of the possible designs of the second aspect,

the transceiver is used for receiving or transmitting signals.

In one possible design, the wireless device is a terminal or a network device.

Drawings

Fig. 1 is a schematic diagram of a communication system architecture applied in an embodiment of the present application;

FIG. 2 is a schematic flow chart of a segmentation method in an embodiment of the present application;

FIG. 3 is a flow chart illustrating RV version verification in an embodiment of the present application;

FIG. 4 is a schematic flow chart of RV1 version confirmation in the embodiment of the present application;

FIG. 5 is a schematic diagram of bit replication in an embodiment of the present application;

fig. 6 is a schematic structural diagram of a transmitting apparatus according to an embodiment of the present application;

FIG. 7 is a second schematic structural diagram of a transmitting apparatus according to an embodiment of the present application;

FIG. 8 is a schematic diagram of a transmitting device in an embodiment of the present application;

FIG. 9 is a diagram illustrating a structure of a receiving apparatus according to an embodiment of the present application;

fig. 10 is a second schematic structural diagram of a receiving apparatus according to an embodiment of the present application;

fig. 11 is a schematic diagram of a receiving device in an embodiment of the present application.

Detailed Description

The embodiments of the present application will be described in detail below with reference to the accompanying drawings.

When Polar codes are considered to be popularized to data channels, a reasonable idea is to reuse the Polar code encoding methods in the existing 5G standard as much as possible, such as nesting characteristics between mother code sequences with different lengths, a selection principle of a rate matching mode, and the like, which is not limited in this application.

The embodiment of the application provides a Polar code encoding method, and specifically comprises a novel data segmentation and HARQ method.

For the sake of understanding of the embodiments of the present application, the following briefly introduces Polar codes.

The coding strategy of Polar codes utilizes a noiseless channel to transmit useful information of users, and a full-noise channel to transmit appointed information or non-transmitted information. Polar code is also a linear block code with a coding matrix of G_NThe coding process is

Wherein

Is a binary line vector with a length of N (i.e. the code length, it can be seen that the lengths of the sequences x and u before and after encoding are both N, and N is also called the code length of the mother code); g_NIs an N × N matrix, and

is defined as log₂N matrices F₂Kronecker (Kronecker) product of (a). The matrix is

In some embodiments, G_NAlso includes a transposed matrix B_NHowever, the essence of Polar coding is not affected, so the application is not limited, and B is not introduced_NThe scheme of (1) is taken as an example.

In the encoding process of the Polar code,

a part of the bits used to carry information is called information bit set, and the index set of these bits is marked as A; the other part of the bits are set as fixed values predetermined by the receiving end and the transmitting end, which are called as a frozen bit set or a frozen bit (frozen bits) set, and the index set uses the complement A of A^cAnd (4) showing. The encoding process of Polar code is equivalent to:

here, G_N(A) Is G_NThe sub-matrix of (A) resulting from those rows corresponding to the indices of set A, G_N(A^C) Is G_NIn (A) is set^cThe index in (1) corresponds to those rows of the resulting sub-matrix. u. of_AIs composed of

The number of the information bit set in (1) is K, and generally, one or more of various Check bits including, but not limited to, Cyclic Redundancy Check (CRC) bits and Parity Check (PC) bits may also be included in the information bit set;

is composed of

The number of frozen bits set in (N-K) is known bits. These freeze bits are usually set to 0, but may be arbitrarily set as long as the receiving end and the transmitting end agree in advance. Thus, the coded output of Polar code can be simplified as:

where u is_AIs composed of

Set of information bits of (1), u_AA row vector of length K, i.e. | a | ═ K, | · indicates the number of elements in the set, K is the information block size, G_N(A) Is a matrix G_NThe sub-matrix of (A) resulting from those rows corresponding to the indices of set A, G_N(A) Is a K × N matrix.

After the code length N of the mother code is determined, the performance of the Polar code is determined by the construction process of the Polar code, namely the selection process of the set A. The Polar code is constructed by determining the co-existing N polarized sub-channels according to the code length N of the mother code, and respectively corresponding to N rows of the coding matrix, regardless ofIn the case of rate matching, the indexes of the first K polarized subchannels with high reliability are used as the elements of the set a, and the indexes corresponding to the remaining (N-K) polarized subchannels are used as the index set a of the frozen bits^cOf (2) is used. Set A determines the position of the information bits, set A^cThe location of the frozen bit is determined. The serial number of the polarized subchannel is the position index of the information bit or the frozen bit, namely

The position index of (1).

When considering rate matching, mainly puncturing (puncturing) or shortening (shorten), it is common to first determine the N-E polarized subchannels that need to be punctured or shortened (i.e., deleted), where E is the target code length, i.e., the length of the bit sequence after rate matching, where the N-E polarized subchannels are selected for placing the frozen bits, in the 5G New Radio (NR) standard, some polarized subchannels, called pre-frozen, are additionally determined for puncturing, and are also used to place the frozen bits, the number of pre-frozen polarising sub-channels is not defined here as P, P being greater than or equal to 0 (for the shortened case, P is obviously 0, this time P may not be considered), and then selecting K polarized subchannels with higher reliability from the remaining E-P polarized subchannels according to the reliability for placing K information bits. Of course, it is also possible to first select the E-P-K subchannels with lower reliability for placing the frozen bits, and the remaining K subchannels for placing the information bits. The reliability of any one of the K polarized subchannels on which the K information bits are placed is higher than the reliability of any one of the E-P-K subchannels on which the frozen bits are placed. In the present application, the value of P is not limited, P may also be 0 even in the case of puncturing, and P may also be greater than 0 even in the case of shortening, which does not affect the implementation of the technical solution of the present application. Meanwhile, in the 5GNR standard, for the selection of N-E polarized subchannels, a sequence after interleaving (for example, dividing into 32 subblocks) of a subblock is placed on a circular buffer (equivalent to a rate matching sequence), if puncturing is performed, reading is started from the nth-E position on the circular buffer, bits from 0 to N-E-1 position are discarded, and if shortening is performed, reading is started from the 0 th position to the E-1 position on the circular buffer, and bits from the E to N-1 position are discarded. This approach does not take into account the relationship between rate matching sequences between different mother code lengths.

It should be noted that the reliability correlation is based on a given reliability calculation method, and different reliability calculation methods may cause the reliability correlation of the polarized sub-channels to change, but the method for selecting the polarized sub-channel for placing the information bits is the same. Outside of the 5G NR standard, information bits may also be considered to be placed in the polarized subchannel that is finally punctured or shortened. The present application does not restrict the selection of the polarized subchannels on which the information bits have to be placed according to the 5G NR criterion.

When the Transport Block Size (TBS) of a data channel is too large, the Transport Block needs to be segmented, and the above description refers to a scheme that can be regarded as an implementation of Polar coding for each segment.

Fig. 1 is a schematic structural diagram of a wireless communication network according to an embodiment of the present invention. Fig. 1 is only an example, and other wireless networks in which the segmentation and retransmission methods or apparatuses according to the embodiments of the present invention can be used are also within the scope of the present invention.

As shown in fig. 1, the wireless communication network 100 includes a network device 110, and a terminal 112. When the wireless communication network 100 includes a core network 102, the network device 110 may also be connected to the core network 102. Network device 110 may also communicate with IP network 104, such as the internet (internet), a private IP network, or other data network, among others. The network device provides services for terminals within the coverage area. For example, referring to FIG. 1, a network device 110 provides wireless access to one or more terminals 112 within the coverage area of the network device 110. In addition, there may be areas of overlapping coverage between network devices, such as

network devices

110 and 120. Network devices may also communicate with each other, for example, network device 110 may communicate with network device 120.

The network device may be a device for communicating with a terminal device. For example, the ue may be an 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. Or the network device may also be a relay station, an access point, a vehicle-mounted device, etc. The network Device may also be a terminal functioning as a base station in a Device-to-Device (D2D) communication system, a Machine-to-Machine (M2M) communication system, and a car networking system.

The terminal may refer to a User Equipment (UE), an access terminal, a subscriber unit, a mobile station, a remote terminal, a mobile device, a User terminal, a wireless communication device, a User agent, or a User Equipment. An access terminal may be a cellular telephone, a cordless telephone, a Session Initiation Protocol (SIP) phone, a Wireless Local Loop (WLL) station, a Personal Digital Assistant (PDA), a handheld device having Wireless communication capabilities, a computing device or other processing device connected to a Wireless modem, a vehicle mounted device, a wearable device, a terminal device in a future communication network, etc.

Based on the communication system architecture shown in fig. 1, in the embodiment of the present application, the execution main body for executing the Polar code encoding method may be the network device or the terminal, and when the network device or the terminal is used as a sending end to send data or information, the Polar code encoding method may be adopted. Correspondingly, when the network device or the terminal is used as a receiving end to receive data or information, the method of the present invention is also required to confirm the segmentation and the HARQ mechanism for corresponding decoding. The segmentation and/or retransmission method provided by the embodiments of the present application will be described in detail below.

Based on the communication system architecture shown in fig. 1, as shown in fig. 2, the present application first provides a mechanism for determining and segmenting data.

Step 210: determining the amount of data N actually transmitted_info；

Number of resources N scheduled according to system_RE(Resource Element, Resource unit), code rate (R), modulation order (Qm), and stream number (v), and determining that the data volume transmittable by the air interface is N_info＝N_RENote that, in practical applications, Ninfo may also be confirmed in other ways, for example, in a mimo system, it is possible that a plurality of streams supported support different modulation schemes, and then the calculation scheme in this case is the sum of the data amount that each stream can transmit and is no longer the product. The present application is not limited;

step 220: determining the number of segments;

order:

N′_info＝max(TBSmfn，2ⁿ*round((N_info-TBcrc)/2ⁿ))

wherein

TBSmin refers to the smallest transport block size, which can typically be taken to be 24 bits;

round is a five-in rounding operation, which can be changed into top rounding or bottom rounding in practical application, and has a certain influence on subsequent operations, such as N 'obtained by top rounding'_infoNot less than N 'from round operation'_infoAnd N 'from round operation'_infoNot less than N 'obtained by lower rounding'_infoThus, the final number of the segments is larger than or equal to the number of the segments obtained by round operation in the upper rounding mode, and the number of the segments obtained by round operation is larger than or equal to the number of the segments obtained by the lower rounding mode;

TBcrc represents the number of bits used for CRC check at Transport Block (TB) level, and may typically be 16, 24, or 32, and may also be 0 if TB is not CRC checked;

n is the quantization level of the current transport block, n_minIs the minimum quantization level of the transport block,quantization here refers to the number of data units comprised by a transport block, typically n_min3 means that a data unit includes 2 bits to the power of 3, i.e. 8 bits, which corresponds to a byte, and if n is 3, the quantization may refer to how many bytes the transport block includes. n0 is a quantization adjustment, and can be typically 4, 5, 6, etc.;

for the down-rounding operation, here also round operation or up-rounding can be changed, the influence on the system mainly being seen as resulting in N'_infoLarger or smaller;

log2() represents a base 2 logarithmic operation.

As can be seen from the above description, N'_infoCan be seen as N_infoThe adjustment is made according to the quantization level to ensure that the number of included data units is an integer.

Setting K _ threshold as a preset segmentation threshold, the value of the segmentation segment number C is:

wherein is

The operation of rounding up, note that here is only the operation of rounding up, and not the operation of round or rounding down, else being denoted. In addition, the ">" may also be "≧" which indicates that segmentation is also performed when the threshold value is obtained, and whether to segment the threshold value may be determined according to needs in a specific application, which is not limited herein.

K-threshold Kcb-CBcrc (equation III)

Kcb represents the maximum number of bits to be coded that a channel coding Block can include, which also includes the number of bits CBcrc of Code Block (CB) level CRC, where the typical value of CBcrc is 6, 8, 16, 24, 32, etc. A more common method is

Wherein Nmax is the maximum number of bits that can be transmitted at a single time, and when applied to Polar code encoding, Nmax is exactly equal in value to the maximum mother code length supported during initial transmission, 2ⁿ¹Indicating the quantization unit, which may correspond to the minimum quantization level described above, e.g., n 1-3, i.e., quantized in bytes, thus 2ⁿ¹Or directly 8. As for the round operation or round operation in which the upper rounding is also changed, it can be seen from the above formula that the larger Kcb means that the probability of segmentation becomes smaller or the number of segments tends to become smaller.

Step 230: determining TBS and number of bits to be encoded per segment

After the number of segments C is determined, the actual TBS to be transmitted can be obtained as follows:

from the above formula, it can be seen that TBS can be regarded as N'_infoAnd further adjusting the result according to the segmentation condition. Note that TBS here is the data payload size for which no CRC check has been performed, 2ⁿ²Since n2 is generally equal to n1, n2 may be 3 or 2, which represents a quantization unitⁿ²Or directly 8.

Accordingly, the number K of bits to be encoded included in each segment is:

note that when C is 1, since there is no segment, i.e., TB is equal to CB, only one CRC check needs to be performed. The formula six adopts TB-level CRC, the actual application can be changed into CBcrc according to the specification, and only the transmitting end and the receiving end are unified.

Although the segmentation decision and the TBS calculation are performed by a plurality of separate formulas with a plurality of steps as shown in fig. 2, in practical applications, some or even all of the formulas and steps may be combined or the order of the calculation may be changed without affecting the final result.

The above method shown in fig. 2 is based on that in the case that the TBS has not been determined, if the size of the TBS is known explicitly, it is easier to determine whether to segment, and the number of segments C may be:

similarly, where ">" may also be "≧" which means that segmentation is also performed when the threshold value is obtained, which is not limited herein.

The number K of bits to be encoded included in each segment can also be calculated by the formula six.

It should be noted that the segmentation method is applicable to various channel codes including Polar coding and LDPC coding.

Since the processing principle and method of each segmented transport block are consistent, the following embodiments are all described as the case where C is 1, where CRC refers to CB level CRC. That is, the transmitting end performs segmentation after acquiring the transmission block, then encodes K bits to be encoded in each segment to obtain an encoded sequence or a retransmitted sequence, and then transmits the encoded sequence or the retransmitted sequence, and receives the transmission block to be decoded at the receiving end, where each corresponding segment is a received signal (i.e., an encoded sequence or a retransmitted sequence) containing information of the K bits to be encoded, and performs corresponding decoding.

Then, when Polar code is used as the channel coding method of the data channel, if there is an error in the initial transmission (initial transmission for short), how is the retransmission performed? The HARQ scheme of Polar code is not specified in the existing 3GPP protocol, so on the one hand, the initial transmission scheme of the data channel may consider multiplexing the existing 3GPP technology, including the selection of the rate matching scheme and the selection principle of the information bits, but since the transport block supported by the data channel is large, Nmax must be increased, and the corresponding reliability ordering sequence is also designed, which is not the scope of the present invention, and therefore is not limited. On the other hand, there is first provided a retransmission method: that is, when the initial transmission is in error, the first retransmission adopts an Incremental Redundancy (IR) mode, and the subsequent retransmission adopts a Chase Combining (CC) mode. This approach can take advantage of the IR approach and simplify the design, which is a good compromise.

As shown in fig. 3, an embodiment of how to construct a Redundancy Version (RV) for retransmission of HARQ transmissions is disclosed.

Operation 310: and the sending end carries out Polar coding on the obtained bit sequence to be coded to obtain a coded first bit sequence, and obtains an initial transmission version RV0 according to a rate matching mode.

The present step may be performed using known techniques. For example, according to the standard of 3GPP, the first bit sequence after encoding is written into the first cyclic buffer after interleaving, and when the initial transmission code rate R0 is less than or equal to 7/16, a puncturing rate matching method is adopted, where RV0 is the last E0 bits in the first cyclic buffer; and when the R0 is larger than 7/16, a shortened rate matching mode is adopted, and then RV0 is the first E0 bits in the first circular buffer. Wherein, R0 ═ K/E0, and E0 is the number of bits actually transmitted over the air interface in the initial transmission.

Operation 320: the length E1 of the retransmitted version RV1 is determined.

E1 is the number of bits that can be transmitted by the first retransmission, and the specific value method is consistent with the method for determining E0.

Operation 330: and determining RV1 according to the initial transmission code rate R0 and a retransmission rate matching mode.

When R0 is less than or equal to the preset rate threshold R _ threshold (i.e. R0 ≦ R _ threshold), the RV1 version with E1 length can be directly read from the first circular buffer of the initial transmission. Wherein R _ threshold may take any value between 1/4 and 1/2, such as 1/4, 3/8, 7/16, 15/32, 1/2, and the like. RV1 may be the first E1 bits in the first circular buffer or E1 bits read clockwise from the beginning of the first circular buffer, and this method may preferentially put the bits not transmitted in the initial transmission into RV 1. How to read RV1 from the first circular buffer may also be determined based on rate matching for retransmissions in a manner similar to the initial transmission. And are not limited thereto.

When R0 is greater than R _ threshold (i.e., R0 > R _ threshold), the encoded second bit sequence may be generated in an IR manner, and rate matching may be performed according to one or more parameters including, but not limited to, code rate, Nmax, mother code length N0 used in the initial transmission encoding, E0, E1, and the like, so as to obtain RV 1.

Specifically, if E1 is greater than or equal to N0, the rate matching manner for retransmission is repeated, otherwise, when R0 is less than or equal to the preset rate threshold R _ threshold _ initial, the rate matching manner for retransmission is puncturing, and when R0 is greater than the preset rate threshold R _ threshold _ initial, the rate matching manner for retransmission is shortened. Wherein R _ threshold _ initial is a threshold for determining a rate matching method at the initial transmission, and its value in the 5G NR standard is 7/16, which may be other preset values. For simplicity, let R _ threshold _ initial be R _ threshold. Of course, when R0 is equal to R _ threshold, the same manner as when R0 is greater than R _ threshold may be adopted, specifically, the two ends of the transceiver are agreed.

In one possible design, if E1 is greater than or equal to N0, the rate matching manner for retransmission is repeated, otherwise, when R0 is greater than the preset code rate threshold R _ threshold _ initial and the length E1 of the retransmission version RV1 is less than the length E0 of the initial transmission version RV0, the rate matching manner for retransmission may be shortened, punctured, or a combination of both.

Optionally, when the rate matching mode of the initial transmission is shortening, the rate matching bits during retransmission consist of two parts, namely, puncturing bits and shortening bits, wherein the number and the position of the shortening bits are the same as those of the shortening bits during the rate matching of the initial transmission; the number of punctured bits is E0-E1, and the punctured bit positions can be determined according to the puncturing pattern of NR rate matching.

Optionally, when the initial rate matching mode is repetition, the rate matching bits during retransmission are composed of punctured bits, where the number of punctured bits is N0-E1, and the punctured bit positions may be determined according to the puncturing mode of NR rate matching.

Optionally, after determining the position of the punctured bit, partial bit positions may also be pre-frozen, but unlike the way in which the pre-frozen bit positions are determined by the existing NR protocol, the present application proposes a new method for determining the pre-frozen bit positions, which specifically includes:

1. determining other polarization subchannels corresponding to the ith sub-block as pre-frozen polarization subchannels if the number Pi of punctured bits in the ith sub-block exceeds a preset value, where the preset value may be a constant, for example, 0,1, 10, 16, or the like; or

2. And if the number Pi of punctured bits in the ith sub-block exceeds a preset proportion of the total number of the polarized sub-channels corresponding to the sub-block, determining other polarized sub-channels corresponding to the sub-block as the pre-frozen polarized sub-channels, wherein the preset proportion can be 1/16, 1/8, 1/4, 1/2 and the like.

Of course, if all the polarized subchannels corresponding to a certain sub-block are punctured, the pre-frozen polarized subchannels do not exist in the sub-block.

Specifically, as in the embodiment shown in fig. 4, the following operations may be employed:

operation 330 a: obtaining a subchannel set Q1, wherein the Q1 includes K elements, which are sequence numbers of K subchannels used for placing K bits to be encoded in the initial transmission, and this may be obtained in operation 310;

operation 330 b: increasing the serial numbers of all the sub-channels in the Q1 by N0 to obtain a sub-channel set Q2, where Q2(i) ═ Q1(i) + N0, where i ═ 0,1, …, K-1; without loss of generality, the present application also illustrates the numbering of the subchannel numbers starting from 0. If the number is numbered from 1, the number is correspondingly increased by 1, and the description is omitted;

operation 330 c: and determining a subchannel set Q3 of K1 bits to be coded when the mother code length is N1 according to the reliability ordering sequence with the length of N1-2 × N0 and the retransmission rate matching mode. The elements in Q3 satisfy: q3(i) < N0 or Q3(i) ∈ Q2, where i is 0,1, …, and K1-1, where K1 is K + K _ adjust, and K _ adjust is a newly added bit to be encoded, and has a value of 0 or CBcrcl, CBcrcl may be 0 or not 0, and the reason why the value of 0 is not 0 is that some CRC checks may need to be performed again to improve reliability of retransmission when retransmission is considered, and the value of CBcrc1 may be determined by any one of the following manners:

● mode one: set to 0;

mode two: based on the condition judgment, when N0 is 4096, setting the value to a first preset value, such as 6, 8, 16, 24 and the like, otherwise setting the value to 0;

mode three: based on the condition judgment, when N0 is 4096 and E1 > -Alpha E0 is set as a first preset value, which may be set to 6, 8, 16, 24, etc., or otherwise set to 0, wherein Alpha may take any value in the interval [1/2, 1], such as 1/2, 3/4, 7/8, 1, etc.;

CBcrc1 may be used in the same manner as the CRC of the initial transmission, or may be a shorter CRC polynomial, for example, a 24-bit CRC for the initial transmission and an 8-bit CRC for the retransmission (i.e., CBcrc1 ═ 8);

operation 330 d: determining an extended bit set Qext to be coded, wherein elements in the extended bit set Qext are elements smaller than N0 in Q3;

when CBcrc1 takes the value of mode two and does not take the value of 0, the following operation 330e0 (not shown in the figure) is also required. It should be noted that operation 330e0 may of course be performed when CBcrc1 is 0, but has no effect on the result, so it is generally recommended that operation 330e0 not be performed when CBcrc1 is 0.

Operation 330e 0:

when the | Qchk | ═ 0 (i.e., | Qext | ═ CBcrc1), the value of CBcrc1 is adjusted to 0, otherwise, the value is not adjusted;

optionally, when | Qchk | ≠ 0, the value of CBcrc1 may be further determined and adjusted, for example:

0 < | Qchk | < ═ Chk _ threshold (Chk _ threshold is a preset threshold value, and typically may be 10, 50, etc.), the value of CBcrc1 is adjusted to a second preset value, which is smaller than the first preset value, for example, adjusted from 8 to 6 or adjusted to 3, etc.;

operation 330 e: determining a copy bit set Qchk-Q2 \ (Q3 \/Qext), wherein \ "represents the difference operation of the set, namely A \ B represents all elements belonging to A and not belonging to B;

operation 330 f: and selecting bit values on the sub-channels in part or all of the Qchk to copy the bit values on the corresponding sub-channels of Qext one by one. Fig. 5 shows a schematic diagram: in Qext, CBcrc1 subchannels are selected first for placing CRC bits (when CBcrc1 ═ 0, this step is omitted), bits from the sub-channel of Qchk are selected | Qext | -CBcrc1 and copied to the remaining | Qext | -CBcrcl subchannels in Qext, and these CBcrcl CRC bits are used to perform CRC check on these | Qext | -CBcrc1 copied bits, where operation | a | represents the number of elements in set a. The method for selecting the CBcrc1 sub-channel in the Qext and the | Qext | -CBcrc1 sub-channel in the Qchk may be sequentially selected from the front to the back or from the back to the front according to a natural sequence, or sequentially selected from the front to the back or from the back to the front according to the reliability of the sub-channels, and the selection methods may be the same or different, and are not limited herein; when the position of Qchk needs to be selected in Qext for placing the duplicated bits when Qext is larger and Qchk is smaller, the selection method is similar, i.e. the selection can be performed sequentially from front to back or from back to front in a natural order, or sequentially from front to back or from back to front according to the reliability of the sub-channels. No matter which selection method is adopted, the sending end and the receiving end only need to agree to be unified.

Operation 330 g: and performing Polar code retransmission coding with the mother code length of N1 on the K bits to be coded according to the determined positions and values to obtain a second bit sequence after polarization coding, and then obtaining RV1 from the first N0 bits of the second bit sequence according to a retransmission rate matching mode. In particular, the manner in which RV1 is derived from the first N0 bits may be consistent with the manner in which RV0 is derived from the first bit sequence.

To better illustrate the above steps, a specific example is given below.

Assuming N0-64 and N1-128, the reliability-ordering sequence in the 3GPP 5G NR standard is not directly adopted:

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]。

assuming that E0 is 60 and K is 50, so R is 5/6 and R _ threshold is 7/16, it is necessary to construct RV1 in an IR manner, and the initial transmission adopts a shortened rate matching manner.

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]；

Correspondingly:

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]；

assuming E1 is exactly equal to E0 and 60, the shortened rate matching scheme is also applied to the sub-channels 64-127, so that all the shortened sub-channels are Q_RM＝[60 61 62 63 124 125 126 127]；

When K _ adjust is 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]；

if CBcrc1 is equal to 0, the bits of the subchannel in Qchk may be copied to Qext in the order described above, or the bits of the subchannel with the larger number in Qchk may be copied to the subchannel with the smaller number in Qext in consideration of the decoding order, that is, the bits of subchannel 98 may be copied to subchannel 31, the bits of subchannel 97 may be copied to subchannel 46, and so on, and the bits of subchannel 70 may be copied to subchannel 59.

If CBcrc1 is equal to 8, 8 subchannels except 31, 46 in Qext may be used to carry the additional CRC bits. The values of the selected sub-channels 70 and 71 in Qchk may be copied to the sub-channels 46 and 31, respectively. The 8 CRC bits are used to perform a CRC check on the 2 bits. It can be seen that in this case 8 CRC bits are obviously redundant, so in practical applications, it is also possible that the number of bits to be coded does not require a new CRC bit in the first interval, and a new CRC bit in the second interval, or a fewer CRC bits in the third interval, and a greater number of CRC bits in the fourth interval. Specific interval division, whether CRC is newly added and how many CRC bits are newly added to the end are only required to be unified by the sending end and the receiving end.

When K _ adjust is 8, Q3 may be:

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]；

correspondingly, Q2, Qext, Qchk are respectively:

Qext＝[29 30 31 43 45 46 47 51 53 54 55 57 58 59]；

Qchk＝[70 74 76 81 82 97]。

the 8 sub-channels Qext 47, 51, 53, 54, 55, 57, 58, 59 may be used to carry the additional CRC bits, while the bits on the 6 sub-channels Qchk may be copied to the 6 sub-channels 29, 30, 31, 43, 45, 46, specifically, the bits of sub-channel 70 may be copied to sub-channel 46, the bits of sub-channel 74 may be copied to sub-channel 45, and so on, and the bits of sub-channel 97 may be copied to sub-channel 29.

It can be seen that even for the same CBcrcl, the value of K _ adiust is different, which affects the final result. And therefore must be unified at both the transmitting and receiving ends.

Operation 340: the RV0 and the RV1 are input into a second circular buffer in a cascade mode;

operation 350: and further retransmitting.

If the RV1 sent by the first retransmission is decoded correctly,

operations

340 and 350 are not needed, so the dashed lines indicate that if the first retransmission is still not decoded correctly, further retransmission is needed, as described above, CC retransmission is adopted at this time, and then the sending end can directly read the corresponding version from the second circular buffer for sending. For example, the x-th transmitted bit may be Ex bits (the number of bits transmitted over the air) read from the first bit after the last bit position of the last transmission, or Ex bits read from the first bit after the last bit position of the RV version (RV0 or RV1) used in the last transmission, where x is greater than 1.

In practical applications, step 330 of determining RV1 (scheme one 330) can also be implemented in another way to simplify operations:

scheme two, 330: when the initial transmission rate R0 is less than or equal to the preset rate threshold R _ threshold (i.e. R0 ≦ R _ threshold, which may be consistent with the foregoing examples of values, for example, 7/16), RV1 is composed of bits from the mod (N0- (E0+ E1), N0) positions to the mod (N0-E0-1, N0) positions in the first circular buffer, where mod represents a modulo operation, and it is noted that the position numbers here are from 0; alternatively, when the initial transmission code rate R0 is greater than R _ threshold, RV1 is composed of bits from the mod (min (E0, N0) -E1, min (E0, N0)) position to the mod (min (E0, N0) -1, min (E0, N0)) position in the first circular buffer arranged in the order of their positions in the first circular buffer.

It can be seen that scheme two 330 prioritizes the bits that do not participate in transmission when the initial transmission is transmitted during retransmission, thereby simplifying the flow. Therefore, in practice, the retransmission scheme shown in scheme one 330 may be adopted, or the retransmission scheme shown in scheme two 330 may be adopted. Particularly, the two modes can be simultaneously supported to adapt to different requirements, and in this case, a specific retransmission mode can be explicitly or implicitly notified through a downlink control signaling DCI or a radio resource control signaling RRC or other control signaling, so that the retransmission mode uniformly and explicitly adopted by the receiving end and the transmitting end is either the first scheme 330 or the second scheme 330.

No matter the channel is initially transmitted or retransmitted, in order to overcome the channel influence, the channel interleaving operation can be performed on the transmission bits after rate matching, specifically, the bits to be transmitted can be input into a channel interleaver and then the interleaved bits are transmitted, and generally, the interleaver can be selected as a row-column interleaver, and is written in by rows and read out by columns, or is written in by columns and read out by rows; in order to make the distribution of the transmitted bits more uniform in the interleaver and ensure random performance, the number of rows of the row-column interleaver may be 14, and the number of columns of the xth transmission is

Wherein x is an integer greater than or equal to 0, and when x is 0, it represents the initial transmission, and when x is other value, it represents the second retransmission.

Although RV1 is determined in separate steps as in fig. 3, some of the steps may be combined or changes may be made to the sequential order of the calculations without affecting the final result in practical applications.

The above description of the embodiment of fig. 3 is for the transmitting side, but in fact, the operations of the receiving side are also very similar, except that in operation 310, decoding is performed instead of encoding, and the decoded first bit sequence is obtained, and the remaining methods and principles for determining RV0 and RV1 are all identical, except that RV0 and RV1 are used for IR combining or CC combining in each retransmission, so as to obtain and output the decoding result. Of course, the transmission in operation 350 is changed to reception accordingly. And thus will not be described in detail.

As shown in fig. 6, in the embodiment of the present application, a sending apparatus 600 is further provided. Part or all of the segmentation method shown in fig. 2 and the retransmission methods shown in fig. 3 and 4 may be implemented by hardware or software.

For the transmitting apparatus 600, the transmitting apparatus 600 is configured to perform the segmentation and retransmission method shown in fig. 2-5 based on the same inventive concept of the segmentation and retransmission method shown in fig. 2-5. When implemented by hardware, the transmission apparatus 600 includes: an input interface circuit 601, configured to obtain a transmission block to be transmitted; the logic circuit 602 is configured to execute the segmentation and retransmission methods shown in fig. 2 to 5, which are specifically described in the foregoing method embodiments and will not be described herein again; an output interface circuit 603 for outputting the encoded sequence or the retransmitted sequence. Further, 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) on the encoded sequence or the retransmitted sequence and then transmits the processed sequence or the retransmitted sequence through the antenna 630. Optionally, the transmitting apparatus 600 may be a chip or an integrated circuit when implemented.

Optionally, when part or all of the segmentation and retransmission methods of the foregoing embodiments are implemented by software, as shown in fig. 7, the transmitting apparatus 700 includes: a memory 701 for storing a program; the processor 702 is configured to execute the program stored in the memory 701, and when the program is executed, the transmitting apparatus 700 is enabled to implement the segmentation and retransmission method provided in the foregoing embodiments.

Alternatively, the memory 701 may be a physically separate unit or may be integrated with the processor 702.

Alternatively, when part or all of the segmentation and retransmission methods of the above embodiments are implemented by software, the transmitting apparatus 700 may only include the processor 702. A memory 701 for storing programs is located outside the transmitting device 700, and a processor 702 is connected to the memory 701 through a circuit/wire for reading and executing the programs stored in the memory 701.

Based on the segmentation and retransmission methods shown in fig. 2 to 5, as shown in fig. 8, an embodiment of the present application further provides a sending device 800, configured to execute the segmentation and retransmission methods shown in fig. 2 to 5, where the sending device 800 includes:

an obtaining unit 801, configured to obtain a transmission block to be transmitted;

a segmenting unit 802, configured to segment the to-be-transmitted transmission block according to the segmenting method in the embodiment shown in fig. 2;

an encoding unit 803, configured to encode or retransmit each segmented transport block;

a determining unit 804, configured to determine RV0 version and RV1 version according to the retransmission method of the embodiments shown in fig. 3-5.

The apparatus at the receiving end may also be similarly designed corresponding to the transmitting end.

As shown in fig. 9, the receiving apparatus 900 includes: the input interface circuit 901 is used for inputting a received signal, and the logic circuit 902 is used for executing the aforementioned segmentation and retransmission method for decoding to obtain a decoding result; the output interface circuit 903 is used for outputting the decoding result. The receiving device 900 may also include a transceiver 920 to acquire a received signal through an antenna 930. And may be a chip or an integrated circuit when embodied.

Optionally, when part or all of the segmentation and retransmission methods of the foregoing embodiments are implemented by software, as shown in fig. 10, the receiving apparatus 1000 includes: a memory 1001 for storing a program; the processor 1002 is configured to execute the program stored in the memory 1001, and when the program is executed, the receiving apparatus 1000 may implement the segmentation and retransmission method provided in the foregoing embodiments.

Alternatively, the memory 1001 may be a physically separate unit, or the processor 1002 may be integrated.

Optionally, when part or all of the segmentation and retransmission methods of the above embodiments are implemented by software, the receiver 1000 may also include only the processor 1002. A memory 1001 for storing programs is located outside the receiving device 1000, and a processor 1002 is connected to the memory 1001 through a circuit/wire 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 a CPU and an NP.

The processor 702 and/or the processor 1002 may further include hardware chips. The hardware chip may be an application-specific integrated circuit (ASIC), a Programmable Logic Device (PLD), or a combination thereof. The PLD may be a Complex Programmable Logic Device (CPLD), a field-programmable gate array (FPGA), a General Array Logic (GAL), or any combination thereof.

The memory in the above embodiments may include volatile memory (volatile memory), such as random-access memory (RAM); the memory may also include a non-volatile memory (non-volatile memory), such as a flash memory (flash memory), a Hard Disk Drive (HDD) or a solid-state drive (SSD); the memory may also comprise a combination of memories of the kind described above.

Based on the foregoing segmentation and retransmission method, as shown in fig. 11, an embodiment of the present application further provides a receiving device 1100, where the receiving device 1100 is configured to execute the foregoing segmentation and retransmission method, and the receiving device 1100 includes:

an acquisition unit 1101 configured to acquire a received signal;

a segmenting unit 1102, configured to segment the to-be-transmitted transmission block according to the segmenting method in the embodiment shown in fig. 2;

a determining unit 1103, configured to determine RV0 version and RV1 version according to the retransmission method in the embodiments shown in fig. 3-5;

a decoding unit 1104, configured to decode each segment of the received transport block.

Embodiments of the present application further provide a computer storage medium storing computer program instructions, which when executed by a computer, cause the foregoing segmentation and retransmission method to be performed.

Embodiments of the present application further provide a computer program product containing instructions that, when run on a computer, cause the aforementioned segmentation and retransmission methods to be performed.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or 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, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

Further variations and modifications of the embodiments described herein will occur to those skilled in the art once they learn of the basic inventive concepts. Therefore, it is intended that the appended claims be interpreted as including preferred embodiments and all alterations and modifications as fall within the scope of the application.

It will be apparent to those skilled in the art that various changes and modifications may be made in the embodiments of the present application without departing from the spirit and scope of the embodiments of the present application. Thus, if such modifications and variations of the embodiments of the present application fall within the scope of the claims of the present application and their equivalents, the present application is also intended to encompass such modifications and variations.

Claims

1. A retransmission method, comprising:

determining the length E1 of the retransmission version RV 1;

and sending the RV 1.

2. The method of claim 1, wherein the determining the retransmission version RV1 according to the initial transmission code rate R0 comprises:

3. The method of claim 2, wherein the obtaining RV1 from the second bit sequence is:

obtaining a set of sub-channels Q3, wherein Q3(i) < N0 or Q3(i) ∈ Q2 where i ═ 0,1, …, K-1;

determining a copy bit set Qchk-Q2 \ Q3\ Qext;

4. The method of claim 3, the Q3 is determined according to a reliability-ordered sequence of length N1 and a rate-matching manner of retransmissions.

5. The method of claim 3 or 4, wherein said encoding said K bits to be encoded by Polar codes of mother code length N1 according to said Q2, said Q3, said Qext, said Qchk comprises:

6. The method of any of claims 2-5, wherein the obtaining RV1 from the second bit sequence is:

7. The method according to any of claims 1-6, wherein before the transmitting device obtains the sequence of bits to be encoded including K bits to be encoded, further comprising:

segmentation is performed according to the transport block size TBS.

8. The method of claim 7,

the segmented segment number C is as follows:

9. The method of claim 8,

where CBcrc is the number of CRC bits at the code block CB level.

10. The method of claim 8 or 9,

wherein 2ⁿ²N2 is a positive integer, N 'in quantization units'_infoAdjustment of the transmittable data quantity Ninfo according to the quantization level。

11. The method of claim 10, wherein N'_infoComprises the following steps:

N′_info＝max(TBSmin，2ⁿ*round((N_info-TBcrc)/2ⁿ))

for the lower rounding operation.

12. The method of any of claims 1-11, further comprising:

the transmitting device retransmits according to RV0 and RV 1.

13. A transmitting device, comprising:

an obtaining unit, configured to obtain a bit sequence to be encoded, where the bit sequence to be encoded includes K bits to be encoded, where K is a positive integer;

the coding unit is used for carrying out polarization coding on the sequence to be coded to obtain a coded first bit sequence, and the length of the first bit sequence is N0;

the determining unit is used for determining the length E1 of the initial transmission version RV0 and the retransmission version RV1 and determining the retransmission version RV1 according to the initial transmission code rate R0.

14. The apparatus of claim 13, wherein the determining the retransmission version RV1 according to the initial transmission code rate R0 comprises:

15. The apparatus of claim 14, wherein the obtaining RV1 from the second bit sequence is:

determining a copy bit set Qchk-Q2 \ Q3\ Qext;

16. The apparatus of claim 15, wherein the Q3 is determined according to a reliability-ordered sequence of length N1 and a rate-matching manner of retransmissions.

17. The apparatus of claim 15 or 16, wherein said Polar code encoding of said K bits to be encoded according to said Q2, said Q3, said Qext, said Qchk with mother code length N1 comprises:

18. The apparatus of any one of claims 14-17, wherein said obtaining RV1 from the second bit sequence is:

19. The apparatus of any one of claims 13-18, further comprising:

a segmentation unit configured to perform segmentation according to the transport block size TBS.

20. The apparatus of claim 19,

the segmented segment number C is as follows:

21. The apparatus of claim 20,

where CBcrc is the number of CRC bits at the code block CB level.

22. The apparatus of claim 20 or 21,

23. The apparatus of claim 22, wherein N'_infoComprises the following steps:

N′_info＝max(TBSmin，2ⁿ*round((N_info-TBcrc)/2ⁿ))

for the lower rounding operation.

24. The apparatus of claims 13-23, wherein the determination unit is further configured to:

RV0 and RV1 are cascaded into the second circular buffer.

25. A transmitting apparatus, comprising:

the input interface circuit is used for acquiring a transmission block to be transmitted;

logic circuitry configured to obtain an encoded sequence or a retransmitted sequence based on the transport block to be transmitted according to the method of any one of claims 1 to 12, wherein;

and the output interface circuit is used for outputting the coded sequence or the retransmitted sequence.

26. A transmitting apparatus, comprising: a processor for performing the method of any one of claims 1-12 when executing program instructions.

27. The apparatus of claim 25, further comprising: a memory for storing the program instructions.

28. A computer-readable medium, in which computer program instructions are stored which, when executed by a computer, cause the method of any one of claims 1-12 to be performed.