Method, apparatus, and terminal device for retransmitting data

By calculating the number of overlapping parts of the overlapping parts of the data transmitted at least two times in the HARQ and merging them, the problems of large resource occupation and inefficiency in traditional HARQ processing methods are solved, and more efficient data transmission is achieved.

CN119892311BActive Publication Date: 2025-06-03HANGZHOU BIBO TECH CO LTD +1
View PDF 2 Cites 0 Cited by

Patent Information

Application Number
CN202510357585.0
Authority / Receiving Office
CN · China
Patent Type
Patents(China)
Current Assignee / Owner
Filing Date
2025-03-25
Publication Date
2025-06-03
Estimated Expiration
2045-03-25

AI Technical Summary

Technical Problem

The traditional HARQ processing method decompresses and recompresses the entire data packet every time it retransmission, resulting in large consumption of DDR resources and low efficiency. The frequent compression and decompression process increases processing time and computing resource consumption.

Method used

By obtaining the start position and end position of the data transmitted at least twice, the overlapping portion is determined, the number of overlaps is calculated, and the overlapping portion is merged according to the number of overlaps to retransmit the data.

Benefits of technology

The traditional HARQ processing method has improved the problem of large resource usage and inefficiency in processing the entire data packet every time it is retransmitted, and the efficiency and resource utilization of data transmission are improved.

✦ Generated by Eureka AI based on patent content.

Smart Images

  • Figure CN119892311B_ABST
    Figure CN119892311B_ABST
Patent Text Reader

Abstract

The present application provides a method, apparatus, and terminal device for retransmitting data. By calculating the number of overlaps of the overlapping parts in the data transmitted at least twice, and retransmitting the data of the overlapping parts after data merging based on the number of overlaps, the problems of large resource consumption and low efficiency caused by processing the entire data packet during each retransmission in the traditional data retransmission method are improved.
Need to check novelty before this filing date? Find Prior Art

Description

Technical Field

[0001] The present application relates to the field of communication technologies, and in particular, to a method, an apparatus, and a terminal device for retransmitting data. Background Art

[0002] With the continuous development of wireless communication technologies, the requirements for the reliability and efficiency of data transmission are getting higher and higher. Hybrid Automatic Repeat reQuest (HARQ), as an important technical means, guarantees the accuracy of data through a retransmission mechanism during the data transmission process. However, the traditional HARQ processing method performs decompression and recompression operations on the entire data packet during each retransmission, which not only occupies a large amount of Dynamic Random Access Memory (DDR) resources, resulting in low DDR utilization efficiency, but also the frequent compression and decompression processes will bring certain performance losses, such as increasing the processing time, consuming additional computing resources, etc. In communication scenarios with large data volume transmission and high real-time requirements, these problems are particularly prominent. Therefore, there is an urgent need for a more efficient HARQ processing method to improve the current situation. Summary of the Invention

[0003] In view of this, the purpose of the present application is to propose a method, an apparatus, and a terminal device for retransmitting data to solve or partially solve the above problems.

[0004] Based on the above purpose, in the first aspect of the present application, there is provided a method for retransmitting data, including:

[0005] Obtaining the start position and the end position of the data for each of at least two transmissions;

[0006] Determining the overlapping part of the data for the at least two transmissions according to the start position and the end position;

[0007] Calculating the overlapping times of the overlapping part;

[0008] Performing data merging on the overlapping part according to the overlapping times to retransmit the data for the at least two transmissions.

[0009] In the second aspect of the present application, there is provided an apparatus for retransmitting data, including:

[0010] A storage module configured to obtain the start position and the end position of the data for each of at least two transmissions;

[0011] A first calculation module configured to determine the overlapping part of the data for the at least two transmissions according to the start position and the end position;

[0012] A second computing module, configured to compute the number of overlapping times of the overlapping part;

[0013] A merging module, configured to perform data merging on the overlapping part according to the number of overlapping times, so as to retransmit the data transmitted at least twice.

[0014] In a third aspect of the present application, a terminal device is provided, including a memory, a processor, and a computer program stored on the memory and executable on the processor. When the processor executes the program, the method described in the first aspect is implemented.

[0015] As can be seen from the above, the present application provides a method, apparatus, and terminal device for retransmitting data. This method computes the number of overlapping times of the overlapping part in the data transmitted at least twice, and retransmits the data after performing data merging on the overlapping part based on the number of overlapping times, thereby improving problems such as large resource occupancy and low efficiency caused by the traditional data retransmission method for performing data processing on the entire data packet during each retransmission. Description of the Drawings

[0016] To more clearly illustrate the technical solutions in the present application or related technologies, the following will briefly introduce the drawings required for use in the embodiments or related technology descriptions. Obviously, the drawings in the following description are only embodiments of the present application. For those of ordinary skill in the art, other drawings can be obtained based on these drawings without creative efforts.

[0017] Figure 1 Shows a schematic diagram of an exemplary terminal device 100 according to an embodiment of the present application.

[0018] Figure 2 Shows a schematic diagram of the process of an exemplary HARQ merging according to an embodiment of the present application.

[0019] Figure 3 Shows a schematic diagram of the process of an exemplary HARQ adaptive weighted merging process according to an embodiment of the present application.

[0020] Figure 4 Shows a schematic diagram of an exemplary application scenario according to an embodiment of the present application.

