Retransmission method and device

Abstract

The present application discloses a segmentation and retransmission method and apparatus, including: a transmitting device performs segmentation after obtaining a transport block to be transmitted; then performs new coding on bits to be coded in each segment to obtain a coded first bit sequence, the length of the first bit sequence being N0; determines an initial transmission version RV0; determines a length E1 of a retransmission version RV1; determines a retransmission version RV1 based on an initial transmission code rate R0; and determines retransmission data based on RV0 and / or RV1. In this method, retransmission can be realized in a relatively simple manner based on consideration of existing standards.

Description

[Technical field]

[0001] FIELD OF THE DISCLOSURE The embodiments of the present application relate to the field of communication technologies, and in particular to a retransmission method and apparatus. [Background technology]

[0002] As the most basic wireless access technology, channel coding plays an important role in ensuring reliable data transmission. In existing wireless communication systems, turbo codes, low density parity check (LDPC) codes, and polar codes are commonly used for channel coding. Turbo codes cannot support information transmission at too low or too high code rates. In the transmission of medium and short packets, turbo codes and LDPC codes are difficult to achieve ideal performance with limited code length due to the encoding and decoding characteristics of turbo codes and LDPC codes. In terms of implementation, turbo codes and LDPC codes have relatively high computational complexity in the implementation process of encoding and decoding. Polar codes are good codes that can obtain the theoretically proven Shannon capacity and have relatively low encoding and decoding complexity. Therefore, polar codes are increasingly being used more widely. In the 5th generation (5G) communication system, polar codes are determined as the coding scheme of the control channel. Therefore, the encoding procedure of polar codes is specified in detail in the standard, including specific processes such as segmentation, determination of the rate matching scheme, as well as mapping, encoding, and rate matching of information bits and check bits (including cyclic redundancy check bits and / or parity check bits) on the polarization channels.

[0003] However, in the 5G standard, the Polar code is only used for the control channel, and therefore, the Hybrid Automatic Repeat reQuest (HARQ) mechanism is not designed. In the data channel, the use of HARQ effectively improves the transmission reliability and further increases the system throughput. Therefore, how to design an appropriate HARQ solution for the Polar code encoding mechanism becomes an urgent problem to be solved in the topic of applying the Polar code to data channel transmission.

Summary of the Invention

[0004] Embodiments of the present application provide a retransmission method and apparatus applicable to wireless communication, which have the advantages of simple implementation.

[0005] The specific technical solutions provided in the embodiments of the present application are as follows.

[0006] According to a first aspect, a retransmission method is provided. A transmitting device obtains a sequence of bits to be encoded including K bits to be encoded, where K is a positive integer. Perform Polar coding on the sequence to be encoded to obtain a first encoded bit sequence, where the length of the first bit sequence is N0. Determine an initial transmission version RV0. Determine the length E1 of a retransmission version RV1. Determine the retransmission version RV1 based on the initial transmission code rate R0. Transmit RV1.

[0007] According to such an implementation method, on the one hand, the design of existing standards is reused as much as possible, and on the other hand, the advantages of existing HARQ mechanisms are absorbed. Therefore, the implementation is simple and the performance can also meet the requirements.

[0008] In one possible design, determining the retransmission version RV1 based on the initial transmission code rate R0 involves when R0 is less than or equal to a preset code rate threshold R_threshold, RV1 is the E1 bit read from the first circular buffer for initial transmission Deciding to or when R0 is greater than R_threshold, generating a second bit sequence encoded by the incremental redundancy IR method and obtaining RV1 based on the second bit sequence, where the length of the second bit sequence is N1 and N1 = 2 * N0.

[0009] In one possible design, obtaining RV1 based on the second bit sequence involves obtaining a subchannel set Q1, where Q1 contains K elements and the K elements are the sequence numbers of K subchannels used to arrange K bits to be encoded during initial transmission, obtaining a subchannel set Q2, where Q2(i) = Q1(i) + N0 for i = 0, 1,..., and K - 1, and N0 is the mother code length of the polar code used during initial transmission, obtaining a subchannel set Q3, where Q3(i) < N0 or Q3(i) ∈ Q2 for i = 0, 1,..., and K - 1, determining an extended set of bits to be encoded Qext, where the elements in Qext are the elements that are in Q3 and less than N0, determining a set of duplicate bits Qchk = Q2\(Q3\Qext), and performing polar code encoding on the K bits to be encoded using the mother code length of N1 based on Q2, Q3, Qext, and Qchk to obtain the second bit sequence.

[0010] In one possible design, Q3 is determined based on a reliability ordering sequence of length N1 and a rate matching method for retransmission.

[0011] In one possible design, performing polar code encoding on K bits to be encoded based on Q2, Q3, Qext, and Qchk with a mother code length of N1 can be This involves selecting bit values ​​on some or all of the sub-channels in Qchk and duplicating the bit values ​​one by one to the corresponding sub-channels in Qext.

[0012] In one possible design, obtaining RV1 based on the second bit sequence may include: Based on the rate matching scheme for retransmission, RV1 is obtained from the first N0 bits of the second bit sequence.

[0013] In one possible design, before the transmitting device obtains a bit sequence to be encoded, the bit sequence including K bits to be encoded, the method includes: The method further includes performing segmentation based on a transport block size TBS.

[0014] In one possible design, the number of segments C of the segmentation is:

number

[0015] In this specification, TBcrc is the number of cyclic redundancy check (CRC) bits at the transport block TB level, and K_threshold is a pre-configured first threshold value.

[0016] In one possible design,

number

[0017] In this specification, CBcrc is the number of CRC bits at the code block CB level.

[0018] In one possible design,

number

[0019] In this specification, 2 n2 is the quantization unit, n2 is a positive integer, and N info ’ is the volume of data that can be transmitted, N info is obtained by adjusting based on the quantization level.

[0020] In one possible design, N info ’ teeth,

number

[0021] In this specification, TBSmin is the minimum transport block size, round is the rounding operation, n is the quantization level of the transport block to be transmitted, and n min is the minimum quantization level, n0 is the quantization adjustment value,

number

[0022] In one possible design, the method includes: The transmitting device inputs RV0 and RV1 into a second circular buffer in a cascaded manner; The method further includes a step of the transmitting device performing retransmission based on RV0 and RV1.

[0023] According to a second aspect, there is provided a retransmission method, comprising: A step in which a receiving device receives a received signal including information of K bits to be encoded, and a mother code length corresponding to the received signal is N0, and a step of determining an initial transmission version RV0, and A step of determining a length E1 of a retransmission version RV1, and A step of determining a retransmission version RV1 based on an initial transmission code rate R0, and A step of performing decoding based on RV0 and RV1, and Includes 。

[0024] In one possible design, determining the retransmission version RV1 based on the initial transmission code rate R0 means that when R0 is less than or equal to a preset code rate threshold R_threshold, RV1 is the E1 bits read from a first circular buffer for initial transmission, Deciding to or when R0 is greater than R_threshold, RV1 is the encoded data generated by the incremental redundancy scheme. based on a second bit sequence Take obtained Be where the length of the second bit sequence is N1 and N1 = 2 * N0.

[0025] In one possible design, the second bit sequence S 、 Obtained based on a sub-channel set Q1, a sub-channel set Q2, a sub-channel set Q3, an extended set of bits to be coded Qext, and a duplicated set of bits Qchk; Q 1 includes K elements, and the K elements are sequence numbers of K sub-channels used to arrange K bits to be encoded during initial transmission, the law of nature 、 Q 2(i) = Q1(i) + N0, i = 0, 1,..., and K - 1, where N0 is the mother code length of the polar code used during initial transmission, the law of nature 、 Q 3(i) < N0, or Q3(i) ∈ Q2, i = 0, 1,..., and K - 1, the law of nature 、 Q ext About, the elements in Qext are those in Q3 and less than N0. the law of nature , Q chk=Q2\(Q3\Qext) is .

[0026] In one possible design, Q3 is determined based on a reliability ordering sequence of length N1 and a rate matching scheme for retransmission.

