WO2012174819A1 - Harq merging method and device - Google Patents

Harq merging method and device Download PDF

Info

Publication number
WO2012174819A1
WO2012174819A1 PCT/CN2011/082186 CN2011082186W WO2012174819A1 WO 2012174819 A1 WO2012174819 A1 WO 2012174819A1 CN 2011082186 W CN2011082186 W CN 2011082186W WO 2012174819 A1 WO2012174819 A1 WO 2012174819A1
Authority
WO
WIPO (PCT)
Prior art keywords
harq
data
length
result
buffer
Prior art date
Application number
PCT/CN2011/082186
Other languages
French (fr)
Chinese (zh)
Inventor
董亮
王喜瑜
吴枫
陈月强
Original Assignee
中兴通讯股份有限公司
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中兴通讯股份有限公司 filed Critical 中兴通讯股份有限公司
Publication of WO2012174819A1 publication Critical patent/WO2012174819A1/en

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04LTRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00Arrangements for detecting or preventing errors in the information received
    • H04L1/12Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1829Arrangements specially adapted for the receiver end
    • H04L1/1835Buffer management
    • H04L1/1845Combining techniques, e.g. code combining

Definitions

  • the present invention relates to the field of communications, and in particular, to a method and apparatus for merging Hybrid Automatic Repeat Request (HQQ). Background technique
  • HARQ is a key technology in high-speed wireless communication systems such as Long-Term Evolution (LTE) and World Interoperability for Microwave Access (WiMAX), which has both forward error correction.
  • LTE Long-Term Evolution
  • WiMAX World Interoperability for Microwave Access
  • FEC Forward Error Correction
  • ARQ Automatic Repeat Request
  • the last saved 'last merge result' is taken out, merged with the retransmitted 'this received data', and then the combined result is decoded to improve The correct rate of decoding, and the combined result is saved as the 'last merge result' used in the next merge. If the decoding is unsuccessful, this method is used repeatedly until the decoding is correct.
  • the general operation process of HARQ merging is to add the two sets of data of 'this received data' and 'last merged result', and then output the added result as the next HARQ merged'
  • the last merged result' the added rule is generally a saturation plus with a weighting factor.
  • three HARQ merge buffers need to be opened, which are used to store the data of the "received data", the 'last merge result' and the former two.
  • the process of merging is: first read in the 'data received this time', then read in the 'last merge result', then add the weighted coefficients to the first two and store the result in the output buffers.
  • HARQ merging is the addition of two vector band coefficients, which is relatively simple to implement.
  • the 'data received this time' will vary widely, especially in the LTE system, the length of the 'received data' is less than the HARQ buffer.
  • the length of the HARQ buffer is larger than that of the HARQ buffer.
  • the relative position of the 'received data' in the HARQ buffer also has various changes.
  • a primary object of the present invention is to provide a HARQ merging scheme to at least solve the problem that the overhead of HARQ merging on storage resource consumption and/or processing delay is large in the above related art.
  • a method of merging HARQ is provided.
  • a method for merging HARQ includes the steps of: storing the data received this time in a HARQ buffer; and reading the data received this time and the data read from the external memory according to a predetermined weighting coefficient method.
  • the secondary HARQ merge result is HARQ merged, and the HARQ merged result is written into the corresponding position in the HARQ cache; all data stored in the HARQ buffer is output to the external memory, and the HARQ cache is cleared.
  • performing HARQ combining on the received data and the last HARQ merge result read from the external memory according to a predetermined weighting coefficient manner comprises: according to the length of the data received this time and the data in the HARQ buffer The relative position, the overlapped portion and the non-overlapping portion of the data received in the previous HARQ merge result; the product of the overlapped portion multiplied by the first weighting coefficient and the product of the non-overlapping portion multiplied by the third weighted coefficient The sum of the summed data is multiplied by the data of the current received by the second weighting coefficient.
  • the overlapping portion is a data portion corresponding to the position of the current received data in the HARQ buffer in the last HARQ combining result, and the non-overlapping portion is removed from the HARQ buffer in the last HARQ combining result and the data received in the HARQ buffer.
  • the data portion other than the data corresponding to the position.
  • determining that the overlapped portion and the non-overlapping portion of the data received in the last HARQ merge result include: When the length of the received data is less than the length of the HARQ buffer and the winding does not occur during the HARQ combining process, the overlapping portion is in the middle of the last HARQ combining result, and the non-overlapping portion is in the head and tail of the last HARQ combining result; When the length of the received data is less than the length of the HARQ buffer and the winding occurs during the HARQ combining process, the overlapping portion is at the head and tail of the last HARQ combining result, and the non-overlapping portion is in the middle of the last HARQ combining result; When the length of the received data is greater than the length of the HARQ buffer, the overlapping portion is the result of the last HARQ combining, and there is no non-overlapping portion; wherein, the overlapping portion is the
  • the corresponding starting position in the cache is the starting point, and the length is the data of the length of the data received this time.
  • a predetermined weighting coefficient method different processing parallelisms required for the application are realized by increasing the number of adders with weighting coefficients.
  • the above merge method is applied to at least one of the following: an LTE system, a WiMA system, a Universal Mobile Telecommunications System (UMTS).
  • UMTS Universal Mobile Telecommunications System
  • a HARQ merging apparatus includes: a storage module configured to store the currently received data in a HARQ buffer; and write the HARQ merged result to a corresponding location in the HARQ cache; a merge module, It is configured to perform HARQ merging of the data received this time and the last HARQ merging result read from the external memory according to a predetermined weighting coefficient method; the result processing module is configured to output all data stored in the HARQ buffer to the outside In the memory, the HARQ buffer is cleared.
  • the merging module comprises: a determining unit, configured to determine an overlap with the currently received data in the last HARQ merging result according to the length of the data received this time and the relative position of the data in the HARQ buffer And a non-overlapping portion; a weighting unit configured to calculate a sum of a product of the overlap portion multiplied by the first weighting coefficient and a product of the non-overlapping portion multiplied by the third weighting coefficient, and the summed data and the data received this time The product of the second weighting coefficient is multiplied.
  • the determining unit is further configured to determine that the overlapping portion is the data portion corresponding to the location of the current received data in the HARQ buffer in the last HARQ combining result, and the non-overlapping portion is removed from the previous HARQ combining result and the current receiving The data is in the data portion of the data corresponding to the location in the HARQ cache.
  • the determining unit is further configured to: when the length of the data received this time is less than the length of the HARQ buffer and the winding does not occur during the HARQ combining process, determining that the overlapping portion is in the middle of the last HARQ combining result, and the non-overlapping portion is on Head and tail of the result of the secondary HARQ merging; when the length of the data received this time is less than the length of the HARQ buffer and the winding occurs during the HARQ merging process, it is determined that the overlapping portion is at the head and tail of the result of the last HARQ merging, The overlap portion is in the middle of the last HARQ merge result; when the length of the data received this time is greater than the length of the HARQ buffer, it is determined that the overlap portion is the result of the last HARQ merge, and there is no non-overlapping portion; wherein, the overlap portion is the last time In the HARQ merging result, the length of the received data is the starting point of the data in the HARQ buffer
  • FIG. 1 is a flowchart of a method for merging HARQ according to an embodiment of the present invention
  • FIG. 2 is a structural block diagram of a merging device for HARQ according to an embodiment of the present invention
  • FIG. 3 is a HARQ according to a preferred embodiment of the present invention.
  • FIG. 4 is a schematic diagram of HARQ combining (non-winding) when the length of the received data is less than the length of the HARQ buffer according to the first embodiment of the present invention;
  • FIG. 5 is the present embodiment according to the first embodiment of the present invention.
  • the received data length is less than the length of the HARQ buffer
  • FIG. 6 is a schematic diagram of HARQ combining when the current received data length is greater than the HARQ buffer length according to the first embodiment of the present invention
  • FIG. 7 is a HARQ combining buffer and several according to the first embodiment of the present invention
  • FIG. 8 is a schematic diagram of a structure with a weighting coefficient adder according to Embodiment 1 of the present invention
  • FIG. 9 is a diagram showing a length of the current received data less than the length of the HARQ buffer according to the first embodiment of the present invention. Schematic diagram of recovery (non-winding) of the received data in the buffer of the HARQ;
  • FIG. 6 is a schematic diagram of HARQ combining when the current received data length is greater than the HARQ buffer length according to the first embodiment of the present invention
  • FIG. 7 is a HARQ combining buffer and several according to the first embodiment of the present invention
  • FIG. 8 is a schematic diagram of a structure with a weighting coefficient adder according to Embodiment 1 of
  • FIG. 10 is a recovery of the received data in the buffer of the HARQ when the length of the received data is less than the length of the HARQ buffer according to the first embodiment of the present invention.
  • FIG. 11 is a schematic diagram of recovery of the current received data in a HARQ buffer when the length of the received data is greater than the length of the HARQ buffer according to the first embodiment of the present invention;
  • the weighting coefficient (not winding) of the current received data and the previous combined result 13 is a schematic diagram of weighting coefficients (winding) of the current received data and the previous merge result when the length of the received data is less than the length of the HARQ buffer according to the first embodiment of the present invention
  • FIG. 14 is a schematic diagram of weighting coefficients of the current received data and the previous merge result when the length of the received data is greater than the length of the HARQ buffer according to the first embodiment of the present invention.
  • FIG. 1 is a flowchart of a method for merging HARQ according to an embodiment of the present invention. As shown in FIG.
  • the method includes the following steps: Step S102: Depositing the data received in the HARQ buffer; Step S104, according to a predetermined weighting The coefficient method performs HARQ combining the data received this time with the last HARQ merge result read from the external memory, and writes the HARQ combined result into a corresponding position in the HARQ buffer; Step S106, will be stored in HARQ All data in the cache is output to external memory, clearing the HARQ cache.
  • a HARQ buffer is used to store the data received and the result data of the HARQ merge, which solves the problem that the HARQ merge consumes a large amount of storage resource consumption and/or processing delay in the related art. The problem saves system storage resources and improves system efficiency.
  • the data can be "read, merge, and deposit" using the HARQ buffer, that is, a set of consecutive operations.
  • the overlapping part and the non-overlapping part of the data received in the previous HARQ combining result are determined. Calculating the sum of the product of the overlapped portion multiplied by the first weighting coefficient and the product of the non-overlapping portion multiplied by the third weighting coefficient, and multiplying the summed data by the current received data by the product of the second weighting coefficient plus. This method can improve the accuracy and effectiveness of the system.
  • the overlapping portion is a data portion corresponding to a position in the HARQ buffer of the current received data in the last HARQ combining result, and the non-overlapping portion is removed from the data received in the previous HARQ combining result.
  • the data portion other than the data corresponding to the location in the HARQ cache.
  • step S104 according to the length of the data received this time and the relative position of the data in the HARQ buffer, the overlapping part and the non-overlapping part of the data received in the previous HARQ combining result are determined.
  • the method includes: when the length of the data received this time is less than the length of the HARQ buffer and the winding does not occur during the HARQ combining, the overlapping portion is in the middle of the last HARQ combining result, and the non-overlapping portion is in the head of the last HARQ combining result. And the tail; when the length of the data received this time is less than the length of the HARQ buffer and the winding occurs during the HARQ combining process, the overlapping portion is at the head and tail of the last HARQ combining result, and the non-overlapping portion is in the last HARQ combining result.
  • step S104 when the addition is performed according to a predetermined weighting coefficient method, different processing parallelisms required for the application are realized by increasing the number of adders with weighting coefficients.
  • the degree of parallelism herein refers to the amount of data when the "this time received data” and the "last merged result" are added by the band coefficient.
  • This amount of data is the amount of data each time it is read and stored in the cache.
  • This method can further increase the processing speed of the system.
  • the above method is applied to at least one of the following: an LTE system, a WiMAX system, and a Universal Mobile Telecommunications System (UMTS).
  • the method is simple and practical, and has high operability.
  • the embodiment of the present invention further provides a merging device for hybrid automatic repeat request HARQ.
  • 2 is a structural block diagram of a HARQ merging apparatus according to an embodiment of the present invention. As shown in FIG.
  • the apparatus includes: a storage module 22 configured to store the currently received data in a HARQ buffer; and merge the HARQs The subsequent result is written into the corresponding position in the HARQ buffer; the merging module 24 is coupled to the storage module 22, and is configured to combine the current received data with the last HARQ combined result read from the external memory according to a predetermined weighting coefficient manner.
  • the result processing module 26 is coupled to the storage module 22, configured to output all data stored in the HARQ buffer to the external memory, and clear the HARQ buffer.
  • the storage module 22 uses a HARQ buffer for storing the data received and the result data of the HARQ merge, which solves the related problem that the HARQ merge consumes the storage resource and/or the processing delay. Big problems save system storage resources and improve system efficiency.
  • the merging module 24 includes: a determining unit 242, configured to be based on the length of the data received this time and the data in the HARQ buffer.
  • the relative position in the middle determine the overlap with the data received in the last HARQ merge result and a non-overlapping portion; a weighting unit 244 coupled to the determining unit 242, configured to calculate a sum of a product of the overlap portion multiplied by the first weighting coefficient and a product of the non-overlapping portion multiplied by the third weighting coefficient, and the summed data and The data received this time is multiplied by the product of the second weighting coefficient.
  • the determining unit 242 is further configured to determine that the overlapping portion is the data portion corresponding to the position of the current received data in the HARQ buffer in the last HARQ combining result, and the non-overlapping portion is removed from the last HARQ combining result.
  • the data portion of the received data is outside the data corresponding to the location in the HARQ cache.
  • the determining unit 242 is further configured to: when the length of the data received this time is less than the length of the HARQ buffer and the winding does not occur during the HARQ combining process, determining that the overlapping portion is in the middle of the last HARQ combining result, and the non-overlapping portion is in the middle Head and tail of the last HARQ merge result;
  • the length of the data received this time is less than the length of the HARQ buffer and the winding occurs during the HARQ merge, it is determined that the overlap is at the head and tail of the last HARQ merge result, The non-overlapping part is in the middle of the last HARQ merging result; when the length of the data received this time is greater than the length of the HARQ buffer, it is determined that the overlapping part is the result of the last HARQ merging, and there is no non-overlapping part; wherein, the overlapping part is In the secondary HARQ combining
  • Embodiment 1 provides an implementation method and a device for saving storage HARQ combining based on an LTE system by using HARQ combining of an LTE system, but is not limited to an LTE system, and includes LTE-FDD and LTE-TDD. Seed system.
  • LTE-FDD Long Term Evolution
  • LTE-TDD Long Term Evolution-Time Division Duplex
  • Seed system a method for saving HARQ combining of storage resources taken in various situations that may occur in the HARQ merging process in this embodiment is described.
  • the length of the HARQ buffer is the length of the original information of the sender.
  • the length of the HARQ buffer is determined, and is also the last time saved after each HARQ merging.
  • the length of the combined result ' In the implementation process, according to the length of the 'received data' and its different positions in the HARQ buffer, the HARQ merged scene can be summarized into the following three cases: Scene 1: 'The data received this time' length It is smaller than the HARQ buffer length (length), and the HARQ combining process does not wind up.
  • 4 is a schematic diagram of HARQ combining (non-winding) when the length of the received data is less than the length of the HARQ buffer according to the first embodiment of the present invention. As shown in FIG.
  • FIG. 5 is a HARQ merge (volume) when the length of the received data is less than the length of the HARQ buffer according to the first embodiment of the present invention.
  • a schematic diagram of the winding, as shown in Fig. 5, the portion requiring HARQ merging is the portion from point A to point B.
  • Scenario 3 The length of the data received in the present time is greater than the length of the HARQ buffer.
  • FIG. 6 is a schematic diagram of HARQ combining when the length of the received data is greater than the length of the HARQ buffer according to the first embodiment of the present invention, as shown in FIG.
  • the merged part starts from point A, merges VI, V2...Vn one by one, and ends at point B.
  • the embodiment adopts a unified method for performing the HARQ combining operation, and the device for completing the HARQ combining is mainly composed of a HARQ buffer length storage space (RAM) and a set of weighting coefficient adders.
  • the HARQ merging method provided in this embodiment may include the following steps: Step 1: Read the 'data received this time' from the external memory, and record the length from A to B, according to which The position in the HARQ buffer is added to the previously cleared HARQ buffer, and the result of the addition is stored in the position corresponding to the HARQ buffer.
  • Step 1 Read the 'data received this time' from the external memory, and record the length from A to B, according to which The position in the HARQ buffer is added to the previously cleared HARQ buffer, and the result of the addition is stored in the position corresponding to the HARQ buffer.
  • FIG. 9 is a schematic diagram of recovery (non-winding) of the received data in the HARQ buffer according to the first embodiment of the present invention, when the length of the received data is less than the length of the HARQ buffer.
  • FIG. 11 is a case where the length of the received data is greater than the length of the HARQ buffer according to the first embodiment of the present invention.
  • the schematic diagram of the recovery of the received data in the buffer of the HARQ, the process of adding in this step can be according to the three different scenarios described above, according to the methods shown in FIG. 9, FIG. 10 and FIG.
  • the data received this time is added from the point A to the all-zero HARQ buffer, and ends at point B; in the scenario 2 shown in FIG. 10, the data received this time is from A.
  • the point starts to add to the all-zero HARQ buffer.
  • the return buffer starts to add to the end of point B.
  • the data received this time starts from point A and The zero HARQ buffer is added.
  • the return buffer starts to add. After the coil is wound, the overlap is continued and the saturation is added until the end of point B.
  • Step 2 Read the 'last merge result' from the external memory and multiply the corresponding weighting coefficient, and simultaneously read the data in the HARQ buffer, and multiply the corresponding weighting coefficient to add the two, and the result is written.
  • HARQ The location corresponding to the buffer.
  • the length of the 'received data' has been controlled within the length of the HARQ buffer. Therefore, the lengths of the two vectors added in this step are both HARQ buffers. length.
  • FIG. 12 is a schematic diagram of weighting coefficients (not winding) of the current received data and the previous combined result when the received data length is less than the HARQ buffer length according to the first embodiment of the present invention, and FIG.
  • FIG. 13 is a schematic diagram of the present invention according to an embodiment of the present invention.
  • FIG. 14 is a schematic diagram of the weighting coefficient (winding) of the current received data and the previous combined result when the length of the received data is less than the length of the HARQ buffer.
  • FIG. 14 is the length of the received data is greater than the length of the HARQ buffer according to the first embodiment of the present invention.
  • the weighting coefficients of the received data and the previous combined result are shown.
  • the weighting coefficients of the two vectors are added according to the above three different scenarios, as shown in FIG. 12, FIG. 13, and FIG. 14, respectively.
  • the operation methods in these three scenarios are the same, which are the 'this time received data' unified multiply
  • step 3 the HARQ buffer is used as an output buffer, and the combined result of the previous step is output to the external memory.
  • the HARQ buffer is cleared at the same time as the output.
  • the adder with weighting coefficients may have other different implementation manners.
  • the denominator is a power of 2
  • the multiplier can be replaced by a shift.
  • the number of adders with weighting coefficients may also be arbitrary, and the bit width of each adder output data is the bit width of one HARQ combined result data (such as N bit in FIG. 7), if two adders are used. , then the parallelism of each processing is 2N bit.
  • this embodiment is applicable not only to the HARQ combining operation of the LTE system, but also to the WiMAX system and the HARQ combining of the UMTS system. It can be seen that, by using a HARQ merge buffer, the present embodiment merges the two data at the same time as the 'received data received' and the 'last merged result', and the combined result is still placed in the same buffer.
  • the wireless communication system is solved, especially in the LTE and WiMAX systems, the receiver HARQ combining operation needs to consume a large amount of storage, and the HARQ combining operation has a large delay, and the HARQ merge execution efficiency is provided, and the design is saved to the utmost extent. Storage resources.
  • the second embodiment assumes that the sender has a maximum packet length of 6144 bits, that is, the HARQ buffer has a length of 6144 bits, and a packet of length 6144 bits is sent for 4 times to be correctly decoded (that is, the packet data has undergone 1 first pass and 3 retransmissions), the data packets of 3 retransmissions coincide with the three different cases described above (SP, the length of the received data is less than the length of the HARQ buffer during the first retransmission, and is not wound; In the case of retransmission, the length of the received data is less than the length of the HARQ buffer, and there is a winding condition; the length of the received data in the third retransmission is greater than the length of the HARQ buffer).
  • SP the length of the received data is less than the length of the HARQ buffer during the first retransmission, and is not wound
  • the length of the received data in the third retransmission is greater than the length of the HARQ buffer.
  • the first HARQ merging result is not present when the data packet is transmitted for the first time, and the HARQ merging operation is not required.
  • the data received in the second time is added to the result of the previous combination.
  • the addition process is performed while reading and adding, and the result of the addition is still placed in the HARQ buffer. Finally, the HARQ result is outputted and outputted. Clear the HARQ buffer to the next time.
  • the length of the data received this time is still 3000 bits.
  • the relative starting position in the HARQ buffer is 4608: First, the data received this time is read in, and according to the HARQ. The relative position in the buffer is filled in the all-zero HARQ buffer, as shown in Figure 10. Second, the last merge result (that is, the merge result of the previous two transfers) is read in, and the weighting coefficient shown in Figure 13 is followed. The method adds the data received this time to the result of the previous combination. The addition process takes the reading and adds one side, and the added result is still placed in the HARQ buffer. Finally, the HARQ combined result is output and output. The HARQ buffer is cleared during the process to facilitate the next use.
  • the length of the data received this time is 9000 bits, and the relative starting position in the HARQ buffer is 64.
  • the data received this time is read in, and according to the HARQ buffer.
  • the relative position in the field is filled in the all-zero HARQ buffer, as shown in Figure 11;
  • the last merged result (that is, the combined result of the first three transmissions) is read in, and will be weighted according to the weighting coefficient shown in Figure 14.
  • the data received this time is added to the previous merged result.
  • the addition process is performed while reading and adding, and the added result is still placed in the HARQ buffer.
  • the HARQ merge result is output and the output process is performed.
  • the middle of the HARQ buffer is cleared to facilitate the next use. It can be seen that the implementation method of the storage-saving HARQ merging provided in this embodiment does not distinguish the first HARQ merging operation, which is the 'filling of data received this time', and the reading of the last merged result is in the present The data is merged ', and the 'combined result is output and the buffer is cleared' three steps. And the corresponding HARQ merging device also clarifies the implementation location and specific operation of the method, saves system storage resources, and improves system efficiency.
  • the embodiments of the present invention provide a method for implementing HARQ consolidation, which saves storage resources and improves combining efficiency, and particularly relates to uplink bit-level processing HARQ combining operations in the wireless communication field of protocol standards such as LTE, WiMAX, and UMTS.
  • the storage resource savings in the process, while using as few resources as possible, also ensure the efficiency of HARQ consolidation, which is of great significance to the performance, power consumption and cost of the actual system.
  • the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices.
  • the invention is not limited to any specific combination of hardware and software.
  • the above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

