Method and device for downlink feedback indication processing
By receiving ACK/NACK indication in the downlink feedback indication signal and the minimum processing time duration in the 5G NR-U network, combined with the relative time position of the sub-packet, the uncertainty problem of the validity of ACK/NACK feedback in the time slot aggregation is solved. It realizes more accurate judgment of data transmission results and improves transmission reliability.
Patent Information
- Application Number
- CN202210693452.7
- Authority / Receiving Office
- CN · China
- Patent Type
- Patents(China)
- Current Assignee / Owner
- Filing Date
- 2019-09-24
- Publication Date
- 2024-11-26
- Estimated Expiration
- 2039-09-24
AI Technical Summary
In 5G NR-U network, in the case of time slot aggregation, there is uncertainty in determining the effectiveness of ACK/NACK feedback, especially the explanation of the smallest processing window covering different subpackets is unclear.
By receiving the ACK/NACK indication in the downlink feedback indication signal (DFI), the effective ACK/NACK feedback for the HARQ process is determined in combination with the minimum processing time duration and the relative time position of multiple subpackets. The specific method includes comparing time for the subpacket, satisfying a predetermined condition to determine the validity of the ACK/NACK indication, or making a judgment based on the minimum processing time in the RRC configuration or the DFI signal.
Eliminates the interpretation uncertainty of ACK/NACK feedback in time slot aggregation transmission, allowing user equipment to accurately determine the success or failure of the HARQ process, and improves the reliability and efficiency of data transmission.
Smart Images