[0027] In one possible design, The second bit sequence is obtained based on the sub-channel set Q1, the sub-channel set Q2, the sub-channel set Q3, the extended set of bits to be coded Qext, and the duplicated set of bits Qchk. , This involves selecting bit values ​​on some or all of the sub-channels in Qchk and duplicating the bit values ​​one by one to the corresponding sub-channels in Qext.

[0028] In one possible design, Encoded Obtaining RV1 based on the second bit sequence is Based on the rate matching scheme for retransmission, RV1 is obtained from the first N0 bits of the second bit sequence.

[0029] In one possible design, the method further includes segmenting the received transport block to be decoded based on a transport block size TBS.

[0030] In one possible design, the number of segments C of the segmentation is:

number

[0031] In this specification, TBcrc is the number of cyclic redundancy check (CRC) bits at the transport block TB level, and K_threshold is a pre-configured first threshold value.

[0032] In one possible design,

number

[0033] In this specification, CBcrc is the number of CRC bits at the code block CB level.

[0034] In one possible design,

number

[0035] In this specification, 2 n2 is the quantization unit, n2 is a positive integer, and N info ’ is the volume of data that can be transmitted, N info is obtained by adjusting based on the quantization level.

[0036] In one possible design, N info ’ teeth,

number

[0037] In this specification, TBSmin is the minimum transport block size, round is the rounding operation, n is the quantization level of the transport block to be transmitted, and n min is the minimum quantization level, n0 is the quantization adjustment value,

number

[0038] According to a third aspect, a transmission device is provided. The device has a function of implementing the method described in any one of the first aspect or the possible designs of the first aspect. This function may be implemented by hardware, or may be implemented by hardware that executes corresponding software. The hardware or software includes one or more modules corresponding to the aforementioned function.

[0039] In a possible design, when the function is implemented partially or wholly by hardware, the transmission device includes an input interface circuit configured to obtain a transport block to be transmitted, a logic circuit configured to execute the behavior described in any one of the first aspect or the possible designs of the first aspect, and an output interface circuit configured to output an encoded sequence or a retransmission sequence.

[0040] Optionally, the transmission device may be a chip or an integrated circuit.

[0041] In a possible design, when the function is implemented partially or wholly by software, the transmission device includes a memory configured to store a program, and a processor configured to execute the program stored in the memory. When the program is executed, the transmission device can implement the method described in any one of the first aspect or the possible designs of the first aspect.

[0042] Optionally, the memory may be a physically independent unit, or may be integrated with the processor.

[0043] In a possible design, when the function is implemented partially or wholly by software, the transmission device includes a processor. A memory configured to store a program is arranged outside the transmission device. The processor is connected to the memory by using a circuit / wire, and is configured to read and execute the program stored in the memory.

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

[0045] According to a fourth aspect, a receiving device is provided, the device having functionality for performing the method according to the second aspect or any one of the possible designs of the second aspect. The functionality may be implemented by hardware or by hardware executing corresponding software. The hardware or software includes one or more modules corresponding to the aforementioned functionality.

[0046] In one possible design, when the functionality is implemented partially or entirely in hardware, the receiving device includes an input interface circuit configured to acquire a received signal, a logic circuit configured to perform the behavior described in the second aspect or any one of the possible designs of the second aspect, and an output interface circuit configured to output the decoded result.

[0047] Optionally, the receiving device may be a chip or integrated circuit.

[0048] In one possible design, when the functionality is implemented partially or wholly in software, the receiving device includes a memory configured to store a program, and a processor configured to execute the program stored in the memory. When the program is executed, Reception The device is 2 The aspect or 2 The method can be carried out in any one of the possible designs of the embodiment.

[0049] Optionally, the memory may be a physically separate unit or may be integrated with the processor.

[0050] In one possible design, when the functionality is partially or wholly implemented in software, the receiving device includes a processor. A memory configured to store a program is located external to the receiving device. The processor is connected to the memory by using circuits / wires and is configured to read and execute the program stored in the memory.

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

[0052] According to a fifth aspect, a computer storage medium is provided, storing a computer program comprising instructions used to perform a method according to the first aspect or any one of the possible designs of the first aspect.

[0053] According to a sixth aspect, a computer storage medium is provided, storing a computer program, the computer program comprising instructions used to perform a method according to the second aspect or any one of the possible designs of the second aspect.

[0054] According to a seventh aspect, an embodiment of the present application provides a computer program product comprising instructions, which when executed on a computer enable the computer to perform a method according to the previous aspect.

[0055] According to an eighth aspect, there is provided a wireless device, comprising a transmitter and a transceiver configured to implement any one of the first aspect or possible designs of the first aspect.

[0056] The transceiver is configured to receive or transmit signals.

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

[0058] According to a ninth aspect, there is provided a wireless device, comprising a receiver and a transceiver configured to implement any one of the second aspect or possible designs of the second aspect.

[0059] The transceiver is configured to receive or transmit signals.

[0060] In one possible design, the wireless device is a terminal or a network device. [Brief description of the drawings]

[0061] [Figure 1] 1 is a schematic diagram of the architecture of an applied communication system according to an embodiment of the present application; [Diagram 2] 1 is a schematic flowchart of a segmentation method according to an embodiment of the present application; [Diagram 3] 1 is a schematic flowchart of RV version determination according to an embodiment of the present application. [Figure 4] 1 is a schematic flowchart of RV1 version determination according to an embodiment of the present application. [Diagram 5] FIG. 2 is a schematic diagram of bit replication according to an embodiment of the present application; [Figure 6] FIG. 1 is a schematic diagram of a configuration of a transmitting device according to an embodiment of the present application. [Figure 7] FIG. 2 is a schematic diagram of a configuration of a transmitting device according to an embodiment of the present application. [Figure 8] 1 is a schematic diagram of a transmitting device according to an embodiment of the present application; [Figure 9] FIG. 1 is a schematic diagram of a configuration of a receiving device according to an embodiment of the present application. [Figure 10] FIG. 2 is a schematic diagram of a configuration of a receiving device according to an embodiment of the present application. [Figure 11] 2 is a schematic diagram of a receiving device according to an embodiment of the present application; DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0062] DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS Hereinafter, embodiments of the present application will be described in detail with reference to the accompanying drawings.

[0063] When it is considered that polar codes are generalized to data channels, a reasonable idea is to reuse as much as possible the polar code encoding methods in existing 5G standards, such as the principles of selecting nesting functions and rate matching schemes between mother code sequences of different lengths, although this is certainly not a limitation in this application.

[0064] The embodiments of the present application specifically provide a polar code encoding method, including a new data segmentation and HARQ method.

[0065] To facilitate understanding of the embodiments of the present application, a brief description of polar codes is provided below.

[0066] The coding policy of a polar code is that the useful information of the users is transmitted by using a noiseless channel, and the agreed upon information or no information is transmitted by using a pure noisy channel. Polar codes are also linear block codes. The coding matrix of a polar code is G N and the encoding process is x 1 N =u 1 N G N where u 1 N =(u 1 , u 2 ,..., u N ) is a binary row vector with length N (i.e., the code length; it can be seen that the length of sequences x and u before and after encoding are both N, where N is also called the mother code length), and G N is an N × N matrix,

number

number

number

[0067] In the encoding process of polar codes, u 1 N Some bits in are used to carry information and are called information bit sets, and the set of bit indices is denoted by A. Some other bits are set to fixed values ​​pre-agreed upon by the receiving end and the transmitting end and are called frozen bit sets or frozen bits. )and The set of bit indices is called the complement of A. c The encoding process of the polar code is

number

[0068] After the mother code length N is determined, the construction process of the polar code, that is, the selection process of the set A, determines the performance of the polar code. The construction process of the polar code generally determines, based on the mother code length N, that there are a total of N polarized subchannels corresponding to each of the N rows of the encoding matrix, and when rate matching is not considered, as elements of the set A, the indexes of the first K polarized subchannels having relatively high reliability are used, and the index set A of the frozen bits cThe method is to use the indices corresponding to the remaining (NK) polarization subchannels as elements of set A. Set A determines the position of the information bits, and set A c determines the location of the frozen bit. The sequence number of the polarization subchannel is the position index of the information bit or frozen bit, i.e., u 1 N is a position index within the