[0021] Figure 5 Shows a schematic diagram of an exemplary application scenario according to an embodiment of the present application.

[0022] Figure 6 Shows a schematic diagram of an exemplary application scenario according to an embodiment of the present application.

[0023] Figure 7The flowchart shows an exemplary method 700 for retransmitting data according to an embodiment of the present application.

[0024] Figure 8 The schematic diagram shows an exemplary apparatus for retransmitting data according to an embodiment of the present application. Detailed implementation manners

[0025] To make the objectives, technical solutions, and advantages of the present application clearer and more understandable, the present application will be further described in detail below with reference to specific embodiments and the accompanying drawings.

[0026] It should be noted that, unless otherwise defined, the technical terms or scientific terms used in the embodiments of the present application should be the general meanings understood by those of ordinary skill in the art to which the present application belongs. The terms "first", "second", and similar terms used in the embodiments of the present application do not denote any order, quantity, or importance, but are only used to distinguish different components. The terms such as "including" or "comprising" mean that the elements or items appearing before this term cover the elements or items listed after this term and their equivalents, without excluding other elements or items. The terms such as "connected" or "coupled" are not limited to physical or mechanical connections, but may include electrical connections, whether direct or indirect. The terms such as "upper", "lower", "left", and "right" are only used to represent relative positional relationships, and when the absolute position of the object being described changes, the relative positional relationship may also change accordingly.

[0027] As described above, with the continuous development of wireless communication technologies, the requirements for the reliability and efficiency of data transmission are getting higher and higher. Hybrid Automatic Repeat reQuest (HARQ), as an important technical means, ensures the accuracy of data through a retransmission mechanism during data transmission. However, the traditional HARQ processing method decompresses and recompresses the entire data packet during each retransmission, which not only occupies a large amount of Dynamic Random Access Memory (DDR) resources, resulting in low DDR utilization efficiency, but also the frequent compression and decompression processes will cause certain performance losses, such as increasing processing time and consuming additional computing resources. In communication scenarios with large data volume transmission and high real-time requirements, these problems are particularly prominent. Therefore, there is an urgent need for a more efficient HARQ processing method to improve the current situation.

[0028] Figure 1FIG. 0 shows a schematic diagram of an exemplary terminal device 100 according to an embodiment of the present application. The terminal device 100 may include: a processor 1010, a memory 1020, an input / output interface 1030, a communication interface 1040, and a bus 1050. Among them, the processor 1010, the memory 1020, the input / output interface 1030, and the communication interface 1040 are communicatively connected to each other inside the device through the bus 1050.

[0029] The processor 1010 may be implemented in the form of a general-purpose CPU (Central Processing Unit), a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits, etc., and is used to execute relevant programs to implement the technical solutions provided in the embodiments of this specification.

[0030] The memory 1020 may be implemented in the form of a ROM (Read Only Memory), a RAM (Random Access Memory), a static storage device, a dynamic storage device, etc. The memory 1020 may store an operating system and other application programs. When implementing the technical solutions provided in the embodiments of this specification through software or firmware, the relevant program codes are stored in the memory 1020 and are called and executed by the processor 1010.

[0031] The input / output interface 1030 is used to connect to an input / output module to implement information input and output. The input / output module may be configured as a component in the device (not shown in the figure) or externally connected to the device to provide corresponding functions. Among them, the input device may include a keyboard, a mouse, a touch screen, a microphone, various sensors, etc., and the output device may include a display, a speaker, a vibrator, an indicator light, etc.

[0032] The communication interface 1040 is used to connect to a communication module (not shown in the figure) to implement communication interaction between this device and other devices. Among them, the communication module may implement communication in a wired manner (such as USB, network cable, etc.) or in a wireless manner (such as mobile network, WIFI, Bluetooth, etc.).

[0033] The bus 1050 includes a path for transmitting information between various components of the device (such as the processor 1010, the memory 1020, the input / output interface 1030, and the communication interface 1040).

[0034] It should be noted that although the above device only shows the processor 1010, the memory 1020, the input / output interface 1030, the communication interface 1040, and the bus 1050, in the specific implementation process, the device may also include other components necessary for normal operation. In addition, those skilled in the art can understand that the above device may also only include the components necessary for implementing the solution of the embodiments of this specification, and does not necessarily include all the components shown in the figure.

[0035] The retransmission mechanism during data transmission can be implemented by the terminal device 100. The existing HARQ processing method performs the same decompression and compression operations on the entire data packet during retransmission, rather than distinguishing the truly overlapping and participating parts from the parts that do not participate in the merging separately in the entire HARQ storage unit (HARQ buffer). Instead, after merging all data, saturation processing or weighted processing is uniformly performed, which seriously damages the integrity and accuracy of the data.

[0036] Data precision loss: The traditional HARQ processing method performs the same processing on the entire data packet during retransmission. Usually, the high-order saturation or weighted merging strategy is uniformly adopted, without distinguishing the truly overlapping part and the separate part. As a result, the precision of the data that does not participate in the alignment gradually decreases after multiple merges, leading to serious data precision loss and affecting the accurate restoration of the data. Among them, the "aligned part of the data" usually refers to the process of merging the retransmitted data received at the receiving end with the previously received data.

[0037] Inefficient resource utilization: Due to the loss of the value of some data during merging, in order to meet the same transmission quality standard, the number of retransmissions needs to be increased, resulting in frequent decompression and compression operations, occupying a large amount of DDR resources, reducing the resource utilization efficiency, and increasing the system burden.