Disclosed are a hybrid automatic repeat request (HARQ) merging method and device. The method comprises the following steps: storing data received this time in an HARQ buffer; by means of a predetermined weighted coefficient, performing HARQ merging on the data received this time and an HARQ merging result obtained last time and read from an external memory, and writing a result after the HARQ merging into a corresponding location in the HARQ buffer; and outputting all data stored in the HARQ buffer to the external memory, and clearing the HARQ buffer. Through the present invention, storage resources of the system are saved and the efficiency of the system is improved.

Description

HARQ的合并方法及装置 技术领域 本发明涉及通信领域, 尤其涉及一种混合自动重传请求(Hybrid Automatic Repeat Request, 简称为 HARQ) 的合并方法及装置。 背景技术  TECHNICAL FIELD The present invention relates to the field of communications, and in particular, to a method and apparatus for merging Hybrid Automatic Repeat Request (HQQ). Background technique
HARQ是长期演进(Long-Term Evolution,简称为 LTE)、全球微波互联接入(World Interoperability for Microwave Access, 简称为 WiMAX)等高速无线通信系统中的一项 关键技术, 由于兼具前向纠错 (Forward Error Correction, 简称为 FEC)和自动重传请 求 (Automatic Repeat Request, 简称为 ARQ) 的优点, 对增强系统传输能力起着非常 重要的作用。 在一个带有 HARQ机制的无线通信系统中,发送数据如果经过一次传输后无法正 确译码, 那么这次传输的数据就会被保存起来, 特定的时间周期后, 发送端会重新发 送同一包数据, 接收端对重传的数据进行译码之前, 取出上次保存的'上次合并结果', 与重传的'本次接收到的数据'进行合并, 然后将合并的结果进行译码以提高译码的正 确率, 同时将合并的结果保存起来, 作为下一次合并时使用的'上次合并结果'。 如果 译码不成功, 则反复使用此方法, 直到译码正确为止。 HARQ is a key technology in high-speed wireless communication systems such as Long-Term Evolution (LTE) and World Interoperability for Microwave Access (WiMAX), which has both forward error correction. The advantages of Forward Error Correction (FEC) and Automatic Repeat Request (ARQ) play an important role in enhancing system transmission capability. In a wireless communication system with a HARQ mechanism, if the transmitted data cannot be decoded correctly after one transmission, the data transmitted this time will be saved. After a certain period of time, the sender will resend the same packet data. Before the receiving end decodes the retransmitted data, the last saved 'last merge result' is taken out, merged with the retransmitted 'this received data', and then the combined result is decoded to improve The correct rate of decoding, and the combined result is saved as the 'last merge result' used in the next merge. If the decoding is unsuccessful, this method is used repeatedly until the decoding is correct.
HARQ 合并的一般操作过程是将'本次接收到的数据'和'上次合并结果 '这两组数 据进行一定规则的相加, 然后将相加的结果输出并作为下次 HARQ合并时的'上次合 并结果', 相加的规则一般为带加权系数的饱和加。 在 HARQ合并传统的实现方法中, 需要开设三个 HARQ合并缓存 (buffer), 分别用来存储 '本次接收到的数据', '上次合 并结果 '和前两者合并的结果。合并的过程为:首先读入'本次接收到的数据',再读入 '上 次合并结果', 然后对前两者进行带加权系数的相加并对结果取饱和存入输出 buffers 可见,采用传统的 HARQ合并实现方法,在'本次接收到的数据'和'上次合并结果' 长度相同的情况下, HARQ合并即两个向量带系数相加,实现相对简单。但是,在 LTE、 WiMAX等无线通信系统中, '本次接收到的数据 '会在很大范围内变化, 特别是在 LTE 系统中, '本次接收到的数据 '的长度既存在小于 HARQ buffer长度的情况, 也存在大 于 HARQ buffer长度的情况, 同时, 按照 LTE协议, 根据每次发送的版本号的不同, '本次接收到的数据 '在 HARQ buffer中的相对位置也有多种不同的变化, 所以, 在这 种情况下, 传统的 HARQ合并对存储资源消耗很大, 同时处理的时延开销也很大。 另 夕卜。 HARQ合并的操作是针对重传数据的额外操作, 比首次传输的情况的数据处理时 延更长, HARQ合并的耗时将会直接成为整个系统的瓶颈。 发明内容 本发明的主要目的在于提供一种 HARQ的合并方案, 以至少解决上述相关技术中 HARQ合并对存储资源的消耗和 /或处理时延的开销都很大的问题。 为了实现上述目的, 根据本发明的一个方面, 提供了一种 HARQ的合并方法。 根据本发明的一种 HARQ的合并方法, 包括以下步骤: 在 HARQ缓存中存入本 次接收到的数据; 按照预定的加权系数方式将本次接收到的数据与从外部存储器中读 入的上次 HARQ合并结果进行 HARQ合并, 并将该 HARQ合并后的结果写入 HARQ 缓存中对应的位置; 将存储在 HARQ 缓存中的所有数据输出到外部存储器中, 清零 HARQ缓存。 优选地, 按照预定的加权系数方式将本次接收到的数据与从外部存储器中读入的 上次 HARQ合并结果进行 HARQ合并包括: 根据本次接收到的数据的长度和该数据 在 HARQ缓存中的相对位置, 确定在上次 HARQ合并结果中与本次接收到的数据的 重叠部分和非重叠部分; 计算重叠部分乘以第一加权系数之积与非重叠部分乘以第三 加权系数之积的和, 并将求和后的数据与本次接收到的数据乘以第二加权系数之积相 加。 优选地, 重叠部分为上次 HARQ合并结果中与本次接收到的数据在 HARQ缓存 中位置对应的数据部分,非重叠部分为上次 HARQ合并结果中除去与本次接收到的数 据在 HARQ缓存中位置对应的数据之外的数据部分。 优选地, 根据本次接收到的数据的长度和该数据在 HARQ缓存中的相对位置, 确 定在上次 HARQ合并结果中与本次接收到的数据的重叠部分和非重叠部分包括: 当本 次接收到的数据的长度小于 HARQ缓存的长度且 HARQ合并过程中不发生卷绕时, 重叠部分处于上次 HARQ合并结果的中部, 非重叠部分处于上次 HARQ合并结果的 头部和尾部; 当本次接收到的数据的长度小于 HARQ缓存的长度且 HARQ合并过程 中发生卷绕时, 重叠部分处于上次 HARQ合并结果的头部和尾部, 非重叠部分处于上 次 HARQ合并结果的中部; 当本次接收到的数据的长度大于 HARQ缓存的长度时, 重叠部分为上次 HARQ合并结果, 不存在非重叠部分; 其中, 重叠部分为上次 HARQ 合并结果中以本次接收到的数据的在 HARQ缓存中对应的起始位置为起点,长度为本 次接收到的数据的长度的数据。 优选地, 按照预定的加权系数方式进行相加时, 通过增加带加权系数的加法器的 个数实现应用所需的不同处理并行度。 优选地, 上述合并方法应用于至少以下之一: LTE系统、 WiMA 系统、 通用移 动通讯系统 (UMTS)。 为了实现上述目的, 根据本发明的另一方面, 还提供了一种 HARQ的合并装置。 根据本发明的一种 HARQ的合并装置, 包括: 存储模块, 设置为在 HARQ缓存 中存入本次接收到的数据; 以及将 HARQ合并后的结果写入 HARQ缓存中对应的位 置; 合并模块, 设置为按照预定的加权系数方式将本次接收到的数据与从外部存储器 中读入的上次 HARQ 合并结果进行 HARQ 合并; 结果处理模块, 设置为将存储在 HARQ缓存中的所有数据输出到外部存储器中, 清零 HARQ缓存。 优选地, 合并模块包括: 确定单元, 设置为根据本次接收到的数据的长度和该数 据在 HARQ缓存中的相对位置, 确定在上次 HARQ合并结果中与本次接收到的数据 的重叠部分和非重叠部分; 加权单元, 设置为计算重叠部分乘以第一加权系数之积与 非重叠部分乘以第三加权系数之积的和, 并将求和后的数据与本次接收到的数据乘以 第二加权系数之积相加。 优选地,确定单元还设置为确定重叠部分为上次 HARQ合并结果中与本次接收到 的数据在 HARQ缓存中位置对应的数据部分, 非重叠部分为上次 HARQ合并结果中 除去与本次接收到的数据在 HARQ缓存中位置对应的数据之外的数据部分。 优选地,确定单元还设置为当本次接收到的数据的长度小于 HARQ缓存的长度且 HARQ合并过程中不发生卷绕时, 确定重叠部分处于上次 HARQ合并结果的中部, 非 重叠部分处于上次 HARQ 合并结果的头部和尾部; 当本次接收到的数据的长度小于 HARQ缓存的长度且 HARQ合并过程中发生卷绕时, 确定重叠部分处于上次 HARQ 合并结果的头部和尾部, 非重叠部分处于上次 HARQ合并结果的中部; 当本次接收到 的数据的长度大于 HARQ缓存的长度时, 确定重叠部分为上次 HARQ合并结果, 不 存在非重叠部分; 其中, 重叠部分为上次 HARQ合并结果中以本次接收到的数据的在 HARQ缓存中对应的起始位置为起点, 长度为本次接收到的数据的长度的数据。 通过本发明, 采用一个 HARQ缓存用于存储本次接收到的数据及 HARQ合并后 的结果数据的方式, 解决了相关技术中 HARQ合并对存储资源的消耗和 /或处理时延 的开销都很大的问题, 节省了系统存储资源, 提高了系统效率。 附图说明 此处所说明的附图用来提供对本发明的进一步理解, 构成本申请的一部分, 本发 明的示意性实施例及其说明用于解释本发明, 并不构成对本发明的不当限定。 在附图 中: 图 1是根据本发明实施例的 HARQ的合并方法的流程图; 图 2是根据本发明实施例的 HARQ的合并装置的结构框图; 图 3是根据本发明优选实施例的 HARQ的合并装置的结构框图; 图 4 是根据本发明实施例一的本次接收数据长度小于 HARQ buffer 长度时的 HARQ合并 (不卷绕) 的示意图; 图 5 是根据本发明实施例一的本次接收数据长度小于 HARQ buffer 长度时的The general operation process of HARQ merging is to add the two sets of data of 'this received data' and 'last merged result', and then output the added result as the next HARQ merged' The last merged result', the added rule is generally a saturation plus with a weighting factor. In the HARQ merge traditional implementation method, three HARQ merge buffers need to be opened, which are used to store the data of the "received data", the 'last merge result' and the former two. The process of merging is: first read in the 'data received this time', then read in the 'last merge result', then add the weighted coefficients to the first two and store the result in the output buffers. With the traditional HARQ merging implementation method, in the case where the lengths of 'this received data' and 'last merged result' are the same, HARQ merging is the addition of two vector band coefficients, which is relatively simple to implement. However, in wireless communication systems such as LTE and WiMAX, the 'data received this time' will vary widely, especially in the LTE system, the length of the 'received data' is less than the HARQ buffer. In the case of the length, there is also a case where the length of the HARQ buffer is larger than that of the HARQ buffer. At the same time, according to the LTE protocol, depending on the version number transmitted each time, the relative position of the 'received data' in the HARQ buffer also has various changes. Therefore, in this case, the traditional HARQ merging consumes a large amount of storage resources, and the processing delay is also large. Another 夕卜. The operation of HARQ merging is an extra operation for retransmitting data, which is longer than the data processing delay of the case of the first transmission. The time consuming of HARQ merging will directly become the bottleneck of the entire system. SUMMARY OF THE INVENTION A primary object of the present invention is to provide a HARQ merging scheme to at least solve the problem that the overhead of HARQ merging on storage resource consumption and/or processing delay is large in the above related art. In order to achieve the above object, according to an aspect of the present invention, a method of merging HARQ is provided. A method for merging HARQ according to the present invention includes the steps of: storing the data received this time in a HARQ buffer; and reading the data received this time and the data read from the external memory according to a predetermined weighting coefficient method. The secondary HARQ merge result is HARQ merged, and the HARQ merged result is written into the corresponding position in the HARQ cache; all data stored in the HARQ buffer is output to the external memory, and the HARQ cache is cleared. Preferably, performing HARQ combining on the received data and the last HARQ merge result read from the external memory according to a predetermined weighting coefficient manner comprises: according to the length of the data received this time and the data in the HARQ buffer The relative position, the overlapped portion and the non-overlapping portion of the data received in the previous HARQ merge result; the product of the overlapped portion multiplied by the first weighting coefficient and the product of the non-overlapping portion multiplied by the third weighted coefficient The sum of the summed data is multiplied by the data of the current received by the second weighting coefficient. Preferably, the overlapping portion is a data portion corresponding to the position of the current received data in the HARQ buffer in the last HARQ combining result, and the non-overlapping portion is removed from the HARQ buffer in the last HARQ combining result and the data received in the HARQ buffer. The data portion other than the data corresponding to the position. Preferably, according to the length of the data received this time and the relative position of the data in the HARQ buffer, determining that the overlapped portion and the non-overlapping portion of the data received in the last HARQ merge result include: When the length of the received data is less than the length of the HARQ buffer and the winding does not occur during the HARQ combining process, the overlapping portion is in the middle of the last HARQ combining result, and the non-overlapping portion is in the head and tail of the last HARQ combining result; When the length of the received data is less than the length of the HARQ buffer and the winding occurs during the HARQ combining process, the overlapping portion is at the head and tail of the last HARQ combining result, and the non-overlapping portion is in the middle of the last HARQ combining result; When the length of the received data is greater than the length of the HARQ buffer, the overlapping portion is the result of the last HARQ combining, and there is no non-overlapping portion; wherein, the overlapping portion is the HARQ in the last HARQ combining result with the data received this time. The corresponding starting position in the cache is the starting point, and the length is the data of the length of the data received this time. Preferably, when the addition is performed in accordance with a predetermined weighting coefficient method, different processing parallelisms required for the application are realized by increasing the number of adders with weighting coefficients. Preferably, the above merge method is applied to at least one of the following: an LTE system, a WiMA system, a Universal Mobile Telecommunications System (UMTS). In order to achieve the above object, according to another aspect of the present invention, a HARQ merging apparatus is also provided. According to the present invention, a HARQ merging apparatus includes: a storage module configured to store the currently received data in a HARQ buffer; and write the HARQ merged result to a corresponding location in the HARQ cache; a merge module, It is configured to perform HARQ merging of the data received this time and the last HARQ merging result read from the external memory according to a predetermined weighting coefficient method; the result processing module is configured to output all data stored in the HARQ buffer to the outside In the memory, the HARQ buffer is cleared. Preferably, the merging module comprises: a determining unit, configured to determine an overlap with the currently received data in the last HARQ merging result according to the length of the data received this time and the relative position of the data in the HARQ buffer And a non-overlapping portion; a weighting unit configured to calculate a sum of a product of the overlap portion multiplied by the first weighting coefficient and a product of the non-overlapping portion multiplied by the third weighting coefficient, and the summed data and the data received this time The product of the second weighting coefficient is multiplied. Preferably, the determining unit is further configured to determine that the overlapping portion is the data portion corresponding to the location of the current received data in the HARQ buffer in the last HARQ combining result, and the non-overlapping portion is removed from the previous HARQ combining result and the current receiving The data is in the data portion of the data corresponding to the location in the HARQ cache. Preferably, the determining unit is further configured to: when the length of the data received this time is less than the length of the HARQ buffer and the winding does not occur during the HARQ combining process, determining that the overlapping portion is in the middle of the last HARQ combining result, and the non-overlapping portion is on Head and tail of the result of the secondary HARQ merging; when the length of the data received this time is less than the length of the HARQ buffer and the winding occurs during the HARQ merging process, it is determined that the overlapping portion is at the head and tail of the result of the last HARQ merging, The overlap portion is in the middle of the last HARQ merge result; when the length of the data received this time is greater than the length of the HARQ buffer, it is determined that the overlap portion is the result of the last HARQ merge, and there is no non-overlapping portion; wherein, the overlap portion is the last time In the HARQ merging result, the length of the received data is the starting point of the data in the HARQ buffer, and the length is the data of the length of the received data. The method of the present invention uses a HARQ buffer for storing the data received and the result data of the HARQ merge, and solves the problem that the HARQ merge consumes a large amount of storage resource consumption and/or processing delay in the related art. The problem saves system storage resources and improves system efficiency. BRIEF DESCRIPTION OF THE DRAWINGS The accompanying drawings, which are set to illustrate,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, In the drawings: FIG. 1 is a flowchart of a method for merging HARQ according to an embodiment of the present invention; FIG. 2 is a structural block diagram of a merging device for HARQ according to an embodiment of the present invention; FIG. 3 is a HARQ according to a preferred embodiment of the present invention. FIG. 4 is a schematic diagram of HARQ combining (non-winding) when the length of the received data is less than the length of the HARQ buffer according to the first embodiment of the present invention; FIG. 5 is the present embodiment according to the first embodiment of the present invention. When the received data length is less than the length of the HARQ buffer
HARQ合并 (卷绕) 的示意图; 图 6 是根据本发明实施例一的本次接收数据长度大于 HARQ buffer 长度时的 HARQ合并的示意图; 图 7是根据本发明实施例一的 HARQ合并 buffer和若干个带加权系数加法器的示 意图; 图 8是根据本发明实施例一的带加权系数加法器的结构示意图; 图 9是根据本发明实施例一的本次接收数据长度小于 HARQ buffer长度时, 本次 接收数据在 HARQ的 buffer中的恢复 (不卷绕) 的示意图; 图 10是根据本发明实施例一的本次接收数据长度小于 HARQ buffer长度时,本次 接收数据在 HARQ的 buffer中的恢复 (卷绕) 的示意图; 图 11是根据本发明实施例一的本次接收数据长度大于 HARQ buffer长度时,本次 接收数据在 HARQ的 buffer中的恢复的示意图; 图 12是根据本发明实施例一的本次接收数据长度小于 HARQ buffer长度时,本次 接收数据和上次合并结果的加权系数 (不卷绕) 的示意图; 图 13是根据本发明实施例一的本次接收数据长度小于 HARQ buffer长度时,本次 接收数据和上次合并结果的加权系数 (卷绕) 的示意图; 图 14是根据本发明实施例一的本次接收数据长度大于 HARQ buffer长度时,本次 接收数据和上次合并结果的加权系数的示意图。 具体实施方式 下文中将参考附图并结合实施例来详细说明本发明。 需要说明的是, 在不冲突的 情况下, 本申请中的实施例及实施例中的特征可以相互组合。 根据本发明实施例, 提供了一种 HARQ的合并方法。 图 1是根据本发明实施例的 HARQ的合并方法的流程图, 如图 1所示, 包括以下步骤: 步骤 S102, 在 HARQ缓存中存入本次接收到的数据; 步骤 S104,按照预定的加权系数方式将本次接收到的数据与从外部存储器中读入 的上次 HARQ合并结果进行 HARQ合并,并将该 HARQ合并后的结果写入 HARQ缓 存中对应的位置; 步骤 S106,将存储在 HARQ缓存中的所有数据输出到外部存储器中,清零 HARQ 缓存。 通过上述步骤, 采用一个 HARQ缓存用于存储本次接收到的数据及 HARQ合并 后的结果数据的方式, 解决了相关技术中 HARQ合并对存储资源的消耗和 /或处理时 延的开销都很大的问题, 节省了系统存储资源, 提高了系统效率。 例如, 在步骤 S104中, 可以利用 HARQ缓存对数据进行"读取、 合并、 存入", 即, 一组连续的操作。 优选地, 在步骤 S104中, 根据本次接收到的数据的长度和该数据在 HARQ缓存 中的相对位置,确定在上次 HARQ合并结果中与本次接收到的数据的重叠部分和非重 叠部分; 计算重叠部分乘以第一加权系数之积与非重叠部分乘以第三加权系数之积的 和, 并将求和后的数据与本次接收到的数据乘以第二加权系数之积相加。 该方法可以 提高系统的准确性和有效性。 优选地, 上述重叠部分为上次 HARQ合并结果中与本次接收到的数据在 HARQ 缓存中位置对应的数据部分,上述非重叠部分为上次 HARQ合并结果中除去与本次接 收到的数据在 HARQ缓存中位置对应的数据之外的数据部分。 优选地, 在步骤 S104中, 根据本次接收到的数据的长度和该数据在 HARQ缓存 中的相对位置,确定在上次 HARQ合并结果中与本次接收到的数据的重叠部分和非重 叠部分包括: 当本次接收到的数据的长度小于 HARQ缓存的长度且 HARQ合并过程 中不发生卷绕时, 重叠部分处于上次 HARQ 合并结果的中部, 非重叠部分处于上次 HARQ合并结果的头部和尾部;当本次接收到的数据的长度小于 HARQ缓存的长度且 HARQ合并过程中发生卷绕时, 重叠部分处于上次 HARQ合并结果的头部和尾部, 非 重叠部分处于上次 HARQ合并结果的中部; 当本次接收到的数据的长度大于 HARQ 缓存的长度时, 重叠部分为上次 HARQ合并结果, 不存在非重叠部分; 其中, 重叠部 分为上次 HARQ合并结果中以本次接收到的数据的在 HARQ缓存中对应的起始位置 为起点, 长度为本次接收到的数据的长度的数据。 该方法符合实际应用的情况, 提高 了系统的适应能力和灵活性。 优选地, 在步骤 S104中, 按照预定的加权系数方式进行相加时, 通过增加带加权 系数的加法器的个数实现应用所需的不同处理并行度。 其中, 这里的并行度是指每次 "本次收到数据"与"上次合并结果"进行带系数相加时的数据量大小。 这个数据量也就 是每次读取、 存入缓存时的数据量大小。 该方法可以进一步地提高系统的处理速度。 优选地, 上述方法应用于至少以下之一: LTE系统、 WiMAX系统、 通用移动通 讯系统(Universal Mobile Telecommunications System, 简称为 UMTS)。 该方法简单实 用、 可操作性强。 对应于上述方法,本发明实施例还提供了一种混合自动重传请求 HARQ的合并装 置。 图 2是根据本发明实施例的 HARQ的合并装置的结构框图, 如图 2所示, 该装置 包括: 存储模块 22, 设置为在 HARQ缓存中存入本次接收到的数据; 以及将 HARQ 合并后的结果写入 HARQ缓存中对应的位置; 合并模块 24, 耦合至存储模块 22, 设 置为按照预定的加权系数方式将本次接收到的数据与从外部存储器中读入的上次 HARQ合并结果进行 HARQ合并; 结果处理模块 26, 耦合至存储模块 22, 设置为将 存储在 HARQ缓存中的所有数据输出到外部存储器中, 清零 HARQ缓存。 通过上述装置, 存储模块 22采用一个 HARQ缓存用于存储本次接收到的数据及 HARQ合并后的结果数据, 解决了相关技术中 HARQ合并对存储资源的消耗和 /或处 理时延的开销都很大的问题, 节省了系统存储资源, 提高了系统效率。 图 3是根据本发明优选实施例的 HARQ的合并装置的结构框图, 如图 3所示, 合 并模块 24包括:确定单元 242,设置为根据本次接收到的数据的长度和该数据在 HARQ 缓存中的相对位置,确定在上次 HARQ合并结果中与本次接收到的数据的重叠部分和 非重叠部分; 加权单元 244, 耦合至确定单元 242, 设置为计算重叠部分乘以第一加权 系数之积与非重叠部分乘以第三加权系数之积的和, 并将求和后的数据与本次接收到 的数据乘以第二加权系数之积相加。 优选地,确定单元 242还设置为确定重叠部分为上次 HARQ合并结果中与本次接 收到的数据在 HARQ缓存中位置对应的数据部分, 非重叠部分为上次 HARQ合并结 果中除去与本次接收到的数据在 HARQ缓存中位置对应的数据之外的数据部分。 优选地,确定单元 242还设置为当本次接收到的数据的长度小于 HARQ缓存的长 度且 HARQ合并过程中不发生卷绕时, 确定重叠部分处于上次 HARQ合并结果的中 部, 非重叠部分处于上次 HARQ合并结果的头部和尾部; 当本次接收到的数据的长度 小于 HARQ 缓存的长度且 HARQ 合并过程中发生卷绕时, 确定重叠部分处于上次 HARQ合并结果的头部和尾部, 非重叠部分处于上次 HARQ合并结果的中部; 当本次 接收到的数据的长度大于 HARQ缓存的长度时, 确定重叠部分为上次 HARQ合并结 果, 不存在非重叠部分; 其中, 重叠部分为上次 HARQ合并结果中以本次接收到的数 据的在 HARQ缓存中对应的起始位置为起点,长度为本次接收到的数据的长度的数据。 下面结合优选实施例和附图对上述实施例的实现过程进行详细说明。 实施例一 本实施例以 LTE系统的 HARQ合并为例, 提供了一种基于 LTE系统的节省存储 的 HARQ合并的实现方法及其装置,但不限于 LTE系统,包含 LTE-FDD和 LTE-TDD 两种制式。 以下对应 LTE系统各种场景, 说明本实施例在 HARQ合并过程中, 可能出 现的多种情况下的所采取的节省存储资源的 HARQ合并的方法。 需要说明的是, 在 HARQ合并过程中, HARQ buffer的长度就是发送方原始信息 的长度,对于一次 HARQ合并来说, HARQ buffer的长度是确定,同时也是每次 HARQ 合并后保存起来的'上次合并结果 '的长度。 在实施过程中, 根据'本次接收到的数据'的长度及其在 HARQ buffer中的不同位 置, HARQ合并的场景可以归纳为以下三种情况: 场景一: '本次接收到的数据 '长度小于 HARQ buffer长度 (length), 且 HARQ合 并过程不发生卷绕。图 4是根据本发明实施例一的本次接收数据长度小于 HARQ buffer 长度时的 HARQ合并(不卷绕)的示意图, 如图 4所示, 需要 HARQ合并的部分为 A 点到 B点的部分。 场景二: '本次接收到的数据 '长度小于 HARQ buffer长度, 且 HARQ合并过程发 生卷绕, 图 5是根据本发明实施例一的本次接收数据长度小于 HARQ buffer长度时的 HARQ合并 (卷绕) 的示意图, 如图 5所示, 需要 HARQ合并的部分为 A点到 B点 的部分。 场景三: '本次接收到的数据 '长度大于 HARQ buffer长度, 图 6是根据本发明实 施例一的本次接收数据长度大于 HARQ buffer长度时的 HARQ合并的示意图, 如图 6 所示, 需要合并的部分从 A点开始, 逐次将 VI、 V2...Vn合并, 到 B点结束。 针对以上三种情况, 本实施例采取统一的方法进行 HARQ合并操作, 完成 HARQ 合并的装置主要由一块 HARQ buffer长度的存储空间 (RAM)和一组带加权系数的加 法器构成。 图 7是根据本发明实施例一的 HARQ合并 buffer和若干个带加权系数加法 器的示意图, 图 8是根据本发明实施例一的带加权系数加法器的结构示意图, 本实施 例提供的 HARQ合并的装置的构成和关系可参见图 7和图 8。 在实施过程中, 本实施例提供的 HARQ合并方法可以包括如下步骤: 步骤 1, 从外部存储器中读入 '本次接收到的数据', 记录其长度为从 A到 B的长 度, 按照其在 HARQ buffer中的位置与事先已经清零的 HARQ buffer进行相加, 相加 的结果保存在 HARQ buffer对应的位置上。 图 9是根据本发明实施例一的本次接收数据长度小于 HARQ buffer长度时, 本次 接收数据在 HARQ的 buffer中的恢复 (不卷绕) 的示意图, 图 10是根据本发明实施 例一的本次接收数据长度小于 HARQ buffer长度时, 本次接收数据在 HARQ的 buffer 中的恢复 (卷绕) 的示意图, 图 11 是根据本发明实施例一的本次接收数据长度大于 HARQ buffer长度时, 本次接收数据在 HARQ的 buffer中的恢复的示意图, 该步骤中 相加的过程可以按照上述的三种不同场景, 分别按照图 9、 图 10和图 11所示的方法。 例如, 图 9所示的场景一, 本次接收到的数据从 A点开始与全零的 HARQ buffer 相加,到 B点结束;图 10所示的场景二,本次接收到的数据从 A点开始与全零的 HARQ buffer相加, 到 HARQ buffer末端后, 返回 buffer起始处继续相加到 B点结束; 图 8 所示的场景三, 本次接收到的数据从 A点开始与全零的 HARQ buffer相加, 到 HARQ buffer末端后, 返回 buffer起始处继续相加, 卷绕一圈之后遇到重叠的部分继续饱和 相加, 直到 B点结束。 步骤 2, 从外部存储器中读入 '上次合并结果'并乘以相应的加权系数, 同时读出 HARQ buffer内的数据, 并乘以相应的加权系数, 将二者进行相加, 结果写入 HARQ buffer对应的位置。 在上述的三种场景下, 经过步骤 1的操作, 已经把'本次接收到的 数据'长度控制在 HARQ buffer的长度之内, 所以, 本步骤中相加的两个向量长度均为 HARQ buffer长度。 图 12是根据本发明实施例一的本次接收数据长度小于 HARQ buffer长度时,本次 接收数据和上次合并结果的加权系数(不卷绕)的示意图, 图 13是根据本发明实施例 一的本次接收数据长度小于 HARQ buffer长度时, 本次接收数据和上次合并结果的加 权系数 (卷绕)的示意图,图 14是根据本发明实施例一的本次接收数据长度大于 HARQ buffer 长度时, 本次接收数据和上次合并结果的加权系数的示意图, 该步骤中相加时 两个向量的加权系数按照上述的三种不同场景, 分别如图 12、 图 13和图 14所示。 如图所示, 这三种场景下的操作方法是一致的, 均为'本次接收到数据'统一乘以A schematic diagram of HARQ combining (winding); FIG. 6 is a schematic diagram of HARQ combining when the current received data length is greater than the HARQ buffer length according to the first embodiment of the present invention; FIG. 7 is a HARQ combining buffer and several according to the first embodiment of the present invention; FIG. 8 is a schematic diagram of a structure with a weighting coefficient adder according to Embodiment 1 of the present invention; FIG. 9 is a diagram showing a length of the current received data less than the length of the HARQ buffer according to the first embodiment of the present invention; Schematic diagram of recovery (non-winding) of the received data in the buffer of the HARQ; FIG. 10 is a recovery of the received data in the buffer of the HARQ when the length of the received data is less than the length of the HARQ buffer according to the first embodiment of the present invention. FIG. 11 is a schematic diagram of recovery of the current received data in a HARQ buffer when the length of the received data is greater than the length of the HARQ buffer according to the first embodiment of the present invention; FIG. 12 is an embodiment of the present invention according to an embodiment of the present invention; When the length of the received data of this time is less than the length of the HARQ buffer, the weighting coefficient (not winding) of the current received data and the previous combined result 13 is a schematic diagram of weighting coefficients (winding) of the current received data and the previous merge result when the length of the received data is less than the length of the HARQ buffer according to the first embodiment of the present invention; FIG. 14 is a schematic diagram of weighting coefficients of the current received data and the previous merge result when the length of the received data is greater than the length of the HARQ buffer according to the first embodiment of the present invention. BEST MODE FOR CARRYING OUT THE INVENTION Hereinafter, the present invention will be described in detail with reference to the accompanying drawings. It should be noted that the embodiments in the present application and the features in the embodiments may be combined with each other without conflict. According to an embodiment of the present invention, a method for merging HARQ is provided. 1 is a flowchart of a method for merging HARQ according to an embodiment of the present invention. As shown in FIG. 1, the method includes the following steps: Step S102: Depositing the data received in the HARQ buffer; Step S104, according to a predetermined weighting The coefficient method performs HARQ combining the data received this time with the last HARQ merge result read from the external memory, and writes the HARQ combined result into a corresponding position in the HARQ buffer; Step S106, will be stored in HARQ All data in the cache is output to external memory, clearing the HARQ cache. Through the above steps, a HARQ buffer is used to store the data received and the result data of the HARQ merge, which solves the problem that the HARQ merge consumes a large amount of storage resource consumption and/or processing delay in the related art. The problem saves system storage resources and improves system efficiency. For example, in step S104, the data can be "read, merge, and deposit" using the HARQ buffer, that is, a set of consecutive operations. Preferably, in step S104, according to the length of the data received this time and the relative position of the data in the HARQ buffer, the overlapping part and the non-overlapping part of the data received in the previous HARQ combining result are determined. Calculating the sum of the product of the overlapped portion multiplied by the first weighting coefficient and the product of the non-overlapping portion multiplied by the third weighting coefficient, and multiplying the summed data by the current received data by the product of the second weighting coefficient plus. This method can improve the accuracy and effectiveness of the system. Preferably, the overlapping portion is a data portion corresponding to a position in the HARQ buffer of the current received data in the last HARQ combining result, and the non-overlapping portion is removed from the data received in the previous HARQ combining result. The data portion other than the data corresponding to the location in the HARQ cache. Preferably, in step S104, according to the length of the data received this time and the relative position of the data in the HARQ buffer, the overlapping part and the non-overlapping part of the data received in the previous HARQ combining result are determined. The method includes: when the length of the data received this time is less than the length of the HARQ buffer and the winding does not occur during the HARQ combining, the overlapping portion is in the middle of the last HARQ combining result, and the non-overlapping portion is in the head of the last HARQ combining result. And the tail; when the length of the data received this time is less than the length of the HARQ buffer and the winding occurs during the HARQ combining process, the overlapping portion is at the head and tail of the last HARQ combining result, and the non-overlapping portion is in the last HARQ combining result. The middle part; when the length of the data received this time is greater than the length of the HARQ buffer, the overlap part is the result of the last HARQ merge, and there is no non-overlapping part; wherein, the overlap part is the last HARQ merge result and is received this time. The corresponding starting position of the data in the HARQ buffer is the starting point, and the length is the data of the length of the data received this time. The method conforms to the actual application and improves the adaptability and flexibility of the system. Preferably, in step S104, when the addition is performed according to a predetermined weighting coefficient method, different processing parallelisms required for the application are realized by increasing the number of adders with weighting coefficients. Here, the degree of parallelism herein refers to the amount of data when the "this time received data" and the "last merged result" are added by the band coefficient. This amount of data is the amount of data each time it is read and stored in the cache. This method can further increase the processing speed of the system. Preferably, the above method is applied to at least one of the following: an LTE system, a WiMAX system, and a Universal Mobile Telecommunications System (UMTS). The method is simple and practical, and has high operability. Corresponding to the above method, the embodiment of the present invention further provides a merging device for hybrid automatic repeat request HARQ. 2 is a structural block diagram of a HARQ merging apparatus according to an embodiment of the present invention. As shown in FIG. 2, the apparatus includes: a storage module 22 configured to store the currently received data in a HARQ buffer; and merge the HARQs The subsequent result is written into the corresponding position in the HARQ buffer; the merging module 24 is coupled to the storage module 22, and is configured to combine the current received data with the last HARQ combined result read from the external memory according to a predetermined weighting coefficient manner. Performing HARQ merging; the result processing module 26 is coupled to the storage module 22, configured to output all data stored in the HARQ buffer to the external memory, and clear the HARQ buffer. Through the foregoing apparatus, the storage module 22 uses a HARQ buffer for storing the data received and the result data of the HARQ merge, which solves the related problem that the HARQ merge consumes the storage resource and/or the processing delay. Big problems save system storage resources and improve system efficiency. 3 is a structural block diagram of a HARQ merging apparatus according to a preferred embodiment of the present invention. As shown in FIG. 3, the merging module 24 includes: a determining unit 242, configured to be based on the length of the data received this time and the data in the HARQ buffer. The relative position in the middle, determine the overlap with the data received in the last HARQ merge result and a non-overlapping portion; a weighting unit 244 coupled to the determining unit 242, configured to calculate a sum of a product of the overlap portion multiplied by the first weighting coefficient and a product of the non-overlapping portion multiplied by the third weighting coefficient, and the summed data and The data received this time is multiplied by the product of the second weighting coefficient. Preferably, the determining unit 242 is further configured to determine that the overlapping portion is the data portion corresponding to the position of the current received data in the HARQ buffer in the last HARQ combining result, and the non-overlapping portion is removed from the last HARQ combining result. The data portion of the received data is outside the data corresponding to the location in the HARQ cache. Preferably, the determining unit 242 is further configured to: when the length of the data received this time is less than the length of the HARQ buffer and the winding does not occur during the HARQ combining process, determining that the overlapping portion is in the middle of the last HARQ combining result, and the non-overlapping portion is in the middle Head and tail of the last HARQ merge result; When the length of the data received this time is less than the length of the HARQ buffer and the winding occurs during the HARQ merge, it is determined that the overlap is at the head and tail of the last HARQ merge result, The non-overlapping part is in the middle of the last HARQ merging result; when the length of the data received this time is greater than the length of the HARQ buffer, it is determined that the overlapping part is the result of the last HARQ merging, and there is no non-overlapping part; wherein, the overlapping part is In the secondary HARQ combining result, the length of the received data is the starting point of the data in the HARQ buffer, and the length is the data of the length of the received data. The implementation process of the above embodiment will be described in detail below in conjunction with the preferred embodiments and the accompanying drawings. Embodiment 1 This embodiment provides an implementation method and a device for saving storage HARQ combining based on an LTE system by using HARQ combining of an LTE system, but is not limited to an LTE system, and includes LTE-FDD and LTE-TDD. Seed system. In the following, corresponding to various scenarios of the LTE system, a method for saving HARQ combining of storage resources taken in various situations that may occur in the HARQ merging process in this embodiment is described. It should be noted that, in the HARQ merging process, the length of the HARQ buffer is the length of the original information of the sender. For a HARQ merging, the length of the HARQ buffer is determined, and is also the last time saved after each HARQ merging. The length of the combined result '. In the implementation process, according to the length of the 'received data' and its different positions in the HARQ buffer, the HARQ merged scene can be summarized into the following three cases: Scene 1: 'The data received this time' length It is smaller than the HARQ buffer length (length), and the HARQ combining process does not wind up. 4 is a schematic diagram of HARQ combining (non-winding) when the length of the received data is less than the length of the HARQ buffer according to the first embodiment of the present invention. As shown in FIG. 4, the part requiring HARQ combining is the point from point A to point B. . Scenario 2: The length of the data received in this time is smaller than the length of the HARQ buffer, and the HARQ combining process is wound. FIG. 5 is a HARQ merge (volume) when the length of the received data is less than the length of the HARQ buffer according to the first embodiment of the present invention. A schematic diagram of the winding, as shown in Fig. 5, the portion requiring HARQ merging is the portion from point A to point B. Scenario 3: The length of the data received in the present time is greater than the length of the HARQ buffer. FIG. 6 is a schematic diagram of HARQ combining when the length of the received data is greater than the length of the HARQ buffer according to the first embodiment of the present invention, as shown in FIG. The merged part starts from point A, merges VI, V2...Vn one by one, and ends at point B. For the above three cases, the embodiment adopts a unified method for performing the HARQ combining operation, and the device for completing the HARQ combining is mainly composed of a HARQ buffer length storage space (RAM) and a set of weighting coefficient adders. 7 is a schematic diagram of a HARQ combining buffer and a plurality of weighting coefficient adders according to the first embodiment of the present invention, and FIG. 8 is a schematic structural diagram of a weighting coefficient adder according to the first embodiment of the present invention. The HARQ combining provided by this embodiment is shown in FIG. The composition and relationship of the device can be seen in Figures 7 and 8. In the implementation process, the HARQ merging method provided in this embodiment may include the following steps: Step 1: Read the 'data received this time' from the external memory, and record the length from A to B, according to which The position in the HARQ buffer is added to the previously cleared HARQ buffer, and the result of the addition is stored in the position corresponding to the HARQ buffer. FIG. 9 is a schematic diagram of recovery (non-winding) of the received data in the HARQ buffer according to the first embodiment of the present invention, when the length of the received data is less than the length of the HARQ buffer. FIG. When the length of the received data is less than the length of the HARQ buffer, the recovery data (rewinding) of the received data in the buffer of the HARQ, FIG. 11 is a case where the length of the received data is greater than the length of the HARQ buffer according to the first embodiment of the present invention. The schematic diagram of the recovery of the received data in the buffer of the HARQ, the process of adding in this step can be according to the three different scenarios described above, according to the methods shown in FIG. 9, FIG. 10 and FIG. For example, in scenario 1 shown in FIG. 9, the data received this time is added from the point A to the all-zero HARQ buffer, and ends at point B; in the scenario 2 shown in FIG. 10, the data received this time is from A. The point starts to add to the all-zero HARQ buffer. After the end of the HARQ buffer, the return buffer starts to add to the end of point B. In the scene 3 shown in Figure 8, the data received this time starts from point A and The zero HARQ buffer is added. After the end of the HARQ buffer, the return buffer starts to add. After the coil is wound, the overlap is continued and the saturation is added until the end of point B. Step 2: Read the 'last merge result' from the external memory and multiply the corresponding weighting coefficient, and simultaneously read the data in the HARQ buffer, and multiply the corresponding weighting coefficient to add the two, and the result is written. HARQ The location corresponding to the buffer. In the above three scenarios, after the operation of step 1, the length of the 'received data' has been controlled within the length of the HARQ buffer. Therefore, the lengths of the two vectors added in this step are both HARQ buffers. length. FIG. 12 is a schematic diagram of weighting coefficients (not winding) of the current received data and the previous combined result when the received data length is less than the HARQ buffer length according to the first embodiment of the present invention, and FIG. 13 is a schematic diagram of the present invention according to an embodiment of the present invention. FIG. 14 is a schematic diagram of the weighting coefficient (winding) of the current received data and the previous combined result when the length of the received data is less than the length of the HARQ buffer. FIG. 14 is the length of the received data is greater than the length of the HARQ buffer according to the first embodiment of the present invention. At the time, the weighting coefficients of the received data and the previous combined result are shown. In this step, the weighting coefficients of the two vectors are added according to the above three different scenarios, as shown in FIG. 12, FIG. 13, and FIG. 14, respectively. As shown in the figure, the operation methods in these three scenarios are the same, which are the 'this time received data' unified multiply
W2, '上次合并结果'与'本次接收到数据'重叠部分乘以 Wl, 不重叠部分乘以 W3。 特 别地, 图 14所示的场景三中, '本次接收到数据'与'上次合并结果 '全部重叠, 所以, 表现为 '上次合并结果'统一乘以 Wl。 步骤 3, 将 HARQ buffer作为输出 buffer, 把前一步的合并的结果输出到外部存储 器。另外,为保证下一次合并开始时 HARQ buffer为全零,在输出结果的同时将 HARQ buffer清零。 优选地, 带加权系数的加法器可以有其他不同的实现方式, 如果加权系数 Wl、 W2和 W3的取值均为 1/2、 1/4、 1/8等分母为 2的幂次数时, 可以用移位方式取代乘 法器。 另外, 带加权系数的加法器个数也可以是任意的, 每个加法器输出数据的位宽 为一个 HARQ合并结果数据的位宽 (如图 7中的 N bit), 如果使用两个加法器, 那么 每次处理的并行度即为 2N bit。 这样, 通过增加带加权系数的加法器个数可以实现应 用中所需的不同处理并行度。 需要说明的是, 本实施例不但适用于 LTE的制式 HARQ合并操作, 对于 WiMAX 制式, 以及 UMTS制式的 HARQ合并也同样适用。 可见,本实施例通过使用一个 HARQ合并 buffer,在读入 '本次接收到的数据 '和'上 次合并结果'的同时对两者进行合并, 且合并的结果仍然放在同一个 buffer内, 解决了 无线通信系统, 特别是 LTE、 WiMAX制式下, 接收机 HARQ合并操作需要消耗大量 存储、 以及 HARQ合并操作时延较大的问题, 在提供 HARQ合并执行效率的同时, 最大程度地节约了设计的存储资源。 实施例二 假设发送方最大的数据包长为 6144bit, 即 HARQ buffer长度为 6144bit, 有一包 长度 6144bit的数据一共发送了 4次才正确译码(即, 这一包数据经历了 1次首传和 3 次重传), 3次重传的数据包正好符合前文中描述的 3种不同的情况(SP, 第一次重传 时本次接收数据长度小于 HARQ buffer长度, 且不卷绕; 第二次重传时本次接收数据 长度小于 HARQ buffer长度, 并且存在卷绕情况; 第三次重传时本次接收数据长度大 于 HARQ buffer长度)。 第一次传输该数据包时不存在上次 HARQ合并结果, 也就不 需要执行 HARQ合并操作, 下面以 3 次重传的处理过程来具体描述本实施例提供的 HARQ合并的实现方法。 ( 1 ) 第一次重传时, 本次收到数据长度为 3000bit, 对应在 HARQ buffer中的相 对起始位置为 32: 首先, 将本次收到的数据读入, 并按照在 HARQ buffer里的相对位置将其填入全 零的 HARQ buffer, 如图 9所示; 其次, 将上次合并结果 (即第一次传输的内容) 读 入, 并按照图 12所示的加权系数方式将本次接收到的数据与上次合并结果相加,相加 的过程采取一边读取一边相加, 相加的结果仍然放在 HARQ buffer内; 最后, 将本次 HARQ合并结果输出, 输出的过程中将 HARQ buffer清零以方便下一次使用。 W2, 'Last merge result' and 'this received data' overlap are multiplied by Wl, and the non-overlapping part is multiplied by W3. In particular, in the third scenario shown in FIG. 14, the 'this time received data' and the 'last merged result' all overlap, so the performance of the 'last merge result' is multiplied by W1. In step 3, the HARQ buffer is used as an output buffer, and the combined result of the previous step is output to the external memory. In addition, to ensure that the HARQ buffer is all zeros at the beginning of the next merge, the HARQ buffer is cleared at the same time as the output. Preferably, the adder with weighting coefficients may have other different implementation manners. If the weighting coefficients W1, W2, and W3 are all 1/2, 1/4, 1/8, etc., the denominator is a power of 2, The multiplier can be replaced by a shift. In addition, the number of adders with weighting coefficients may also be arbitrary, and the bit width of each adder output data is the bit width of one HARQ combined result data (such as N bit in FIG. 7), if two adders are used. , then the parallelism of each processing is 2N bit. Thus, by increasing the number of adders with weighting coefficients, different processing parallelisms required in the application can be achieved. It should be noted that this embodiment is applicable not only to the HARQ combining operation of the LTE system, but also to the WiMAX system and the HARQ combining of the UMTS system. It can be seen that, by using a HARQ merge buffer, the present embodiment merges the two data at the same time as the 'received data received' and the 'last merged result', and the combined result is still placed in the same buffer. The wireless communication system is solved, especially in the LTE and WiMAX systems, the receiver HARQ combining operation needs to consume a large amount of storage, and the HARQ combining operation has a large delay, and the HARQ merge execution efficiency is provided, and the design is saved to the utmost extent. Storage resources. The second embodiment assumes that the sender has a maximum packet length of 6144 bits, that is, the HARQ buffer has a length of 6144 bits, and a packet of length 6144 bits is sent for 4 times to be correctly decoded (that is, the packet data has undergone 1 first pass and 3 retransmissions), the data packets of 3 retransmissions coincide with the three different cases described above (SP, the length of the received data is less than the length of the HARQ buffer during the first retransmission, and is not wound; In the case of retransmission, the length of the received data is less than the length of the HARQ buffer, and there is a winding condition; the length of the received data in the third retransmission is greater than the length of the HARQ buffer). The first HARQ merging result is not present when the data packet is transmitted for the first time, and the HARQ merging operation is not required. The following describes the implementation method of the HARQ merging provided in this embodiment by the process of three retransmissions. (1) When retransmitting for the first time, the received data length is 3000bit, and the relative starting position corresponding to the HARQ buffer is 32: First, the data received this time is read in, and in the HARQ buffer. The relative position is filled in the all-zero HARQ buffer, as shown in Fig. 9; secondly, the result of the last merge (that is, the content of the first transmission) is read in, and the weighting coefficient method shown in Fig. 12 is used. The data received in the second time is added to the result of the previous combination. The addition process is performed while reading and adding, and the result of the addition is still placed in the HARQ buffer. Finally, the HARQ result is outputted and outputted. Clear the HARQ buffer to the next time.
(2) 第二次重传时, 本次收到的数据长度仍为 3000bit, 对于在 HARQ buffer中 的相对起始位置为 4608: 首先, 将本次收到的数据读入, 并按照在 HARQ buffer里的相对位置将其填入全 零的 HARQ buffer, 如图 10所示; 其次, 将上次合并结果(即前两次传输的合并结果) 读入, 并按照图 13所示的加权系数方式将本次接收到的数据与上次合并结果相加,相 加的过程采取一边读取一边相加, 相加的结果仍然放在 HARQ buffer内; 最后, 将本 次 HARQ合并结果输出, 输出的过程中将 HARQ buffer清零以方便下一次使用。 (2) When the second retransmission is performed, the length of the data received this time is still 3000 bits. For the relative starting position in the HARQ buffer is 4608: First, the data received this time is read in, and according to the HARQ. The relative position in the buffer is filled in the all-zero HARQ buffer, as shown in Figure 10. Second, the last merge result (that is, the merge result of the previous two transfers) is read in, and the weighting coefficient shown in Figure 13 is followed. The method adds the data received this time to the result of the previous combination. The addition process takes the reading and adds one side, and the added result is still placed in the HARQ buffer. Finally, the HARQ combined result is output and output. The HARQ buffer is cleared during the process to facilitate the next use.
(3 ) 第三次重传时, 本次收到的数据长度为 9000bit, 对于在 HARQ buffer中的 相对起始位置为 64; 首先, 将本次收到的数据读入, 并按照在 HARQ buffer里的相对位置将其填入全 零的 HARQ buffer, 如图 11所示; 其次, 将上次合并结果(即前三次传输的合并结果) 读入, 并按照图 14所示的加权系数方式将本次接收到的数据与上次合并结果相加,相 加的过程采取一边读取一边相加, 相加的结果仍然放在 HARQ buffer内; 最后, 将本 次 HARQ合并结果输出, 输出的过程中将 HARQ buffer清零以方便下一次使用。 可见,本实施例提供的节省存储的 HARQ合并的实现方法,不区分是第几次 HARQ 合并操作, 均为'本次接收到数据的填入', '上次合并结果的读入并于本次收到数据合 并', 以及'合并结果输出并对 buffer清零'这 3个步骤。 且对应的 HARQ合并装置, 也 明确了方法的实现位置和具体操作, 节省了系统存储资源, 提高了系统效率。 综上所述, 本发明实施例提供了一种节省存储资源、提高合并效率的 HARQ合并 的实现方法, 尤其涉及 LTE、 WiMAX、 UMTS等协议标准的无线通讯领域中, 上行比 特级处理 HARQ合并操作过程中的存储资源节省, 在使用尽可能少的资源的情况下, 还保证了 HARQ合并的执行效率,对实际系统的性能、功耗和成本都有很重要的意义。 显然, 本领域的技术人员应该明白, 上述的本发明的各模块或各步骤可以用通用 的计算装置来实现, 它们可以集中在单个的计算装置上, 或者分布在多个计算装置所 组成的网络上, 可选地, 它们可以用计算装置可执行的程序代码来实现, 从而可以将 它们存储在存储装置中由计算装置来执行,或者将它们分别制作成各个集成电路模块, 或者将它们中的多个模块或步骤制作成单个集成电路模块来实现。 这样, 本发明不限 制于任何特定的硬件和软件结合。 以上所述仅为本发明的优选实施例而已, 并不用于限制本发明, 对于本领域的技 术人员来说, 本发明可以有各种更改和变化。 凡在本发明的精神和原则之内, 所作的 任何修改、 等同替换、 改进等, 均应包含在本发明的保护范围之内。 (3) In the third retransmission, the length of the data received this time is 9000 bits, and the relative starting position in the HARQ buffer is 64. First, the data received this time is read in, and according to the HARQ buffer. The relative position in the field is filled in the all-zero HARQ buffer, as shown in Figure 11; secondly, the last merged result (that is, the combined result of the first three transmissions) is read in, and will be weighted according to the weighting coefficient shown in Figure 14. The data received this time is added to the previous merged result. The addition process is performed while reading and adding, and the added result is still placed in the HARQ buffer. Finally, the HARQ merge result is output and the output process is performed. The middle of the HARQ buffer is cleared to facilitate the next use. It can be seen that the implementation method of the storage-saving HARQ merging provided in this embodiment does not distinguish the first HARQ merging operation, which is the 'filling of data received this time', and the reading of the last merged result is in the present The data is merged ', and the 'combined result is output and the buffer is cleared' three steps. And the corresponding HARQ merging device also clarifies the implementation location and specific operation of the method, saves system storage resources, and improves system efficiency. In summary, the embodiments of the present invention provide a method for implementing HARQ consolidation, which saves storage resources and improves combining efficiency, and particularly relates to uplink bit-level processing HARQ combining operations in the wireless communication field of protocol standards such as LTE, WiMAX, and UMTS. The storage resource savings in the process, while using as few resources as possible, also ensure the efficiency of HARQ consolidation, which is of great significance to the performance, power consumption and cost of the actual system. Obviously, those skilled in the art should understand that the above modules or steps of the present invention can be implemented by a general-purpose computing device, which can be concentrated on a single computing device or distributed over a network composed of multiple computing devices. Alternatively, they may be implemented by program code executable by the computing device so that they may be stored in the storage device by the computing device, or they may be separately fabricated into individual integrated circuit modules, or Multiple modules or steps are made into a single integrated circuit module. Thus, the invention is not limited to any specific combination of hardware and software. The above is only the preferred embodiment of the present invention, and is not intended to limit the present invention, and various modifications and changes can be made to the present invention. Any modifications, equivalent substitutions, improvements, etc. made within the spirit and scope of the present invention are intended to be included within the scope of the present invention.

