WO2019128937A1 - 一种上行数据调度方法以及相关设备 - Google Patents

一种上行数据调度方法以及相关设备 Download PDF

Info

Publication number
WO2019128937A1
WO2019128937A1 PCT/CN2018/123206 CN2018123206W WO2019128937A1 WO 2019128937 A1 WO2019128937 A1 WO 2019128937A1 CN 2018123206 W CN2018123206 W CN 2018123206W WO 2019128937 A1 WO2019128937 A1 WO 2019128937A1
Authority
WO
WIPO (PCT)
Prior art keywords
pdu
decoding result
message
user equipment
scheduling
Prior art date
Application number
PCT/CN2018/123206
Other languages
English (en)
French (fr)
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 WO2019128937A1 publication Critical patent/WO2019128937A1/zh

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1874—Buffer management
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/1607—Details of the supervisory signal
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1812—Hybrid protocols; Hybrid automatic repeat request [HARQ]
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H04W72/1268—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows of uplink data flows
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
    • H04L1/00—Arrangements for detecting or preventing errors in the information received
    • H04L1/12—Arrangements for detecting or preventing errors in the information received by using return channel
    • H04L1/16—Arrangements for detecting or preventing errors in the information received by using return channel in which the return channel carries supervisory signals, e.g. repetition request signals
    • H04L1/18—Automatic repetition systems, e.g. Van Duuren systems
    • H04L1/1867—Arrangements specially adapted for the transmitter end
    • H04L1/1887—Scheduling and prioritising arrangements