[0038] Limited decoding performance bottleneck: Since the conditions of the wireless channel are dynamically changing, it may be affected by factors such as multipath effects, interference, and fading. During data transmission, the fluctuation of the channel quality will cause a large difference in the signal quality of different transmissions, thus affecting the accuracy of data merging and resulting in misalignment of data merging. The additional error codes introduced by the misalignment of data merging increase the error correction difficulty of the decoder, leading to a decrease in the decoding success rate and an increase in the error frame rate, affecting the reliability of the system.

[0039] In the conventional processing flow of HARQ combination, when the system starts receiving data, it opens up HARQ buffer space at the receiving end according to the 3GPP protocol, such as 38212 for 5G (Fifth Generation) New Radio of the 3GPP (Third Generation Partnership Project) protocol and 36212 for 4G (Fourth Generation) Long Term Evolution (4G LTE). The initial storage format and capacity are set according to system parameters. Usually, the capacity size allocated to each CB (CodeBlock) in the capacity size of the HARQ storage unit (HARQ buffer Size) is called Ncb (Number of Circular Buffers).

[0040] The received data is parsed according to the protocol and stored in the corresponding starting position k0 of the HARQ buffer (i.e., the offset of the buffer storage address during each transmission). The length of the received data is E. The offset of each transmission is determined according to the redundancy version (RV) of that transmission. The redundancy version is used to indicate the version of the redundant information used in the transmission. Different RVs result in different starting positions k0.

[0041] In 4G LTE, the calculation of the starting position k0 is obtained from the following formula given in 3GPP 36212:

[0042]

[0043] where, represents the number of columns during LTE rate matching row-column conversion, represents the redundancy version index, i.e., the above-mentioned RV.

[0044] In 5G NR, the calculation of the starting position k0 is shown in 3GPP 38212:

[0045]

[0046] where, represents the redundancy version number of the current transmission, i.e., the above-mentioned RV. represents the length factor of the LDPC coding block. LDPC base graph represents the base graph used to generate the LDPC (Low-Density Parity-Check) code.

[0047] In third-generation mobile communication technology (3G) communication systems, including WCDMA (Wideband Code Division Multiple Access), CDMA2000 (Code Division Multiple Access 2000), and TD-SCDMA (Time Division-Synchronous Code Division Multiple Access) systems, the HARQ retransmission combining algorithm is used. The calculation of related parameters is similar and will not be elaborated here.

[0048] During each transmission, if the Transport Block Cyclic Redundancy Check (TB CRC) of the current transmission block is incorrect, HARQ needs to cache the current data for the next retransmission. In some embodiments, the start position and end position of the current transmission can be additionally recorded to determine whether there is an overlap between the two segments of data during the next retransmission combination.

[0049] Figure 2 The flowchart of an exemplary HARQ combination according to an embodiment of the present application is shown.

[0050] Assume that the bit width of the soft bits input to HARQ and the soft bits after HARQ combination is m, and the bit width after HARQ compression is n. As Figure 2 shown, in some embodiments, the HARQ module may include a HARQ Combine unit, a Compress unit, a HARQ buf (HARQ buffer storage) unit, and a Decompress unit.

[0051] The basic process of HARQ combination is as Figure 2 shown. The HARQ combination unit receives two paths of data: one is the LLR (Log-Likelihood Ratio) with a bit width of m bits received by the receiver during each transmission, and the other is the LLR with a bit width of m bits from the previous transmission decompressed from the HARQ buffer. The log-likelihood ratio is used to represent the relative probability that the received signal corresponds to a certain bit value (usually 0 or 1).

[0052] Except for the initial transmission, all retransmissions need to perform HARQ combination, and HARQ combination is to add the two paths of LLRs input to the HARQ combination unit at the corresponding positions.

[0053] The bit width of the LLR after HARQ combination is m + 1 bits, and this LLR needs to be saturated or weighted to obtain an LLR with a bit width of m bits.

[0054] The data output after HARQ combination also has two paths. One path is given to the decoder, and the other path is given to the compression unit. The LLR with an m-bit width is stored in the HARQ buffer with an n-bit width after compression. Among them, n ≤ m. It can be understood that there are various compression algorithms and will not be elaborated here.

[0055] In traditional combination processing, in the HARQ combination unit, all data is directly saturated or weighted uniformly. Such an operation easily causes precision loss of some data participating in the combination.

[0056] Since the starting positions of the data participating in the combination are different, there are separate parts and overlapping parts. If all data is directly saturated uniformly, the data in the overlapping part may be saturated at the high bits, resulting in loss of high-bit precision. If all data is weighted uniformly, the non-overlapping part may lose low-bit precision, and there may be multiple overlapping parts. Using the same weighting factor for weighted processing uniformly will cause high-bit loss in the part with more overlapping times or low-bit loss in the part with fewer overlapping times. All of these will introduce loss of data precision in HARQ combination and cause degradation of the overall system performance.

[0057] To at least solve the above problems, the present application provides a method, device, and terminal device for retransmitting data. This method calculates the overlapping times of the overlapping parts in the data of at least two transmissions, and retransmits the data in the overlapping parts after data combination based on the overlapping times, thereby improving problems such as large resource occupation and low efficiency caused by the traditional data retransmission method for data processing of the entire data packet during each retransmission.