[0069] When rate matching is considered, puncturing or shortening is mainly considered, and NE polarization subchannels that need to be punctured or shortened (i.e., deleted) are generally determined first. In this specification, E is the target code length, i.e., the bit sequence length after rate matching. In this specification, the selected NE polarization subchannels are used to place the frozen bits. In the 5G New Radio (NR) standard, in the case of puncturing, some so-called pre-frozen polarization subchannels are further determined and further used to place the frozen bits. In this specification, the quantity of pre-frozen polarization subchannels may be defined as P, where P is equal to or greater than 0 (in the case of shortening, P is obviously 0, in which case P may not need to be considered). Then, K polarization subchannels with relatively high reliability are selected from the remaining EP polarization subchannels based on the reliability and used to place the K information bits. Indeed, EPK subchannels with relatively low reliability may be selected first to place frozen bits, and the remaining K subchannels are used to place information bits. The reliability of any one of the K polarization subchannels on which the K information bits are placed is higher than the reliability of any one of the EPK subchannels on which the frozen bits are placed. In this application, the value of P is not limited. In the case of puncturing, P may be 0, and in the case of shortening, P may be greater than 0. This does not affect the implementation of the technical solution of this application. Regardless of the encoder end or the decoder end, the principle and method of determining the K subchannels used to place the K information bits are the same. Furthermore, in the 5G NR standard, for the selection of NE polarization subchannels, the sequence obtained after subblock interleaving (e.g., 32 subblocks are obtained by division) is placed in a circular buffer (in English, it is a circular buffer, which is equivalent to a rate matching sequence).If puncturing is to be performed, bits are read from the (NE)th position in the circular buffer and bits from the 0th position to the (NE-1)th position are discarded. If shortening is to be performed, bits are read from the 0th position to the (E-1)th position in the circular buffer and bits from the Eth position to the (N-1)th position are discarded. This scheme does not consider the relationship between rate matching sequences with different mother code lengths.

[0070] It should be noted that the relative relationship of the reliabilities described herein is based on a given reliability calculation scheme. Different reliability calculation schemes may change the relative relationship of the reliabilities of the polarization subchannels. However, the method of selecting the polarization subchannels to place the information bits remains the same. Beyond the 5G NR standard, the information bits may further be considered to be placed in the last punctured or shortened polarization subchannel. The present application does not limit the standard on which the selection of the polarization subchannels to place the information bits is based to the 5G NR standard.

[0071] When the Transport Block Size (TBS) of the data channel is too large, the transport block needs to be segmented. The solution related to the above description may be considered as one implementation solution of performing polar coding on each segment.

[0072] Fig. 1 is a schematic diagram of a wireless communication network configuration according to an embodiment of the present invention. Fig. 1 is merely an example, and other wireless networks that can use the segmentation method, retransmission method or device in the embodiment of the present invention are also within the protection scope of the present invention.

[0073] 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 be further connected to the core network 102. The network device 110 may further communicate with an IP network 104, such as the Internet, a private IP network, or another data network. The network device provides services to terminals within a coverage area. For example, referring to FIG. 1, the network device 110 provides wireless access to one or more terminals 112 within the coverage area of ​​the network device 110. Furthermore, there may be an overlapping area between the coverage areas of multiple network devices, e.g., the network devices 110 and 120. The network devices may further communicate with each other. For example, the network device 110 may communicate with the network device 120.

[0074] The network device may be a device configured to communicate with a terminal device, for example an Evolved NodeB (Evolved Node B) in an LTE system. eB , eNB or eNodeB), gNB in ​​a 5G network, or a satellite in satellite communication, or a network side device in a future communication system. Alternatively, the network device may be a relay station, an access point, an in-vehicle device, etc. In a Device to Device (D2D) communication system, a Machine to Machine (M2M) communication system, and an Internet of Vehicles system, the network device may instead be a terminal acting as a base station.

[0075] A terminal may be a User Equipment (UE), access terminal, subscriber unit, mobile station, remote station, remote terminal, mobile device, user terminal, wireless communication device, user agent, or user equipment. An 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 handheld device with wireless communication capabilities, a computing device, another processing device connected to a wireless modem, an in-vehicle device, a wearable device, a terminal device in a future communication network, etc.

[0076] Based on the communication system architecture shown in Fig. 1, in an embodiment of the present application, a polar code encoding method can be performed by a network device or terminal. When functioning as a transmitting end for transmitting data or information, the network device or terminal can use the polar code encoding method. Correspondingly, when functioning as a receiving end for receiving data or information, the network device or terminal needs to determine segmentation and HARQ mechanisms based on the method described in the present invention to perform corresponding decoding. The following describes in detail the segmentation and / or retransmission method provided in the embodiment of the present application.

[0077] 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 performing data segmentation.

[0078] Step 210: Volume N of data actually sent info Determine.

[0079] The quantity N of resource elements scheduled by the system REBased on the number of streams (v), the code rate (R), the modulation order (Qm), and the number of streams (v), the volume of data that can be transmitted using the air interface is N info =N RE *R*Qm*v. In practical applications, N info It should be noted that σ may instead be determined in another manner. For example, in a multiple-input multiple-output system, the multiple supported streams may support different modulation schemes. In this case, the calculation method is not the product but the sum of the volumes of data that can be transmitted by the streams. This is not a limitation in this application.

[0080] Step 220: Determine the segment quantity.

[0081] The following is assumed:

number

[0082] TBSmin refers to the minimum transport block size, which is typically 24 bits.

[0083] Round is a rounding operation. In practical applications, this operation may be changed to rounding up or rounding down, which may have some effect on subsequent operations. For example, N obtained by rounding up info ’ is the number N obtained by performing the round operation. info ’ N obtained by performing the round operation, which is not smaller than info ’ is the number N obtained by truncating info ’It is not smaller. In this way, in the rounding-up method, the final number of segments is greater than or equal to the number of segments obtained by performing the round operation, and the number of segments obtained by performing the round operation is greater than or equal to the number of segments obtained by the truncation method.

[0084] TBcrc represents the number of bits used for CRC checking at the transport block (TB) level and may typically be set to values such as 16, 24, or 32. If the CRC check is not performed on the TB, TBcrc may be 0.

[0085] n is the quantization level of the current transport block, and n min is the minimum quantization level of the transport block. Quantization in this specification refers to the number of data units included in the transport block. Generally, n min = 3, which indicates that one data unit contains 2 3 bits, that is, 8 bits equivalent to 1 byte. When n = 3, quantization can refer to the number of bytes included in the transport block. n0 is the quantization adjustment value and may typically be set to values such as 4, 5, or 6.

[0086]

Number

[0087] log2( ) represents the logarithmic operation with base 2.

[0088] From the above description, N info ’is adjusted based on the quantization level to ensure that it contains an integer number of data units. info You can learn things that may be considered as such.

[0089] It is assumed that K_threshold is a preset segmentation threshold, in which case the value of the segment quantity C is:

number

[0090] In this specification,

number

[0091] Kcb is the maximum number of bits to be coded that can be included in a channel coding code block, including the number of CRC bits at the Code Block (CB) level, CBcrc. Typical values ​​of CBcrc are 6, 8, 16, 24, or 32, etc. Commonly used methods are as follows:

number

[0092] In this specification, Nmax is the maximum number of bits that can be transmitted at one time. When this method is applied to polar code encoding, the value of Nmax is exactly equal to the maximum mother code length supported during the initial transmission. n1 represents the quantization unit and can correspond to the minimum quantization level mentioned above. For example, n1=3, i.e., the quantization is performed in units of bytes. Therefore, 2 n1 can be written as 8 directly. The rounding up in the formula can be replaced by round operation or rounding down. From this formula, it can be learned that a larger Kcb means a smaller probability of segmentation or a smaller number of segments.

[0093] Step 230: Determine the TBS and the number of bits to code for each segment.

[0094] After the segment quantity C is determined, the actual TBS to be transmitted can be obtained as follows:

number

[0095] From this formula, TBS is determined based on the segmentation situation. info ’ It can be seen that TBS may be considered as the result of further adjusting TBS. Note that TBS in this specification is the size of the data payload before CRC check has been performed. n2 represents the quantization unit, and generally n2 = n1. Therefore, n2 may also be set to 3, or written directly as 8.