Figure CN115250163B_ABST
Abstract
Description
[0001] This application is a divisional application of the PCT international patent application PCT / IB2019 / 001104 with an application date of September 24, 2019, which has entered the Chinese national phase with Chinese patent application number 201980099920.4 and the invention name being “Method and device for downlink feedback indication processing”. Technical Field
[0002] The invention relates to a method and a device for processing downlink feedback indication.
[0003] The present invention is applicable, for example, to the use of fifth generation new radio (5GNR) as a third generation mobile communication partnership project (3GPP) rd The present invention is applicable to a telecommunication system of a fifth generation (5G) network of a radio access technology (RAT) defined by the Third Generation Partnership Project (3GPP). The present invention is applicable to both a 5G NR in unlicensed spectrum (5G NR-U) and a 5G NR in licensed spectrum (5G NR). Background Art
[0004] Unlicensed spectrum corresponds to spectrum shared by different communication systems. As long as the regulatory requirements set by the country or region for the spectrum are met, communication devices in different communication systems can use the spectrum without applying for exclusive spectrum authorization from the government.
[0005] In order to allow various communication systems that use unlicensed spectrum for wireless communication to coexist in a friendly manner on the unlicensed spectrum, some countries or regions have stipulated regulatory requirements that must be met when using unlicensed spectrum. For example, communication equipment must follow the principle of "listen before talking (LBT)", that is, before the communication equipment transmits a signal on the channel of the unlicensed spectrum, it needs to perform channel listening first. Only when the LBT result shows that the channel is idle can the communication device perform signal transmission; otherwise, the communication device cannot perform signal transmission. In order to ensure fairness, once the communication device successfully occupies the channel, the transmission duration cannot exceed the maximum channel occupancy time (Maximum Channel Occupancy Time, MCOT).
[0006] On an unlicensed carrier, for the channel occupation time acquired by a base station (BS), the base station can share the channel occupation time with a user equipment (UE) for transmitting uplink signals or uplink channels. That is, when the base station shares its channel occupation time with the UE, the UE can use a higher priority LBT mode than that used by itself to acquire the channel, thereby acquiring the channel with a greater probability.
[0007] In NR Release 15 (Rel.15), in order to support ultra-low latency and high reliability services, configured grant (CG) transmission is supported for physical uplink shared channel (PUSCH) transmission. The concept of CG is that the base station configures the periodic uplink time and frequency resources. The necessary information for the UE to prepare for transmission through PUSCH and the necessary information for the base station to decode the data packets received through PUSCH are semi-statically configured, such as transport block size (TBS), modulation coding scheme (MCS), RV, time and frequency resources, period and number of repetitions. In addition, the hybrid automatic repeat request (HARQ) process ID is closely related to the periodic time and frequency resources and period.
[0008] Once the UE sends a CG-PUSCH in the configured resources (radio symbols), the UE will start a timer. Before the timer expires, if the UE receives a scheduling DCI scrambled with a specific RNTI and the same HARQ process ID, the UE will understand that the HARQ process in the previous CG-PUSCH has failed. Otherwise, the UE will assume that the HARQ process in the previous CG-PUSCH was successfully received by the base station.
[0009] Slot aggregation (also referred to as time slot aggregation in this patent) is introduced in 3GPP NR Rel.15 to enhance transmission reliability. The uplink data packet to be transmitted by the UE can be divided into multiple sub-packets corresponding to multiple redundant versions of the uplink data packet. The concept of time slot aggregation is that the same HARQ process will be repeated in multiple consecutive time slots with different redundant versions (RV) so that the receiver can perform combined decoding, thereby achieving more reliable transmission.
[0010] In the current NR-U discussion, according to the latest RAN1#98 protocol, for each configured HARQ process, there is a dedicated downlink feedback indication (DFI) including an acknowledgment indication (ACK / NACK).
[0011] In the case of slot aggregation, there is uncertainty as to which subpacket should be considered relative to the minimum processing window D to determine ACK / NACK validity.
[0012] Therefore, there seems to be a need to improve the situation regarding this uncertainty. Summary of the invention
[0013] The scope of protection sought by each embodiment of the present invention is defined by the independent claims. Each embodiment / example, aspect and feature (if any) described in the present invention specification that does not belong to the scope of the independent claims will be interpreted as an example useful for understanding each embodiment of the present invention.
[0014] According to a first aspect, a method for processing downlink feedback indications for a user equipment is provided. The method comprises: receiving a downlink feedback indication (DFI) signal from a base station, wherein the DFI signal comprises an ACK / NACK indication associated with a first HARQ process, the first HARQ process being defined for transmitting an uplink data packet to the base station using time slot aggregation, wherein transmitting an uplink data packet using time slot aggregation comprises transmitting a plurality of sub-packets to the base station using one or more wireless symbols through a plurality of physical uplink shared channels (PUSCHs) in a plurality of time slots; obtaining a minimum processing duration D corresponding to a minimum processing time required for the base station to process an uplink data packet; determining effective ACK / NACK feedback for the first HARQ process based on the ACK / NACK indication, the minimum processing duration D, and the relative time position of at least one of the plurality of sub-packets relative to the DFI signal.
[0015] In one or more embodiments, determining valid ACK / NACK feedback includes: determining whether the ACK / NACK indication is a valid ACK / NACK indication for the first HARQ process based on the ACK / NACK indication associated with the first HARQ process, the minimum processing duration D, and the relative time position of at least one subpacket of the multiple subpackets relative to the DFI signal; if the ACK / NACK indication is determined to be valid, using the ACK / NACK indication as valid ACK / NACK feedback.
[0016] In one or more embodiments, determining valid ACK / NACK feedback includes, when it is determined that the ACK / NACK indication is invalid: waiting for another DFI signal including another ACK / NACK indication for the first HARQ process; and determining valid ACK / NACK feedback for the first HARQ process based on the other ACK / NACK indication, the minimum processing duration D, and the relative time position of at least one subpacket of the multiple subpackets relative to the other DFI signal.
[0017] Determining whether the ACK / NACK indication is a valid ACK / NACK indication can be implemented in a variety of ways, including: performing a time comparison on one or more sub-packets to determine whether the relative time position of the sub-packet with respect to the DFI signal satisfies one or more predetermined conditions. Based on the result of the determination and / or the value of the ACK / NACK indication, it can be determined whether the ACK / NACK indication is a valid ACK / NACK.
[0018] In one or more embodiments, determining whether the ACK / NACK indication is a valid ACK / NACK indication includes: making a first determination of a relative time position of a last transmitted subpacket among the plurality of subpackets; and based on the first determination, the ACK / NACK indication is determined to be valid regardless of the value of the ACK / NACK indication. Making the first determination may include: determining a duration D between a transmission duration corresponding to the transmission of the last transmitted subpacket and a reception time corresponding to the reception of the DFI signal. last Greater than the minimum processing time D; or, determining that the transmission time corresponding to the transmission of the last sent sub-packet falls before the start time of the processing window, the duration of the processing window is equal to the minimum processing time D, and ends at the reception time corresponding to the received DFI signal.
[0019] In one or more embodiments, determining whether the ACK / NACK indication is a valid ACK / NACK indication includes: making a second determination of the relative time position of the subpacket sent for the first time among multiple subpackets; and based on the second determination, regardless of the value of the ACK / NACK indication, the ACK / NACK indication is determined to be invalid.
[0020] Making a second determination of the relative time position of the sub-packet transmitted for the first time among the plurality of sub-packets may include determining a duration D between a transmission time corresponding to the transmission of the sub-packet transmitted for the first time and a reception time corresponding to the reception of the DFI signal. first Less than the minimum processing time D; or, determining that the transmission time corresponding to the transmission of the sub-packet sent for the first time falls after the start time of the processing window, the duration of the processing window is equal to the minimum processing time D, and ends at the receiving time corresponding to the receiving DFI signal.
[0021] In one or more embodiments, determining whether the ACK / NACK indication is a valid ACK / NACK indication includes: making a third determination of the relative time position of the last subpacket sent among multiple subpackets and the first subpacket sent among the multiple subpackets; and based on the third determination, regardless of the value of the ACK / NACK indication, the ACK / NACK indication is determined to be valid.
[0022] In one or more embodiments, determining whether the ACK / NACK indication is a valid ACK / NACK indication includes: making a third determination of the relative time position of the last subpacket sent among multiple subpackets and the first subpacket sent among the multiple subpackets; based on the third determination, if the value of the ACK / NACK indication is ACK, determining that the ACK / NACK indication is valid, and if the ACK / NACK indication is NACK, determining that the ACK / NACK indication is invalid.
[0023] Making a third determination of the relative time position of the last transmitted subpacket of the plurality of subpackets and the first transmitted subpacket of the plurality of subpackets may include determining a duration D between a transmission time corresponding to the transmission of the last transmitted subpacket and a reception time corresponding to the reception of the DFI signal. last is less than the minimum processing time D, and determines the time D between the transmission time corresponding to the transmission of the sub-packet sent for the first time and the reception time corresponding to the reception of the DFI signal first Greater than the minimum processing time D; or, determining that the transmission time corresponding to the transmission of the last sent sub-packet falls after the start time of the processing window, the length of the processing window is equal to the minimum processing time D, and ends at the receiving time corresponding to the received DFI signal, and determining that the transmission time corresponding to the transmission of the first sent sub-packet falls before the start time of the processing window, the length of the processing window is equal to the minimum processing time D, and ends at the receiving time corresponding to the received DFI signal.
[0024] In one or more embodiments, determining whether the ACK / NACK indication is a valid ACK / NACK indication includes: making a second determination of a relative time position of a last transmitted subpacket of the plurality of subpackets; based on the second determination, the ACK / NACK indication is determined to be invalid regardless of the value of the ACK / NACK indication. Making the second determination of a relative time position of a last transmitted subpacket of the plurality of subpackets may include: determining a duration D between a transmission time corresponding to the transmission of the last transmitted subpacket and a reception time corresponding to the reception of the DFI signal. last Less than the minimum processing time D; or, determining that the transmission time corresponding to the transmission of the last sent sub-packet falls after the start time of the processing window, the duration of the processing window is equal to the minimum processing time D, and ends at the reception time corresponding to the received DFI signal.
[0025] In one or more embodiments, the transmission time corresponding to the sub-packet transmission is determined from the user equipment perspective based on the last wireless symbol used to transmit the relevant sub-packet; the reception time corresponding to the received DFI signal is determined from the user equipment perspective based on the first wireless symbol used to receive the DFI signal.
[0026] In one or more embodiments, the minimum processing time D is configured by the RRC or included in the DFI signal.
[0027] The embodiments presented here can be combined in various ways.
[0028] According to a second aspect, a device is provided comprising an apparatus for executing the method described in the first aspect. The device may include a transmitter for sending an uplink data packet using time slot aggregation; and a receiver for receiving a DFI signal from a base station. The device may include one or more processors and one or more memories including computer program codes, wherein the at least one memory and the computer program code are configured to cause the device to execute one or more steps of the method described in the first aspect through the at least one processor. The device may include a circuit for executing one or more steps of the method described in the first aspect.
[0029] According to a third aspect, a user equipment comprising the device according to the second aspect is provided.
[0030] According to another aspect, a computer readable medium including program instructions stored thereon is provided, for causing a device to execute the steps of the method described in the first aspect. The computer readable medium may be a non-transitory computer readable medium.
[0031] The present invention can be applied to wireless networks in unlicensed spectrum (also referred to as NR-U in the context of the 3GPP standard). More specifically, the present invention can be applied to any other wireless network in which a user equipment performs time slot aggregation and the minimum processing duration is defined by the base station processing the corresponding transmission. BRIEF DESCRIPTION OF THE DRAWINGS
[0032] Some embodiments will be described below by way of example only with reference to the accompanying drawings, in which:
[0033] Figure 1 Schematically illustrates a communication system in which one or more disclosed embodiments may be implemented;
[0034] Figure 2 is a flow chart of an exemplary embodiment of a method for downlink feedback indication processing;
[0035] Figure 3Ais a flow chart of an exemplary embodiment of a method for downlink feedback indication processing;
[0036] Figure 3B is a flow chart of an exemplary embodiment of a method for downlink feedback indication processing;
[0037] Figures 4A to 4D Various aspects of downlink feedback indication processing according to an example are shown;
[0038] Figure 5 is a block diagram of an apparatus according to an exemplary embodiment. DETAILED DESCRIPTION
[0039] The exemplary embodiments will be described below with reference to the functionality, designs, block diagrams, flow charts, state transition diagrams, and / or flowcharts illustrating methods, apparatus, systems, computer programs, and computer readable media according to one or more exemplary embodiments.
[0040] The present invention provides a method that enables a user equipment to eliminate interpretation ambiguity when performing timeslot aggregation transmission and receiving DFI, wherein the indicated minimum processing window covers different parts (different subpackets) of the aggregated timeslot.
[0041] When a UE receives a DFI signal including ACK / NACK indications for multiple subpackets of a given HARQ process belonging to a timeslot aggregation (i.e., one HARQ process ID is shared with more than one PUSCH in different timeslots), the UE may determine valid ACK / NACK feedback in at least one of the following ways.
[0042] The UE determines the effective ACK / NACK feedback of the relevant HARQ process through the first subpacket belonging to the HARQ process, the minimum processing time D (also referred to as the minimum processing window D here) and the ACK / NACK for the above HARQ process. The minimum processing time D can be configured by RRC or indicated in the received DFI signal. If the minimum processing window D is semi-statically configured, the base station will not be able to flexibly prioritize the CPU processing for some important services.
[0043] The first subpacket via PUSCH is any subpacket belonging to the HARQ process, wherein the relative time position of the first subpacket with respect to the DFI signal satisfies a predetermined condition. For example, the first subpacket is any subpacket belonging to the HARQ process, and from the perspective of the UE, the duration between the last symbol used to transmit the subpacket and the first symbol used to receive the DFI signal is greater than the minimum processing duration D. In practice, it is sufficient to determine the duration for the first subpacket corresponding to the last subpacket sent. Figure 3A-3B as well as Figures 4A-4D Exemplary embodiments are described. Figures 4A-4D Each sub-packet HARQ0-PUSCH3 in corresponds to the last sub-packet sent.
[0044] If the first subpacket is present, the UE determines the ACK / NACK feedback directly with reference to the ACK / NACK indication (valid ACK / NACK indication). If the first PUSCH is not present, the UE determines that the feedback is invalid (invalid ACK / NACK indication). In one or more embodiments, the first subpacket is the last subpacket sent: in this case, if the determined duration is greater than the minimum processing duration, all other durations associated with other subpackets will also be greater than the minimum processing duration.
[0045] The UE determines ACK / NACK feedback through the second subpacket sent by the PUSCH and the ACK / NACK indication associated with the HARQ process.
[0046] The second subpacket is any subpacket belonging to the HARQ process, wherein the relative time position of the first subpacket relative to the received DFI signal satisfies another predetermined condition. For example, the second subpacket is any subpacket belonging to the HARQ process, and from the perspective of the UE, the duration between the last symbol used to transmit the subpacket and the first symbol used to receive the DFI signal is less than the minimum processing duration D. In fact, it is sufficient to determine the duration for the second subpacket corresponding to the subpacket sent for the first time. Figure 3A-3B as well as Figures 4A-4D Exemplary embodiments are described. Figures 4A-4D Each sub-packet HARQ0-PUSCH0 in corresponds to a sub-packet sent for the first time.
[0047] If the above-mentioned second PUSCH exists, if the ACK / NACK indication shows ACK, the UE determines that the ACK feedback is valid, and if the ACK / NACK indication shows NACK, the UE determines that the feedback is invalid.
[0048] If the above-mentioned second PUSCH does not exist, the UE directly refers to the ACK / NACK indication (valid ACK / NACK indication) to determine the ACK / NACK feedback.
[0049] Figure 1An example system 100 is shown according to some exemplary embodiments. The system 100 includes a base station 110 and one or more user devices 120 having wireless cell coverage of the base station. In this example, the base station 110 can be configured according to 5G (with, for example, NR, new air interface) or LTE. Although some examples herein relate to certain types of base stations, such as 5G base stations and LTE base stations, other types of base stations may also be used, including femtocell base stations, home eNB base stations, picocell base stations, small cell base stations, and / or other wireless access points. In addition, although some examples herein relate to certain types of wireless access technologies, such as 5G, NR, and LTE, other types of wireless technologies may also be used.
[0050] Figure 2 is a flow chart of an exemplary method for downlink feedback indication processing.
[0051] The steps of the method may be implemented by a device in a user equipment described in any example herein. The user equipment is served by a base station in a wireless network.
[0052] Although described in terms of these steps being sequential, those skilled in the art will appreciate that some steps may be omitted, combined, performed in a different order, and / or performed in parallel.
[0053] In step 200, the UE uses time slot aggregation to send an uplink data packet to the base station, that is, the UE sends multiple subpackets in multiple time slots through multiple physical uplink shared channels (PUSCH) and using one or more wireless symbols. It is assumed that each of the multiple subpackets belongs to the first HARQ process.
[0054] In step 210, the UE receives a downlink feedback indication DFI signal from the base station. The DFI signal includes an ACK / NACK indication associated with the first HARQ process.
[0055] In step 220, the UE obtains a minimum processing time D corresponding to the minimum processing time required by the base station to process an uplink data packet. The minimum processing time D can be configured through radio resource control (RRC) or included in a DFI signal. The minimum processing time D can be configured for one or more uplink data packets or one or more HARQ processes.
[0056] In step 230, the UE determines the relative time position (or time relationship) of at least one of the multiple subpackets relative to the DFI signal. For example, for the subpacket sent for the first time and / or the subpacket sent for the last time. The UE performs one or more time comparisons on the selected subpackets to determine whether the relative time position meets one or more predetermined conditions. For example, the UE performs one or more time comparisons to determine the relative time position (time relationship) between the transmission time corresponding to the transmission of one or more subpackets and the reception time corresponding to the reception of the DFI signal. For each subpacket belonging to the first HARQ process, a time comparison is performed based on the minimum processing duration D, the reception time corresponding to the reception of the DFI signal, and the transmission time corresponding to the transmission of the relevant subpacket. The time comparison can be performed in different ways.
[0057] In a first embodiment, the time comparison is performed based on a processing window. The processing window is a window having a duration equal to the minimum processing duration D and ending at a reception time corresponding to the reception of the DFI signal. The reception time corresponding to the reception of the DFI signal can be determined from the perspective of the UE based on the first wireless symbol used to receive the DFI signal. In this first embodiment, the time comparison for the subpacket includes: obtaining a start time corresponding to the start time of the processing window; comparing the start time corresponding to the start time of the processing window with the transmission time corresponding to the transmission of the relevant subpacket. Comparing the start time corresponding to the start time of the processing window with the transmission time corresponding to the transmission of the relevant subpacket includes: determining whether the transmission time falls after the start time of the processing window (thus within the processing window, because the processing window occurs after the start time of the subpacket transmission), or before the start time of the processing window, or at the start time of the processing window.
[0058] In a second embodiment, a time comparison is performed based on the determination of a duration. For a subpacket, the duration is determined as the difference between the transmission time corresponding to the transmission subpacket and the reception time corresponding to the reception of the DFI signal. More precisely, from the UE perspective, the duration determined for the subpacket can be determined as: the duration between the last wireless symbol used for the transmission of the relevant subpacket and the first wireless symbol used for the reception of the DFI signal. In this second embodiment, the time comparison for the subpacket includes: for the relevant subpacket, obtaining (determining) the duration as the difference between the transmission time corresponding to the subpacket transmission and the reception time corresponding to the reception of the DFI signal; comparing the duration obtained for the relevant subpacket with the minimum processing duration D. Comparing the duration obtained for the relevant subpacket with the minimum processing duration D includes determining whether the duration is greater than, less than or equal to the minimum processing duration D.
[0059] Each of the first and second embodiments can achieve the same comparison results for the identification of existing time relationships, so the embodiments can be interchanged. For example, when the transmission time falls after the start time of the processing window (i.e., falls inside the processing window), this corresponds to the same time relationship as when the duration is less than the minimum processing duration D. For example, when the transmission time falls before the start time of the processing window, this corresponds to the same time relationship as when the duration is greater than the minimum processing duration D. Similarly, when the transmission time falls at the start time of the processing window, this corresponds to the same time relationship as when the duration is equal to the minimum processing duration D.
[0060] In step 230, the UE performs a time comparison for each of the one or more subpackets to determine whether the relative time position of the relevant subpacket with respect to the DFI signal satisfies one or more predetermined conditions. As explained, the time comparison may be performed based on a duration or a processing window.
[0061] In step 240, the UE determines valid ACK / NACK feedback for the first HARQ process based on the ACK / NACK indication associated with the first HARQ process, the minimum processing duration D, and the relative time position of the one or more subpackets relative to the DFI signal. In one example, the UE determines valid ACK / NACK feedback for the first HARQ process based on the ACK / NACK indication associated with the first HARQ process and the result of the time comparison performed in step 230 for the one or more subpackets belonging to the first HARQ process.
[0062] The determination of valid ACK / NACK feedback may include determining whether the ACK / NACK indication is a valid ACK / NACK indication for the first HARQ process based on the ACK / NACK indication associated with the first HARQ process, the minimum processing duration D, and the relative time position of at least one of the plurality of subpackets relative to the DFI signal. Whether the ACK / NACK indication is a valid ACK / NACK indication for the first HARQ process may be determined based on the ACK / NACK indication associated with the first HARQ process and the result of the time comparison performed in step 230 for one or more subpackets belonging to the first HARQ process.
[0063] In one or more embodiments, if the ACK / NACK indication is determined to be valid, the received ACK / NACK indication is used as valid ACK / NACK feedback. Otherwise, if the ACK / NACK indication is determined to be invalid, the UE waits for another DFI signal including another ACK / NACK indication (next ACK / NACK indication) for the first HARQ process. The UE then performs another time comparison for each of the one or more subpackets belonging to the first HARQ process to determine whether the relative time position of the relevant subpacket relative to the other DFI signal satisfies one or more predetermined conditions (as in step 230, but using another DFI signal).
[0064] The UE then determines valid ACK / NACK feedback for the first HARQ process based on the other ACK / NACK indication associated with the first HARQ process, the minimum processing duration D, and the relative time position of one or more subpackets relative to the other DFI signal. In an example, the UE determines valid ACK / NACK feedback for the first HARQ process based on the result of the other time comparison and the other ACK / NACK indication (similar to step 240, but using the result of another time comparison based on the related subpacket transmission and the other DFI signal).
[0065] An example method for determining valid ACK / NACK feedback will now be described. The method for determining whether an ACK / NACK indication is a valid ACK / NACK indication may be used, for example, in steps 230 and 240. The method for determining valid ACK / NACK feedback may include determining a duration D between a transmission time corresponding to the transmission of the last transmitted subpacket and a reception time corresponding to the reception of the DFI signal. last Is it greater than the minimum processing time D? If the time D last is greater than (or equal to) the minimum processing duration D, then the ACK / NACK indication is determined to be valid regardless of the value of the ACK / NACK indication. Otherwise, if the duration D last If the ACK / NACK indication is less than (or equal to) the minimum processing duration D, then the ACK / NACK indication is determined to be invalid regardless of the value of the ACK / NACK indication. In this example, the identification of the time relationship between the transmission of the sub-packet and the reception of the DFI signal and the associated time comparison are performed based on the duration, but as explained above, the identification and time comparison can also be achieved using a time comparison based on a processing window.
[0066] Figure 3Ais a flow chart of another exemplary method for determining valid ACK / NACK feedback. The steps of the method may be implemented to determine whether an ACK / NACK indication is a valid ACK / NACK indication and may be used, for example, in steps 230 and 240.
[0067] The steps of the method may be implemented by a device in a user equipment in any example described herein. The user equipment is served by a base station in a wireless network.
[0068] Although described in these step order modes, it will be appreciated by those skilled in the art that some steps may be omitted, combined, performed in a different order and / or in parallel. For example, the order of the tests of step 310, step 320, and step 330 may be changed, such as starting with the test described in step 320 or step 330.
[0069] Here, the identification of the temporal relationship between the transmission of the sub-packets and the reception of the DFI signal and the associated temporal comparison are performed based on duration, but the method steps may also be implemented using a processing window based temporal comparison, as described above.
[0070] In step 300, the user equipment receives a DFI signal from the base station. A first duration D between the transmission of the last sub-packet sent among the plurality of sub-packets and the reception of the DFI signal is determined. last Determine a second time duration D between the transmission of the first sub-packet sent among the plurality of sub-packets and the reception of the DFI signal first .
[0071] In step 310, a first duration D is determined. last Is it greater than the minimum processing time D? If the first time D last If the first processing duration D is greater than the minimum processing duration D, then the ACK / NACK indication is determined to be valid regardless of the value of the ACK / NACK indication (step 310A). last is less than the minimum processing time D, then step 320 is performed after step 310. If the first time D is determined in step 310 last If the processing time is equal to the minimum processing time D, then one of step 310A and step 320 may be executed after step 310 .
[0072] In step 320, a first duration D is determined. last Less than (or equal to) the minimum processing time D. In step 320, determine the second time D first Is it greater than the minimum processing time D? If the first time D last Less than (or equal to) the minimum processing time D and the second time D firstIf the second processing time D is greater than the minimum processing time D, then step 325 is performed after step 320. Otherwise, if the second processing time D first is less than the minimum processing time D, then step 330 is performed after step 320. If the second time D is determined in step 320 first If the processing time is equal to the minimum processing time D, then one of step 325 and step 330 may be executed after step 320 .
[0073] In step 325, it is determined whether the value of the ACK / NACK indication is equal to ACK. In step 325, if the value of the ACK / NACK indication is ACK, it is determined that the ACK / NACK indication is valid (step 325A), and if the value of the ACK / NACK indication is NACK, it is determined that the ACK / NACK indication is invalid (step 325B).
[0074] In step 330, a first duration D is determined. last Less than (or equal to) the minimum processing time D and the second time D first is less than (or equal to) the minimum processing duration D. In step 330, the ACK / NACK indication is determined to be invalid regardless of the value of the ACK / NACK indication.
[0075] Figure 3B is a flow chart of another exemplary method for determining valid ACK / NACK feedback. The steps of the method may be implemented to determine whether an ACK / NACK indication is a valid ACK / NACK indication and may be used, for example, in step 240.
[0076] The steps of the method may be implemented by a device in a user equipment in any example described herein. The user equipment is served by a base station in a wireless network.
[0077] Although described in these step order modes, it will be appreciated by those skilled in the art that some steps may be omitted, combined, performed in a different order and / or in parallel. For example, the order of the tests of step 350, step 360, and step 380 may be changed, such as starting with the test described in step 360 or step 380.
[0078] Here, the identification of the temporal relationship between the transmission of the sub-packets and the reception of the DFI signal and the associated temporal comparison are performed based on duration, but the method steps may also be implemented using a processing window based temporal comparison, as described above.
[0079] In step 350, the user equipment receives a DFI signal from the base station. A first duration D between the transmission of the last sub-packet sent among the plurality of sub-packets and the reception of the DFI signal is determined. lastDetermine a second time duration D between the transmission of the first sub-packet sent among the plurality of sub-packets and the reception of the DFI signal first .
[0080] In step 360, a first duration D is determined. last Is it greater than the minimum processing time D? If the first time D last If the first processing duration D is greater than the minimum processing duration D, then the ACK / NACK indication is determined to be valid regardless of the value of the ACK / NACK indication (step 360A). last is less than the minimum processing time D, then step 370 is performed after step 360. If the first time D is determined in step 360 last If the processing time is equal to the minimum processing time D, then one of step 360A and step 370 may be executed after step 360 .
[0081] In step 370, a first duration D is determined. last Less than (or equal to) the minimum processing time D. In step 370, determine the second time D first Is it greater than the minimum processing time D? If the first time D last Less than (or equal to) the minimum processing time D and the second time D first If the second processing time D is greater than the minimum processing time D, then the ACK / NACK indication is determined to be valid regardless of the value of the ACK / NACK indication (step 370A). first is less than the minimum processing time D, then step 380 is performed after step 370. If the second time D is determined in step 370 first If it is equal to the minimum processing time D, then one of step 370A and step 380 can be executed after step 370.
[0082] In step 380, a first duration D is determined. last Less than (or equal to) the minimum processing time D and the second time D first is less than (or equal to) the minimum processing duration D. In step 380, the ACK / NACK indication is determined to be invalid regardless of the value of the ACK / NACK indication.
[0083] Now refer to Figures 4A to 4D Describe examples. In these examples, we assume that the UE has sent a slot-aggregated PUSCH transmission using K=3 aggregated slots, and HARQ process ID=0. Then, the UE will receive a DFI signal, where the DFI signal includes an ACK / NACK indication for HARQ process ID=0 and a minimum processing window D (D may be indicated in the DFI signal or configured by RRC). Then the following situation may occur. Figures 4A to 4DEach of the accompanying drawings shows a processing window having a duration equal to the minimum processing duration D: the end moment of this processing window falls on the reception moment of the DFI signal. Figures 4A to 4D Each of the accompanying drawings shows 3 sub-packets HARQ0-PUSCH0 to HARQ0-PUSCH3.
[0084] Case 1: As Figure 4A shown, all aggregated time slots, that is, K PUSCHs are located outside the minimum processing window. This case corresponds to the previously described step 310A and step 360A. Here, 3 aggregated time slots are located outside the minimum processing window D.
[0085] In Case 1, when the UE obtains the DFI signal and the D value, it finds that all the aggregated K time slots are located outside the minimum processing window D. Therefore, the UE will determine that the ACK / NACK indication for HARQ process ID = 0 in the DFI signal is valid. When the DFI signal indicates ACK, it means that the HARQ process ID = 0 is well received by the base station; or when the DFI indicates NACK, it means that the HARQ process ID = 0 is not correctly received by the base station.
[0086] Case 2: As Figure 4B shown, among the aggregated time slots (K PUSCHs), only M PUSCHs (0 < M < K) are located outside the minimum processing window D and K - M PUSCHs are located within the minimum processing window D, and the DFI signal indicates ACK. This case corresponds to the previously described step 325A. In Figure 4B it, M = 2 aggregated time slots HARQ0-PUSCH1 and HARQ0-PUSCH2 are located outside the minimum processing window D.
[0087] In Case 2, when the UE obtains the DFI signal and the D value, the UE finds that only M PUSCHs (0 < M < K) among the aggregated K time slots are located outside the minimum processing window D. Therefore, the UE will consider that the ACK / NACK indication for HARQ process ID = 0 in the DFI signal is only valid for part of the PUSCHs. In Case 2, the DFI signal indicates ACK: this means that the base station has correctly received the HARQ process ID = 0 data for at least the M PUSCHs outside the minimum processing window D. This means that the base station may not need to further utilize the other sub-packets K - M PUSCHs. Therefore, the UE will determine that the HARQ process ID = 0 transmission is successfully completed and consider the ACK indication in the DFI signal to be valid.
[0088] Case 3: As Figure 4CAs shown, in the aggregated time slots (K PUSCHs), only M PUSCHs (0 < M < K) are outside the minimum processing window and K - M PUSCHs are within the minimum processing window D, and the DFI signal indicates NACK. This situation corresponds to step 325B described previously. In Figure 4C , M = 2 aggregated time slot HARQ0 - PUSCH1 and HARQ0 - PUSCH2 are outside the minimum processing window D.
[0089] In case 3, when the UE obtains the DFI signal and the D value, the UE finds that only M PUSCHs (0 < M < K) in the aggregated K time slots are outside the minimum processing window D. Therefore, the UE will consider that the ACK / NACK indication for HARQ process ID = 0 in the DFI signal is only valid for some PUSCHs. In case 3, the DFI signal indicates NACK: this means that the base station has not correctly received the HARQ process ID = 0 data in the M PUSCHs outside the minimum processing window D. This means that the base station needs to further utilize the other K - M PUSCHs, and the base station does not have enough time to process them (because they are within the minimum processing window D). Therefore, the UE will determine that the ACK / NACK indication for HARQ process ID = 0 in the DFI signal is invalid.
[0090] Case 4: As Figure 4D shown, all aggregated time slots, i.e., K PUSCHs, are within the minimum processing window. This situation corresponds to step 330 or step 380 described previously.
[0091] In case 4, when the UE obtains the DFI signal and the D value, the UE finds that all the aggregated K time slots are within the minimum processing window D. Therefore, the UE will determine that the ACK / NACK indication for HARQ process ID = 0 in the DFI signal is invalid.
[0092] The present invention provides a method that enables a user equipment UE to eliminate interpretation uncertainties when performing time slot aggregation transmission and receiving DFI, where the indicated minimum processing window covers different parts of the aggregated time slots.
[0093] However, these embodiments are not limited to the 3GPP network used as an example in this article, and those skilled in the art can apply this solution to other communication systems.
[0094] The list of abbreviations used in this article is as follows.
[0095] abbreviation meaning BS Base Station CG Configuring Authorization DFI Downlink feedback indication HARQ Hybrid Automatic Repeat Request LBT Listen before you speak LTE Long Term Evolution LTE-A Advanced Long Term Evolution NR New air interface NR-U New air interface in unlicensed spectrum PBCH Physical Broadcast Channel PDCCH Physical Downlink Control Channel PDSCH Physical downlink shared channel PUSCH Physical Uplink Shared Channel RNTI Wireless Network Temporary Identifier RV Redundant version UE User Equipment
[0096] It should be understood by those skilled in the art that any functions, designs, block diagrams, flow charts, state transition diagrams, and / or flowcharts herein represent conceptual views of illustrative circuits that embody the principles of the present invention. Similarly, it should be understood that any flow charts, flow charts, state transition diagrams, pseudocodes, etc. represent various processes that can be substantially represented in a computer-readable medium and thus executed by a computer or processing device, whether or not such a computer or processor is explicitly shown.
[0097] Each described function, design, block diagram, step can be implemented in hardware, software, firmware, middleware, microcode or any suitable combination thereof. If implemented in software, these functions, designs, block diagrams and / or flow chart blocks can be implemented by computer program instructions / software codes, which can be stored or transmitted through a computer-readable medium, or loaded into a general-purpose computer, a special-purpose computer or other programmable processing device and / or system to produce a machine, so that the computer program instructions or software codes executed on the computer or other programmable processing device create a device for implementing the functions described herein.
[0098] Implementations of the various techniques and methods described herein can be realized in digital electronic circuitry, or in computer hardware, firmware, software, or a combination thereof. Embodiments can be implemented as a computer program product, i.e., a computer program tangibly embodied in an information carrier, such as in a machine-readable storage device or a propagated signal, for execution by, or to control the operation of, a data processing apparatus such as a programmable processor, a computer, or multiple computers. Embodiments can also be provided on a computer-readable medium or computer-readable storage medium, which can be non-transitory media.
[0099] Hereinafter, "means configured to perform a function..." should be understood as a functional block including a circuit suitable for performing or configured to perform the function. In addition, any entity described as "means" herein may correspond to or be implemented as "one or more modules", "one or more devices", "one or more units", etc. The means for performing one or more functions may also include at least one processor and at least one memory for storing computer program code (e.g., in a system or device), the computer program code being configured to use the at least one processor to implement (by the system or corresponding device) the execution of one or more functions.
[0100] When provided by a processor, the functions may be provided by a single dedicated processor, by a single shared processor, or by a plurality of individual processors, some of which may be shared. The functions of the various elements shown in the figures, including any functional blocks labeled as "processors", may be provided through the use of dedicated hardware as well as hardware capable of executing software in association with appropriate software.
[0101] In addition, the explicit use of the term "processor" or "controller" should not be interpreted as referring exclusively to hardware capable of executing software, but may also implicitly include, but not limited to, digital signal processor (DSP) hardware, network processor, application specific integrated circuit (ASIC), field programmable gate array (FPGA), read only memory (ROM), random access memory (RAM) and non-volatile memory for storing software. Other conventional or custom hardware may also be included. The functions of these hardware may be performed by the operation of program logic, by dedicated logic, by the interaction of program control and dedicated logic, or even manually, and the specific technology may be selected by the operator after a better understanding of the context.
[0102] The term "circuit" may refer to a pure hardware circuit implementation; a combination of circuitry and software and / or firmware; or a hardware circuit and / or processor, such as a microprocessor or a portion of a microprocessor, which may or may not require software and / or firmware to operate, whether or not the software or firmware is physically present. A circuit may be a general purpose circuit or a special purpose logic circuit, such as a field programmable gate array (FPGA) or an application specific integrated circuit (ASIC). The term circuitry also includes, for example (if applicable) specifically required components, baseband integrated circuits, processor integrated circuits, or similar integrated circuits for base stations and / or user equipment.
[0103] Some embodiments are also intended to include computer-readable media, such as digital data storage media, which are machine or computer readable and are encoded with machine-executable or computer-executable program instructions, wherein such instructions are configured to cause a corresponding device, apparatus or system to perform some or all of the steps of the above method. The computer-readable medium may be, for example, a digital memory, a magnetic storage medium such as a disk and a tape, a hard drive, or an optically readable digital data storage medium.
[0104] Embodiments of computer-readable media include, but are not limited to, computer storage media and communication media, including any medium that facilitates the transfer of computer programs from one place to another. Specifically, program instructions or computer-readable program codes for executing the embodiments described herein may be stored temporarily or permanently in whole or in part on a non-transitory computer-readable medium of a local or remote storage device including one or more storage media.
[0105] A computer program may be in source code form, object code form or some intermediate form and may be stored on some carrier, distribution medium or computer readable medium, which may be any entity or device capable of carrying the program. For example, such carriers include recording media, computer memory, read-only memory, optical and / or electrical carrier signals, telecommunication signals and software distribution packages. A computer program may be executed in a single electronic digital computer or distributed among multiple computers, depending on the processing power required.
[0106] Computer programs, such as those described above, can be written in any form of programming language, including compiled or interpreted languages, and can be deployed in any form, including as a stand-alone program or as a module, component, subroutine or other unit or part thereof suitable for use in a computing environment. A computer program can be deployed to be executed on a single computer or on multiple computers at one site or distributed across multiple sites interconnected by a communication network.
[0107] For completeness, Figure 5 An exemplary block diagram of a device (e.g., user equipment) 1000 according to one embodiment is shown. The device 1000 may include, for example, one or more wireless transceivers 1002, each of which includes a transmitter for transmitting wireless signals and a receiver for receiving wireless signals. The device 1000 also includes a circuit 1004 (e.g., a processor, a control unit / entity, a controller) for executing instructions or software and controlling signal transmission and reception, and a memory 1006 for storing data and / or instructions. The circuit 1004 may control the wireless transceiver 1002 to receive, send, broadcast or transmit signals and / or data. When the circuit 1004 is implemented in a user equipment, it may be configured to process the DFI signal and perform any processing steps described herein.
[0108] The circuit 1004 may also make decisions or determinations, generate frames, data packets, or messages for transmission, decode received frames or messages for further processing, and other tasks or functions described herein. The circuit 1004 may be, for example, a baseband processor that may generate messages, data packets, frames, or other signals for transmission through the wireless transceiver 1002. The circuit 1004 may control the transmission of signals or messages on a wireless network, and may control, for example, receiving signals or messages via a wireless network, etc. (e.g., after being down-converted by the wireless transceiver 1002). The circuit 1004 may be programmable and capable of executing software or other instructions stored on a memory or other computer medium to perform the various tasks and functions described above, such as one or more of the tasks or methods described above. The circuit 1004 may be or include, for example, hardware, programmable logic, a programmable processor that executes software or firmware, and / or any combination thereof. Using other terms, the circuit 1004 and the transceiver 1002 may be considered together, for example, as a wireless transmitter / receiver system.
[0109] In addition, the processor 1008 can execute software and instructions and can provide overall control for the device 1000 and can Figure 5 Other systems not shown provide control, such as controlling input / output devices and / or can execute software for one or more applications provided on device 1000.
[0110] In addition, a computer-readable storage medium may also be provided that includes stored instructions, which, when executed by the processor 1008, perform one or more functions, steps or tasks described above for the relevant devices.
[0111] For example, device 1000 may also include, or be operably coupled to, receive data from, send data to, or perform data transmission and reception with one or more computer-readable storage media, such as magnetic disks, magneto-optical disks, or optical disks. Computer-readable storage media suitable for containing computer program instructions and data include all forms of non-volatile memory, including, for example, semiconductor memory devices, such as Erasable Programmable Read-only Memory (EPROM), Electrically Erasable Programmable Read-only Memory (EEPROM), and flash memory devices; magnetic disks, such as internal hard disks or removable disks; magneto-optical disks; and compact disc read-only memory (CD-ROM) and DVD-ROM disks.
[0112] The processor 1008 may be configured to store, read, load and / or otherwise process computer program code stored in a computer-readable storage medium and / or memory 1006, and when the computer program code is executed by at least one processor, the device 1000 may be caused to perform one or more steps of the method described herein for the relevant device 1000. Processors suitable for executing computer programs include, for example, general-purpose and special-purpose microprocessors, and any one or more processors of any type of digital computer, chip or chipset. Typically, the processor will receive instructions and data from a read-only memory or a random access memory or both. The elements of a computer may include at least one processor for executing instructions and one or more memory devices for storing instructions and data.
[0113] Processor 1008 may be any suitable microprocessor, microcontroller, integrated circuit, or central processing unit (CPU) including at least one hardware-based processor or processing core.
[0114] The memory 1006 may include random access memory (RAM), cache memory, non-volatile memory, backup memory (e.g., programmable or flash memory), read-only memory (ROM), hard disk drive (HDD), solid state drive (SSD), or any combination thereof. The ROM of the memory 1006 may be configured to store one or more computer program codes of an operating system and / or one or more computer programs of the storage device 1000, etc. The processor 1008 may use the RAM of the memory 1006 to temporarily store data.
[0115] The description and drawings merely illustrate the principles of the invention. It will therefore be appreciated that those skilled in the art will be able to devise various arrangements which, although not explicitly described or shown herein, embody the principles of the invention and are included within its spirit and scope.
[0116] In addition, all examples cited herein are intended in principle to be used only for teaching purposes to help readers understand the principles of the present invention and the concepts contributed by the inventors to promote the art, and should be interpreted as not being limited to these specifically listed examples and conditions. In addition, all statements describing the principles, aspects and embodiments of the present invention and their specific examples are intended to cover their equivalents.
Claims
1. A method for processing downlink feedback indication, performed by a user equipment, the method include: Receive a downlink feedback indication DFI signal (210) from a base station; wherein the DFI signal includes a positive acknowledgement / negative acknowledgement ACK / NACK indication associated with a first hybrid automatic repeat request HARQ process, wherein the first HARQ process is defined for transmitting an uplink data packet to the base station using time slot aggregation, wherein transmitting the uplink data packet using time slot aggregation includes transmitting a plurality of subpackets to the base station in a plurality of time slots through a plurality of physical uplink shared channels PUSCH and using one or more radio symbols; Obtaining a minimum processing time D (220) corresponding to a minimum processing time required by the base station to process the uplink data packet, wherein the minimum processing time D is configured by a radio resource control RRC or included in the DFI signal; and A valid ACK / NACK feedback for the first HARQ process is determined based on the ACK / NACK indication associated with the first HARQ process, the minimum processing duration D, and a relative time position of at least one of the plurality of subpackets relative to the DFI signal (240).
2. The method according to claim 1, in, The determining the valid ACK / NACK feedback comprises: determining whether the ACK / NACK indication is a valid ACK / NACK indication for the first HARQ process based on the ACK / NACK indication associated with the first HARQ process, the minimum processing duration D, and the relative time position of at least one subpacket of the plurality of subpackets relative to the DFI signal; If the ACK / NACK indication is determined to be valid, the ACK / NACK indication is used as the valid ACK / NACK feedback.
3. The method according to claim 2, in, The determining whether the ACK / NACK indication is a valid ACK / NACK indication comprises: A first determination is made regarding a relative time position of a last transmitted subpacket of the plurality of subpackets (310, 360), wherein making the first determination includes: Determine the duration D between the transmission time corresponding to the transmission of the last sub-packet and the reception time corresponding to the reception of the DFI signal last is greater than the minimum processing time D; or Determining that a transmission time corresponding to the transmission of the last subpacket falls before a start time of a processing window; the duration of the processing window is equal to the minimum processing duration D and ends at a reception time corresponding to receiving the DFI signal; Based on the first determination, the ACK / NACK indication is determined to be valid regardless of the value of the ACK / NACK indication (310A, 360A).
4. The method according to claim 2, in, The determining whether the ACK / NACK indication is a valid ACK / NACK indication comprises: A third determination is made for the relative time position of the last subpacket in the plurality of subpackets and the subpacket that is sent for the first time in the plurality of subpackets (320), wherein making the third determination includes: Determine the duration D between the transmission time corresponding to the transmission of the last subpacket and the reception time corresponding to the reception of the DFI signal last is less than the minimum processing time D, and determines the time D between the transmission time corresponding to the transmission of the first transmitted sub-packet and the reception time corresponding to the reception of the DFI signal first is greater than the minimum processing time D; or, Determine that a transmission time corresponding to the transmission of the last sub-packet falls after a start time of a processing window, the duration of the processing window being equal to the minimum processing duration D, and ending at a reception time corresponding to receiving the DFI signal, and determine that a transmission time corresponding to the transmission of the first-sent sub-packet falls before a start time of a processing window, the duration of the processing window being equal to the minimum processing duration D, and ending at the reception time corresponding to receiving the DFI signal; Based on the third determination, if the value of the ACK / NACK indication is ACK, it is determined that the ACK / NACK indication is valid, and if the value of the ACK / NACK indication is NACK, it is determined that the ACK / NACK indication is invalid (325A, 325B).
5. A user device, include: at least one processor (1008); as well as At least one memory (1006) including computer program code, wherein the at least one memory and the computer program code are configured to, with the at least one processor, cause the user equipment to perform the following operations: Receiving a downlink feedback indication DFI signal from a base station; wherein the DFI signal includes a positive acknowledgement / negative acknowledgement ACK / NACK indication associated with a first hybrid automatic repeat request HARQ process, wherein the first HARQ process is defined for transmitting an uplink data packet to the base station using time slot aggregation, wherein transmitting the uplink data packet using time slot aggregation includes transmitting a plurality of subpackets to the base station in a plurality of time slots through a plurality of physical uplink shared channels PUSCH and using one or more radio symbols; Obtaining a minimum processing time D corresponding to a minimum processing time required by the base station to process the uplink data packet, wherein the minimum processing time D is configured by a radio resource control RRC or included in the DFI signal; and A valid ACK / NACK feedback for the first HARQ process is determined based on the ACK / NACK indication associated with the first HARQ process, the minimum processing duration D, and a relative time position of at least one of the plurality of subpackets relative to the DFI signal.
6. The user equipment according to claim 5, wherein the determining the valid ACK / NACK feedback include: determining whether the ACK / NACK indication is a valid ACK / NACK indication for the first HARQ process based on the ACK / NACK indication associated with the first HARQ process, the minimum processing duration D, and the relative time position of at least one subpacket of the plurality of subpackets relative to the DFI signal; If the ACK / NACK indication is determined to be valid, the ACK / NACK indication is used as the valid ACK / NACK feedback.
7. The user equipment according to claim 6, in, The determining whether the ACK / NACK indication is a valid ACK / NACK indication comprises: Making a first determination of a relative time position of a last subpacket in the plurality of subpackets, wherein making the first determination comprises: Determine the duration D between the transmission time corresponding to the transmission of the last sub-packet and the reception time corresponding to the reception of the DFI signal last is greater than the minimum processing time D; or Determining that a transmission time corresponding to the transmission of the last subpacket falls before a start time of a processing window; the duration of the processing window is equal to the minimum processing duration D and ends at a reception time corresponding to receiving the DFI signal; Based on the first determination, the ACK / NACK indication is determined to be valid regardless of the value of the ACK / NACK indication.
8. The user equipment according to claim 6, in, The determining whether the ACK / NACK indication is a valid ACK / NACK indication comprises: Making a third determination for a relative time position of a last subpacket in the plurality of subpackets and a subpacket sent for the first time in the plurality of subpackets, wherein making the third determination comprises: Determine the duration D between the transmission time corresponding to the transmission of the last sub-packet and the reception time corresponding to the reception of the DFI signal last is less than the minimum processing time D, and determines the time D between the transmission time corresponding to the transmission of the first transmitted sub-packet and the reception time corresponding to the reception of the DFI signal first is greater than the minimum processing time D; or, Determine that a transmission time corresponding to the transmission of the last sub-packet falls after a start time of a processing window, the duration of the processing window being equal to the minimum processing duration D, and ending at a reception time corresponding to receiving the DFI signal, and determine that a transmission time corresponding to the transmission of the first-sent sub-packet falls before a start time of a processing window, the duration of the processing window being equal to the minimum processing duration D, and ending at the reception time corresponding to receiving the DFI signal; Based on the third determination, if the value of the ACK / NACK indication is ACK, it is determined that the ACK / NACK indication is valid, and if the value of the ACK / NACK indication is NACK, it is determined that the ACK / NACK indication is invalid.
9. A computer-readable medium comprising program instructions stored thereon, for causing a device to execute the steps of the method according to any one of claims 1 to 4.