Definitions

  • the present application relates to the field of communications, and in particular, to an uplink data scheduling method and related devices.
  • wireless base stations are evolving toward richer forms, better performance, lower TCO, higher deployment density, greater bandwidth, smarter, better user experience, and more flexible deployment.
  • the physical form of the base station is continuously subdivided into two ends; and the trend of multi-standard and multi-modal hybrid networking is becoming more and more obvious; various pre- and post-transmission interfaces are becoming more and more diverse.
  • the development of the architecture of the communication system has gradually formed a trend of stripping the radio remote unit (RRU) from the building baseband unit (BBU) and connecting the two by long-distance transmission means, and then transmitting the radio frequency. The unit is placed wherever it is needed.
  • this architecture improves the flexibility of networking, and on the other hand, reduces the maintenance cost of the network. Therefore, it is more and more recognized by users and more and more applications.
  • the BBU and the RRU are not optical fiber transmissions, that is, the CO and the site are non-ideal transmissions, and the generated transmission delay causes the same hybrid automatic repeat request (HARQ).
  • the process cannot obtain the demodulation result of the last scheduling when the next scheduling is performed.
  • the scheduling process cannot be performed according to the result of the acknowledgement (ACK)/negative ack.
  • ACK acknowledgement
  • the BBU cannot obtain the demodulation result of T+0ms when scheduling in T+8ms.
  • the scheduling process cannot be performed according to the ACK/NACK result.
  • the BBU assumes that the demodulation result is ACK, and then performs new transmission data transmission.
  • the radio link control (RLC) retransmission mechanism needs to be retransmitted, so When the initial cyclic redundancy check CRC error occurs, it is necessary to wait for the RLC retransmission mechanism to start, and the transmission time is obviously enhanced, which affects the user's perceived rate.
  • RLC radio link control
  • the embodiment of the present application provides an uplink data scheduling method, which is used to solve the problem that the transmission time is long in the prior art, thereby affecting the user's perceived rate.
  • the first aspect of the present application provides an uplink data scheduling method, including: the first device sends a first message to the user equipment at time T, where the first message includes resource scheduling information used by the first PDU. If the first device does not determine the decoding result of the first PDU at the time T+m, the first device sends a second message to the user equipment at the time T+m, where the The second message carries a default decoding result for the first PDU, the default decoding result is ACK, and the m is a cyclic period of the HARQ process; the first device determines the first PDU according to the received first PDU.
  • the first device sends the third message to the user equipment at the time of the T+A*m, where the third message carries a real decoding result indication, so that Determining, by the user equipment, whether to clear data of the first PDU according to the real decoding result, where A is an integer greater than 1.
  • the decoding result of the first PDU is not accurately known as ACK or NACK, the ACK is always considered as the next new transmission scheduling, and the real decoding result is carried in the third message.
  • the indication is to enable the user equipment to clear the data of the first PDU according to the indication, to avoid the initial transmission error, and to wait for the RLC retransmission mechanism to start, which solves the problem that the transmission time is long in the prior art, thereby affecting the perceived rate of the user.
  • the method before the first device sends the first message to the user equipment at time T, the method further includes: the first device And receiving, by the user equipment, a scheduling request, where the scheduling request is used to request the first device to allocate a radio resource to the first PDU.
  • the scheduling request is used to request the first device to allocate a radio resource to the first PDU.
  • the method further includes: when the real decoding result indicates that the decoding fails, the first device schedules the data amount of the first PDU1 to be compensated back to the buffer. In this implementation manner, when the decoding fails, the first device further compensates the data amount back to the buffer, so that the logic of the embodiment of the present application is stronger.
  • the third message when the real decoding result indicates that the decoding fails, the third message further includes retransmitting the first Resource scheduling information used by the PDU. In this implementation manner, when the decoding fails, the third message further includes the resource scheduling information of the retransmission, so that the embodiment of the present application is more perfect.
  • a second aspect of the present application provides an uplink data scheduling method, including: a user equipment sends a first PDU to a first device; and the user equipment receives a first message sent by the first device, where the first The message carries a default decoding result for the first PDU, and the default decoding result is an ACK; the user equipment confirms a true decoding result of the first device to the first PDU; when the real If the scheduling result indicates that the decoding is correct, the user equipment clears the data of the first PDU.
  • the user equipment confirms that the first device performs a real decoding result on the first PDU, that is, the user:
  • the device receives the second message sent by the first device, where the first message carries a real decoding result indication; the user equipment determines the real decoding result according to the real decoding result indication.
  • the second message when the real scheduling result indicates that the decoding fails, the second message further includes retransmitting the first PDU. Resource scheduling information used.
  • the user equipment confirms that the first device performs a real decoding result on the first PDU, that is, the user: After receiving the preset duration of the first message, the device confirms that the default decoding result is the real decoding result.
  • a third aspect of the embodiment of the present application provides a scheduling device, including:
  • transceiver unit configured to send a first message to the user equipment at time T, where the first message includes resource scheduling information used by the first PDU; if the first device does not determine the first at the time T+m
  • the transceiver unit is further configured to send a second message to the user equipment at the time of the T+m, where the second message carries a default decoding result for the first PDU, where the PDU is decoded.
  • the default decoding result is ACK
  • the m is a cyclic period of the HARQ process
  • the determining unit is configured to determine a true decoding result of the first PDU according to the received first PDU
  • the transceiver unit is further configured to: And sending, by the user equipment, the third message, where the third message carries a real decoding result indication, so that the user equipment determines, according to the real decoding result indication, whether Clearing data of the first PDU, the A being an integer greater than one.
  • the scheduling device further includes: the transceiver unit is further configured to receive a scheduling request sent by the user equipment, where The scheduling request is used to request the first device to allocate a radio resource to the first PDU.
  • the scheduling device further includes: a scheduling unit, configured to perform scheduling when the real decoding result indicates that the decoding fails The data amount of the first PDU1 is compensated back to the buffer.
  • the third message when the real decoding result indicates that the decoding fails, the third message further includes retransmitting the first Resource scheduling information used by the PDU.
  • a fourth aspect of the present application provides a user equipment, including: a transceiver unit, configured to send a first PDU to a first device, where the transceiver unit is further configured to receive a first message sent by the first device The first message carries a default decoding result for the first PDU, and the default decoding result is an ACK;
  • a confirming unit configured to confirm a true decoding result of the first device by using the first device
  • the unit is cleared, and when the real scheduling result indicates that the decoding is correct, the data of the first PDU is cleared.
  • the confirming unit includes: a receiving module, configured to receive a second message sent by the first device, where the A message carries a real decoding result indication; the first determining module is configured to determine the real decoding result according to the real decoding result indication.
  • the second message when the real scheduling result indicates that the decoding fails, the second message further includes retransmitting the first PDU. Resource scheduling information used.
  • the confirming unit includes: a second determining module, where the transceiver unit receives the preset duration of the first message Then, it is used to confirm that the default decoding result is the real decoding result.
  • a fifth aspect of the present application provides a computer readable storage medium having stored therein instructions that, when executed on a computer, cause the computer to perform the methods described in the above aspects.
  • a sixth aspect of the present application provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the methods described in the various aspects above.
  • the embodiment of the present application has the following advantages: in the case that the decoding result of the first PDU at time T cannot be accurately known as ACK or NACK, the ACK is always considered as the next new transmission scheduling, and The third message carries the real decoding result indication, so that the user equipment clears the data of the first PDU according to the indication, and avoids the initial transmission error is to wait for the RLC retransmission mechanism to start, which solves the long transmission time in the prior art, thereby affecting The problem of the user's perceived rate.
  • FIG. 1 is a flowchart of a possible uplink data scheduling method according to an embodiment of the present application
  • FIG. 2 is a schematic diagram of a possible HARQ process according to an embodiment of the present application.
  • FIG. 3 is a schematic diagram of a possible solution provided by an embodiment of the present application.
  • FIG. 4 is a schematic structural diagram of a possible scheduling device according to an embodiment of the present disclosure.
  • FIG. 5 is a schematic structural diagram of a possible user equipment according to an embodiment of the present application.
  • FIG. 6 is a schematic structural diagram of another possible scheduling device according to an embodiment of the present disclosure.
  • FIG. 7 is a schematic structural diagram of another possible user equipment according to an embodiment of the present application.
  • the embodiment of the present application provides an uplink data scheduling method and a related device, which are used to solve the problem that the transmission time is long in the prior art, thereby affecting the user's perceived rate.
  • a hybrid automatic repeat request (HARQ) process means that the base station schedules a data transmission, and then the base station receives the ACK/NACK feedback information.
  • the length to wait is round-trip time (RTT) to determine whether the next transmission is to transmit new data or to retransmit old data.
  • RTT round-trip time
  • the base station or terminal cannot stop transmission and wait for it, and other parallel HARQ processes must be initiated to make full use of the time domain resources.
  • the number of processes of the HARQ is related to the RTT, that is, the transmission delay and the processing time of the user equipment (UE)/base station. The larger the RTT, the number of parallel HARQ processes that need to be supported to fill the RTT, the HARQ process.
  • the quantity is approximately equal to RTT/TTI.
  • uplink and downlink data can be transmitted every subframe, and uplink and downlink data are separated by frequency.
  • the base station (UE) can send the acknowledgement information of the HARQ process in the n+4th subframe. Then, the UE (base station) can continue to transmit the next data frame in the n+8th subframe through the HARQ process, that is, the HARQ RTT time is 8 ms, so it is not difficult to obtain the number of HARQ processes to be 8.
  • the embodiments of the present application can be applied to a long term evolution (LTE) and a future 5G communication system.
  • the applicable scenario includes a network architecture with a delay on the wireless side, such as between a BBU and an RRU, between a BBU and a BBU. It is no longer a fiber-optic connection. That is, there is a demodulation result that the same HARQ process cannot obtain the previous scheduling when the next HARQ process performs the next scheduling. At this time, the scheduling process cannot be performed according to the ACK/NACK result. In the prior art, it is assumed that the demodulation result of the last scheduling is ACK, so the new data is transmitted in the next scheduling.
  • the UE side has cleared the last scheduling. Data information, so it is necessary to wait for the RLC ARQ mechanism to start for retransmission, and the transmission time is obviously enhanced, which affects the user's perceived rate.
  • the present application provides an uplink data scheduling method, which is used to solve the problem of user perceived rate loss caused by the untimely reporting of demodulation results in the prior art.
  • the base station involved in the present application is configured as a distributed base station, and the distributed base station includes a BBU and an RRU, and a transmission delay exists between the BBU and the RRU.
  • FIG. 1 is a flowchart of an uplink data scheduling method according to an embodiment of the present application, where the method specifically includes:
  • the UE sends a first scheduling request to the BBU by using the RRU.
  • the first scheduling request is sent to the BBU through the RRU, that is, the UE will The first scheduling request is sent to the RRU, and the RRU is forwarded to the BBU, where the first scheduling request is used to request the BBU to allocate the bearer resource for the first PDU.
  • the first scheduling request may be an increase request (addition)
  • the request message may also be other existing messages or new messages, which is not limited in this application.
  • the PDU is used to refer to a data unit transmitted between peer layers.
  • a PDU of a physical layer is a data bit
  • a PDU of a data link layer is a data frame
  • a PDU of a network layer is a data packet ( Packet)
  • the PDU of the transport layer is a segment
  • other higher-level PDUs are messages.
  • the BBU sends a first message to the UE by using the RRU.
  • the BBU After receiving the first scheduling request, the BBU sends a first message to the UE according to the first scheduling request, and the first message includes the resource scheduling information used by the UE to send the first PDU, where the first PDU is sent.
  • the resource scheduling information used is used to indicate the location of the radio resource to the UE, where the resource scheduling information may carry a resource block index (RB index) sequence number or an RB position allocated for the first transmission of the first PDU by the UE.
  • RB index resource block index
  • MCS Modulation and Coding Scheme
  • the selection of the MCS may be performed by the BBU by measuring the data sent by the UE to send the uplink, for example, according to the uplink reference signal carried in the data, or other signals, which are not limited herein.
  • the resource scheduling information may further include a resource scheduling period configured by the BBU.
  • the resource scheduling period is an optional parameter. If the BBU does not notify the UE of the resource scheduling period, the BBU is scheduled each time. Before the resource, the UE needs to be notified of the time when the BBU schedules the resource.
  • the first message may be a UL grant corresponding to the UE, or may be another existing message or a new message, which is not limited in this application.
  • the UL grant may carry predetermined information that can be uniquely identified by the UE, and a dedicated resource that is allocated to the UE to send uplink data, and scheduling information such as a modulation and coding scheme (MCS), so that the UE can according to the predetermined information.
  • MCS modulation and coding scheme
  • the UL grant is identified and the uplink data is sent on the dedicated resource specified in the UL grant.
  • the UL grant may come from a dynamically scheduled PDCCH, or from a RAR, or through a semi-static configuration.
  • the BBU uses the first HARQ process to perform the new transmission scheduling of the PDU1 at the time T, and sends the first message to the RRU, and the RRU is at the time of T+s.
  • the first message is received and then forwarded to the UE.
  • the UE it is assumed that there is no transmission delay between the RRU and the UE, so the UE also receives the first message at the time T+s, where s is the BBU and the RRU.
  • the value of s may be 2ms, 3ms, or 4ms, etc., which is not limited herein.
  • the UE sends the first PDU to the BBU by using the RRU.
  • the UE After receiving the first message at the T+s time, the UE obtains resource scheduling information for transmitting the first PDU included in the first message, and the UE scheduling information includes the MCS and the RB index or the RB location, so the UE The content of the resource scheduling information determines the time-frequency location of the radio resource allocated by the BBU and the MCS. Therefore, the UE sends the first PDU to the BBU according to the MCS allocated by the BBU at the time-frequency resource specified by the BBU based on the resource scheduling information.
  • the UE has a processing delay p, that is, after receiving the first message at the T+s time, the UE sends the first PDU to the RRU at the time T+s+p, so that the RRU is at the time of T+s+p. After receiving the first PDU, the first PDU is forwarded to the BBU. It can be understood that the time when the BBU receives the first PDU is T+2s+p. In addition, the protocol stipulates that the processing delay p on the UE side may be 4 ms.
  • the BBU sends a second message to the UE by using the RRU.
  • FIG. 2 a schematic diagram of a possible HARQ process provided by the present application, where numbers 1-8 represent 8 parallel HARQ processes in each cycle, each parallel HARQ process is independent of each other, and the letter A is used.
  • the acknowledgement ACK the letter N is used to indicate the negative acknowledgement NACK
  • the base station transmits data to the UE, and retransmits or transmits new data according to the feedback of the UE.
  • the base station passes the process 3 in the first cycle. Sending data to the UE and receiving the ACK fed back by the UE before the second cycle, so the base station sends new data to the UE through process 3 in the second cycle, and receives feedback from the UE before the third cycle. NACK, so the base station transmits retransmission data of new data to the UE through process 3 in the third cycle.
  • the BBU since there is a transmission delay between the BBU and the RRU, and there is a processing delay on the UE side, after the BBU sends the first message through the first process at time T, the BBU may not be able to obtain the translation at the T time in the next cycle. The code result, so the scheduling process cannot be performed. Therefore, the BBU sends a second message to the UE through the RRU at the time of T+m, where m is the cycle period of the HARQ process.
  • the value of m can be 8ms or 10ms, or other values, which are not limited herein. .
  • the second message carries a default decoding result for the first PDU, and the default decoding result is ACK, and the second message includes resource scheduling information used for sending the second PDU, and it should be noted that the first message is sent.
  • the BBU allocates the bearer resource to the second PDU by receiving the second scheduling request sent by the UE, and carries the configured resource scheduling information used for sending the second PDU in the second message, Steps 101 to 102 in the present application are similar, and details are not described herein again.
  • the second message may also be a new-transfer grant corresponding to the UE, or may be another existing message or a new message, which is not limited in this application.
  • the BBU sends the second message to the UE through the RRU forwarding at the time of T+m.
  • the RRU receives the second message at the time T+m+s due to the transmission delay s between the BBU and the RRU, and forwards the message.
  • the UE does not clear the data of the first PDU according to the default decoding result.
  • the BBU performs modulation and decoding processing on the first PDU to obtain a real decoding result.
  • the BBU After the UE sends the first PDU to the BBU through the RRU, the BBU receives the first PDU at time T+2s+p, and performs modulation and decoding processing on the first PDU to obtain a real decoding result. It can be understood that, in order to improve The data transmission efficiency reduces the bit error rate.
  • the UE in the present application can encode, modulate, and map the first PDU into a frame, an inverse fast Fourier transform, and a cyclic prefix.
  • the CP and the like are then transmitted to the receiving end, that is, the BBU in the present application by the channel. Therefore, after receiving the first PDU sent by the UE, the BBU sequentially performs the de-CP and fast Fuli on the received first PDU.
  • the modulation and decoding process of the encoded first PDU may be performed by using existing technical means, and details are not described herein again.
  • the process of the modulation and decoding process may take from 2.5 ms to 3.75 ms, or other durations, which is not limited herein.
  • the BBU sends a third message to the UE by using the RRU.
  • the real decoding result indication may be added to the third message according to the real decoding result (the operation requires protocol support or privatization protocol), for example, by using a specific bit in the third message.
  • the information carrying the indication of the real decoding result for example, when the specific bit is 0, indicating that the decoding is correct, that is, the feedback message used for the first PDU is ACK; when the specific bit is 1, it indicates that the decoding fails, that is, The feedback message for the first PDU is NACK.
  • the BBU needs to compensate the scheduling data amount back to the buffer, and perform retransmission scheduling of the PDU1.
  • the BBU side maintains a buffer, and the buffer may include the amount of scheduling data required for scheduling the UE to request to send data, and the BBU determines the length or size of the resource block required to schedule the data. Scheduling errors also require scheduling again. For example, if the UE requests to send 100 data, after the BBU schedules 10 of the data, the buffer has 90 scheduling data quantities. If the 10 data scheduled is correctly decoded, the UE is scheduled to send the request.
  • the third message further includes re-transmitting the resource scheduling information used by the first PDU, and the third message may also be a retransmission grant corresponding to the UE, or may be another existing message or New news, which is not limited here.
  • the BBU performs a normal operation, for example, scheduling new data through the first HARQ process in the cycle of the next HARQ.
  • the BBU adds a real decoding result indication to the third message as an optional operation, that is, after the UE receives the preset duration of the third message, If the information is still not received to indicate that the BBU fails to decode the first PDU, the UE confirms that the default decoding result is a true decoding result, that is, the feedback based on the first PDU is an ACK.
  • the BBU sends the third message to the UE via the RRU through the first HARQ process at the time of T+A*m, so that the UE determines whether to clear the data of the first PDU according to the true decoding result indication in the third message.
  • A is an integer greater than one.
  • the UE retransmits the first PDU according to the third message.
  • the BBU sends the third message to the UE through the RRU at the time of T+A*m.
  • the UE receives the third message at the time T+A*m+s based on the existence of the transmission delay s between the BBU and the RRU.
  • the real decoding result carried by the third message indicates that the decoding fails, and the UE retransmits the data of the reserved first PDU according to the resource scheduling information used by the third message to retransmit the first PDU.
  • the UE clears data of the first PDU according to the third message.
  • the BBU sends the third message to the UE through the RRU at the time of T+A*m.
  • the UE receives the third message at the time T+A*m+s based on the existence of the transmission delay s between the BBU and the RRU.
  • the real decoding result carried by the three messages indicates that the decoding is correct, and the UE clears the data of the first PDU.
  • the BBU may not add a real decoding result indication in the third message, so if the UE receives the preset time of the third message, if After receiving the information to indicate that the BBU fails to decode the first PDU, the UE confirms that the feedback based on the first PDU is an ACK, and then clears the data of the first PDU.
  • the preset duration is It can be 5m or 6m, etc., and is not limited herein.
  • the UE uses the indication of the new real decoding result to clear the historical data after receiving the real decoding instruction, and ensures that when the actual demodulation result is NACK, the HARQ gain can still be obtained, and the RLC is solved.
  • the retransmission cannot obtain the HARQ combining gain problem and improve the demodulation performance.
  • the initial CRC error will still be retransmitted at the media access control (MAC) layer without waiting for the radio link control layer.
  • the radio link control (RLC) retransmission mechanism is started, and the transmission time is not increased, thereby avoiding the loss of the user's perceived rate.
  • Step 1 The BBU performs the new scheduling of the PDU1 at the time of T+0ms, and sends the resource scheduling information of the PDU1 to the RRU (T+4), and the RRU sends the Grant to the UE (T+4ms), where the Grant carries the resource scheduling information of the PDU1. .
  • the UE sends the PDU1 to the RRU (T+8ms) according to the resource scheduling information of the PDU1, and the RRU transmits the PDU1 to the BBU (T+12ms), and the BBU receives the PDU1 sent by the UE at T+12ms and performs demodulation and decoding.
  • Step 2 The BBU assumes that PDU1 is demodulated into an ACK at T+8ms and performs new transmission data transmission of PDU2.
  • the RRU processes the ACK information according to the ACK information at T+12ms, and sends the decoding result ACK of the PDU1 to the UE, the new transmission Grant includes the resource scheduling information of the PDU2, and the Grant carries the decoding result ACK of the transmitting PDU1.
  • the UE does not clear the data of the PDU1;
  • Step 3 The BBU processes according to the obtained real decoding result at T+16ms. If the decoding is correct, the conventional processing is performed; if the decoding is incorrect, the scheduled data amount is compensated back to the buffer, and the PDU1 is retransmitted. Scheduling, transmitting the true decoding result of the PDU1 NACK+Retransmission Grant to the UE, and the retransmission Grant includes retransmitting the resource scheduling information of the PDU1.
  • the BBU also adds an indication of the real decoding result in the retransmission Grant (requires protocol support or privatization protocol), and after receiving the indication of the real decoding result, the UE performs the clear operation of the PDU1 data, if the real decoding result is NACK does not clear the data of PDU1; if the actual decoding result is ACK, the data of PDU1 is cleared.
  • retransmission Grant requires protocol support or privatization protocol
  • an embodiment of the scheduling device in the embodiment of the present application includes: a device,
  • the transceiver unit 401 is configured to send a first message to the user equipment at time T, where the first message includes resource scheduling information used by the first PDU.
  • the transceiver unit 401 is further configured to send a second message to the user equipment at the time T+m, if the first device does not determine the decoding result of the first PDU at the time of the T+m.
  • the second message carries a default decoding result for the first PDU, the default decoding result is ACK, and the m is a cycle period of the HARQ process;
  • a determining unit 402 configured to determine a true decoding result of the first PDU according to the received first PDU;
  • the transceiver unit 401 is further configured to send the third message to the user equipment at the time of the T+A*m, where the third message carries a real decoding result indication, so that the user equipment is The result of the real decoding indicates whether to clear the data of the first PDU, and the A is an integer greater than 1.
  • the transceiver unit 401 is further configured to receive a scheduling request sent by the user equipment, where the scheduling request is used to request the first device to allocate a radio resource to the first PDU.
  • the scheduling device further includes:
  • the scheduling unit 403 is configured to schedule the data amount of the first PDU1 to be compensated back to the buffer when the real decoding result indicates that the decoding fails.
  • a user equipment is also provided in the embodiment of the present application.
  • an embodiment of the user equipment in the embodiment of the present application includes:
  • the transceiver unit 501 is configured to send the first PDU to the first device.
  • the transceiver unit 501 is further configured to receive a first message sent by the first device, where the first message carries a default decoding result for the first PDU, and the default decoding result is an ACK;
  • An acknowledgment unit 502 configured to confirm a true decoding result of the first PDU by the first device
  • the clearing unit 503 is configured to clear the data of the first PDU when the real scheduling result indicates that the decoding is correct.
  • the confirming unit 502 specifically includes:
  • the receiving module 5021 is configured to receive a second message sent by the first device, where the first message carries a real decoding result indication;
  • the first determining module 5022 is configured to determine the true decoding result according to the real decoding result indication.
  • the confirming unit 502 specifically includes:
  • the second determining module 5023 after receiving the preset duration of the first message, the transceiver unit is configured to confirm that the default decoding result is the real decoding result.
  • FIG. 6 another embodiment of the scheduling device in this embodiment of the present application includes:
  • FIG. 6 is a schematic structural diagram of a scheduling device according to an embodiment of the present disclosure.
  • the scheduling device 600 may generate a large difference due to different configurations or performances, and may include one or more processors (central processing units, CPU) 601. (eg, one or more processors) and memory 609, one or more storage media 608 that store application 607 or data 606 (eg, one or one storage device in Shanghai).
  • the memory 609 and the storage medium 608 may be short-term storage or persistent storage.
  • the program stored on storage medium 608 may include one or more modules (not shown), each of which may include a series of instruction operations in the scheduling device.
  • the processor 601 can be configured to communicate with the storage medium 608, executing a series of instruction operations in the storage medium 608 on the scheduling device 600.
  • the scheduling device 600 can also include one or more power sources 602, one or more wired or wireless network interfaces 603, one or more input and output interfaces 604, and/or one or more operating systems 605, such as Windows Server, Mac. OS X, Unix, Linux, FreeBSD, etc.
  • operating systems 605 such as Windows Server, Mac. OS X, Unix, Linux, FreeBSD, etc.
  • FIG. 6 does not constitute a limitation to the scheduling device, may include more or fewer components than illustrated, or may combine certain components, or different component arrangements.
  • the memory 609 can be used to store software programs and modules, and the processor 601 executes various functional applications and data processing of the scheduling device by running software programs and modules stored in the memory 609.
  • the memory 609 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application required for at least one function (such as a broadcast function), and the like; the storage data area may be stored according to the use of the payment platform. Data (such as a list of transfer paths, etc.) and so on.
  • memory 609 can include high speed random access memory, and can also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid state storage device.
  • the program for retransmitting the schedule and the received data are stored in the memory 609 in the embodiment of the present application, and the processor 601 calls from the memory 609 when it is needed.
  • the processor 601 is a control center of the scheduling device, and can perform retransmission scheduling according to the set retransmission scheduling method.
  • the processor 601 connects various portions of the entire scheduling device using various interfaces and lines, performs various types of scheduling devices by running or executing software programs and/or modules stored in the memory 609, and recalling data stored in the memory 609. Function and processing of data to solve the problem of long transmission time in the prior art, thereby affecting the user's perceived rate.
  • FIG. 7 is a schematic structural diagram of a user equipment according to an embodiment of the present disclosure.
  • the user equipment 700 may generate a large difference due to different configurations or performances, and may include one or more central processing units (CPUs) 701. (eg, one or more processors) and memory 709, one or more storage media 708 that store application 707 or data 706 (eg, one or one storage device in Shanghai).
  • the memory 709 and the storage medium 708 may be short-term storage or persistent storage.
  • the program stored on storage medium 708 can include one or more modules (not shown), each of which can include a series of instruction operations in the user device.
  • the processor 701 can be configured to communicate with the storage medium 708 to perform a series of instruction operations in the storage medium 708 on the user device 700.
  • User equipment 700 may also include one or more power sources 702, one or more wired or wireless network interfaces 703, one or more input and output interfaces 704, and/or one or more operating systems 705, such as Windows Server, Mac OS X, Unix, Linux, FreeBSD, etc. It will be understood by those skilled in the art that the user equipment structure shown in FIG. 7 does not constitute a limitation to the user equipment, and may include more or less components than those illustrated, or a combination of certain components, or different component arrangements.
  • the memory 709 can be used to store software programs and modules, and the processor 701 executes various functional applications and data processing of the base station by running software programs and modules stored in the memory 709.
  • the memory 709 may mainly include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application required for at least one function (such as a broadcast function), and the like; the storage data area may be stored according to the use of the payment platform. Data (such as a list of transfer paths, etc.) and so on.
  • memory 709 can include high speed random access memory, and can also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other volatile solid state storage device.
  • the program for retransmitting the schedule and the received data are stored in the memory 709 in the embodiment of the present application, and the processor 701 calls from the memory 709 when it is needed.
  • the processor 701 is a control center of the base station, and can perform retransmission scheduling according to the set retransmission scheduling method.
  • the processor 701 connects various portions of the entire user device using various interfaces and lines, performs various operations of the user device by running or executing software programs and/or modules stored in the memory 709, and recalling data stored in the memory 709. Function and processing of data to solve the problem of long transmission time in the prior art, thereby affecting the user's perceived rate.
  • the disclosed system, apparatus, and method may be implemented in other manners.
  • the device embodiments described above are merely illustrative.
  • the division of the unit is only a logical function division.
  • there may be another division manner for example, multiple units or components may be combined or Can be integrated into another system, or some features can be ignored or not executed.
  • the mutual coupling or direct coupling or communication connection shown or discussed may be an indirect coupling or communication connection through some interface, device or unit, and may be in an electrical, mechanical or other form.
  • the units described as separate components may or may not be physically separated, and the components displayed as units may or may not be physical units, that is, may be located in one place, or may be distributed to multiple network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of the embodiment.
  • each functional unit in each embodiment of the present application may be integrated into one processing unit, or each unit may exist physically separately, or two or more units may be integrated into one unit.
  • the above integrated unit can be implemented in the form of hardware or in the form of a software functional unit.
  • the integrated unit if implemented in the form of a software functional unit and sold or used as a standalone product, may be stored in a computer readable storage medium.
  • a computer readable storage medium A number of instructions are included to cause a computer device (which may be a personal computer, server, or network device, etc.) to perform all or part of the steps of the methods described in various embodiments of the present application.
  • the foregoing storage medium includes: a U disk, a mobile hard disk, a read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk, and the like, which can store program codes. .

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