[0058] To solve the problem that the existing HARQ combination algorithm does not distinguish data processing, resulting in precision loss, resource waste, and poor decoding performance of the data that does not participate in alignment combination, in some embodiments, an address storage unit, an overlapping position calculation unit, and a saturation / weighting selection unit can be added.

[0059] Figure 3 Shows a schematic flow diagram of an exemplary HARQ adaptive weighted combination process according to an embodiment of the present application.

[0060] As Figure 3As shown, in some embodiments, the HARQ module may include a HARQ Combine unit, a Compress unit, a HARQ buf unit, a Decompress unit, an Address buf unit, an Overlap position cal unit, and a Saturation / Weighted selection unit.

[0061] The Address buf unit may store the starting position k0 and the ending position k1 of the current data. The function of the Overlap position cal unit is to judge the overlap between two transmissions. In HARQ retransmission, since the size of the Circular Buffer is Ncb, the starting position k0 and the ending position k1 of each transmission may cause some data to overlap or not overlap in the buffer. Therefore, it is necessary to judge which data is the overlapping part and which is the separate part (non-overlapping part).

[0062] The index range of the overlapping part is:

[0063]

[0064] where is the overlapping data range of the current transmission and the previous transmission in the circular buffer, that is, the index intersection; represents the starting position of the current i-th transmission; represents the starting position of the previous (i - 1)-th transmission; represents the ending position of the current i-th transmission; represents the ending position of the previous transmission; represents the size of the circular buffer; represents taking the remainder.

[0065] The starting position of the overlapping part: represents that the starting point of the overlapping part is the larger one of the starting positions of the current transmission and the previous transmission. Because only starting from the larger starting point can the content of both transmissions be included.

[0066] The ending position of the overlapping part: represents that the ending point of the overlapping part is the smaller one of the ending positions of the current transmission and the previous transmission. Because only before the smaller ending point can it be the range covered by both transmissions.

[0067] The index range of the non-overlapping part is expressed as:

[0068]

[0069] Among them, is the part of the current transmitted data that does not overlap with the buffered data. It can be divided into two parts:

[0070] The first part, the non - overlapping part of the previous transmission:

[0071]

[0072] Among them, the range of the previous transmission: the starting position is and the ending position is , which represents the actual range of the previous transmission in the circular buffer.

[0073] Deduct the overlapping area: Use the subtraction operation \ to represent removing the overlapping part (OverlapRange) from the previous transmission range. The remaining part is the non - overlapping area of the previous transmission that has no intersection with the current transmission.

[0074] The second part, the non - overlapping part of the current transmission:

[0075]

[0076] Among them, the range of the current transmission: the starting position is and the ending position is , which represents the actual range of the current transmission in the circular buffer.

[0077] Deduct the overlapping area: Similarly, use the subtraction operation \ to represent removing the overlapping part (Overlap Range) from the current transmission range. The remaining part is the non - overlapping area of the current transmission that has no intersection with the previous transmission.

[0078] Multiple re - transmissions refer to the scenarios of the second and above re - transmissions except for the initial transmission (abbreviated as the first transmission). For multiple re - transmission scenarios, it is necessary to calculate the mutual overlapping positions between each transmission. For example, for 3 transmissions, there may be some parts that overlap once, and there may also be some parts that overlap twice. For N transmissions, the possible number of overlaps x = 1~N - 1.

[0079] The saturation / weighted selection unit is used to determine, in each transmission, whether each part of the data obtained through the overlapping position calculation unit overlaps and how many times it overlaps. For non - overlapping parts, directly output the data of that part with an m - bit width to maintain the original accuracy and simplify the process. The LLR after weighted combination of the overlapping parts can be expressed by the following formula:

[0080]

[0081] Among them, is the LLR of the current transmission; is the LLR decompressed from the HARQ buffer. If there are multiple overlaps, it is the LLR obtained by weighted combination of the LLRs from previous multiple transmissions; is the weighting factor. For the part with x overlaps, = 1 / (1 + x).

[0082] The advantage of weighted counting for overlapping parts is to balance data contribution, reduce precision loss, and improve combination quality. For example, for multiple retransmissions of key data, the weights are reasonably accumulated, and for secondary data, it is moderately diluted.

[0083] Figure 4 shows a schematic diagram of an exemplary application scenario according to an embodiment of the present application.

[0084] Such as Figure 4 shown, taking the case where all 4 transmissions result in decoding errors as an example. In this scenario, each transmission requires retransmission. The capacity of the HARQ storage unit is Ncb. The data lengths of each transmission are E1, E2, E3, and E4 respectively.

[0085] In the initial transmission, that is, the first transmission, in some embodiments, the starting position k0 = a and the ending position k1 = a + E1 of this transmission can be recorded for use in subsequent retransmissions. The initial transmission does not undergo any combination processing.

[0086] In the second transmission, in some embodiments, the starting position k0 = b and the ending position k1 = b + E2 of this transmission can be recorded for use in subsequent retransmissions. The data range after combination is [a, b - a + E2], which can be divided into three parts, namely [a, b], [b, a + E1], and [a + E1, b + E2].

[0087] Figure 5 shows a schematic diagram of an exemplary application scenario according to an embodiment of the present application. Figure 5 The application scenario shown can be Figure 4 the first transmission and the second transmission in the application scenario shown.