[0096] Correspondingly, the number K of bits to be coded contained in each segment is:

number

[0097] Note that when C=1, there is no segmentation, i.e., TB is equal to CB, so the CRC check only needs to be performed once. The CRC at the TB level is used in Equation 6, and in practical applications, it may be changed to CBcrc based on the adjustment, as long as the equation is unified between the transmitting end and the receiving end.

[0098] In FIG. 2, the segmentation determination and TBS calculation are performed by using multiple equations in multiple separate steps, but in practical applications, some or even all equations and steps may be combined, or the order of calculations may be changed without affecting the final result.

[0099] The method shown in FIG. 2 is based on the case where the TBS has not yet been determined. If the value of the TBS is clearly known, it is easier to decide whether to perform segmentation. The segment quantity C may be as follows:

number

[0100] Similarly, ">" may be "≧", which indicates that segmentation is also performed when the TBS is equal to the threshold, which is not a limitation in this specification.

[0101] The number of bits to be coded contained in each segment, K, may be calculated by using Equation 6.

[0102] It should be noted that the above segmentation scheme is applicable to multiple types of channel coding, including polar coding or LDPC coding.

[0103] Since the processing principle and method of each segment of the segmented transport block are the same, the following embodiments are all described based on the case of C=1, and the related CRC also refers to the CRC at the CB level. That is, after obtaining the transport block, the transmitting end performs segmentation, and then encodes the K bits to be coded in each segment to obtain a coding sequence or a retransmission sequence, and then transmits the coding sequence or the retransmission sequence. The receiving end receives the transport block to be decoded, where each corresponding segment is a received signal containing the information of the K bits to be coded (i.e., the coding sequence or the retransmission sequence), and performs corresponding decoding.

[0104] In this case, when polar codes are used as the channel coding scheme for the data channel, the initial transmission In faith How is retransmission performed when an error occurs? In the existing 3GPP protocol, no HARQ solution for polar codes is specified. Therefore, on the one hand, the existing 3GPP techniques, including the selection of rate matching solutions and the principle of selecting information bits, may be considered to be reused for the initial transmission solution of the data channel. However, since the transport block supported by the data channel is relatively large, Nmax needs to be increased and a corresponding reliability ordering sequence needs to be designed. However, this is not included in the scope of the present invention and is therefore not limited thereto. On the other hand, in this specification, a retransmission method is first provided. That is, when an error occurs in the initial transmission, the incremental redundancy (IR) scheme is used for the first retransmission, and the chase combining (CC) scheme is used for the later retransmission. This scheme not only uses the advantages of the IR scheme, but also simplifies the design, and is a relatively good compromise.

[0105] As shown in FIG. 3, one embodiment of a retransmission method is disclosed that describes how to construct a redundancy version (RV) for HARQ transmission.

[0106] Operation 310: The transmitting end performs polar coding on the obtained bit sequence to be coded to obtain a first coded bit sequence, and obtains an initial transmission version RV0 based on a rate matching scheme.

[0107] In this step, conventional techniques can be used. For example, based on the 3GPP standard, the encoded first bit sequence is interleaved and then written into a first circular buffer. When the initial transmission code rate R0 is less than or equal to 7 / 16, a rate matching scheme of puncturing is used. In this case, RV0 is the last E0 bit in the first circular buffer. When R0 is greater than 7 / 16, a rate matching scheme of shortening is used. In this case, RV0 is the first E0 bit in the first circular buffer. R0=K / E0, where E0 is the quantity of bits actually transmitted by using the air interface during the initial transmission.

[0108] Action 320: Determine the length E1 of the retransmission version RV1.

[0109] E1 is the number of bits that can be transmitted by using the air interface during the first retransmission. The specific value calculation method is the same as the method for determining E0.

[0110] Operation 330: Determine RV1 based on the initial transmission code rate R0 and a rate matching scheme for retransmission.

[0111] When R0 is equal to or less than a preset code rate threshold R_threshold (i.e., R0≦R_threshold), the RV1 version with length E1 can be read directly from the first circular buffer for the initial transmission. R_threshold may be any value between 1 / 4 and 1 / 2, for example, 1 / 4, 3 / 8, 7 / 16, 15 / 32, or 1 / 2. RV1 may be the first E1 bit in the first circular buffer, or the E1 bits read sequentially clockwise from the start of the first circular buffer. In this manner, bits that are not transmitted during the initial transmission may be preferentially put into RV1. Alternatively, the manner of reading RV1 from the first circular buffer may be determined based on a rate matching scheme for retransmission and in a manner similar to that for the initial transmission. This is not limited in this specification.

[0112] When R0 is greater than R_threshold (i.e., R0>R_threshold), a coded second bit sequence may be generated in an IR manner, and rate matching may be performed based on one or more parameters including, but not limited to, the code rate, Nmax, the mother code length N0, E0, and E1 used for initial transmission coding to obtain RV1.

[0113] Specifically, if E1≧N0, the rate matching scheme for retransmission is repetition. Otherwise, when R0 is equal to or less than the preset code rate threshold R_threshold_initial, the rate matching scheme for retransmission is puncturing, and when R0 is greater than the preset code rate threshold R_threshold_initial, the rate matching scheme for retransmission is truncation. R_threshold_initial is a threshold for determining the rate matching scheme during initial transmission. In the 5G NR standard, the value of R_threshold_initial is 7 / 16. Indeed, the value of R_threshold_initial may be another preset value instead. For simplicity, it may be assumed that R_threshold_initial=R_threshold. Indeed, when R0=R_threshold, the same scheme as that used when R0>R_threshold may also be used. This is specifically determined by agreement between the transmitting end and the receiving end.

[0114] In one possible design, if E1≧N0, the rate matching scheme for retransmission is repetition. Otherwise, when R0 is greater than a 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 scheme for retransmission may be shortening, puncturing, or a combination of shortening and puncturing.

[0115] Optionally, when the rate matching scheme for the initial transmission is truncated, the rate matching bits during the retransmission include two parts, namely, punctured bits and truncated bits. The quantity and position of the truncated bits are the same as the quantity and position of the truncated bits during the rate matching for the initial transmission. The quantity of the punctured bits is E0-E1, and the position of the punctured bits may be determined based on the puncturing scheme of the NR rate matching.

[0116] Optionally, when the rate matching scheme for the initial transmission is repetitive, the rate matching bits during the retransmission include punctured bits, where the quantity of punctured bits is N0-E1, and the positions of the punctured bits may be determined based on the puncturing scheme of the NR rate matching.

[0117] Optionally, after the positions of the punctured bits are determined, some bit positions may be further pre-frozen. However, unlike the manner of determining the pre-frozen bit positions in the existing NR protocol, the present application proposes a new method for determining the pre-frozen bit positions, specifically as follows:

[0118] 1. The number of punctured bits in the i-th subblock, P i exceeds a preset value, another polarization subchannel corresponding to the subblock is determined as a pre-frozen polarization subchannel, where the pre-frozen value may be a constant, for example, 0, 1, 10, or 16.

[0119] 2. Instead, the number of punctured bits in the i-th subblock, P i exceeds a preset percentage of the total number of polarization subchannels corresponding to the subblock, another polarization subchannel corresponding to the subblock is determined as a pre-frozen polarization subchannel, where the preset percentage may be 1 / 16, 1 / 8, 1 / 4, 1 / 2, etc.

[0120] Indeed, if all polarization subchannels corresponding to a subblock are punctured, there are no pre-frozen polarization subchannels within the subblock.

[0121] Specifically, in one embodiment shown in FIG. 4, the following operations may be performed.

[0122] Operation 330a: Obtain a set of subchannels Q1, where Q1 contains K elements, and the elements are the sequence numbers of K subchannels used to arrange K bits to be encoded during the initial transmission and can be obtained in operation 310.

[0123] Operation 330b: Add N0 to all subchannel sequence numbers in Q1 to obtain a set of subchannels Q2, where Q2(i) = Q1(i) + N0, for i = 0, 1, ..., and K - 1. Without loss of generality, in this application, an example where the subchannel sequence numbers are numbered starting from 0 is used for illustration. If the subchannel sequence numbers are numbered starting from 1, correspondingly, 1 may be added to the subchannel sequence numbers. Details are not described.