本申请实施例公开了一种上行数据调度方法以及相关设备，用于解决现有技术中传输时间长，从而影响用户的感知速率的问题。本申请实施例方法包括：第一设备在T时刻向用户设备发送第一消息，其中第一消息包括发送第一PDU所使用的资源调度信息；若第一设备在T+m时刻未确定第一PDU的译码结果时，第一设备在T+m时刻向用户设备发送第二消息，第二消息携带有用于第一PDU的默认译码结果，默认译码结果为ACK，m为HARQ进程的循环周期；第一设备根据接收到的第一PDU确定第一PDU的真实译码结果；第一设备在T+A*m时刻向用户设备发送第三消息，第三消息携带有真实译码结果指示，以使得用户设备根据真实译码结果指示确定是否清空第一PDU的数据，A为大于1的整数。

Description

一种上行数据调度方法以及相关设备
本申请要求于2017年12月26日提交中国专利局、申请号为201711441069.8、申请名称为“一种上行数据调度方法以及相关设备”的中国专利申请的优先权，其全部内容通过引用结合在本申请中。
技术领域
本申请涉及通信领域，尤其涉及一种上行数据调度方法以及相关设备。
背景技术
随着技术的不断更新，无线基站正朝着更丰富的形态、更好的性能、更低TCO、更高部署密度、更宽带、更智能、更好用户体验、更灵活部署等方面发展。基站的物理形态不断向两端演进细分；并且多制式、多形态混合组网趋势越来越明显；各种前传、后传接口也越来越多样化。通信系统的架构发展逐渐形成这样一个趋势：将射频拉远单元(radio remote unit，RRU)与基带处理单元(building baseband unit，BBU)剥离，并通过远距离传输手段将两者连接，然后将射频单元放置在各种需要的地方。这种架构一方面提高了组网的灵活性，另一方面降低了网络的维护成本，因此越来越得到用户的认可，应用场合也越来越多。
然而，现有技术中，存在BBU与RRU之间不是光纤传输的场景，即CO与站点为非理想传输，则产生的传输时延会使得同一个混合自动重传(hybrid automatic repeat request，HARQ)进程在进行下一次调度时无法获得上一次调度的解调结果，此时，就不能根据确认应答(acknowledgement，ACK)/否定应答(negative ack)结果进行调度处理。由于BBU和RRU之间存在传输时延，则BBU在T+8ms进行调度时，无法获得T+0ms的解调结果，此时不能根据ACK/NACK结果进行调度处理。BBU假设解调结果为ACK，进而进行新传数据传输，然而，若实际解调结果为NACK，则需要通过无线链路层控制协议(radio link control，RLC)重传机制进行重传，因此若初传循环冗余校验CRC错误时要等待RLC重传机制启动，传输时间增强明显，影响了用户的感知速率。
发明内容
本申请实施例提供了一种上行数据调度方法，用于解决现有技术中传输时间长，从而影响用户的感知速率的问题。
本申请实施例的第一方面提供了一种上行数据调度方法，包括：第一设备在T时刻向用户设备发送第一消息，其中所述第一消息包括发送第一PDU所使用的资源调度信息；若所述第一设备在T+m时刻未确定所述第一PDU的译码结果时，所述第一设备在所述T+m时刻向所述用户设备发送第二消息，所述第二消息携带有用于所述第一PDU的默认译码结果，所述默认译码结果为ACK，所述m为HARQ进程的循环周期；所述第一设备根据接收到的第一PDU确定所述第一PDU的真实译码结果；所述第一设备在所述T+A*m时刻向所述用户设备发送所述第三消息，所述第三消息携带有真实译码结果指示，以使得所述用户设备根据所述真实译码结果指示确定是否清空所述第一PDU的数据，所述A为大于1的整数。本申 请实施例中，在无法准确获知T时刻第一PDU的译码结果为ACK还是NACK的情况下，始终认为是ACK来进行下一次新传调度，通过在第三消息中携带真实译码结果指示来使得用户设备根据该指示清空第一PDU的数据，避免初传错误是要等待RLC重传机制启动，解决了现有技术中传输时间长，从而影响用户的感知速率的问题。
在一种可能的设计中，在本申请实施例第一方面的第一种实现方式中，第一设备在T时刻向用户设备发送第一消息之前，所述方法还包括：所述第一设备接收所述用户设备发送的调度请求，所述调度请求用于请求所述第一设备为所述第一PDU分配无线资源。本实现方式中，说明了第一设备调度资源的触发方式，增加了本申请实施例的实现方式。
在一种可能的设计中，在本申请实施例第一方面的第二种实现方式中，所述第一设备根据接收到的第一PDU确定所述第一PDU的真实译码结果后，所述方法还包括：当所述真实译码结果表示译码失败时，所述第一设备调度所述第一PDU1的数据量补偿回缓冲区。本实现方式中，说明译码失败时，第一设备还要将数据量补偿回缓冲区，使得本申请实施例的逻辑性更强。
在一种可能的设计中，在本申请实施例第一方面的第三种实现方式中，当所述真实译码结果表示译码失败时，所述第三消息还包括重传所述第一PDU所使用的资源调度信息。本实现方式中，说明了译码失败时，第三消息中还包括重传的资源调度信息，使得本申请实施例更加完善。
本申请实施例的第二方面提供了一种上行数据调度方法，包括：用户设备向第一设备发送第一PDU；所述用户设备接收所述第一设备发送的第一消息，所述第一消息携带有用于所述第一PDU的默认译码结果，所述默认译码结果为ACK；所述用户设备确认所述第一设备对所述第一PDU的真实译码结果；当所述真实调度结果表示译码正确，则所述用户设备清空所述第一PDU的数据。
在一种可能的设计中，在本申请实施例第二方面的第一种实现方式中，所述用户设备确认所述第一设备对所述第一PDU的真实译码结果包括：所述用户设备接收所述第一设备发送的第二消息，所述第一消息携带有真实译码结果指示；所述用户设备根据所述真实译码结果指示确定所述真实译码结果。
在一种可能的设计中，在本申请实施例第二方面的第二种实现方式中，当所述真实调度结果表示译码失败，则所述第二消息还包括重传所述第一PDU所使用的资源调度信息。
在一种可能的设计中，在本申请实施例第二方面的第三种实现方式中，所述用户设备确认所述第一设备对所述第一PDU的真实译码结果包括：所述用户设备接收到所述第一消息的预置时长后，确认所述默认译码结果为所述真实译码结果。
本申请实施例的第三方面提供了一种调度设备，包括：
收发单元，用于在T时刻向用户设备发送第一消息，所述第一消息包括发送第一PDU所使用的资源调度信息；若所述第一设备在T+m时刻未确定所述第一PDU的译码结果时，所述收发单元还用于在所述T+m时刻向所述用户设备发送第二消息，所述第二消息携带有用于所述第一PDU的默认译码结果，所述默认译码结果为ACK，所述m为HARQ进程的循环周期；确定单元，用于根据接收到的第一PDU确定所述第一PDU的真实译码结果；所述收 发单元还用于在所述T+A*m时刻向所述用户设备发送所述第三消息，所述第三消息携带有真实译码结果指示，以使得所述用户设备根据所述真实译码结果指示确定是否清空所述第一PDU的数据，所述A为大于1的整数。
在一种可能的设计中，在本申请实施例第三方面的第一种实现方式中，所述调度设备还包括：所述收发单元还用于接收所述用户设备发送的调度请求，所述调度请求用于请求所述第一设备为所述第一PDU分配无线资源。
在一种可能的设计中，在本申请实施例第三方面的第二种实现方式中，所述调度设备还包括：调度单元，当所述真实译码结果表示译码失败时，用于调度所述第一PDU1的数据量补偿回缓冲区。
在一种可能的设计中，在本申请实施例第三方面的第三种实现方式中，当所述真实译码结果表示译码失败时，所述第三消息还包括重传所述第一PDU所使用的资源调度信息。
本申请实施例的第四方面提供了一种用户设备，包括：收发单元，用于向第一设备发送第一PDU；所述收发单元，还用于接收所述第一设备发送的第一消息，所述第一消息携带有用于所述第一PDU的默认译码结果，所述默认译码结果为ACK；
确认单元，用于确认所述第一设备对所述第一PDU的真实译码结果；
清空单元，当所述真实调度结果表示译码正确，则用于清空所述第一PDU的数据。
在一种可能的设计中，在本申请实施例第四方面的第一种实现方式中，所述确认单元包括：接收模块，用于接收所述第一设备发送的第二消息，所述第一消息携带有真实译码结果指示；第一确定模块，用于根据所述真实译码结果指示确定所述真实译码结果。
在一种可能的设计中，在本申请实施例第四方面的第二种实现方式中，当所述真实调度结果表示译码失败，则所述第二消息还包括重传所述第一PDU所使用的资源调度信息。
在一种可能的设计中，在本申请实施例第四方面的第三种实现方式中，所述确认单元包括：第二确定模块，所述收发单元接收到所述第一消息的预置时长后，用于确认所述默认译码结果为所述真实译码结果。
本申请的第五方面提供了一种计算机可读存储介质，所述计算机可读存储介质中存储有指令，当其在计算机上运行时，使得计算机执行上述各方面所述的方法。
本申请的第六方面提供了一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行上述各方面所述的方法。
从以上技术方案可以看出，本申请实施例具有以下优点：在无法准确获知T时刻第一PDU的译码结果为ACK还是NACK的情况下，始终认为是ACK来进行下一次新传调度，通过在第三消息中携带真实译码结果指示来使得用户设备根据该指示清空第一PDU的数据，避免初传错误是要等待RLC重传机制启动，解决了现有技术中传输时间长，从而影响用户的感知速率的问题。
附图说明
图1为本申请实施例提供的一种可能的上行数据调度方法的流程图；
图2为本申请实施例提供的一种可能的HARQ进程示意图；
图3为本申请实施例提供的一种可能的方案示意图；
图4为本申请实施例提供的一种可能的调度设备的结构示意图；
图5为本申请实施例提供的一种可能的用户设备的结构示意图；
图6为本申请实施例提供的另一可能的调度设备的结构示意图；
图7为本申请实施例提供的另一可能的用户设备的结构示意图。
具体实施方式
本申请实施例提供了一种上行数据调度方法以及相关设备，用于解决现有技术中传输时间长，从而影响用户的感知速率的问题。
下面将结合本申请实施例中的附图，对本申请实施例中的技术方案进行清楚、完整地描述，显然，所描述的实施例仅仅是本申请一部分实施例，而不是全部的实施例。基于本申请中的实施例，本领域技术人员在没有做出创造性劳动前提下所获得的所有其他实施例，都属于本申请保护的范围。
一个混合式自动重传请求(hybrid automatic repeat request，HARQ)进程，是指基站调度进行一次数据传输，再到基站接收到ACK/NACK反馈信息。在一个HARQ进程中，一次传输发出后，需要等待的长度为往返延时(round-trip time，RTT)才能决定下次传输是传输新数据，还是进行旧数据的重传。在这段时间内，基站或者终端不能停止传输而白白等待，必须发起其他的并行HARQ进程，以充分利用时域资源。其中，HARQ的进程数量跟RTT，也就是传输时延和用户设备(user equipment，UE)/基站的处理时间相关的，RTT越大，需要支持的并行HARQ进程数量以填满RTT，HARQ进程的数量约等于RTT/TTI。例如，对于FDD系统而言，每个子帧都可以进行上行和下行数据的发送，上行和下行数据之间通过频率分隔开。考虑到物理层的处理时延，如果UE(基站)通过某个HARQ进程在第n个子帧发送了一个数据帧，基站(UE)在第n+4个子帧才能发送该HARQ进程的确认信息，那么UE(基站)通过该HARQ进程在第n+8个子帧才能继续发送下一个数据帧，即HARQ RTT时间为8ms，故不难得到HARQ进程数为8。
本申请实施例可以适用于长期演进(long term evolution，LTE)以及未来5G通信系统，可应用场景包括在无线侧存在时延的组网架构，如BBU和RRU之间，BBU和BBU等之间不再是光纤连接，即会存在前向时延导致同一个HARQ进程在进行下一次调度时无法获得上一次调度的解调结果，此时不能根据ACK/NACK结果进行调度处理。而现有技术中，假设上一次调度的解调结果为ACK，故在下一次调度时进行新数据的传输，若上一次调度的真实解调结果为NACK时，由于UE侧已经清空上一次调度的数据信息，故需要等待RLC ARQ机制启动来进行重传，传输时间明显增强，影响了用户的感知速率。
有鉴于此，本申请提供了一种上行数据调度方法，用于解决现有技术中解调结果上报不及时导致的用户感知速率损失的问题。
本申请中，为便于理解，将本申请中所涉及到的基站设定为分布式基站，该分布式基站包括BBU和RRU，且BBU与RRU之间存在传输时延。基于此，请参阅图1，为本申请实施例提供了一种上行数据调度方法的流程图，该方法具体包括：
101、UE通过RRU向BBU发送第一调度请求；
当UE需要发送上行数据时，为便于描述，本申请中，可将该上行数据称为第一协议数据单元(protocol data unit，PDU)时，通过RRU向BBU发送第一调度请求，即UE将该第一调度请求发送给RRU，再有RRU转发至BBU，其中该第一调度请求用于请求BBU为该第一PDU分配承载资源，实际应用中，该第一调度请求可以为增加请求(addition request)消息，也可以是其他现有消息或者新消息，具体本申请不做限定。
另外，PDU用于指对等层次之间传递的数据单位，例如，物理层的PDU为数据位(bit)，数据链路层的PDU是数据帧(frame)，网络层的PDU是数据包(packet)，传输层的PDU是数据段(segment)，其他更高层次的PDU是报文(message)。
102、BBU通过RRU向UE发送第一消息；
BBU接收到第一调度请求后，响应于该第一调度请求，经由RRU转发向UE发送第一消息，该第一消息中包括UE发送第一PDU所使用的资源调度信息，该发送第一PDU所使用的资源调度信息用于向UE指示无线资源的位置，该资源调度信息可以携带有为UE首次传输第一PDU分配的资源块序列号(resource block index，RB index)序列号或者RB位置，和调制编码方式(Modulation and Coding Scheme，MCS)。其中MCS的选择可以由BBU通过测量UE发送上行发送的数据获取，如根据数据中携带的上行参考信号做测量或者其他信号，具体此处不做限定。
可选的，该资源调度信息中还可包括BBU配置的资源调度周期，实际应用中，该资源调度周期为可选参数，若该BBU不将资源调度周期告知给UE，则BBU每次在调度资源之前都需向UE通知BBU调度资源的时刻。
可选的，该第一消息可以为与UE对应的UL grant，也可以是其他现有消息或者新消息，具体本申请不做限定。其中，UL grant可以携带有能够被UE唯一识别的预定信息以及指定给该UE发送上行数据的专用资源，以及调制与编码策略(modulation and coding scheme，MCS)等调度信息，使得UE能够根据预定信息识别出自己的UL grant，并在该UL grant中指定的专用资源上发送上行数据。另外，该UL grant可以来自动态调度的PDCCH，或来自RAR，或通过半静态配置。
需要说明的是，由于BBU与RRU之间存在传输时延，本申请中，设BBU在T时刻使用第一HARQ进程进行PDU1的新传调度，向RRU发送第一消息，RRU在T+s时刻接收到该第一消息，进而转发给UE，本申请中，假定RRU与UE之间不存在传输时延，故UE也在T+s时刻接收到第一消息，其中s即为BBU与RRU之间的传输时延，实际应用中，s的取值可以为2ms、3ms或者4ms等，具体此处不做限定。
103、UE通过RRU向BBU发送第一PDU；
UE在T+s时刻接收到第一消息后，获得该第一消息中包含的用于传输第一PDU的资源调度信息，由于该资源调度信息中包括MCS和RB index或者RB位置，故UE从该资源调度信息中的内容确定了BBU分配的无线资源的时频位置以及MCS，故UE基于该资源调度信息在BBU指定的时频资源处，按照BBU分配的MCS向BBU发送第一PDU，需要说明的是，UE侧还存在处理延时p，即UE在T+s时刻接收到第一消息后，在T+s+p时刻发送第一PDU到 RRU，使得RRU在T+s+p时刻接收到该第一PDU后，将该第一PDU转发至BBU，可以理解的是，BBU收到该第一PDU的时刻为T+2s+p。另外，协议中规定，UE侧的处理延时p可为4ms。
104、BBU通过RRU向UE发送第二消息；
如图2所示，为本申请提供的一种可能的HARQ进程示意图，其中数字1-8表示各循环周期内的8个并行的HARQ进程，各并行的HARQ进程相互独立，且字母A用于表示确认应答ACK，字母N用于表示否定应答NACK，基站向UE发送数据，并根据UE的反馈进行重传或者传输新数据，如图所示，在第一个循环周期内，基站通过进程3向UE发送数据，并在第二个循环周期之前接收到UE反馈的ACK，故基站在第二个循环周期通过进程3向UE发送新数据，并在第三个循环周期之前接收到UE反馈的NACK，故基站在第三个循环周期通过进程3向UE发送新数据的重传数据。
因此，由于BBU与RRU之间存在传输时延，且UE侧存在处理时延，故在BBU在T时刻通过第一进程发送第一消息后，在下一个循环周期，BBU可能无法获得T时刻的译码结果，故不能进行调度处理。因此，BBU在T+m时刻通过RRU向UE发送第二消息，其中m为HARQ进程的循环周期，实际应用中，m的取值可以为8ms或者10ms，或者其他数值，具体此处不做限定。且该第二消息携带有用于第一PDU的默认译码结果，且默认译码结果为ACK，且第二消息包括发送第二PDU所使用的资源调度信息，需要说明的是，在发送该第二消息之前，BBU通过接收UE发送的第二调度请求来为第二PDU分配承载资源，并将配置好的用于发送第二PDU所使用的资源调度信息携带于第二消息中，该过程与本申请中的步骤101到102类似，具体此处不再赘述。
可选的，该第二消息也可以为与UE对应的新传grant，也可以是其他现有消息或者新消息，具体本申请不做限定。
可以理解的是，BBU在T+m时刻经由RRU转发向UE发送第二消息，由于BBU与RRU间的传输时延s，故RRU在T+m+s时刻收到该第二消息，并转发至UE，且UE在T+m+s时刻收到该第二消息后，虽然其中包括对第一PDU的默认译码结果，但UE并不根据该默认译码结果清空第一PDU的数据。
105、BBU对第一PDU进行调制译码处理得到真实译码结果；
UE通过RRU向BBU发送第一PDU后，BBU在T+2s+p时刻收到该第一PDU，对该第一PDU进行调制译码处理以得到真实译码结果，可以理解的是，为了提高数据传输效率，降低误码率，实际应用中，发送端即本申请中的UE可以将第一PDU依次进行编码、调制、映射成帧、快速傅里叶逆变换和加循环前缀(cyclic prefix，CP)等操作，然后通过信道传输给接收端即本申请中的BBU，因此，对应的，BBU接收到UE发送的第一PDU后，对接收到的第一PDU依次进行去CP、快速傅里叶变换、数据抽取、信道估计、均衡、解调和译码处理。本申请中，对编码后的第一PDU进行调制译码处理可以采用现有的技术手段，具体本申请不再赘述。
需要说明的是，实际应用中，该调制译码处理的过程耗时可以为2.5ms～3.75ms，或者其他时长，具体此处不做限定。
106、BBU通过RRU向UE发送第三消息；
BBU得到真实译码结果后，可根据该真实译码结果在第三消息中新增真实译码结果指示(该操作需要协议支持或私有化协议)，例如可通过第三消息中的特定bit来携带该真实译码结果指示的信息，如，该特定bit为0时，表示译码正确，即用于第一PDU的反馈消息为ACK；该特定bit为1时，表示译码失败，即用于第一PDU的反馈消息为NACK。
另外，若译码结果表示译码失败时，BBU还需将该次调度数据量补偿回缓冲区，并进行PDU1的重传调度。可以理解为，BBU侧维护一个缓冲区，该缓冲区可包括调度UE请求发送数据所需要的调度数据量，BBU确定将数据调度完所需要的资源块的长度或者大小，可以理解的是，若调度错误则还需要再次进行调度。举例而言，如UE请求发送100个数据，BBU调度了其中10个数据后，缓冲区还剩下90个调度数据量，若被调度的10个数据译码正确，则继续调度UE请求发送的剩下90个数据；若被调度的10个数据译码错误，即表示发送失败，则BBU还需要调度该10个数据，因此要将调度该10个数据所用的调度数据量补偿回缓冲区以进行下一次调度。故译码失败时，第三消息中还包括重传该第一PDU所使用的资源调度信息，另外，该第三消息也可以为与UE对应的重传grant，也可以是其他现有消息或者新消息，具体此处不做限定。
另外，若真实译码结果表示译码正确，则BBU进行常规的操作，例如在下一个HARQ的循环周期通过第一HARQ进程进行新数据的调度。
需要说明的是，若BBU获得的真实译码结果为译码正确，BBU在第三消息中新增真实译码结果指示为可选操作，即UE在接收到第三消息的预置时长后，若仍未收到信息来指示BBU译码第一PDU失败，则UE确认上述默认译码结果即为真实译码结果，即基于第一PDU的反馈为ACK。
综上，BBU在T+A*m时刻通过第一HARQ进程将第三消息经由RRU发送给UE，以使得UE根据该第三消息中的真实译码结果指示确定是否清空第一PDU的数据，其中A为大于1的整数。
107、UE根据第三消息重传第一PDU；
BBU在T+A*m时刻将第三消息通过RRU发送给UE，基于BBU与RRU之间传输时延s的存在，UE在T+A*m+s时刻接收到该第三消息，若第三消息所携带的真实译码结果指示表示译码失败，则UE根据第三消息包括的重传第一PDU所使用的资源调度信息重传保留的第一PDU的数据。
108、UE根据第三消息清空第一PDU的数据。
BBU在T+A*m时刻将第三消息通过RRU发送给UE，基于BBU与RRU之间传输时延s的存在，UE在T+A*m+s时刻接收到该第三消息，若第三消息所携带的真实译码结果指示表示译码正确，则UE清空第一PDU的数据。
可选的，若BBU获得的真实译码结果表示译码正确时，BBU可以不在第三消息中新增真实译码结果指示，故UE在接收到第三消息的预置时长后，若仍未收到信息来指示BBU译码第一PDU失败，则UE确认基于第一PDU的反馈为ACK，进而清空第一PDU的数据，实际应用中，HARQ进程的循环周期为m时，该预置时长可以为5m或者6m等，具体此处不做限定。
本申请实施例中，利用新增真实译码结果的指示，UE收到真实译码指示后在进行历史数据清空，保证当实际解调结果为NACK时，仍然可以获取HARQ增益，解决了在RLC进行重传无法获取HARQ合并增益的问题，提升解调性能；另外，本申请中，初传CRC错误仍然会在介质访问控制(media access control，MAC)层重传，不用等待无线链路控制层协议(radio link control，RLC)重传机制启动，传输时间不会增益，从而避免了用户感知速率的损失。
为便于理解，下面结合具体的例子来说明本方案的主要内容，请参阅图3，为本申请实施例提供的一种可能的方案示意图，其中，假设BBU与RRU之间的传输时延s＝4ms，HARQ的循环周期m＝8ms，因此，该方案具体包括以下步骤：
步骤1、BBU在T+0ms时刻进行PDU1的新传调度，发送PDU1的资源调度信息至RRU(T+4)，RRU发送Grant至UE(T+4ms)，该Grant携带有PDU1的资源调度信息。UE根据PDU1的资源调度信息发送PDU1至RRU(T+8ms)，RRU回传至BBU(T+12ms)，BBU在T+12ms接收UE发送的PDU1并进行解调译码；
步骤2、BBU在T+8ms假设PDU1解调为ACK并进行PDU2的新传数据传输。RRU在T+12ms根据ACK信息进行处理，发送PDU1的译码结果ACK+新传Grant至UE，该新传Grant包括PDU2的资源调度信息，且该Grant携带有发送PDU1的译码结果ACK。此时UE不清空PDU1的数据；
步骤3、BBU在T+16ms根据获得的真实译码结果进行处理，如果译码正确，则进行常规处理；如果译码错误则将该次调度数据量补偿回缓冲区，并进行PDU1的重传调度，发送PDU1的真实译码结果NACK+重传Grant至UE，该重传Grant包括重传PDU1的资源调度信息。且BBU还在重传Grant里新增真实译码结果的指示(需要协议支持或私有化协议)，UE收到该真实译码结果指示后再进行PDU1数据的清空操作，若真实译码结果为NACK，则不清空PDU1的数据；若真实译码结果为ACK，则清空PDU1的数据。
上面对本申请实施例中上行数据调度方法进行了描述，下面对本申请实施例中的调度设备进行描述，请参阅图4，本申请实施例中调度设备的一个实施例包括：所述调度设备为第一设备，
收发单元401，用于在T时刻向用户设备发送第一消息，所述第一消息包括发送第一PDU所使用的资源调度信息；
若所述第一设备在T+m时刻未确定所述第一PDU的译码结果时，所述收发单元401还用于在所述T+m时刻向所述用户设备发送第二消息，所述第二消息携带有用于所述第一PDU的默认译码结果，所述默认译码结果为ACK，所述m为HARQ进程的循环周期；
确定单元402，用于根据接收到的第一PDU确定所述第一PDU的真实译码结果；
所述收发单元401还用于在所述T+A*m时刻向所述用户设备发送所述第三消息，所述第三消息携带有真实译码结果指示，以使得所述用户设备根据所述真实译码结果指示确定是否清空所述第一PDU的数据，所述A为大于1的整数。
在一种可行的实施方式中，所述收发单元401还用于接收所述用户设备发送的调度请求，所述调度请求用于请求所述第一设备为所述第一PDU分配无线资源。
在一种可行的实施方式中，所述调度设备还包括：
调度单元403，当所述真实译码结果表示译码失败时，用于调度所述第一PDU1的数据量补偿回缓冲区。
本申请实施例中还提供了一种用户设备，请参阅图5，本申请实施例中用户设备的一个实施例包括：
收发单元501，用于向第一设备发送第一PDU；
所述收发单元501，还用于接收所述第一设备发送的第一消息，所述第一消息携带有用于所述第一PDU的默认译码结果，所述默认译码结果为ACK；
确认单元502，用于确认所述第一设备对所述第一PDU的真实译码结果；
清空单元503，当所述真实调度结果表示译码正确，则用于清空所述第一PDU的数据。
在一种可行的实施方式中，所述确认单元502具体包括：
接收模块5021，用于接收所述第一设备发送的第二消息，所述第一消息携带有真实译码结果指示；
第一确定模块5022，用于根据所述真实译码结果指示确定所述真实译码结果。
在一种可行的实施方式中，所述确认单元502具体包括：
第二确定模块5023，所述收发单元接收到所述第一消息的预置时长后，用于确认所述默认译码结果为所述真实译码结果。
上面图4和图5从模块化功能实体的角度分别对本申请实施例中的调度设备和用户设备进行详细描述，下面从硬件处理的角度对本申请实施例中的调度设备和用户设备进行详细描述。请参阅图6，本申请实施例中调度设备的另一个实施例包括：
图6是本申请实施例提供的一种调度设备的结构示意图，该调度设备600可因配置或性能不同而产生比较大的差异，可以包括一个或一个以上处理器(central processing units，CPU)601(例如，一个或一个以上处理器)和存储器609，一个或一个以上存储应用程序607或数据606的存储介质608(例如一个或一个以上海量存储设备)。其中，存储器609和存储介质608可以是短暂存储或持久存储。存储在存储介质608的程序可以包括一个或一个以上模块(图示没标出)，每个模块可以包括对调度设备中的一系列指令操作。更进一步地，处理器601可以设置为与存储介质608通信，在调度设备600上执行存储介质608中的一系列指令操作。
调度设备600还可以包括一个或一个以上电源602，一个或一个以上有线或无线网络接口603，一个或一个以上输入输出接口604，和/或，一个或一个以上操作系统605，例如Windows Server，Mac OS X，Unix，Linux，FreeBSD等等。本领域技术人员可以理解，图6中示出的调度设备结构并不构成对调度设备的限定，可以包括比图示更多或更少的部件，或者组合某些部件，或者不同的部件布置。
下面结合图6对调度设备的各个构成部件进行具体的介绍：
存储器609可用于存储软件程序以及模块，处理器601通过运行存储在存储器609的软件程序以及模块，从而执行调度设备的各种功能应用以及数据处理。存储器609可主要包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的 应用程序(比如广播功能)等；存储数据区可存储根据支付平台的使用所创建的数据(比如转账路径列表等)等。此外，存储器609可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件、或其他易失性固态存储器件。在本申请实施例中重传调度的程序和接收到的数据存储在存储器609中，当需要使用时，处理器601从存储器609中调用。
处理器601是调度设备的控制中心，可以按照设置的重传调度方法进行重传调度。处理器601利用各种接口和线路连接整个调度设备的各个部分，通过运行或执行存储在存储器609内的软件程序和/或模块，以及调用存储在存储器609内的数据，执行调度设备的各种功能和处理数据，从而解决现有技术中传输时间长，从而影响用户的感知速率的问题。
图7是本申请实施例提供的一种用户设备的结构示意图，该用户设备700可因配置或性能不同而产生比较大的差异，可以包括一个或一个以上处理器(central processing units，CPU)701(例如，一个或一个以上处理器)和存储器709，一个或一个以上存储应用程序707或数据706的存储介质708(例如一个或一个以上海量存储设备)。其中，存储器709和存储介质708可以是短暂存储或持久存储。存储在存储介质708的程序可以包括一个或一个以上模块(图示没标出)，每个模块可以包括对用户设备中的一系列指令操作。更进一步地，处理器701可以设置为与存储介质708通信，在用户设备700上执行存储介质708中的一系列指令操作。
用户设备700还可以包括一个或一个以上电源702，一个或一个以上有线或无线网络接口703，一个或一个以上输入输出接口704，和/或，一个或一个以上操作系统705，例如Windows Server，Mac OS X，Unix，Linux，FreeBSD等等。本领域技术人员可以理解，图7中示出的用户设备结构并不构成对用户设备的限定，可以包括比图示更多或更少的部件，或者组合某些部件，或者不同的部件布置。
下面结合图7对用户设备的各个构成部件进行具体的介绍：
存储器709可用于存储软件程序以及模块，处理器701通过运行存储在存储器709的软件程序以及模块，从而执行基站的各种功能应用以及数据处理。存储器709可主要包括存储程序区和存储数据区，其中，存储程序区可存储操作系统、至少一个功能所需的应用程序(比如广播功能)等；存储数据区可存储根据支付平台的使用所创建的数据(比如转账路径列表等)等。此外，存储器709可以包括高速随机存取存储器，还可以包括非易失性存储器，例如至少一个磁盘存储器件、闪存器件、或其他易失性固态存储器件。在本申请实施例中重传调度的程序和接收到的数据存储在存储器709中，当需要使用时，处理器701从存储器709中调用。
处理器701是基站的控制中心，可以按照设置的重传调度方法进行重传调度。处理器701利用各种接口和线路连接整个用户设备的各个部分，通过运行或执行存储在存储器709内的软件程序和/或模块，以及调用存储在存储器709内的数据，执行用户设备的各种功能和处理数据，从而解决现有技术中传输时间长，从而影响用户的感知速率的问题。
所属领域的技术人员可以清楚地了解到，为描述的方便和简洁，上述描述的系统，装置和单元的具体工作过程，可以参考前述方法实施例中的对应过程，在此不再赘述。
在本申请所提供的几个实施例中，应该理解到，所揭露的系统，装置和方法，可以通过其它的方式实现。例如，以上所描述的装置实施例仅仅是示意性的，例如，所述单元的划分，仅仅为一种逻辑功能划分，实际实现时可以有另外的划分方式，例如多个单元或组件可以结合或者可以集成到另一个系统，或一些特征可以忽略，或不执行。另一点，所显示或讨论的相互之间的耦合或直接耦合或通信连接可以是通过一些接口，装置或单元的间接耦合或通信连接，可以是电性，机械或其它的形式。
所述作为分离部件说明的单元可以是或者也可以不是物理上分开的，作为单元显示的部件可以是或者也可以不是物理单元，即可以位于一个地方，或者也可以分布到多个网络单元上。可以根据实际的需要选择其中的部分或者全部单元来实现本实施例方案的目的。
另外，在本申请各个实施例中的各功能单元可以集成在一个处理单元中，也可以是各个单元单独物理存在，也可以两个或两个以上单元集成在一个单元中。上述集成的单元既可以采用硬件的形式实现，也可以采用软件功能单元的形式实现。
所述集成的单元如果以软件功能单元的形式实现并作为独立的产品销售或使用时，可以存储在一个计算机可读取存储介质中。基于这样的理解，本申请的技术方案本质上或者说对现有技术做出贡献的部分或者该技术方案的全部或部分可以以软件产品的形式体现出来，该计算机软件产品存储在一个存储介质中，包括若干指令用以使得一台计算机设备(可以是个人计算机，服务器，或者网络设备等)执行本申请各个实施例所述方法的全部或部分步骤。而前述的存储介质包括：U盘、移动硬盘、只读存储器(Read-Only Memory，ROM)、随机存取存储器(Random Access Memory，RAM)、磁碟或者光盘等各种可以存储程序代码的介质。
以上所述，以上实施例仅用以说明本申请的技术方案，而非对其限制；尽管参照前述实施例对本申请进行了详细的说明，本领域的普通技术人员应当理解：其依然可以对前述各实施例所记载的技术方案进行修改，或者对其中部分技术特征进行等同替换；而这些修改或者替换，并不使相应技术方案的本质脱离本申请各实施例技术方案的精神和范围。