Claims

1. 一种混合自动重传请求 HARQ的合并方法, 包括以下步骤: 在 HARQ缓存中存入本次接收到的数据; A hybrid automatic repeat request HARQ merging method, comprising the following steps: storing the data received in the HARQ buffer;
按照预定的加权系数方式将所述本次接收到的数据与从外部存储器中读入 的上次 HARQ合并结果进行 HARQ合并, 并将该 HARQ合并后的结果写入所 述 HARQ缓存中对应的位置;  Performing HARQ combining on the current received data and the last HARQ merge result read from the external memory according to a predetermined weighting coefficient manner, and writing the HARQ combined result to a corresponding position in the HARQ buffer. ;
将存储在所述 HARQ缓存中的所有数据输出到所述外部存储器中,清零所 述 HARQ缓存。  All data stored in the HARQ buffer is output to the external memory, and the HARQ buffer is cleared.
2. 根据权利要求 1所述的方法, 其中, 按照所述预定的加权系数方式将所述本次 接收到的数据与从所述外部存储器中读入的所述上次 HARQ 合并结果进行 HARQ合并包括: 2. The method according to claim 1, wherein the current received data is HARQ merged with the last HARQ merge result read from the external memory according to the predetermined weighting coefficient manner. Includes:
根据所述本次接收到的数据的长度和该数据在所述 HARQ 缓存中的相对 位置,确定在所述上次 HARQ合并结果中与所述本次接收到的数据的重叠部分 和非重叠部分;  Determining an overlapping portion and a non-overlapping portion of the current received data in the last HARQ combining result according to the length of the currently received data and the relative position of the data in the HARQ buffer ;
计算所述重叠部分乘以第一加权系数之积与所述非重叠部分乘以第三加权 系数之积的和, 并将求和后的数据与所述本次接收到的数据乘以第二加权系数 之积相加。  Calculating a sum of the product of the overlap portion multiplied by the first weighting coefficient and the product of the non-overlapping portion multiplied by the third weighting coefficient, and multiplying the summed data by the current received data by a second The product of the weighting coefficients is added.
3. 根据权利要求 2所述的方法, 其中, 所述重叠部分为所述上次 HARQ合并结果 中与所述本次接收到的数据在所述 HARQ缓存中位置对应的数据部分,所述非 重叠部分为所述上次 HARQ 合并结果中除去与所述本次接收到的数据在所述 HARQ缓存中位置对应的数据之外的数据部分。 The method according to claim 2, wherein the overlapping portion is a data portion corresponding to a location of the current received data in the HARQ cache in the last HARQ merge result, the non- The overlapping portion is a portion of the data in the last HARQ merge result excluding data corresponding to the location of the currently received data in the HARQ buffer.
4. 根据权利要求 2所述的方法, 其中, 根据所述本次接收到的数据的长度和该数 据在所述 HARQ缓存中的相对位置, 确定在所述上次 HARQ合并结果中与所 述本次接收到的数据的重叠部分和非重叠部分包括: 4. The method according to claim 2, wherein, according to the length of the data received this time and the relative position of the data in the HARQ buffer, determining, in the last HARQ merge result, The overlapping and non-overlapping parts of the data received this time include:
当所述本次接收到的数据的长度小于所述 HARQ缓存的长度且 HARQ合 并过程中不发生卷绕时, 所述重叠部分处于所述上次 HARQ合并结果的中部, 所述非重叠部分处于所述上次 HARQ合并结果的头部和尾部; 当所述本次接收到的数据的长度小于所述 HARQ缓存的长度且 HARQ合 并过程中发生卷绕时,所述重叠部分处于所述上次 HARQ合并结果的头部和尾 部, 所述非重叠部分处于所述上次 HARQ合并结果的中部; When the length of the currently received data is less than the length of the HARQ buffer and the winding does not occur during the HARQ combining, the overlapping portion is in the middle of the last HARQ combining result, and the non-overlapping portion is in the middle The head and tail of the last HARQ merge result; When the length of the currently received data is less than the length of the HARQ buffer and the winding occurs during the HARQ combining, the overlapping portion is at the head and the tail of the last HARQ combining result, the non-overlapping Partially in the middle of the last HARQ merge result;
当所述本次接收到的数据的长度大于所述 HARQ缓存的长度时,所述重叠 部分为所述上次 HARQ合并结果, 不存在所述非重叠部分;  When the length of the data received this time is greater than the length of the HARQ buffer, the overlapping portion is the result of the last HARQ merge, and the non-overlapping portion does not exist;
其中,所述重叠部分为所述上次 HARQ合并结果中以所述本次接收到的数 据的在所述 HARQ缓存中对应的起始位置为起点,长度为所述本次接收到的数 据的长度的数据。  The overlapping portion is the starting point of the current HARQ buffer in the previous HARQ combining result, and the length is the data received in the current HARQ buffer. Length data.
5. 根据权利要求 1所述的方法,其中,按照所述预定的加权系数方式进行相加时, 通过增加带加权系数的加法器的个数实现应用所需的不同处理并行度。 5. The method according to claim 1, wherein when the addition is performed in accordance with the predetermined weighting coefficient manner, different processing parallelisms required for the application are realized by increasing the number of adders having weighting coefficients.
6. 根据权利要求 1至 5中任一项所述的方法, 其中, 所述方法应用于至少以下之 一: 长期演进 LTE系统、 全球微波互联接入 WiMAX系统、 通用移动通讯系统 UMTSo The method according to any one of claims 1 to 5, wherein the method is applied to at least one of the following: Long-term evolution LTE system, global microwave interconnection access WiMAX system, universal mobile communication system UMTSo
7. 一种混合自动重传请求 HARQ的合并装置, 包括: 7. A hybrid automatic repeat request HARQ merging device, comprising:
存储模块, 设置为在 HARQ缓存中存入本次接收到的数据; 以及将 HARQ 合并后的结果写入所述 HARQ缓存中对应的位置; 合并模块, 设置为按照预定的加权系数方式将所述本次接收到的数据与从 外部存储器中读入的上次 HARQ合并结果进行 HARQ合并;  a storage module, configured to store the data received in the HARQ buffer; and write the merged result of the HARQ into a corresponding location in the HARQ cache; and the merging module is configured to perform the method according to a predetermined weighting coefficient manner The data received this time is HARQ merged with the last HARQ merge result read from the external memory;
结果处理模块,设置为将存储在所述 HARQ缓存中的所有数据输出到所述 外部存储器中, 清零所述 HARQ缓存。  A result processing module is arranged to output all data stored in the HARQ buffer to the external memory, clearing the HARQ buffer.
8. 根据权利要求 7所述的合并装置, 其中, 所述合并模块包括: 8. The merging device according to claim 7, wherein the merging module comprises:
确定单元, 设置为根据所述本次接收到的数据的长度和该数据在所述 HARQ缓存中的相对位置,确定在所述上次 HARQ合并结果中与所述本次接收 到的数据的重叠部分和非重叠部分;  a determining unit, configured to determine an overlap with the current received data in the last HARQ merge result according to the length of the current received data and the relative position of the data in the HARQ buffer Partial and non-overlapping parts;
加权单元, 设置为计算所述重叠部分乘以第一加权系数之积与所述非重叠 部分乘以第三加权系数之积的和, 并将求和后的数据与所述本次接收到的数据 乘以第二加权系数之积相加。  a weighting unit configured to calculate a sum of a product of the overlap portion multiplied by the first weighting coefficient and a product of the non-overlapping portion multiplied by a third weighting coefficient, and the summed data and the current received The data is multiplied by the product of the second weighting coefficient.
9. 根据权利要求 8所述的合并装置, 其中, 所述确定单元还设置为确定所述重叠 部分为所述上次 HARQ合并结果中与所述本次接收到的数据在所述 HARQ缓 存中位置对应的数据部分,所述非重叠部分为所述上次 HARQ合并结果中除去 与所述本次接收到的数据在所述 HARQ 缓存中位置对应的数据之外的数据部 分。 9. The merging device according to claim 8, wherein the determining unit is further configured to determine that the overlapping portion is the HARQ mitigation result in the last HARQ merging result and the current received data in the HARQ mitigation And a non-overlapping portion is a data portion except the data corresponding to the location of the currently received data in the HARQ cache in the last HARQ merge result.
10. 根据权利要求 8所述的合并装置, 其中, 所述确定单元还设置为当所述本次接 收到的数据的长度小于所述 HARQ缓存的长度且 HARQ合并过程中不发生卷 绕时, 确定所述重叠部分处于所述上次 HARQ合并结果的中部, 所述非重叠部 分处于所述上次 HARQ合并结果的头部和尾部;当所述本次接收到的数据的长 度小于所述 HARQ缓存的长度且 HARQ合并过程中发生卷绕时, 确定所述重 叠部分处于所述上次 HARQ合并结果的头部和尾部,所述非重叠部分处于所述 上次 HARQ合并结果的中部;当所述本次接收到的数据的长度大于所述 HARQ 缓存的长度时, 确定所述重叠部分为所述上次 HARQ合并结果, 不存在所述非 重叠部分; 其中, 所述重叠部分为所述上次 HARQ合并结果中以所述本次接收 到的数据的在所述 HARQ缓存中对应的起始位置为起点,长度为所述本次接收 到的数据的长度的数据。 10. The merging device according to claim 8, wherein the determining unit is further configured to: when the length of the data received this time is less than the length of the HARQ buffer and the winding does not occur during the HARQ merging process, Determining that the overlapping portion is in the middle of the last HARQ combining result, the non-overlapping portion is in a header and a tail of the last HARQ combining result; when the length of the current received data is less than the HARQ When the length of the buffer and the winding occurs during the HARQ combining process, it is determined that the overlapping portion is at the head and the tail of the last HARQ combining result, and the non-overlapping portion is in the middle of the last HARQ combining result; When the length of the data received in the current time is greater than the length of the HARQ buffer, determining that the overlapping portion is the result of the last HARQ merge, and the non-overlapping portion does not exist; wherein the overlapping portion is the upper portion The result of the current HARQ merging is the starting position corresponding to the current received data in the HARQ buffer, and the length is the data received in the current HARQ buffer. The length of the data.
PCT/CN2011/082186 2011-06-23 2011-11-15 Harq merging method and device WO2012174819A1 (en)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201110171526.2 2011-06-23
CN201110171526.2A CN102843224B (en) 2011-06-23 2011-06-23 The merging method and device of HARQ