[0088] For the processing of non - overlapping parts, such as Figure 5 shown, in some embodiments, for the LLR from a to b, this part of the data is the part decompressed from the HARQ buffer, and the bit width is still m. Without undergoing combination processing, this part is directly passed backward for subsequent decoding and compression processing;

[0089] In some embodiments, for the LLR from a+E1 to b+E2, since this part of the LLR is the newly received LLR in the current time, without undergoing merging processing, the bit width remains m, and this part is directly passed backward for subsequent decoding and compression processing;

[0090] For the processing of the part with one overlap, in some embodiments, for the LLR from b to a+E1, which belongs to the overlapping part of the initial transmission and the retransmission, after merging the LLRs of the initial transmission and the retransmission, weighted merging is performed with w = 1 / 2 as the weighting factor, that is:

[0091]

[0092] Then an LLR with a bit width of m bits is obtained. Among them, is the LLR of the previous transmission decompressed from the HARQ buffer, is the newly received LLR in the current time.

[0093] Figure 6 FIG. shows a schematic diagram of an exemplary application scenario according to an embodiment of the present application. Figure 6 The shown application scenario can be Figure 4 the first transmission, the second transmission, and the third transmission in the shown application scenario.

[0094] Such as Figure 6 shown, in the third transmission, in some embodiments, the starting position k0 = c of this transmission can be recorded. If the end position of the LLR of this transmission exceeds the size Ncb of the cyclic buffer, it is stored in a circular manner (for example, the part of E3-(Ncb-c)), so the end position k1 = (c + E3)%Ncb = E3 - Ncb + c, which is used for subsequent retransmission. Therefore, the LLR of the third transmission is divided into two parts, the first part E3 (part1) with a corresponding data size of Ncb - c and the second part E3 (part2) with a corresponding data size of E3 - Ncb + c.

[0095] The merged data can be divided into three scenarios according to the number of overlaps: non-overlapping, one overlap, and two overlaps.

[0096] For the non-overlapping scenario, in some embodiments, for the part [0, a], since these two parts of the LLR are the newly received LLRs in the current time, without undergoing merging processing, the bit width remains m bits, and this part is directly passed backward for subsequent decoding and compression processing;

[0097] In some embodiments, for the [E3-Ncb+c, b] part, the data of this part is the part decompressed from the HARQ buffer (the initial transmission data of the last unmerged part), and the bit width is still m bits. Without merging processing, this part is directly passed backward for subsequent decoding and compression processing;

[0098] In some embodiments, for the [b+E2, Ncb] part, since the LLRs of these two parts are the newly received LLRs in the current time, without merging processing, the bit width is still m bits, and this part is directly passed backward for subsequent decoding and compression processing.

[0099] For the scenario with one overlap, in some embodiments, for the [a, E3-Ncb+c] part, the currently received LLR is weighted and merged with the LLR stored for the first time decompressed from the HARQ buffer with a weighting factor w = 1 / 2, that is:

[0100]

[0101] Then an LLR with a bit width of m bits is obtained. Among them, is the LLR for the first time decompressed from the HARQ buffer, is the newly received LLR in the current time.

[0102] In some embodiments, for the [b, c] part, the LLR stored after the weighted merging of the first and second times decompressed from the HARQ buffer. This part of the LLR has been weighted and merged before storage, so it does not need to be weighted and merged again after decompression, and the bit width is still m. This part is directly passed backward for subsequent decoding and compression processing;

[0103] In some embodiments, for the [a+E1, b+E2] part, the currently received LLR is weighted and merged with the LLR stored for the second time decompressed from the HARQ buffer, that is:

[0104]

[0105] Then an LLR with a bit width of m bits is obtained. Among them, is the LLR for the second time decompressed from the HARQ buffer, is the newly received LLR in the current time.

[0106] For the scenario with two overlaps, in some embodiments, for [c, a+E1], the LLR stored after the weighted merging of the first and second times decompressed from the HARQ buffer is denoted as , it is weighted and combined with the LLR received in the current time with a weighting factor w = 1 / 3, that is:

[0107]

[0108] The bit width of the output LLR is still m, and this part is directly passed backward for subsequent decoding and compression processing.

[0109] Return to Figure 4 , for the scenario of the 4th transmission, in some embodiments, the starting position k0 = d and the ending position k1 = (d + E4) of the transmission can be recorded.

[0110] The merged data can be divided into 3 scenarios according to the number of overlaps: non - overlapping, overlapping once, overlapping twice, and overlapping three times.

[0111] For the non - overlapping scenario, in some embodiments, for the [0, d] part, this part of the data is the LLR of the 3rd transmission decompressed from the HARQ buffer;

[0112] In some embodiments, for the [b + E2, Ncb] part, this part of the data is the LLR of the 3rd transmission decompressed from the HARQ buffer;

[0113] For the non - overlapping part, the output bit width is still m bit, without passing through the merging process, and this part is directly passed backward for subsequent decoding and compression processing.

[0114] For the scenario of overlapping once, in some embodiments, for the [d, a] part: the 3rd data and the 4th data are merged:

[0115]

[0116] In some embodiments, for the [c + E3 - Ncb, b] part: the 1st data and the 4th data are merged, and the merging is the same as above;

[0117] In some embodiments, for the [a + E1, b + E2] part: it is the result of the merger of the 2nd data and the 3rd data, which has been weighted, and no processing is required when used this time .