[0124] Operation 330c: Determine a set of subchannels Q3 of K1 bits to be encoded when the mother code length is N1 based on a reliability ordering sequence of length N1 = 2 * N0 and a rate matching method for retransmission. The elements in Q3 satisfy Q3(i) < N0 or Q3(i) ∈ Q2, where i = 0, 1, ..., and K1 - 1. In this specification, K1 = K + K_adjust, and K_adjust is the newly added bit to be encoded. The value of K_adjust is 0 or CBcrc1. CBcrc1 may be 0 or not 0. The reason CBcrc1 is not 0 is that in order to improve the reliability of retransmission, some CRC check may need to be performed again during retransmission. The value of CBcrc1 can be determined in any one of the following methods.

[0125] ● Method 1: Set the value of CBcrc1 to 0.

[0126] ● Method 2: Determine the value of CBcrc1 based on conditions. When N0 = 4096, the value of CBcrc1 is set to a first preset value, for example, 6, 8, 16, or 24, or otherwise, the value of CBcrc1 is set to 0.

[0127] ● Method 3: Determine the value of CBcrc1 based on a condition. When N0=4096 and E1>=Alpha*E0, the value of CBcrc1 is set to a first preset value, which may be set to, for example, 6, 8, 16, or 24; otherwise, the value of CBcrc1 is set to 0. The value of Alpha may be any value in the interval [1 / 2, 1], for example, 1 / 2, 3 / 4, 7 / 8, or 1.

[0128] CBcrc1 may use the same scheme as the CRC for the initial transmission, or may use a shorter CRC polynomial, e.g., a 24-bit CRC is used for the initial transmission and an 8-bit CRC is used for retransmissions (i.e., CBcrc1=8).

[0129] Operation 330d: Determine an extended set of bits to be encoded Qext, where the elements in Qext are the elements that are in Q3 and less than N0.

[0130] The value of CBcrc1 is determined by method 2, and when the value of CBcrc1 is not 0, the next operation 330e0 (not shown in the figure) needs to be further executed. It should be noted that when CBcrc1 is 0, operation 330e0 may indeed be executed, but the result will not be affected. Therefore, it is generally recommended that operation 330e0 not be executed when CBcrc1 is 0.

[0131] Operation 330e0:

[0132] When |Qchk|=0 (i.e., |Qext|=CBcrc1), adjust the value of CBcrc1 to 0; otherwise, do not adjust the value of CBcrc1.

[0133] Optionally, when |Qchk|≠0, the value of CBcrc1 may be further adjusted, for example, determined as follows: ● 0<|Qchk|<=Chk_threshold (Chk_threshold is a preset threshold, typical values ​​may be 10, 50, etc.). In this case, the value of CBcrc1 is adjusted to a second preset value, which is smaller than the first preset value. For example, the value of CBcrc1 is adjusted from 8 to 6, or to 3, etc.

[0134] Operation 330e: Determine the duplicated bit set Qchk=Q2\(Q3\Qext), where "\" represents the set difference operation, i.e., A\B represents all elements that belong to A but not to B.

[0135] Operation 330f: Select bit values ​​on some or all subchannels in Qchk and copy the bit values ​​to corresponding subchannels in Qext one by one. Figure 5 shows a schematic diagram. CBcrc1 subchannels are first selected from Qext to place CRC bits (this step is omitted when CBcrc1=0), and bits of |Qext|-CBcrc1 subchannels are selected from Qchk to copy to the remaining |Qext|-CBcrc1 subchannels in Qext. The CBcrc1 CRC bits are used to perform a CRC check on |Qext|-CBcrc1 copied bits, where the operation |A| represents obtaining the quantity of elements in set A. The method of first selecting CBcrc1 subchannels from Qext and the method of selecting |Qext|-CBcrc1 subchannels from Qchk may be sequentially selected from front to back or back to front in natural order, or sequentially selected from front to back or back to front based on the reliability of the subchannels. These methods may be the same or different, which is not limited in this specification. When |Qext| is relatively large and |Qchk| is relatively small, and |Qchk| positions need to be selected from Qext to place the replicated bits, the selection method is similar, that is, it may be sequentially selected from front to back or back to front in natural order, or sequentially selected from front to back or back to front based on the reliability of the subchannel. Regardless of the selection method, the transmitting end and the receiving end only need to agree on a unified method.

[0136] Operation 330g: According to the determined positions and values, perform polar code retransmission encoding on the K bits to be encoded using a mother code length of N1 to obtain a polar-encoded second bit sequence, and then obtain RV1 from the first N0 bits of the second bit sequence according to a rate matching scheme for retransmission. Specifically, the scheme for obtaining RV1 from the first N0 bits may be the same as the scheme for obtaining RV0 from the first bit sequence.

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

[0138] It is assumed that N0 = 64 and N1 = 128. The reliability ordering sequence in the 3GPP 5G NR standard may be used directly as follows: 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]

[0139] It is assumed that E0=60 and K=50. Therefore, R=5 / 6 and R_threshold=7 / 16. Therefore, RV1 needs to be constructed in the IR manner and a shortened rate matching scheme is used for the initial transmission. 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]

[0140] Correspondingly, it is as follows: 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]

[0141] It is assumed that E1 is exactly equal to E0 and is also equal to 60. A shortened rate matching scheme is further used on subchannels 64 to 127. Thus, all shortened subchannels are Q RM =[60 61 62 63 124 125 126 127].

[0142] 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]

[0143] When CBcrc1 = 0, the bits of the sub-channels in Qchk can be sequentially replicated to Qext in the aforementioned order. Alternatively, the bits of the sub-channels with larger sequence numbers in Qchk may be replicated to the sub-channels with smaller sequence numbers in Qext on the premise of considering the decoding order. That is, the bits of sub-channel 98 are replicated to sub-channel 31, the bits of sub-channel 97 are replicated to sub-channel 46, and so on, and the bits of sub-channel 70 are replicated to sub-channel 59.

[0144] When CBcrc1 = 8, eight sub-channels in Qext other than 31 and 46 can be used to carry the newly added CRC bits. The values of sub-channels 70 and 71 selected from Qchk can be replicated to sub-channels 46 and 31 respectively. The eight CRC bits are used to perform CRC checks on 2 bits. In this case, it can be learned that the eight CRC bits are clearly redundant. Therefore, in actual applications, there may be another possibility that CRC bits do not need to be added when the number of bits to be encoded is within the first interval, and CRC bits need to be added when the number of bits to be encoded is within the second interval. Alternatively, when the number of bits to be encoded is within the third interval, a relatively small number of CRC bits are added, and when the number of bits to be encoded is within the fourth interval, a relatively large number of CRC bits are added. For specific interval division, whether to add CRC bit It is only necessary to unify between the transmitter and the receiver whether to add CRC and how many CRC bits are added.

[0145] When K_adjust is 8, Q3 may be as follows. 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]

[0146] Correspondingly, the corresponding Q2, Qext, Q and chk are as follows: 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]

[0147] Eight subchannels in Qext can be used to carry the newly added CRC bits: 47, 51, 53, 54, 55, 57, 58, and 59. The bits of six subchannels in Qchk are duplicated in six subchannels: 29, 30, 31, 43, 45, and 46. Specifically, the bits of subchannel 70 are duplicated in subchannel 46, the bits of subchannel 74 are duplicated in subchannel 45, and so on, with the bits of subchannel 97 being duplicated in subchannel 29.

[0148] It can be learned that even with the same CBcrc1, different values ​​of K_adjust will affect the final result. Therefore, K_adjust needs to be unified between the sending end and the receiving end.

[0149] Operation 340: RV0 and RV1 are input in a cascaded manner into a second circular buffer.

[0150] Action 350: Perform further retransmissions.

[0151] If the RV1 transmitted in the first retransmission is correctly decoded, operations 340 and 350 do not need to be performed and are therefore shown with dashed lines. If the RV1 transmitted in the first retransmission is still not correctly decoded, a further retransmission needs to be performed. In this case, CC retransmission is used as described above. In this case, the transmitting end can directly read the corresponding version from the second circular buffer and transmit that version. For example, the bits of the x-th transmission may be the Ex bits (the amount of bits transmitted using the air interface) read from the first bit after the last bit position of the RV version (RV0 or RV1) used in the previous transmission, where x is greater than 1, or the Ex bits read from the first bit after the last bit position of the RV version (RV0 or RV1) used in the previous transmission.