Claims (18)

  1. 一种上行数据调度方法，其特征在于，包括：
    第一设备在T时刻向用户设备发送第一消息，所述第一消息包括发送第一PDU所使用的资源调度信息；
    若所述第一设备在T+m时刻未确定所述第一PDU的译码结果时，所述第一设备在所述T+m时刻向所述用户设备发送第二消息，所述第二消息携带有用于所述第一PDU的默认译码结果，所述默认译码结果为ACK，所述m为HARQ进程的循环周期；
    第一设备根据接收到的第一PDU确定所述第一PDU的真实译码结果；
    第一设备在所述T+A*m时刻向所述用户设备发送所述第三消息，所述第三消息携带有真实译码结果指示，以使得所述用户设备根据所述真实译码结果指示确定是否清空所述第一PDU的数据，所述A为大于1的整数。
  2. 根据权利要求1所述的上行数据调度方法，其特征在于，第一设备在T时刻向用户设备发送第一消息之前，所述方法还包括：
    所述第一设备接收所述用户设备发送的调度请求，所述调度请求用于请求所述第一设备为所述第一PDU分配无线资源。
  3. 根据权利要求1所述的上行数据调度方法，其特征在于，所述第一设备根据接收到的第一PDU确定所述第一PDU的真实译码结果后，所述方法还包括：
    当所述真实译码结果表示译码失败时，所述第一设备调度所述第一PDU1的数据量补偿回缓冲区。
  4. 根据权利要求1所述的上行数据调度方法，其特征在于，当所述真实译码结果表示译码失败时，所述第三消息还包括重传所述第一PDU所使用的资源调度信息。
  5. 一种上行数据调度方法，其特征在于，包括：
    用户设备向第一设备发送第一PDU；
    所述用户设备接收所述第一设备发送的第一消息，所述第一消息携带有用于所述第一PDU的默认译码结果，所述默认译码结果为ACK；
    所述用户设备确认所述第一设备对所述第一PDU的真实译码结果；
    当所述真实调度结果表示译码正确，则所述用户设备清空所述第一PDU的数据。
  6. 根据权利要求5所述的上行数据调度方法，其特征在于，所述用户设备确认所述第一设备对所述第一PDU的真实译码结果包括：
    所述用户设备接收所述第一设备发送的第二消息，所述第一消息携带有真实译码结果指示；
    所述用户设备根据所述真实译码结果指示确定所述真实译码结果。
  7. 根据权利要求6所述的上行数据调度方法，其特征在于，当所述真实调度结果表示译码失败，则所述第二消息还包括重传所述第一PDU所使用的资源调度信息。
  8. 根据权利要求5所述的上行数据调度方法，其特征在于，所述用户设备确认所述第一设备对所述第一PDU的真实译码结果包括：
    所述用户设备接收到所述第一消息的预置时长后，确认所述默认译码结果为所述真实译码结果。
  9. 一种调度设备，所述调度设备为第一设备，其特征在于，包括：
    收发单元，用于在T时刻向用户设备发送第一消息，所述第一消息包括发送第一PDU所使用的资源调度信息；
    若所述第一设备在T+m时刻未确定所述第一PDU的译码结果时，所述收发单元还用于在所述T+m时刻向所述用户设备发送第二消息，所述第二消息携带有用于所述第一PDU的默认译码结果，所述默认译码结果为ACK，所述m为HARQ进程的循环周期；
    确定单元，用于根据接收到的第一PDU确定所述第一PDU的真实译码结果；
    所述收发单元还用于在所述T+A*m时刻向所述用户设备发送所述第三消息，所述第三消息携带有真实译码结果指示，以使得所述用户设备根据所述真实译码结果指示确定是否清空所述第一PDU的数据，所述A为大于1的整数。
  10. 根据权利要求9所述的调度设备，其特征在于，所述调度设备还包括：
    所述收发单元还用于接收所述用户设备发送的调度请求，所述调度请求用于请求所述第一设备为所述第一PDU分配无线资源。
  11. 根据权利要求9所述的调度设备，其特征在于，所述调度设备还包括：
    调度单元，当所述真实译码结果表示译码失败时，用于调度所述第一PDU1的数据量补偿回缓冲区。
  12. 根据权利要求9所述的调度设备，其特征在于，当所述真实译码结果表示译码失败时，所述第三消息还包括重传所述第一PDU所使用的资源调度信息。
  13. 一种用户设备，其特征在于，包括：
    收发单元，用于向第一设备发送第一PDU；
    所述收发单元，还用于接收所述第一设备发送的第一消息，所述第一消息携带有用于所述第一PDU的默认译码结果，所述默认译码结果为ACK；
    确认单元，用于确认所述第一设备对所述第一PDU的真实译码结果；
    清空单元，当所述真实调度结果表示译码正确，则用于清空所述第一PDU的数据。
  14. 根据权利要求13所述的用户设备，其特征在于，所述确认单元包括：
    接收模块，用于接收所述第一设备发送的第二消息，所述第一消息携带有真实译码结果指示；
    第一确定模块，用于根据所述真实译码结果指示确定所述真实译码结果。
  15. 根据权利要求14所述的用户设备，其特征在于，当所述真实调度结果表示译码失败，则所述第二消息还包括重传所述第一PDU所使用的资源调度信息。
  16. 根据权利要求13所述的用户设备，其特征在于，所述确认单元包括：
    第二确定模块，所述收发单元接收到所述第一消息的预置时长后，用于确认所述默认译码结果为所述真实译码结果。
  17. 一种计算机可读存储介质，包括指令，当其在计算机上运行时，使得计算机执行如权利要求1-8任意一项所述的方法。
  18. 一种包含指令的计算机程序产品，当其在计算机上运行时，使得计算机执行如权利要求1-8任意一项所述的方法。