[0118] For the scenario of overlapping twice, in some embodiments, for the [a, c + E3 - Ncb] part: the 4th data is merged with the data in the buffer (after the weighted merger of the 1st and 3rd data);

[0119]

[0120] In some embodiments, for the [b, c] part: The data in the 4th time is merged with the data in the buffer (after the 1st and 2nd weighted merges). The merging method is the same as above.

[0121] In some embodiments, for the [d+E4, a+E1] part: The data in the buffer (after the 1st, 2nd, and 3rd weighted merges) has already been weighted and merged. It is directly output backward.

[0122] For the processing of the part with 3 overlaps, in some embodiments, for the [c, d+E4] part: The data in the 4th time is merged with the data in the buffer (after the 1st, 2nd, and 3rd weighted merges), and the weighting factor is 1 / 4.

[0123]

[0124] The saturation processing of the output LLR is m bits, which is used for subsequent decoding and compression processing.

[0125] The embodiments of the present application aim to design an optimized HARQ weighted merging scheme, adaptively adjust the processing strategy according to whether the data is merged with the previous time and the merging misalignment situation, improve the data processing accuracy, resource utilization rate and decoding accuracy, and enhance the comprehensive performance of the HARQ technology.

[0126] Figure 7 The flowchart of an exemplary method 700 for retransmitting data according to the embodiments of the present application is shown. As Figure 7 shown, the method 700 can be executed by the terminal device 100 and may include the following steps.

[0127] In step 702, obtain the start position and end position of the data for each transmission in at least two transmissions of data (for example, Figure 4 at least two of the 1st transmission, 2nd transmission, 3rd transmission, and 4th transmission in Figure 4 ). The start positions are a, b, c, d, and the end positions are a+E1, b+E2, E3-Ncb+c, d+E4 in

[0128] In some embodiments, obtain target data related to the data of the previous transmission among the data of the at least two transmissions from a storage unit (for example, Figure 2 the HARQ storage unit in Figure 4 ). If the current transmission is the 4th transmission in Figure 4The merged partial data 502) among them, the target data includes the merged partial data in the data transmitted last time. The data after the merging process is stored in the storage unit, and this partially merged data can be directly obtained and used during the next weighting process without any other processing.

[0129] In step 704, according to the starting position and the ending position, determine the overlapping part of the data transmitted at least twice (for example, Figure 4 the part overlapping once, the part overlapping twice, the part overlapping three times) among them.

[0130] In some embodiments, the method further includes: according to the starting position and the ending position, determine the non - overlapping part of the data transmitted at least twice (for example, Figure 4 the [0, d] part, the [b + E2, Ncb] part) among them; output the non - overlapping part with the bit widths corresponding to the data transmitted at least twice to re - transmit the data transmitted at least twice. Outputting the data of the non - overlapping part with the original bit width when receiving can maintain the original data accuracy and simplify the data processing procedures.

[0131] In some embodiments, the determining the non - overlapping part of the data transmitted at least twice according to the starting position and the ending position further includes: according to the starting position and the ending position, determine the transmission range of the data transmitted at least twice (for example, taking Figure 4 the first transmission and the second transmission among them as an example, the transmission range is the [a, b + E2] part); remove the overlapping part in the transmission range to obtain the non - overlapping part (for example, taking Figure 4 the first transmission and the second transmission among them as an example, the non - overlapping part is the [a, b] part and the [a + E1, b + E2] part).

[0132] In some embodiments, the data transmitted at least twice includes the data transmitted this time and the data transmitted last time, and the determining the non - overlapping part of the data transmitted at least twice according to the starting position and the ending position further includes:

[0133]

[0134] wherein, represents the non - overlapping part; represents the non - overlapping part of the data transmitted last time; represents the non - overlapping part of the data transmitted this time; represents the number of circular buffers; represents taking the remainder.

[0135] In some embodiments, determining the overlapping portion of the data of the at least two transmissions according to the starting position and the ending position further includes: determining a target starting position (for example, taking the first transmission and the second transmission in Figure 4 as an example, the target starting position is a) and a target ending position (for example, taking the first transmission and the second transmission in Figure 4 as an example, the target ending position is b + E2) of the data of the at least two transmissions according to the starting position and the ending position; determining the overlapping portion (for example, taking the first transmission and the second transmission in Figure 4 as an example, the overlapping portion is the [b, a + E1] portion) of the data of the at least two transmissions according to the target starting position and the target ending position. Based on the target starting position and the target ending position, the range that simultaneously includes the data of at least two transmissions can be determined.

[0136] In some embodiments, the data of the at least two transmissions includes the data of the current transmission and the data of the previous transmission. The data of the current transmission includes a first starting position and a first ending position, and the data of the previous transmission includes a second starting position and a second ending position. Determining the target starting position and the target ending position of the data of the at least two transmissions according to the starting position and the ending position further includes: in response to the first starting position (for example, taking the first transmission and the second transmission in Figure 4 as an example, the first starting position is a) being greater than the second starting position (for example, taking the first transmission and the second transmission in Figure 4 as an example, the second starting position is b), determining the first starting position as the target starting position; in response to the first ending position being less than the second ending position, determining the first ending position as the target ending position. Based on the target starting position and the target ending position, the range that simultaneously includes the data of at least two transmissions can be determined.