[0152] In practical application, in order to simplify the operation, step 330 of determining RV1 (Solution 1 of step 330) may be implemented in another manner instead.

[0153] Solution 2 of step 330: When the initial transmission code rate R0 is less than or equal to a preset code rate threshold R_threshold (i.e., R0≦R_threshold, where the value of R_threshold may be the same as the example value above, e.g., 7 / 16), RV1 includes bits located in the first circular buffer from mod(N0-(E0+E1), N0)th position to mod(N0-E0-1, N0)th position, and arranged in the order in which the bits are arranged in the first circular buffer, where mod denotes modulo operation. Note that the position numbers in this specification start from 0. Alternatively, when the initial transmission code rate R0 is greater than R_threshold, RV1 contains the bits in the first circular buffer from the mod(min(E0,N0)-E1,min(E0,N0))th position to the mod(min(E0,N0)-1,min(E0,N0))th position and arranged in the order in which the bits are arranged in the first circular buffer.

[0154] It can be learned that in solution 2 of step 330, bits not involved in transmission during initial transmission are preferentially considered to be transmitted during retransmission, and the procedure is simplified. Therefore, in practice, either the retransmission scheme shown in solution 1 of step 330 or the retransmission scheme shown in solution 2 of step 330 may be used. In particular, the two schemes may be supported simultaneously to meet different requirements. In this case, a specific retransmission scheme may be explicitly or implicitly signaled by using downlink control signaling DCI, radio resource control RRC signaling, or other control signaling. In this way, the receiving end and the transmitting end uniformly determine whether the retransmission scheme to be used is solution 1 of step 330 or solution 2 of step 330.

[0155] Whether it is an initial transmission or a retransmission, in order to overcome the influence of the channel, after the rate matching, a channel interleaving operation may be further performed on the bits to be sent. Specifically, the bits to be sent may be input to a channel interleaver, and then the interleaved bits may be transmitted. In general, the interleaver may be selected as a row-column interleaver, in which the bits are written row by row and read column by column, or written column by column and read row by row. In order to distribute the bits to be sent more evenly in the interleaver and ensure random execution, the number of rows of the row-column interleaver may be 14. In this case, the number of columns of the x-th transmission is

number

[0156] In FIG. 3, RV1 is determined by performing multiple separate steps, but in practical applications, some steps may be combined or the order of calculations may be changed without affecting the final result.

[0157] The above description of the embodiment in Fig. 3 is directed to the transmitting end. However, in practice, the operation of the receiving end is quite similar. The difference is that in operation 310, decoding is performed instead of encoding to obtain a decoded first bit sequence. Otherwise, the method and principle of determining RV0 and RV1 are completely the same, except that RV0 and RV1 are used for IR combining or CC combining at each retransmission to obtain and output the decoding result. Indeed, the transmission in operation 350 should also be changed correspondingly to receiving. Therefore, the details will not be described.

[0158] As shown in Fig. 6, an embodiment of the present application further provides a sending device 600. Some 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 software.

[0159] In the transmitting device 600, based on the same inventive concept of the segmentation and retransmission method shown in Figures 2 to 5, the transmitting device 600 is configured to execute the segmentation and retransmission method shown in Figures 2 to 5. When a part or all of the segmentation and retransmission method is implemented by hardware, the transmitting device 600 includes an input interface circuit 601 configured to obtain a transport block to be transmitted, a logic circuit 602 configured to execute the segmentation and retransmission method shown in Figures 2 to 5, the details of which are referred to in the description of the above method embodiment and will not be described in detail here, and an output interface circuit 603 configured to output an encoded sequence or a retransmission sequence. Furthermore, the encoded sequence or the retransmission sequence is output to a transceiver 620, which performs corresponding processing (including but not limited to processing such as digital-to-analog conversion and / or frequency conversion) on the encoded sequence or the retransmission sequence, and then transmits the encoded sequence or the retransmission sequence by using an antenna 630. Optionally, during a particular implementation, the transmitting device 600 may be a chip or an integrated circuit.

[0160] Optionally, when some or all of the segmentation and retransmission methods in the above-mentioned embodiments are implemented by software, as shown in Fig. 7, the sending device 700 includes a memory 701 configured to store a program, and a processor 702 configured to execute the program stored in the memory 701. When the program is executed, the sending device 700 can implement the segmentation and retransmission methods provided in the above-mentioned embodiments.

[0161] Optionally, the memory 701 may be a physically separate unit or may be integrated with the processor 702 .

[0162] Optionally, when some or all of the segmentation and retransmission methods in the above embodiments are implemented by software, the transmitting device 700 may instead include only the processor 702. The memory 701 configured to store a program is located outside the transmitting device 700. The processor 702 is connected to the memory 701 by using circuits / wires and configured to read and execute the program stored in the memory 701.

[0163] Based on the segmentation and retransmission method shown in Figures 2 to 5, as shown in Figure 8, an embodiment of the present application further provides a sending device 800 configured to perform the segmentation and retransmission method shown in Figures 2 to 5. The sending device 800 includes: an acquisition unit 801 configured to acquire a transport block to be transmitted; a segmentation unit 802 configured to segment a transport block to be transmitted according to the segmentation method in the embodiment shown in FIG. 2; a coding unit 803 configured to perform coding or retransmission coding on each segment of the segmented transport block; The determining unit 804 is configured to determine the RV0 version and the RV1 version based on the retransmission method in the embodiment shown in FIG.

[0164] Corresponding to the transmitting end, the device at the receiving end can be designed similarly.

[0165] 9, the receiving device 900 includes an input interface circuit 901 configured to input a received signal, a logic circuit 902 configured to perform the aforementioned segmentation and retransmission method for decoding to obtain a decoding result, and an output interface circuit 903 configured to output the decoding result. The receiving device 900 may further include a transceiver 920 to obtain the received signal by using an antenna 930. During a particular implementation, the receiving device 900 may be a chip or an integrated circuit.

[0166] Optionally, when some or all of the segmentation and retransmission methods in the above-mentioned embodiments are implemented by software, as shown in Fig. 10, the receiving device 1000 includes a memory 1001 configured to store a program, and a processor 1002 configured to execute the program stored in the memory 1001. When the program is executed, the receiving device 1000 can implement the segmentation and retransmission methods provided in the above-mentioned embodiments.

[0167] Optionally, the memory 1001 may be a physically separate unit or may be integrated with the processor 1002 .

[0168] Optionally, when some or all of the segmentation and retransmission methods in the above embodiments are implemented by software, the receiving device 1000 may instead include only the processor 1002. The memory 1001 configured to store a program is located outside the receiving device 1000. The processor 1002 is connected to the memory 1001 by using circuits / wires and configured to read and execute the program stored in the memory 1001.

[0169] Processor 702 and / or processor 1002 may be a central processing unit (CPU), a network processor (NP), or a combination of a CPU and a NP.

[0170] Processor 702 and / or processor 1002 may further include a hardware chip. 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 generic array logic (GAL), or any combination thereof.

[0171] The memory in the above embodiments may include volatile memory, such as random-access memory (RAM), or non-volatile memory, such as flash memory, a hard disk drive (HDD), or a solid-state drive (SSD), or may include a combination of the above types of memory.

[0172] Based on the above-mentioned segmentation and retransmission method, and as shown in FIG. 11, an embodiment of the present application device 1100 more to be provided. device 1100 is configured to perform the segmentation and retransmission method described above. device 1100 is, an acquisition unit 1101 configured to acquire a received signal; A segmentation unit 1102 configured to segment a transport block to be transmitted according to the segmentation method in the embodiment shown in FIG. 2; A determination unit 1103 configured to determine the RV0 version and the RV1 version based on the retransmission method in the embodiments shown in FIGS. 3 to 5; It includes a decoding unit 1104 configured to decode each received segment of the transport block.

[0173] One embodiment of the present application further provides a computer storage medium storing computer program instructions. When the computer program instructions are executed by a computer, the aforementioned segmentation and retransmission methods are executed.