Publications (1)

Publication Number Publication Date
WO2012174819A1 true WO2012174819A1 (en) 2012-12-27

Family

ID=47370308

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2011/082186 WO2012174819A1 (en) 2011-06-23 2011-11-15 Harq merging method and device

Country Status (2)

Country Link
CN (1) CN102843224B (en)
WO (1) WO2012174819A1 (en)

Cited By (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014133926A1 (en) * 2013-02-27 2014-09-04 Qualcomm Incorporated Methods and apparatus for conditional offload of one or more log-likelihood ratios (llrs) or decoded bits

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103916224B (en) * 2013-01-04 2019-08-02 中兴通讯股份有限公司 HARQ data buffer storage and method

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101047475A (en) * 2007-04-30 2007-10-03 重庆重邮信科(集团)股份有限公司 Design method for HARQ technical data buffer store and its circuit
US20090059801A1 (en) * 2007-08-28 2009-03-05 Beceem Communications, Inc. Managing storage of HARQ packets
CN101924617A (en) * 2009-06-11 2010-12-22 中兴通讯股份有限公司 Decoding merging method and device based on hybrid automatic repeat request

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP5087479B2 (en) * 2007-07-16 2012-12-05 イノヴァティヴ ソニック リミテッド Method and apparatus for improving HARQ function in a wireless communication system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101047475A (en) * 2007-04-30 2007-10-03 重庆重邮信科(集团)股份有限公司 Design method for HARQ technical data buffer store and its circuit
US20090059801A1 (en) * 2007-08-28 2009-03-05 Beceem Communications, Inc. Managing storage of HARQ packets
CN101924617A (en) * 2009-06-11 2010-12-22 中兴通讯股份有限公司 Decoding merging method and device based on hybrid automatic repeat request

Cited By (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2014133926A1 (en) * 2013-02-27 2014-09-04 Qualcomm Incorporated Methods and apparatus for conditional offload of one or more log-likelihood ratios (llrs) or decoded bits
US9204437B2 (en) 2013-02-27 2015-12-01 Qualcomm Incorporated Methods and apparatus for conditional offload of one or more log-likelihood ratios (LLRs) or decoded bits

Also Published As

Publication number Publication date
CN102843224B (en) 2017-07-11
CN102843224A (en) 2012-12-26

Similar Documents

Publication Publication Date Title
KR101696776B1 (en) Enhanced acknowledgement and retransmission mechanism
US8341485B2 (en) Increasing hybrid automatic repeat request (HARQ) throughput
TWI387256B (en) Method and apparatus for improving transmission time interval bundling
US8559365B2 (en) After transmission return signal
US9185529B2 (en) Wireless reliability architecture and methods using network coding
US7003710B2 (en) Communications method, communications apparatus and communications system using same communications apparatus
WO2011150639A1 (en) Method and device for implementing dynamical scheduling of hybrid automatic repeat request memory
CN104484295A (en) Receiver sliding window-based data transmission method in parallel computer system
CN114499993B (en) High-reliability safe transmission and control system and method based on one-way optical gate
WO2012142906A1 (en) Method and apparatus for processing harq combined storage space
JP2013504975A (en) Method and system for increasing the throughput of a hybrid automatic repeat request (HARQ) protocol
CN112738229B (en) Communication method for realizing automatic data continuous transmission
CN112261142B (en) RDMA network data retransmission method, device and FPGA
CN107959555A (en) A kind of data transmission method based on LWAAP, device and storage medium
CN101026441A (en) Automatic erroneous data packet repeating method and retransmission buffer
CN114726933B (en) QUIC-based data transmission control method, system and equipment
WO2012174819A1 (en) Harq merging method and device
WO2013086825A1 (en) Harq combination method and device
WO2020087477A1 (en) Device used for transmitting data packet, method, apparatus and computer readable storage medium
WO2022228467A1 (en) Data transmission method and apparatus, and readable storage medium
CN108769000B (en) High-efficiency streaming media transmission method for deep space environment
CN112073435A (en) Method for reducing transmission delay of transmission channel in TOE
CN116405164B (en) Decoding method, device and equipment
JP2000253059A (en) Re-transmission control method
CN117499992A (en) Semantic-based DTN BP and LTP cross-layer bundle transmission method and device

Legal Events

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

Ref document number: 11868185

Country of ref document: EP

Kind code of ref document: A1

NENP Non-entry into the national phase

Ref country code: DE

122 Ep: pct application non-entry in european phase

Ref document number: 11868185

Country of ref document: EP

Kind code of ref document: A1