[0137] In some embodiments, determining the overlapping portion of the data of the at least two transmissions according to the target starting position and the target ending position further includes:

[0138]

[0139] wherein, represents the overlapping portion; represents the target starting position; represents the target ending position.

[0140] In step 706, calculate the number of overlapping times of the overlapping portion (for example, Figure 4 overlaps once, twice, three times).

[0141] In step 708, data merging is performed on the overlapping part according to the number of overlaps to re - transmit the data of at least two transmissions.

[0142] In some embodiments, the data of at least two transmissions includes the data of the current transmission and the data of the previous transmission. The overlapping part includes a first overlapping part and a second overlapping part. The data of the current transmission includes the first overlapping part, and the data of the previous transmission includes the second overlapping part. The data merging of the overlapping part according to the number of overlaps to re - transmit the data of at least two transmissions further includes: weighted - merging the first overlapping part and the second overlapping part according to the number of overlaps to re - transmit the data of at least two transmissions. By performing weighted - merging processing on the data of the overlapping part, the problems of resource waste and low efficiency caused by processing the data of the entire data packet in the traditional re - transmission mechanism are improved.

[0143] In some embodiments, the weighted - merging of the first overlapping part and the second overlapping part according to the number of overlaps to re - transmit the data of at least two transmissions further includes:

[0144]

[0145] wherein, represents the data after weighted - merging; represents the first overlapping part; represents the second overlapping part; represents the weighting factor, , represents the number of overlaps.

[0146] This application provides a method, an apparatus, and a terminal device for re - transmitting data. By calculating the number of overlaps of the overlapping part in the data of at least two transmissions, and re - transmitting after data - merging the data of the overlapping part based on the number of overlaps, the problems of large resource occupation and low efficiency caused by processing the entire data packet in each re - transmission in the traditional data re - transmission method are improved.

[0147] Based on the same inventive concept, corresponding to the method in any of the above embodiments, this application also provides an apparatus for re - transmitting data.

[0148] Referring to Figure 8 , the apparatus for re - transmitting data includes:

[0149] A storage module 801, configured to obtain the start position and the end position of the data of each transmission in the data of at least two transmissions.

[0150] The storage module 801 is further configured to obtain target data related to the data of the last transmission among the data of the at least two transmissions from the storage unit, where the target data includes the merged partial data in the data of the last transmission.

[0151] The first calculation module 802 is configured to determine the overlapping part of the data of the at least two transmissions according to the start position and the end position.

[0152] The first calculation module 802 is further configured to determine the non-overlapping part of the data of the at least two transmissions according to the start position and the end position; output the non-overlapping part with the bit width corresponding to the data of the at least two transmissions to re-transmit the data of the at least two transmissions.

[0153] The first calculation module 802 is further configured to determine the transmission range of the data of the at least two transmissions according to the start position and the end position; remove the overlapping part in the transmission range to obtain the non-overlapping part.

[0154] The first calculation module 802 is further configured to

[0155] where represents the non-overlapping part; represents the non-overlapping part of the data of the last transmission; represents the non-overlapping part of the data of the current transmission; represents the number of circular buffers; represents taking the remainder.

[0156] The first calculation module 802 is further configured to determine the target start position and the target end position of the data of the at least two transmissions according to the start position and the end position; determine the overlapping part of the data of the at least two transmissions according to the target start position and the target end position.

[0157] The first calculation module 802 is further configured to, in response to the first start position being greater than the second start position, determine the first start position as the target start position; in response to the first end position being less than the second end position, determine the first end position as the target end position.

[0158] The first calculation module 802 is further configured to:

[0159]

[0160] where represents the overlapping part; represents the target start position; Indicates the target end position.

[0161] A second calculation module 803, configured to calculate the number of overlaps of the overlapping part.

[0162] A merging module 804, configured to perform data merging on the overlapping part according to the number of overlaps, so as to retransmit the data transmitted at least twice.

[0163] The merging module 804 is further configured to perform weighted merging on the first overlapping part and the second overlapping part according to the number of overlaps, so as to retransmit the data transmitted at least twice.

[0164] The merging module 804 is further configured to

[0165] Wherein, represents the data after weighted merging; represents the first overlapping part; represents the second overlapping part; represents the weighting factor, , represents the number of overlaps.

[0166] For the convenience of description, when describing the above device, various modules are described separately according to their functions. Of course, when implementing the present application, the functions of each module can be implemented in the same or multiple software and / or hardware.

[0167] The device of the above embodiment is used to implement the corresponding method 700 in any of the foregoing embodiments, and has the beneficial effects of the corresponding method embodiments, which will not be elaborated herein.

[0168] Those of ordinary skill in the art should understand that: the discussion of any of the above embodiments is only exemplary, and is not intended to imply that the scope of the present application (including the claims) is limited to these examples; under the idea of the present application, the technical features in the above embodiments or different embodiments can also be combined, the steps can be implemented in any order, and there are many other variations in different aspects of the embodiments of the present application as described above, and they are not provided in detail for the sake of brevity.

[0169] In addition, for simplicity of explanation and discussion, and so as not to make the embodiments of the present application difficult to understand, known power / ground connections to integrated circuit (IC) chips and other components may or may not be shown in the provided drawings. Further, the devices may be shown in block diagram form in order to avoid making the embodiments of the present application difficult to understand, and this also takes into account the fact that details of the implementation of these block diagram devices are highly dependent on the platform on which the embodiments of the present application are to be implemented (i.e., these details should be fully within the understanding of those skilled in the art). In cases where specific details (such as circuits) are set forth to describe exemplary embodiments of the present application, it will be apparent to those skilled in the art that the embodiments of the present application may be practiced without these specific details or with variations of these specific details. Accordingly, these descriptions should be regarded as illustrative rather than restrictive.