[0174] One embodiment of the present application further provides a computer program product including instructions. When the instructions are executed on a computer, the aforementioned segmentation and retransmission methods are executed.

[0175] Those skilled in the art should understand that the embodiments of the present application can be provided as a method, a system, or a computer program product. Therefore, the present application can use forms of embodiments by hardware-only embodiments, software-only embodiments, or a combination of software and hardware. Furthermore, the present application can use the form of a computer program product implemented on one or more computer-usable storage media (including but not limited to disk memory, CD-ROM, optical memory, etc.) containing computer-usable program code.

[0176] The present application is described with reference to flowcharts and / or block diagrams of methods, devices (systems), and computer program products according to embodiments of the present application. It should be understood that computer program instructions can be used to implement each process and / or each block in the flowcharts and / or block diagrams, and combinations of processes and / or blocks in the flowcharts and / or block diagrams. The computer program instructions may be provided to a processor of a general-purpose computer, a special-purpose computer, an embedded processor, or another programmable data processing device to generate a machine, whereby the instructions executed by the processor of the computer or another programmable data processing device generate an apparatus for performing a particular function within one or more steps in the flowcharts and / or one or more blocks in the block diagrams.

[0177] Computer program instructions may alternatively be stored in a computer readable memory that can direct a computer or another programmable data processing device to operate in a particular manner, such that the instructions stored in the computer readable memory generate an artifact that includes an instruction apparatus that implements a particular function within one or more procedures in the flowcharts and / or one or more blocks in the block diagrams.

[0178] The computer program instructions may alternatively be loaded into a computer or other programmable data processing device such that a sequence of operations and steps are executed on the computer or other programmable device, thereby generating a computer-implemented process. Thus, the instructions executed on the computer or other programmable device provide steps for implementing a particular function within one or more procedures in the flowcharts and / or within one or more blocks in the block diagrams.

[0179] In addition to the embodiments of the present application, those skilled in the art may make other changes and modifications to the embodiments once they have acquired the basic creative concept. Therefore, the following claims are ,fruit intended to be construed as covering the embodiments and all changes and modifications within the scope of the present application.

[0180] Obviously, those skilled in the art can make various modifications and variations to the embodiments of the present application Example without departing from the scope thereof. In this case, the present application is intended to cover these modifications and variations on the condition that they are within the scope of protection defined by the following claims and their equivalent technologies.

Claims

1. A retransmission method, comprising: obtaining, by a transmitting device, a bit sequence to be encoded, comprising K bits to be encoded, where K is a positive integer; performing polar encoding on the sequence to be encoded to obtain an encoded first bit sequence, the first bit sequence having a length N0; and determining an initial transmission version RV0; determining a length E1 of a retransmission version RV1; determining the retransmission version RV1 based on an initial transmission code rate R0; transmitting the RV1; Including, determining the retransmission version RV1 based on an initial transmission code rate R0, determining that RV1 is an E1 bit read from the first circular buffer for initial transmission when R0 is less than or equal to a preset code rate threshold R_threshold; or When R0 is greater than R_threshold, generate a second bit sequence encoded in an incremental redundancy IR manner, and obtain the RV1 based on the second bit sequence, where the length of the second bit sequence is N1, and N1=2*N0. Including, Generating a second bit sequence encoded in an incremental redundancy (IR) manner and obtaining the RV1 based on the second bit sequence includes: Obtaining a sub-channel set Q1, Q1 including K elements, the K elements being sequence numbers of K sub-channels used to place the K bits to be coded during an initial transmission; The first step is to obtain a set of subchannels Q2, where Q2(i)=Q1(i)+N0, i=0, 1. , . . . , and K−1, and N0 is the mother code length of the polar code used during the initial transmission; and Obtain a subchannel set Q3 based on a reliability ordering sequence of length N1 and a rate matching scheme for retransmission, where Q3(i)<N0 or Q3(i)∈Q2, i=0, 1. , . . . , and K-1; and determining an extended set of bits to be coded Qext, where the elements in Qext are the elements in Q3 and less than N0; Determining a set of replicated bits Qchk=Q2\(Q3\Qext); selecting bit values ​​on some or all of the subchannels in Qchk and copying the bit values ​​one by one to corresponding subchannels in Qext; performing polar code encoding on the K bits to be encoded based on the determined positions and values ​​with a mother code length of N1 to obtain the second bit sequence, and then obtaining RV1 from the first N0 bits of the second bit sequence based on the rate matching scheme for retransmission; Including, method.

2. Before obtaining, by a transmitting device, a bit sequence to be coded, comprising K bits to be coded, the method comprises: performing segmentation based on a transport block size TBS The method of claim 1 further comprising:

3. The number of segments C of the segmentation is [0010] where TBcrc is the number of cyclic redundancy check (CRC) bits at the transport block (TB) level, and K_threshold is a first preset threshold value. The method of claim 2.

4. 【Number 2】 and CBcrc is the number of CRC bits at the code block CB level. The method according to claim 3.

5. 【Figure 3】 And, 2 ｎ２ is the quantization unit, n2 is a positive integer, and N ｉｎｆｏ ’ is the volume of data that can be transmitted N ｉｎｆｏ based on the quantization level, The method according to claim 3 or 4.

6. N ｉｎｆｏ ’ teeth, [0045] where TBSmin is the minimum transport block size, round is the rounding operation, n is the quantization level of the transport block to be transmitted, and n ｍｉｎ is the minimum quantization level, n0 is the quantization adjustment value, [0050] is a truncation operation, The method according to claim 5.

7. The method comprises: inputting the RV0 and the RV1 in a cascaded manner into a second circular buffer by the transmitting device; performing retransmission based on the RV0 and the RV1 by the transmitting device; The method of claim 1 , further comprising:

8. 1. A transmitting device, comprising: an acquisition unit configured to acquire a bit sequence to be encoded, the bit sequence comprising K bits to be encoded, where K is a positive integer; an encoding unit configured to perform polar encoding on the sequence to be encoded to obtain an encoded first bit sequence, the first bit sequence having a length N0; a determining unit configured to determine a length E1 of an initial transmission version RV0 and a retransmission version RV1 and to determine said retransmission version RV1 based on an initial transmission bit rate R0; Including, determining the retransmission version RV1 based on an initial transmission bit rate R0, determining that RV1 is an E1 bit read from the first circular buffer for initial transmission when R0 is less than or equal to a preset code rate threshold R_threshold; or When R0 is greater than R_threshold, generate a second bit sequence encoded in an incremental redundancy IR manner, and obtain the RV1 based on the second bit sequence, where the length of the second bit sequence is N1, and N1=2*N0. Including, Generating a second bit sequence encoded in an incremental redundancy (IR) manner and obtaining the RV1 based on the second bit sequence includes: Obtaining a sub-channel set Q1, Q1 including K elements, the K elements being sequence numbers of K sub-channels used to place the K bits to be coded during an initial transmission; The first step is to obtain a set of subchannels Q2, where Q2(i)=Q1(i)+N0, i=0, 1. , . . . , and K−1, and N0 is the mother code length of the polar code used during the initial transmission; and Obtain a subchannel set Q3 based on a reliability ordering sequence of length N1 and a rate matching scheme for retransmission, where Q3(i)<N0 or Q3(i)∈Q2, i=0, 1. , . . . , and K-1; and determining an extended set of bits to be coded Qext, where the elements in Qext are the elements in Q3 and less than N0; Determining a set of replicated bits Qchk=Q2\(Q3\Qext); selecting bit values ​​on some or all of the subchannels in Qchk and copying the bit values ​​one by one to corresponding subchannels in Qext; performing polar code encoding on the K bits to be encoded based on the determined positions and values ​​with a mother code length of N1 to obtain the second bit sequence, and then obtaining RV1 from the first N0 bits of the second bit sequence based on the rate matching scheme for retransmission; Including, device.

9. The device is A segmentation unit configured to perform segmentation based on a transport block size TBS The device of claim 8 further comprising:

10. The number of segments C of the segmentation is [006] where TBcrc is the number of cyclic redundancy check (CRC) bits at the transport block (TB) level, and K_threshold is a first preset threshold value. The device of claim 9.