PCT/CN2018/123206 2017-12-26 2018-12-24 一种上行数据调度方法以及相关设备 WO2019128937A1 (zh)

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201711441069.8 2017-12-26
CN201711441069.8A CN108337072A (zh) 2017-12-26 2017-12-26 一种上行数据调度方法以及相关设备

Publications (1)

Publication Number Publication Date
WO2019128937A1 true WO2019128937A1 (zh) 2019-07-04

Family

ID=62923387

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2018/123206 WO2019128937A1 (zh) 2017-12-26 2018-12-24 一种上行数据调度方法以及相关设备

Country Status (2)

Country Link
CN (1) CN108337072A (zh)
WO (1) WO2019128937A1 (zh)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN108337072A (zh) * 2017-12-26 2018-07-27 上海华为技术有限公司 一种上行数据调度方法以及相关设备
WO2020133129A1 (zh) * 2018-12-28 2020-07-02 华为技术有限公司 一种信息传输的方法及装置

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101047481A (zh) * 2006-03-27 2007-10-03 中兴通讯股份有限公司 一种无线通信系统中自动重传请求分布式反馈方法
WO2013170464A1 (zh) * 2012-05-17 2013-11-21 华为技术有限公司 传输或接收上行sps业务数据的方法及用户设备、基站
CN103918210A (zh) * 2013-12-26 2014-07-09 华为技术有限公司 Phich信道传输信息的容错方法和装置
CN105262570A (zh) * 2015-10-26 2016-01-20 上海华为技术有限公司 一种数据的处理方法和基站以及用户设备
CN107154842A (zh) * 2017-07-19 2017-09-12 珠海市魅族科技有限公司 Harq反馈方法及harq反馈装置、网络侧设备和终端
CN108337072A (zh) * 2017-12-26 2018-07-27 上海华为技术有限公司 一种上行数据调度方法以及相关设备

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101047953B (zh) * 2006-03-30 2012-06-27 华为技术有限公司 一种对自动重传请求数据进行处理的方法
EP2036377A4 (en) * 2006-07-04 2012-07-25 Ericsson Telefon Ab L M BROADCAST AND MULTICAST ON HIGH SPEED DOWNLINK CHANNELS
KR101394784B1 (ko) * 2007-10-16 2014-05-15 엘지전자 주식회사 고속데이터 전송을 위한 ａｒｑ 과정의 수행방법
EP3048750B1 (en) * 2013-10-16 2019-12-04 Huawei Technologies Co., Ltd. Data transmission method, apparatus, and device
CN106330412B (zh) * 2015-06-25 2019-05-21 辰芯科技有限公司 利用harq ack/nack的rlc pdu发送方法及装置

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101047481A (zh) * 2006-03-27 2007-10-03 中兴通讯股份有限公司 一种无线通信系统中自动重传请求分布式反馈方法
WO2013170464A1 (zh) * 2012-05-17 2013-11-21 华为技术有限公司 传输或接收上行sps业务数据的方法及用户设备、基站
CN103918210A (zh) * 2013-12-26 2014-07-09 华为技术有限公司 Phich信道传输信息的容错方法和装置
CN105262570A (zh) * 2015-10-26 2016-01-20 上海华为技术有限公司 一种数据的处理方法和基站以及用户设备
CN107154842A (zh) * 2017-07-19 2017-09-12 珠海市魅族科技有限公司 Harq反馈方法及harq反馈装置、网络侧设备和终端
CN108337072A (zh) * 2017-12-26 2018-07-27 上海华为技术有限公司 一种上行数据调度方法以及相关设备