[0170] Although the present application has been described in connection with specific embodiments thereof, many alternatives, modifications, and variations of these embodiments will be apparent to those of ordinary skill in the art based on the foregoing description.

[0171] Embodiments of the present application are intended to cover all such alternatives, modifications, and variations that fall within the broad scope of the appended claims. Therefore, any omissions, modifications, equivalent substitutions, improvements, etc., made within the spirit and principles of the embodiments of the present application shall be included within the protection scope of the present application.

Claims

1. A method for retransmitting data, comprising: Obtaining the starting position and the ending position of each of the at least two transmitted data; Determining an overlapping portion of the data transmitted at least twice according to the starting position and the ending position; Calculating the number of overlaps of the overlapping parts; Merging the overlapping parts according to the number of overlaps to retransmit the data transmitted at least twice, comprising: weighted merging the first overlapping part and the second overlapping part according to the number of overlaps to retransmit the data transmitted at least twice; wherein the data transmitted at least twice include the data transmitted at the current time and the data transmitted at the last time, the overlapping parts include the first overlapping part and the second overlapping part, the data transmitted at the current time includes the first overlapping part, and the data transmitted at the last time includes the second overlapping part; The weighted combination of the first overlapping part and the second overlapping part according to the number of overlaps to retransmit the at least two transmitted data further comprises: in, represents the weighted combined data; represents the first overlapping part; represents the second overlapping part; represents the weighting factor, , Indicates the number of overlaps.

2. The method of claim 1, wherein: The method further comprises: Determining a non-overlapping portion of the data transmitted at least twice according to the starting position and the ending position; The non-overlapping portion is outputted with a bit width corresponding to the data transmitted at least twice, so as to retransmit the data transmitted at least twice.

3. The method of claim 1, wherein: Determining the overlapping portion of the at least two transmitted data according to the starting position and the ending position further comprises: Determining a target starting position and a target ending position of the data transmitted at least twice according to the starting position and the ending position; An overlapping portion of the at least two transmitted data is determined according to the target starting position and the target ending position.

4. The method of claim 3, wherein: The at least two transmitted data include data of a current transmission and data of a previous transmission, the data of the current transmission include a first starting position and a first ending position, the data of the previous transmission include a second starting position and a second ending position, and determining a target starting position and a target ending position of the at least two transmitted data according to the starting position and the ending position further includes: In response to the first starting position being greater than the second starting position, determining the first starting position as the target starting position; In response to the first end position being smaller than the second end position, the first end position is determined as the target end position.

5. The method of claim 3, wherein: Determining the overlapping portion of the at least two transmitted data according to the target starting position and the target ending position further comprises: in, Indicates the overlapping part; Indicates the target starting position; Indicates the target end position.

6. The method of claim 2, wherein: Determining the non-overlapping portion of the data transmitted at least twice according to the starting position and the ending position further comprises: Determining a transmission range of the data transmitted at least twice according to the starting position and the ending position; The overlapping portion in the transmission range is removed to obtain the non-overlapping portion.

7. The method of claim 2, wherein: The data of the at least two transmissions include data of the current transmission and data of the last transmission, and the determining, according to the starting position and the ending position, a non-overlapping portion of the data of the at least two transmissions further includes: in, Indicates the non-overlapping part; Represents the non-overlapping portion of the data transmitted last time; Indicates the non-overlapping part of the data currently transmitted; Indicates the number of circular buffers; Indicates remainder.

8. The method of claim 1, wherein: The method further comprises: Target data related to the last transmitted data among the at least two transmitted data is acquired from the storage unit, wherein the target data includes a merged portion of the last transmitted data.

9. An apparatus for retransmitting data, comprising: A storage module, configured to obtain a starting position and an ending position of each of the at least two transmitted data; A first calculation module is configured to determine an overlapping portion of the data transmitted at least twice according to the starting position and the ending position; A second calculation module is configured to calculate the number of overlaps of the overlapping parts; a merging module, configured to perform data merging on the overlapping parts according to the number of overlaps, so as to retransmit the data transmitted at least twice, comprising: weighted merging of the first overlapping part and the second overlapping part according to the number of overlaps, so as to retransmit the data transmitted at least twice; wherein the data transmitted at least twice include the data transmitted at the current time and the data transmitted at the last time, the overlapping parts include the first overlapping part and the second overlapping part, the data transmitted at the current time includes the first overlapping part, and the data transmitted at the last time includes the second overlapping part; The merging module is further configured to: in, represents the weighted combined data; represents the first overlapping part; represents the second overlapping part; represents the weighting factor, , Indicates the number of overlaps.

10. A terminal device comprising a memory, a processor, and a computer program stored in the memory and executable on the processor, wherein: When the processor executes the program, the method according to any one of claims 1 to 8 is implemented.

Citation Information

Patent Citations

  • Communication system and communication method with association frequency domain repetition and mixed automatic retransmission

    CN101222306A

  • Self-adaptive retransmission merging method, system and medium in wireless communication system

    CN110138516A