11. 【Number 7】 and CBcrc is the number of CRC bits at the code block CB level. The device of claim 10.

12. 【FIG. 8】 And, 2 ｎ２ is the quantization unit, n2 is a positive integer, and N ｉｎｆｏ ’ is the volume of data that can be transmitted N ｉｎｆｏ based on the quantization level, 12. A device according to claim 10 or 11.

13. 【Number 9】 where TBSmin is the minimum transport block size, round is the rounding operation, n is the quantization level of the transport block to be transmitted, and n ｍｉｎ is the minimum quantization level, n0 is the quantization adjustment value, [0089] is a truncation operation, The device of claim 12.

14. The determination unit further comprises:

14. A device according to claim 8, configured to input RV0 and RV1 in a cascaded manner into a second circular buffer.

15. an input interface circuit configured to obtain a transport block to be transmitted; - a logic circuit configured to obtain a coding sequence or a retransmission sequence based on the transport block to be transmitted according to the method of any one of claims 1 to 7; an output interface circuit configured to output the encoded sequence or the retransmission sequence; A transmitting device including:

16. A retransmission method, comprising: receiving a received signal including K bits of information to be coded, the mother code length corresponding to the received signal being N0; and determining an initial transmission version RV0; determining a length E1 of a retransmission version RV1; determining the retransmission version RV1 based on an initial transmission code rate R0; performing decoding based on the RV0 and the RV1; Including, determining the retransmission version RV1 based on an initial transmission code rate R0, determining that RV1 is an E1 bit read from the first circular buffer for initial transmission when R0 is less than or equal to a preset code rate threshold R_threshold; or When R0 is greater than R_threshold, the RV1 is obtained based on an encoded second bit sequence generated by an incremental redundancy IR method, the length of the second bit sequence is N1, and N1 = 2 * N0, including, the fact that the RV1 is obtained based on an encoded second bit sequence generated by an incremental redundancy IR method is to obtain a subchannel set Q1, Q1 includes K elements, and the K elements are the sequence numbers of K subchannels used to arrange the K bits to be encoded during the initial transmission, to obtain a subchannel set Q2, Q2(i) = Q1(i) + N0, i = 0, 1 ,..., and K - 1, and N0 is the mother code length of the polar code used during the initial transmission, to obtain a subchannel set Q3 based on a reliability ordering sequence of length N1 and a rate matching method for retransmission, Q3(i) < N0, or Q3(i) ∈ Q2, i = 0, 1 ,..., and K - 1, to determine an extended set of bits to be encoded Qext, the elements in Qext are the elements that are in Q3 and less than N0, to determine a set of duplicate bits Qchk = Q2\(Q3\Qext), select the bit values on some or all of the subchannels in Qchk and replicate the bit values one by one to the corresponding subchannels in Qext, based on the determined positions and values, perform polar code encoding on the K bits to be encoded using a mother code length of N1 to obtain the second bit sequence, and then obtain RV1 from the first N0 bits of the second bit sequence based on the rate matching method for retransmission, by which the RV1 is obtained, method.

17. The method according to claim 16, further comprising the step of segmenting the received transport block to be decoded based on the transport block size TBS.

18. The number of segments C of the segmentation is ##EQU00011## where TBcrc is the number of cyclic redundancy check (CRC) bits at the transport block (TB) level, and K_threshold is a first preset threshold value.

20. The method of claim 17.

19. 【Number 12】 and CBcrc is the number of CRC bits at the code block CB level.

20. The method of claim 18.

20. 【Number 13】 And, 2 ｎ２ is the quantization unit, n2 is a positive integer, and N ｉｎｆｏ ’ is the volume of data that can be transmitted N ｉｎｆｏ based on the quantization level, 20. The method of claim 18 or 19.

21. N ｉｎｆｏ ’ teeth, 【Number 14】 where TBSmin is the minimum transport block size, round is the rounding operation, n is the quantization level of the transport block to be transmitted, and n ｍｉｎ is the minimum quantization level, n0 is the quantization adjustment value, ##EQU00015## is a truncation operation, 21. The method of claim 20.

22. 1. A receiving device, comprising: an acquisition unit configured to receive a received signal containing information about K bits to be coded, the mother code length corresponding to said received signal being N0; and to determine an initial transmission version RV0; a determining unit configured to determine a length E1 of a retransmission version RV1 and to determine said retransmission version RV1 based on an initial transmission bit rate R0; a decoding unit configured to perform decoding based on the RV0 and the RV1; Including, determining the retransmission version RV1 based on an initial transmission bit rate R0, determining that RV1 is an E1 bit read from the first circular buffer for initial transmission when R0 is less than or equal to a preset code rate threshold R_threshold; or When R0 is greater than R_threshold, the RV1 is obtained based on an encoded second bit sequence generated by an incremental redundancy IR scheme, and the length of the second bit sequence is N1, where N1=2*N0; Including, The RV1 is obtained based on an encoded second bit sequence generated by an incremental redundancy (IR) method, Obtaining a sub-channel set Q1, Q1 including K elements, the K elements being sequence numbers of K sub-channels used to place the K bits to be coded during an initial transmission; The first step is to obtain a set of subchannels Q2, where Q2(i)=Q1(i)+N0, i=0, 1. , . . . , and K−1, and N0 is the mother code length of the polar code used during the initial transmission; and Obtain a subchannel set Q3 based on a reliability ordering sequence of length N1 and a rate matching scheme for retransmission, where Q3(i)<N0 or Q3(i)∈Q2, i=0, 1. , . . . , and K-1; and determining an extended set of bits to be coded Qext, where the elements in Qext are the elements in Q3 and less than N0; Determining a set of replicated bits Qchk=Q2\(Q3\Qext); selecting bit values ​​on some or all of the subchannels in Qchk and copying the bit values ​​one by one to corresponding subchannels in Qext; performing polar code encoding on the K bits to be encoded based on the determined positions and values ​​with a mother code length of N1 to obtain the second bit sequence, and then obtaining RV1 from the first N0 bits of the second bit sequence based on the rate matching scheme for retransmission; The RV1 is obtained by device.

23. The device of claim 22 , further comprising: a segmentation unit configured to segment a received transport block to be decoded based on a transport block size TBS.

24. The number of segments C of the segmentation is ##EQU00016## where TBcrc is the number of cyclic redundancy check (CRC) bits at the transport block (TB) level, and K_threshold is a first preset threshold value.

24. The device of claim 23.

25. 【FIG. 17】 and CBcrc is the number of CRC bits at the code block CB level.

25. The device of claim 24.

26. 【FIG. 18】 And, 2 ｎ２ is the quantization unit, n2 is a positive integer, and N ｉｎｆｏ ’ is the volume of data that can be transmitted N ｉｎｆｏ based on the quantization level, 26. A device according to claim 24 or 25.

27. N ｉｎｆｏ ’ teeth, [0019] where TBSmin is the minimum transport block size, round is the rounding operation, n is the quantization level of the transport block to be transmitted, and n ｍｉｎ is the minimum quantization level, n0 is the quantization adjustment value, [0020] is a truncation operation, 27. The device of claim 26.

28. an input interface circuit configured to acquire a received signal; A logic circuit configured to obtain a decoding result based on the received signal according to the method of any one of claims 16 to 21; an output interface circuit configured to output the decoded result; A receiving device including:

29. A communications device, comprising a processor configured to carry out a method according to any one of claims 1 to 7 when executing program instructions.

30. 30. The apparatus of claim 29, further comprising: a memory configured to store the program instructions.

31. A communications device, the device including a processor configured to carry out a method according to any one of claims 16 to 21 when executing program instructions.

32. 32. The apparatus of claim 31, further comprising: a memory configured to store the program instructions.

33. A computer readable medium storing computer program instructions which, when executed by a computer, perform the method of any one of claims 1 to 7.

34. A computer readable medium storing computer program instructions which, when executed by a computer, perform the method of any one of claims 16 to 21.

35. A communication system comprising a transmitting device and a receiving device, the transmitting device being configured to perform a method according to any one of claims 1 to 7 and the receiving device being configured to perform a method according to any one of claims 16 to 21.

Images