Also Published As

Publication number Publication date
CN108337072A (zh) 2018-07-27

Similar Documents

Publication Publication Date Title
US12040898B2 (en) Method and arrangement for retransmission using HARQ
CN108541360B (zh) 通信系统
US9507669B2 (en) Method of transmitting data using HARQ
JP5482900B2 (ja) 多地点協調伝送を用いて受信されるパケットに対するｎａｃｋ送信への遅延導入
US20090319850A1 (en) Local drop control for a transmit buffer in a repeat transmission protocol device
EP2670077A1 (en) Method and apparatus for data packet retransmission
US20130028189A1 (en) Method and apparatus for using physical layer error control to direct media access layer error control
JP2015188255A (ja) 移動端末の無線充電のための方法
KR20190097963A (ko) 무선 통신 시스템에서 데이터 송수신 방법 및 장치
EP2164202A1 (en) Method for automatic repeat request operation, transceiver arrangement, and computer program
WO2019128937A1 (zh) 一种上行数据调度方法以及相关设备
US11658892B2 (en) Ping latency optimization
CN104618075A (zh) Tti集束的传输处理方法及装置、网络侧设备、ue
WO2013170464A1 (zh) 传输或接收上行sps业务数据的方法及用户设备、基站
WO2017088920A1 (en) Error recovery mechanisms at lower layers of mobile communication systems

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: 18897832

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: 18897832

Country of ref document: EP

Kind code of ref document: A1