Dynamic HARQ-ACK codebook processing method, device, equipment, and readable storage medium

Abstract

The present application discloses a dynamic HARQ-ACK codebook processing method, an apparatus, a device, and a readable storage medium, and the HARQ-ACK codebook processing method includes a step in which, when a scheduling PDSCH cannot be transmitted, a terminal determines a mapping relationship between a HARQ-ACK bit in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on one or more of a DAI counting manner, and whether or not time domain binding is used.

Description

[Technical Field]

[0001] (CROSS-REFERENCE TO RELATED APPLICATIONS) This application claims priority from Chinese Patent Application No. 202110510949.6 filed in China on May 11, 2021, the entire contents of which are incorporated herein by reference.

[0002] The present application relates to the field of communications technology, and particularly to a dynamic Hybrid Automatic Repeat reQuest-ACK (HARQ-ACK) codebook processing method, device, apparatus, and readable storage medium. [Background technology]

[0003] In multi-Physical Downlink Shared Channel (PDSCH) scheduling, if at least one PDSCH among one or more PDSCHs scheduled by a single Downlink Control Information (DCI) cannot actually be transmitted (e.g., due to a collision with a semi-static UL symbol), the counting / indication of Downlink Assignment Index (DAI) and the setting of the HARQ-ACK bit for the dynamic HARQ-ACK codebook will be affected. Therefore, how to set the HARQ-ACK bit for the dynamic HARQ-ACK codebook is an issue that needs to be resolved as soon as possible. Summary of the Invention [Problem to be solved by the invention]

[0004] The embodiments of the present application provide a dynamic HARQ-ACK codebook processing method, device, apparatus, and readable storage medium that can solve the problem of how to determine the HARQ-ACK bit of the dynamic HARQ-ACK codebook when a scheduling PDSCH cannot actually be transmitted. [Means for solving the problem]

[0005] According to a first aspect, there is provided a dynamic HARQ-ACK codebook processing method, the method including: when a scheduling PDSCH cannot be transmitted, a terminal determines a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on one or more of a DAI counting method and whether time-domain binding is used.

[0006] According to a second aspect, there is provided a dynamic HARQ-ACK codebook processing method, which includes, when a scheduling PDSCH cannot be transmitted, a network side device determines a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on one or more of a DAI counting method and whether time domain binding is used.

[0007] According to a third aspect, there is provided a dynamic HARQ-ACK codebook processing device for use in a terminal, the device comprising: The system includes a first determination module for determining, when a scheduling PDSCH cannot be transmitted, a mapping relationship between a HARQ-ACK bit in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on one or more of a DAI counting method and whether time domain binding is used.

[0008] According to a fourth aspect, there is provided a dynamic HARQ-ACK codebook processing device for use in a network side device, the device comprising: The system further includes a second determination module for determining a mapping relationship between a HARQ-ACK bit in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on one or more of a DAI counting method and whether time domain binding is used, when the scheduling PDSCH cannot be transmitted.

[0009] According to a fifth aspect, there is provided a terminal including a processor, a memory, and a program stored in the memory and operable to run on the processor, the program performing the steps of the method of the first aspect when executed by the processor.

[0010] According to a sixth aspect, there is provided a terminal, the terminal including a processor and a communications interface, wherein the processor, when executing, is adapted to implement the steps of the method according to the first aspect.

[0011] According to a seventh aspect, there is provided a network side device, the network side device including a processor, a memory, and a program stored in the memory and operable to run on the processor, the program implementing the steps of the method according to the second aspect when executed by the processor.

[0012] According to an eighth aspect, there is provided a network side device, the network side device including a processor and a communication interface, the processor being adapted, when executed, to implement the steps of the method according to the second aspect.

[0013] According to a ninth aspect, there is provided a readable storage medium having stored thereon a program or instructions which, when executed by a processor, implements the steps of the method of the first or second aspect.

[0014] According to a tenth aspect, there is provided a computer program / program product stored on a storage medium, the computer program / program product being executed by at least one processor to implement the steps of the processing method according to the first or second aspect.

[0015] According to an eleventh aspect, there is provided a chip, the chip including a processor and a communication interface, the communication interface coupled to the processor, the processor running a program or instruction to implement the method of processing according to the first or second aspect. [Effects of the Invention]

[0016] In the embodiments of the present application, when a scheduling PDSCH cannot actually be transmitted, the consistency of the understanding of the HARQ-ACK bit in the dynamic HARQ-ACK codebook between the terminal and the network side device can be ensured, and the reliability of downlink data transmission can be further ensured. [Brief explanation of the drawings]

[0017] [Figure 1] 1 is a schematic diagram of a wireless communication system to which an embodiment of the present application can be applied; [Figure 2] 1 is a schematic diagram of a dynamic HARQ-ACK codebook processing method according to an embodiment of the present application; [Figure 3] 2 is a second schematic diagram of a dynamic HARQ-ACK codebook processing method according to an embodiment of the present application; [Figure 4] 1 is a schematic diagram of a dynamic HARQ-ACK codebook processing device according to an embodiment of the present application; [Figure 5] 2 is a second schematic diagram of a dynamic HARQ-ACK codebook processing device according to an embodiment of the present application; [Figure 6] 1 is a schematic diagram of a terminal according to an embodiment of the present application; [Figure 7]FIG. 1 is a schematic diagram of a network-side device according to an embodiment of the present application; DETAILED DESCRIPTION OF THE INVENTION

[0018] The following clearly describes the technical solutions in the embodiments of the present application, in conjunction with the drawings in the embodiments of the present application. Obviously, the described embodiments are only some of the embodiments of the present application, but not all of the embodiments. All other embodiments obtained by those skilled in the art based on the embodiments of the present application fall within the scope of protection of the present application.

[0019] The terms "first," "second," etc. in the specification and claims of this application distinguish between similar objects and do not describe a specified order or sequence. It is to be understood that terms used in this manner are interchangeable where appropriate, so that embodiments of this application may be performed in orders other than those illustrated or described herein, and that objects distinguished by "first" and "second" generally are of the same type and do not limit the number of objects; for example, a first object may be one or more. Furthermore, in the specification and claims, "and" indicates at least one of the connected objects, and the character " / " generally indicates an "or" relationship between the related objects.

[0020] It should be noted that the techniques described in the embodiments of the present application are not limited to Long Term Evolution (LTE) / LTE-Advanced (LTE-A) systems, but can also be applied to other wireless communication systems, such as Code Division Multiple Access (CDMA), Time Division Multiple Access (TDMA), Frequency Division Multiple Access (FDMA), Orthogonal Frequency Division Multiple Access (OFDMA), Single-carrier Frequency-Division Multiple Access (SC-FDMA), and other systems. The terms "system" and "network" in the embodiments of the present application are always used interchangeably, and the described techniques may be used in the above-mentioned systems and radio technologies as well as other systems and radio technologies. Although the following description describes New Radio (NR) systems for illustrative purposes and uses NR terminology in most of the following description, these technologies may also be used in applications other than NR system applications, such as sixth generation (6G) systems. th This may be applied to 6G (6th Generation) communication systems.

[0021] To facilitate understanding of the embodiments of the present application, the following technical points will be introduced first.

[0022] 1. Release-17 (Rel-17) Multi-PDSCH scheduling.

[0023] The Rel-17 52.6-71 GHz performance study identified the need to introduce new subcarrier spacings (SCSs) including 480 kHz and 960 kHz for the deployment of the new New Radio (NR) frequency band. For these newly introduced SCSs, physical downlink control channel (PDCCH) monitoring needs to be adjusted or enhanced accordingly, for example, to avoid the terminal (e.g., user equipment (UE)) monitoring the PDCCH every slot (which is very short), thereby reducing the UE implementation complexity. Accordingly, multi-PDSCH scheduling and multi-PUSCH scheduling need to be investigated and implemented to fully utilize carrier time domain resources.

[0024] Multi-PDSCH scheduling means that a single DCI can schedule multiple PDSCH transmissions on the same carrier at once. According to the NR protocol, these PDSCHs do not overlap each other in the time domain.

[0025] Second, Release-15 (Rel-15) HARQ-ACK dynamic codebook.

[0026] When a UE generates a HARQ-ACK bit sequence to be reported at a certain feedback time, the UE determines the correspondence between each downlink PDSCH transmission and a bit in the generated HARQ-ACK bit sequence based on a predefined rule and the scheduling status of uplink and downlink PDSCH transmissions of a single carrier or multiple carriers for which HARQ-ACK is reported at this feedback time. This operation is called constructing a HARQ-ACK codebook or HARQ-ACK codebook scheme. NR Rel-15 uses two HARQ-ACK codebook schemes: a semi-static codebook (Type-1) and a dynamic codebook (Type-2).

[0027] The dynamic codebook is a method of performing DAI counting for actually scheduled PDSCH transmissions / Semi-Persistent Scheduling (SPS) PDSCH release instructions, and reserves a feedback bit for each actually used DAI value. If the UE infers that it has not received a PDSCH allocation instruction or SPS PDSCH release instruction corresponding to some DAI based on other detected DAIs, it sets the corresponding feedback bit to a negative acknowledgement (NACK); otherwise, it sets the corresponding feedback bit according to the decoding result of the PDSCH transmission corresponding to each PDSCH allocation instruction, and sets the corresponding feedback bit to an acknowledgement (ACK) for the detected SPS PDSCH release instruction.

[0028] DAI is represented using a limited number of bits (currently, a single DAI generally occupies 2 bits), and to extend its range, modulo operation is introduced: first, count from 1, and then modulo to obtain the DAI value corresponding to a certain count value.

[0029] Third, Rel-17 HARQ-ACK dynamic codebook.

[0030] When supporting Multi-PDSCH scheduling, the HARQ-ACK dynamic codebook needs to be correspondingly augmented to support HARQ-ACK feedback corresponding to Multi-PDSCH scheduling.

[0031] 4. Time Domain Bundling of HARQ-ACK Feedback.

[0032] Time-domain binding for HARQ-ACK feedback may be understood as reducing feedback bits by bundling (typically using a binary AND operation) the decoding results of PDSCHs received at different times to form a single fused decoding result, and is already used in the bundling mechanism for HARQ-ACK feedback in Long Term Evolution (LTE) Time Division Duplexing (TDD) mode.

[0033] In the Rel-17 52.6-71 GHz performance study, when considering HARQ-ACK feedback based on a dynamic codebook for multi-PDSCH scheduling, some companies proposed using a time-domain binding mechanism. The currently submitted proposals mainly involve performing time-domain binding within one to multiple PDSCHs scheduled by a single DCI, or grouping one to multiple PDSCHs scheduled by a single DCI and then performing time-domain binding within the PDSCHs corresponding to a single PDSCH group.

[0034] 5. Interpretation of terms used in this specification: A scheduled PDSCH is a PDSCH among one or more PDSCHs scheduled by a single DCI, and may be an enabled PDSCH or an disabled PDSCH.

[0035] A valid PDSCH is a PDSCH that does not collide with a semi-static UL symbol among one or more PDSCHs scheduled by a single DCI, and may be understood as a scheduled PDSCH that can actually be transmitted.

[0036] An invalid PDSCH is a PDSCH that collides with a semi-static UL symbol among one or more PDSCHs scheduled by a single DCI, and may be understood as a scheduled PDSCH that cannot actually be transmitted.

[0037] 1 shows a block diagram of a wireless communication system to which the embodiments of the present application can be applied. The wireless communication system includes a terminal 11 and a network side device 12. Here, the terminal 11 may be referred to as a terminal device or a user terminal, and may be a terminal side device such as a mobile phone, a tablet personal computer (PDA), a laptop computer (also called a notebook computer), a personal digital assistant (PDA), a palmtop computer, a netbook, an ultra-mobile personal computer (UMPC), a mobile internet device (MID), a wearable device, a vehicle-mounted equipment (VUE), a pedestrian-mounted equipment (PUE), etc., and wearable devices include a smart watch, a bracelet, an earphone, glasses, etc. It should be noted that the embodiments of the present application do not limit the specific type of the terminal 11.

[0038] The network side equipment 12 may be a base station or a core network, where the base station may be called a Node B, an evolved Node B, an access point, a base transceiver station (BTS), a radio base station, a radio transceiver, a basic service set (BSS), an extended service set (ESS), a B node, an evolved B node (eNB), a home B node, a home evolved B node, a wireless local area network (WLAN) access point, a WiFi node, a transmitting and receiving point (TRP), a radio access network node, or any other suitable term in the art, and as long as the same technical effect is achieved, the base station is not limited to the specified technical term. For illustrative purposes, in the embodiments of this application, only base stations in an NR system are taken as examples, and the specific type of base station is not limited.

[0039] Referring to FIG. 2, an embodiment of the present application provides a dynamic HARQ-ACK codebook processing method, and specific steps include step 201.

[0040] Step 201: When a scheduling PDSCH cannot be transmitted, the terminal determines a mapping relationship between the HARQ-ACK bit in the dynamic HARQ-ACK codebook and the scheduling PDSCH based on one or more of the counting method of the DAI and whether or not time domain binding is used.

[0041] Here, the case where the scheduling PDSCH cannot be transmitted corresponds to the possibility that the scheduling PDSCH cannot be transmitted, for example, because the PDSCH collides with a semi-static uplink symbol (i.e., at least one symbol occupied by the PDSCH is semi-statically configured as an uplink symbol) or because it cannot actually be transmitted due to other circumstances.

[0042] Here, the scheduling PDSCH includes a valid PDSCH or an invalid PDSCH.

[0043] In one embodiment of the present application, the step of determining a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on a DAI counting manner and whether time domain binding is used includes: The DAI counting method includes performing DAI counting for each downlink control information DCI, and when time domain binding is not used, includes a step of mapping the valid PDSCH to a HARQ-ACK bit in the dynamic HARQ-ACK codebook, or mapping all of the scheduling PDSCHs to HARQ-ACK bits in the dynamic HARQ-ACK codebook.

[0044] In one embodiment of the present application, the time domain binding scheme comprises: (1) incorporating the invalid PDSCH into the time-domain binding calculation range; (2) excluding the invalid PDSCH from the time-domain binding calculation range.

[0045] In one embodiment of the present application, the granularity or scope of the time domain binding is: (1) a PDSCH set scheduled by the DCI; (2) a PDSCH subset of the PDSCH set scheduled by the DCI.

[0046] In one embodiment of the present application, when the granularity or range of the time domain binding includes a PDSCH set scheduled by the DCI, the PDSCH set division method is: (1) all the scheduling PDSCHs are grouped into a PDSCH set; (2) forming all the valid PDSCHs into a PDSCH set.

[0047] In one embodiment of the present application, when the granularity or scope of the time domain binding includes a PDSCH subset of a PDSCH set scheduled by the DCI, the method comprises: determining the number of PDSCH subsets based on the size of the PDSCH subsets; Or, The method further includes determining a size of the PDSCH subset based on the number of PDSCH subsets.

[0048] In one embodiment of the present application, when the granularity or scope of the time domain binding includes a PDSCH subset of a PDSCH set scheduled by the DCI, the method comprises: The method further includes determining a mapping relationship between the scheduling PDSCH or the valid PDSCH and the PDSCH subset.

[0049] In one embodiment of the present application, the mapping relationship is: The first scheduling PDSCH or the first valid PDSCH corresponds to the first PDSCH in the first PDSCH subset, and the remaining scheduling PDSCHs or the remaining valid PDSCHs correspond to the current PDSCH subset or the PDSCH subsets after the current PDSCH subset in order; the last scheduling PDSCH or the last valid PDSCH corresponds to the last PDSCH in the last PDSCH subset, and the remaining scheduling PDSCHs or the remaining valid PDSCHs correspond in order to the current or a PDSCH subset preceding the current PDSCH subset.

[0050] In one embodiment of the present application, the step of determining a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on a DAI counting manner and whether time domain binding is used includes: not mapping the invalid PDSCH to a HARQ-ACK bit in the dynamic HARQ-ACK codebook if time domain binding is not used and the invalid PDSCH is not included in a DAI count; Or, If time domain binding is not used and the invalid PDSCH is incorporated into a DAI count, mapping the invalid PDSCH to a HARQ-ACK bit in the dynamic HARQ-ACK codebook is included.

[0051] In one embodiment of the present application, the step of determining a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on a DAI counting manner and whether time domain binding is used includes: When time domain binding is used and the DAI counting method includes including the invalid PDSCH in the DAI count, the method includes a step of including the invalid PDSCH in the time domain binding calculation range or excluding the invalid PDSCH from the time domain binding calculation range.

[0052] In one embodiment of the present application, the step of determining a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on a DAI counting manner and whether time domain binding is used includes: dividing a PDSCH group for a scheduling PDSCH, and when the counting method of the DAI includes not including an invalid PDSCH group in the DAI count, and time domain binding is not used, not mapping an invalid PDSCH group in the PDSCH group to a HARQ-ACK bit in the dynamic HARQ-ACK codebook; Or, dividing a PDSCH group for the scheduling PDSCH, and when the counting method of the DAI includes including incorporating an invalid PDSCH group into a DAI count, and time domain binding is not used, mapping the invalid PDSCH group in the PDSCH group to a HARQ-ACK bit in the dynamic HARQ-ACK codebook, wherein the HARQ-ACK bit is set to a negative acknowledgement (NACK); Here, each scheduling PDSCH corresponding to the invalid PDSCH group is an invalid PDSCH.

[0053] In one embodiment of the present application, the step of determining a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on a DAI counting manner and whether time domain binding is used includes: Dividing PDSCH groups for scheduling PDSCHs, the counting method of the DAI includes counting DAI for each PDSCH group scheduled by a single DCI, and when an invalid PDSCH is included in a valid PDSCH group in the PDSCH group and time domain binding is not used, mapping the invalid PDSCH of the valid PDSCH group to a HARQ-ACK bit in the dynamic HARQ-ACK codebook, where the HARQ-ACK bit is set to NACK; Here, at least one scheduling PDSCH corresponding to the valid PDSCH group is a valid PDSCH.

[0054] In one embodiment of the present application, the step of determining a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on a DAI counting manner and whether time domain binding is used includes: The method includes a step of dividing PDSCH groups for the scheduling PDSCH, using time domain binding, and when the DAI counting method includes incorporating invalid PDSCH groups into DAI counting, mapping invalid PDSCH groups in the PDSCH groups to HARQ-ACK bits in the dynamic HARQ-ACK codebook, where the HARQ-ACK bits are set to NACK.

[0055] In one embodiment of the present application, the step of determining a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on a DAI counting manner and whether time domain binding is used includes: The method further includes dividing the scheduled PDSCH into PDSCH groups, and the DAI counting method includes performing DAI counting for each PDSCH group scheduled by a single DCI. When time-domain binding is used, the method further includes a step of including invalid PDSCHs in valid PDSCH groups in the PDSCH group into a time-domain binding calculation range, or excluding invalid PDSCHs in valid PDSCH groups in the PDSCH group from the time-domain binding calculation range.

[0056] In one embodiment of the present application, the method comprises: The terminal further includes receiving a DAI instruction from a network side device; Here, the DAI instruction is: (1) The network side device does not include the invalid PDSCH in the DAI count; (2) the network side device incorporates the invalid PDSCH into the DAI count; (3) The network side device does not include the PDSCH group in the DAI count; and (4) The network side device includes the PDSCH group in the DAI count, Here, the PDSCH group is divided for the scheduling PDSCH, or the PDSCH group is divided for valid PDSCHs, and the PDSCH group includes up to M scheduling PDSCHs with consecutive numbers or indices, or includes adjacent valid PDSCHs among up to M of the scheduling PDSCHs, where M is 1 or more.

[0057] In one embodiment of the present application, when the granularity or scope of the time domain binding includes a PDSCH subset of a PDSCH set scheduled by the DCI, the PDSCH subset includes up to N scheduling PDSCHs with consecutive numbers or indices, or includes up to N adjacent valid PDSCHs among the scheduling PDSCHs; Here, N is equal to M, or M is an integer multiple of N, or N is an integer multiple of M.

[0058] In the embodiments of the present application, when a scheduling PDSCH cannot actually be transmitted, the consistency of the understanding of the HARQ-ACK bit in the dynamic HARQ-ACK codebook between the terminal and the network side device can be ensured, and the reliability of downlink data transmission can be further ensured.

[0059] Referring to FIG. 3, an embodiment of the present application provides a dynamic HARQ-ACK codebook processing method, and specific steps include step 301.

[0060] Step 301: When a scheduling PDSCH cannot be transmitted, the network side device determines the mapping relationship between the HARQ-ACK bit in the dynamic HARQ-ACK codebook and the scheduling PDSCH based on one or more of the DAI counting method and whether or not time domain binding is used.

[0061] Here, the scheduling PDSCH includes a valid PDSCH or an invalid PDSCH.

[0062] In one embodiment of the present application, the step of determining a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on a DAI counting manner and whether time domain binding is used includes: The DAI counting method includes performing DAI counting for each DCI, and when time domain binding is not used, includes a step of mapping the valid PDSCH to a HARQ-ACK bit in the dynamic HARQ-ACK codebook, or mapping all of the scheduling PDSCHs to HARQ-ACK bits in the dynamic HARQ-ACK codebook.

[0063] In one embodiment of the present application, the time domain binding scheme comprises: (1) incorporating the invalid PDSCH into the time-domain binding calculation range; (2) excluding the invalid PDSCH from the time-domain binding calculation range.

[0064] In one embodiment of the present application, the granularity or scope of the time domain binding is: (1) a PDSCH set scheduled by the DCI; (2) a PDSCH subset of the PDSCH set scheduled by the DCI.

[0065] In one embodiment of the present application, when the granularity or range of the time domain binding includes a PDSCH set scheduled by the DCI, the PDSCH set division method is: (1) all the scheduling PDSCHs are grouped into a PDSCH set; (2) forming all the valid PDSCHs into a PDSCH set.

[0066] In one embodiment of the present application, when the granularity or scope of the time domain binding includes a PDSCH subset of a PDSCH set scheduled by the DCI, the method comprises: determining the number of PDSCH subsets based on the size of the PDSCH subsets; Or, The method further includes determining a size of the PDSCH subset based on the number of PDSCH subsets.

[0067] In one embodiment of the present application, when the granularity or scope of the time domain binding includes a PDSCH subset of a PDSCH set scheduled by the DCI, the method comprises: The method further includes determining a mapping relationship between the scheduling PDSCH or the valid PDSCH and the PDSCH subset.

[0068] In one embodiment of the present application, the mapping relationship is: The first scheduling PDSCH or the first valid PDSCH corresponds to the first PDSCH in the first PDSCH subset, and the remaining scheduling PDSCHs or the remaining valid PDSCHs correspond to the current PDSCH subset or the PDSCH subsets after the current PDSCH subset in order; the last scheduling PDSCH or the last valid PDSCH corresponds to the last PDSCH in the last PDSCH subset, and the remaining scheduling PDSCHs or the remaining valid PDSCHs correspond in order to the current or a PDSCH subset preceding the current PDSCH subset.

[0069] In one embodiment of the present application, the step of determining a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on a DAI counting manner and whether time domain binding is used includes: not mapping the invalid PDSCH to a HARQ-ACK bit in the dynamic HARQ-ACK codebook if time domain binding is not used and the invalid PDSCH is not included in a DAI count; Or, If time domain binding is not used and the invalid PDSCH is incorporated into a DAI count, mapping the invalid PDSCH to a HARQ-ACK bit in the dynamic HARQ-ACK codebook is included.

[0070] In one embodiment of the present application, the step of determining a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on a DAI counting manner and whether time domain binding is used includes: When time domain binding is used and the DAI counting method includes including the invalid PDSCH in the DAI count, the method includes a step of including the invalid PDSCH in the time domain binding calculation range or excluding the invalid PDSCH from the time domain binding calculation range.

[0071] In one embodiment of the present application, the step of determining a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on a DAI counting manner and whether time domain binding is used includes: dividing the scheduling PDSCH into PDSCH groups, and if the counting method of the DAI includes not including an invalid PDSCH group in the DAI count, and time domain binding is not used, not mapping the invalid PDSCH group to a HARQ-ACK bit in the dynamic HARQ-ACK codebook; Or, dividing a PDSCH group for the scheduling PDSCH, and when the counting method of the DAI includes including incorporating an invalid PDSCH group into a DAI count, and time domain binding is not used, mapping the invalid PDSCH group to a HARQ-ACK bit in the dynamic HARQ-ACK codebook, wherein the HARQ-ACK bit is set to a negative acknowledgement (NACK); Here, each scheduling PDSCH corresponding to the invalid PDSCH group is an invalid PDSCH.

[0072] In one embodiment of the present application, the step of determining a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on a DAI counting manner and whether time domain binding is used includes: Dividing PDSCH groups for scheduling PDSCHs, the counting method of the DAI includes counting DAI for each PDSCH group scheduled by a single DCI, and when an invalid PDSCH is included in a valid PDSCH group in the PDSCH group and time domain binding is not used, mapping the invalid PDSCH of the valid PDSCH group to a HARQ-ACK bit in the dynamic HARQ-ACK codebook, wherein the HARQ-ACK bit is set to NACK; Here, at least one scheduling PDSCH corresponding to the valid PDSCH group is a valid PDSCH.

[0073] In one embodiment of the present application, the step of determining a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on a DAI counting manner and whether time domain binding is used includes: The method includes a step of dividing PDSCH groups for the scheduling PDSCH, using time domain binding, and when the DAI counting method includes incorporating invalid PDSCH groups into DAI counting, mapping invalid PDSCH groups in the PDSCH groups to HARQ-ACK bits in the dynamic HARQ-ACK codebook, and the HARQ-ACK bits are set to NACK.

[0074] In one embodiment of the present application, the step of determining a mapping relationship between HARQ-ACK bits in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on a DAI counting manner and whether time domain binding is used includes: The method further includes dividing the scheduled PDSCH into PDSCH groups, and the DAI counting method includes performing DAI counting for each PDSCH group scheduled by a single DCI. When time-domain binding is used, the method further includes a step of including invalid PDSCHs in valid PDSCH groups in the PDSCH group into a time-domain binding calculation range, or excluding invalid PDSCHs in valid PDSCH groups in the PDSCH group from the time-domain binding calculation range.

[0075] The network side device may determine the mapping relationship between the HARQ-ACK bits in the dynamic HARQ-ACK codebook and the PDSCH scheduled by the DCI based on a predefined rule.

[0076] In one embodiment of the present application, the network side device counts the DAI based on one or more of the following: a DAI counting method; and whether or not time domain binding is used.

[0077] In one embodiment of the present application, the step of counting the DAI by the network side device based on a DAI counting method includes: When the DAI counting method includes performing DAI counting for each of the scheduling PDSCHs, the method includes a step in which the network side device does not include the invalid PDSCHs in the DAI count, or includes a step in which the network side device includes the invalid PDSCHs in the DAI count.

[0078] In one embodiment of the present application, the step of counting the DAI by the network side device based on a DAI counting method includes: When the DAI counting method includes performing DAI counting for a PDSCH group scheduled by each DCI, the network side device does not include the PDSCH group in the DAI counting, or includes the PDSCH group in the DAI counting, Here, the scheduling PDSCH is divided into PDSCH groups, or the valid PDSCHs are divided into PDSCH groups, and the PDSCH group includes up to M scheduling PDSCHs with consecutive numbers or indices, or includes up to M adjacent valid PDSCHs among the scheduling PDSCHs, where M is 1 or more.

[0079] In one embodiment of the present application, when the granularity or scope of the time domain binding includes a PDSCH subset of a PDSCH set scheduled by the DCI, the PDSCH subset includes up to N scheduling PDSCHs with consecutive numbers or indices, or includes up to N adjacent valid PDSCHs among the scheduling PDSCHs; Here, N is equal to M, or M is an integer multiple of N, or N is an integer multiple of M.

[0080] In one embodiment of the present application, the method comprises: The network side device further includes sending a DAI instruction to the terminal; Here, the DAI instruction is: (1) The network side device does not include the invalid PDSCH in the DAI count; (2) the network side device incorporates the invalid PDSCH into the DAI count; (3) The network side device does not include the PDSCH group in the DAI count; and (4) The network side device includes the PDSCH group in the DAI count.

[0081] In the embodiments of the present application, when a scheduling PDSCH cannot actually be transmitted, the consistency of the understanding of the HARQ-ACK bit in the dynamic HARQ-ACK codebook between the terminal and the network side device can be ensured, and the reliability of downlink data transmission can be further ensured.

[0082] The following will introduce the mode of implementation of the present application in conjunction with the following examples.

[0083] When a dynamic HARQ-ACK codebook is used for multi-PDSCH scheduling, there are currently three alternative (Alt) schemes for counting the DAI, including Alt Scheme 1, Alt Scheme 2, and Alt Scheme 3. The following provides a method for counting the DAI and / or setting the HARQ-ACK bit for each Alt scheme when the scheduling PDSCH scheduled by DCI cannot actually be transmitted (e.g., the scheduling PDSCH scheduled by DCI collides with a semi-static UL symbol).

[0084] It should be noted that counting or indicating the DAI is performed by the network side equipment, and the terminal receives the corresponding DAI counting indication (or simply the DAI indication) and can determine the possible DCI detection miss situation based on the DAI counting indication corresponding to the actually received DCI.

[0085] The HARQ-ACK bit configuration (including constructing a dynamic HARQ-ACK codebook, i.e., determining a HARQ-ACK bit sequence corresponding to the dynamic HARQ-ACK codebook, determining the mapping relationship between each HARQ-ACK bit and the scheduled PDSCH, and determining the value of the HARQ-ACK bit) is performed by the terminal, and the network side device determines the mapping relationship between the HARQ-ACK bit in the dynamic HARQ-ACK codebook and the PDSCH scheduled by DCI according to a predefined rule, receives the HARQ-ACK bit sequence corresponding to the HARQ-ACK codebook, and reads the value of the HARQ-ACK bit.

[0086] (1) Alternative Option 1: Count DAI for each DCI.

[0087] Generally, at least one Scheduled PDSCH scheduled by each DCI is valid. That is, it can be assumed that there is no collision with a semi-static UL symbol (otherwise, this DCI indication from the network side is completely meaningless). In this case, if one or several Scheduled PDSCHs scheduled by DCI collide with a semi-static UL symbol, the DAI count / indication will not be affected (the DAI count / indication can be based on conventional understanding / methods), but it will affect the setting of the value of the HARQ-ACK bit corresponding to the DAI. The following provides an impact analysis and corresponding processing methods in conjunction with whether time-domain binding is used.

[0088] Case 1-1: The dynamic HARQ-ACK codebook does not use time domain binding.

[0089] The number of HARQ-ACK bits corresponding to each DCI / DAI in the dynamic HARQ-ACK codebook (in the case of a single codebook) or the HARQ-ACK sub-codebook (in the case of a single sub-codebook) corresponding to the Multi-PDSCH DCI depends on the maximum configured number of PDSCHs for multi-PDSCH DCI across serving cells belonging to the same Physical Uplink Control Channel (PUCCH) cell group.

[0090] If the value of the above maximum configured number is MAX, each DCI / DAI corresponds to the number of HARQ-ACK bits corresponding to (i.e., needing to occupy) MAX PDSCHs, hereinafter referred to as MAX positions (in the dynamic HARQ-ACK codebook or HARQ-ACK Sub-codebook corresponding to Multi-PDSCH DCI), each position corresponds to a single PDSCH, Assuming that each PDSCH needs to use S HARQ-ACK bits to feed back corresponding HARQ-ACK information, each of the above positions corresponds to S HARQ-ACK bits, and each DCI / DAI corresponds to MAX×S HARQ-ACK bits.

[0091] If a DCI schedules N Scheduled PDSCHs, including N1 valid PDSCHs and N2 invalid PDSCHs, one of the following methods (configuration method 2-1 or configuration method 2-2) may be used.

[0092] Configuration method 2-1: Only valid PDSCHs are mapped to HARQ-ACK bits in the dynamic HARQ-ACK codebook.

[0093] At this time, the N2 valid PDSCHs scheduled by the DCI are mapped one by one to the first or last N2 positions among the MAX positions corresponding to the DAI corresponding to this DCI based on a scheduling order or other predefined order. In the N2 positions that are actually mapped among the MAX positions, the HARQ-ACK bit corresponding to each position is set based on the decoding result of the corresponding invalid PDSCH, the number of codewords, spatial bundling, etc., and in the MAX-N2 positions that are not mapped among the MAX positions, the HARQ-ACK bits corresponding to each position are all set to NACK.

[0094] The N1 invalid PDSCHs scheduled by the DCI are not mapped to any of the MAX positions.

[0095] Configuration method 2-2: All scheduled PDSCHs are mapped to HARQ-ACK bits in a dynamic HARQ-ACK codebook.

[0096] At this time, the N Scheduled PDSCHs scheduled by the DCI are mapped one by one to the first or last N positions among the MAX positions corresponding to the DAI corresponding to this DCI based on a scheduling order or other predefined order. If a position among the N actually mapped positions among the MAX positions is mapped to a valid PDSCH, the HARQ-ACK bit corresponding to this position is set based on the decoding result of the corresponding invalid PDSCH and the configuration of the number of codewords, spatial bundling, etc. If a position is mapped to an invalid PDSCH, all the HARQ-ACK bits corresponding to this position are set to NACK, and all the HARQ-ACK bits corresponding to each position among the (MAX-N) unmapped positions among the MAX positions are set to NACK.

[0097] Case 1-2: Using time domain binding.

[0098] Time-domain binding may be understood as performing a binary logical AND (or a binary logical OR) on the decoding results of corresponding codewords of two or more PDSCHs to obtain a fused decoding result corresponding to the codeword (i.e., fusing the decoding results corresponding to the codeword of each PDSCH among the two or more PDSCHs, which may be represented by, for example, one bit), and if the configuration uses dual codeword transmission, each codeword corresponds to a respective fused decoding result, which may be further operated on based on the spatial bundling configuration.

[0099] When time-domain binding is used, a PDSCH set / subset is defined as a binding group (bundling group), time-domain binding is performed for the PDSCHs in this PDSCH set / subset, and the corresponding HARQ-ACK bit in the HARQ-ACK codebook of this bundling group is set according to the bundling output.

[0100] As can be seen from the above description, a single DCI / DAI corresponds to one or more bundling groups. That is, bundling granularity 1-1 corresponds to a single bundling group, and bundling granularity 1-2 may correspond to one or more bundling groups, or may correspond to multiple bundling groups. Each bundling group corresponds to a single feedback position in the dynamic HARQ-ACK codebook or the HARQ-ACK sub-codebook corresponding to the Multi-PDSCH DCI, and each feedback position corresponds to one or two HARQ-ACK bits based on the codeword configuration.

[0101] For a specific PDSCH set / subset (referred to as a bundling group), if there is at least one invalid PDSCH in this PDSCH set / subset, one of the following methods (Bundling Method 1-1 or Bundling Method 1-2) may be used.

[0102] Bundling method 1-1: Invalid PDSCH is incorporated into the time domain binding calculation range.

[0103] Each PDSCH in the PDSCH set / subset is equivalent to participating in the time-domain binding calculation. The decoding result corresponding to an invalid PDSCH may be assumed as NACK or ACK.

[0104] Furthermore, to avoid the impact on HARQ-ACK feedback due to the inability to transmit / receive invalid PDSCH, (1) When using binary AND, the decoding result corresponding to an invalid PDSCH may be assumed as an ACK; (2) When using binary OR, the decoding result corresponding to an invalid PDSCH may be assumed as a NACK.

[0105] Bundling method 1-2: Invalid PDSCHs are excluded from the time domain binding calculation range.

[0106] Only each valid PDSCH in the PDSCH set / subset participates in the time domain binding calculation.

[0107] For the granularity / scope of time domain binding, one of the following granularities (Bundling Granularity 1-1 or Bundling Granularity 1-2) may be used.

[0108] Bundling granularity 1-1: Time domain binding is performed within the range of all scheduling PDSCHs scheduled by DCI.

[0109] At this time, one of the following aggregation methods (Aggregation Method 1 or Aggregation Method 2) may be used.

[0110] Aggregation method 1: All scheduled PDSCHs scheduled by DCI are considered as a PDSCH set.

[0111] At this time, the PDSCH set may include invalid PDSCHs, and the above-mentioned Bundling Scheme 1-1 or Bundling Scheme 1-2 may be used.

[0112] Aggregation method 2: All valid PDSCHs scheduled by DCI are considered as a PDSCH set.

[0113] At this time, the normal time domain binding operation can be used for each valid PDSCH in the PDSCH set.

[0114] Bundling granularity 1-2: Time-domain binding is performed within the PDSCH subset range scheduled by DCI.

[0115] In this case, some (not all) of one or more PDSCHs (referred to as a PDSCH set) scheduled by a single DCI may be set as a PDSCH subset. The number of PDSCH subsets scheduled by a single DCI and the size of the PDSCH subset may be determined using one of the following methods (granularity method 1-2-1 or granularity method 1-2-2).

[0116] Granularity method 1-2-1: Determine the number of PDSCH subsets based on the size of the PDSCH subset.

[0117] If the size of the PDSCH subset is known, for example, specified by a protocol or configured based on higher layer signaling, then the number of PDSCH subsets = ceiling (MAX / PDSCH subset size), where MAX is as described above. For the actual PDSCH subset size, one of the following methods (granularity method 1-2-1-1 or granularity method 1-2-1-2) may also be used.

[0118] Granularity method 1-2-1-1: directly using the previously known PDSCH subset size, Granularity method 1-2-1-2: Based on the determined number of PDSCH subsets and further combining granularity method 1-2-2, determine and use the size of the PDSCH subset; Granularity method 1-2-2: Determine the size of the PDSCH subset based on the number of PDSCH subsets.

[0119] If the number of PDSCH subsets is known, e.g., specified by a protocol or configured based on higher layer signaling, one of the following methods (granularity method 1-2-2-1, granularity method 1-2-2-2, or granularity method 1-2-2-3) may be used when determining the size of the PDSCH subsets.

[0120] Granularity method 1-2-2-1: PDSCH subset size = ceiling (MAX / number of PDSCH subsets), For MAX, see the above description.

[0121] Granularity method 1-2-2-2: PDSCH subset size = ceiling (number of scheduled PDSCHs in a PDSCH set / number of PDSCH subsets), Granularity method 1-2-2-3: PDSCH subset size = ceiling (number of valid PDSCHs in the PDSCH set / number of PDSCH subsets).

[0122] When determining the size of the actually used PDSCH subset based on the granularity scheme 1-2-2-2 or the granularity scheme 1-2-2-3, in some cases it may be possible to obtain a smaller actually used PDSCH subset size while keeping the number of PDSCH subsets constant.

[0123] For any one of the above granularity methods based on PDSCH subsets (granularity method 1-2-1 or granularity method 1-2-2), each Scheduled PDSCH may be mapped to a corresponding PDSCH subset (all methods other than the above granularity method 1-2-2-3, which only supports mapping each valid PDSCH to a corresponding PDSCH subset), and each valid PDSCH may be mapped to a corresponding PDSCH subset (any of the above methods may be applied).

[0124] When determining the mapping relationship between the Scheduled PDSCH / valid PDSCH and the PDSCH subset, one of the following schemes (Mapping Scheme 1-1 or Mapping Scheme 1-2) may be used.

[0125] Mapping Scheme 1-1: The first Scheduled PDSCH / active PDSCH corresponds to the first PDSCH of the first PDSCH subset, and the remaining Scheduled PDSCHs / active PDSCHs correspond to the current or subsequent PDSCH subsets in order; Mapping scheme 1-2: The last Scheduled PDSCH / valid PDSCH corresponds to the last PDSCH of the last PDSCH subset, and the remaining Scheduled PDSCHs / valid PDSCHs correspond to the current or previous PDSCH subsets in order.

[0126] When only valid PDSCHs are considered for the above mapping, invalid PDSCHs have already been excluded from PDSCH subsetting and mapping. When Scheduled PDSCHs are considered for the above mapping, invalid PDSCHs may exist in the scheduled PDSCHs mapped to a certain PDSCH subset, and in this case, Bundling Scheme 1-1 or Bundling Scheme 1-2 may be used.

[0127] If no Scheduled PDSCH / valid PDSCH is mapped to a certain PDSCH subset, there is no need to actually perform a time-domain binding operation for this PDSCH subset, and the corresponding HARQ-ACK bits in the codebook or sub-codebook of the bundling group corresponding to this PDSCH subset may all be set to NACK.

[0128] It should be noted that for bundling granularity 1-2, the number of PDSCH subsets corresponding to each DCI / DAI can be predicted before the terminal compiles the HARQ-ACK codebook to ensure consistent understanding between the terminal and the network, and the number of PDSCH subsets here may be understood as the number of bundling groups.

[0129] (2) Alt Scheme 2: Perform DAI counting for each PDSCH.

[0130] When performing DAI counting for PDSCH, one of the following methods (counting method 2-1 or counting method 2-2) may be used.

[0131] Counting method 2-1: Do not include invalid PDSCHs in the DAI count.

[0132] The counter-downlink assignment index (C-DAI) indicated in the DCI corresponds to the first or last valid PDSCH scheduled by this DCI, and the total-downlink assignment index (T-DAI) indicated in the DCI indicates the DAI corresponding to the last valid PDSCH that has been scheduled in the current PUCCH cell group up to the current PDCCH monitoring occasion (including each valid PDSCH scheduled in each serving cell corresponding to the current PUCCH cell group within the current PDCCH monitoring occasion) and for which HARQ-ACK is fed back within the same UL slot / sub-slot. If no missed detection of the scheduling DCI occurs, counting should be postponed on the DAI indicated by this scheduling DCI to feed back the next scheduling DCI corresponding to HARQ-ACK for the same PUCCH cell group of the same UE and within the same UL slot / sub-slot.

[0133] For example, assume that a PUCCH cell group is associated with only a single serving cell, and the terminal detects that DCI1 has scheduled three Scheduled PDSCHs, two of which are valid PDSCHs, and the C-DAI indicated in DCI1 is 1. If there is no DCI detection miss for the first valid scheduled PDSCH, the terminal expects the next DCI2 to indicate C-DAI=3 (i.e., the two valid PDSCHs scheduled in DCI1 correspond to DAI=1 and DAI=2, respectively).

[0134] Counting method 2-2: Incorporate invalid PDSCH into DAI count.

[0135] For each scheduled PDSCH, the DAI count is performed without considering whether it is a valid PDSCH or an invalid PDSCH.

[0136] The UE determines the DCI missed detection situation based on the above certain counting scheme used, and builds the HARQ-ACK codebook accordingly.

[0137] Hereinafter, whether or not time domain binding is used will be distinguished, and bit settings / processing of the HARQ-ACK codebook will be given.

[0138] Case 2-1: No time domain binding is used.

[0139] When using counting method 2-1, an invalid PDSCH has no corresponding HARQ-ACK bit in the HARQ-ACK codebook.

[0140] When counting method 2-2 is used, the invalid PDSCH has corresponding HARQ-ACK bits in the HARQ-ACK codebook, and these HARQ-ACK bits are all set to NACK.

[0141] Case 2-2: Using time domain binding.

[0142] The time domain binding here may be understood as bundling across DAIs (and may even cross DCI boundaries). That is, bundling is performed for every B adjacent DAIs / PDSCHs according to the DAI count / number order, and if there are less than B DAIs at the end, bundling is performed based on the remaining DAIs / PDSCHs. The PDSCHs to be bundled here may form a PDSCH subset. Here, B is the granularity of time domain binding, and B may be 1 or more and may be specified by a protocol or configured based on higher layer signaling.

[0143] For the DAI count / number order, since each DCI can schedule one or multiple PDSCHs, a PDSCH traversal dimension can be introduced based on the original DAI count / number order. Specifically, the DAI count / number order may be to first traverse one or multiple PDSCHs scheduled by a single DCI (based on the scheduling order of the scheduled / valid PDSCHs), then traverse DCIs scheduled in one or multiple serving cells corresponding to the same PDCCH monitoring occasion (directed to a specified UL slot / sub-slot, which may be based on a cell index when traversing the serving cell), and finally traverse each PDCCH monitoring occasion (based on the order of the start times).

[0144] It should be noted that the number of DAIs / PDSCHs corresponding to each DCI can be flexibly changed, and if the time-domain binding is limited to the PDSCH range scheduled by a single DCI, this may cause inconsistency in the understanding of the codebook size on both sides when DCI detection is missed.

[0145] When counting method 2-1 is used, the PDSCH with time domain binding does not participate in the invalid PDSCH.

[0146] When using Counting Method 2-2, you may use one of the following processing methods (Bundling Method 2-1 or Bundling Method 2-2).

[0147] Bundling method 2-1: Invalid PDSCH is incorporated into the time domain binding calculation range.

[0148] At this time, each PDSCH in the PDSCH subset determined based on B participates in the time-domain binding calculation. The decoding result corresponding to the invalid PDSCH may be assumed as NACK or ACK.

[0149] Furthermore, to avoid the impact on HARQ-ACK feedback due to the inability to transmit / receive invalid PDSCH, (1) When using binary AND, the decoding result corresponding to an invalid PDSCH may be assumed as an ACK; (2) When using binary OR, the decoding result corresponding to an invalid PDSCH may be assumed as a NACK.

[0150] Bundling method 2-2: Invalid PDSCHs are excluded from the time domain binding calculation range.

[0151] At this time, only each valid PDSCH in the PDSCH subset determined based on B is involved in the time-domain binding calculation.

[0152] Alternative Scheme 3: DAI counting is performed for each of M scheduling PDSCHs scheduled by a single DCI.

[0153] To briefly explain such a DAI counting scheme, the set of PDSCHs scheduled by each DCI may be divided into one or more PDSCH groups (PDSCH group) based on M. Each PDSCH group contains the maximum number of M consecutive numbered / indexed scheduled PDSCHs (except for the last PDSCH group, other PDSCH groups contain M consecutive numbered / indexed scheduled PDSCHs, and the number of consecutive PDSCHs in the last PDSCH group is ≤ M), and DAI counting is performed for each PDSCH group. Here, M may be defined by the protocol or configured based on upper layer signaling.

[0154] When M = MAX, Alt scheme 3 is Alt scheme 1, and when M = 1, Alt scheme 3 is Alt scheme 2.

[0155] When 1 < M < MAX, Alt scheme 3 is a trade-off between Alt scheme 1 and Alt scheme 2. For the division of PDSCH groups, any one of the following methods (grouping method 1 or grouping method 2) may be used.

[0156] Grouping method 1: Divide PDSCH groups for Scheduled PDSCH.

[0157] At this time, each Scheduled PDSCH scheduled by DCI, regardless of whether it is a valid PDSCH or an invalid PDSCH, is involved in PDSCH group division.

[0158] Grouping method 2: Divide PDSCH groups only for valid PDSCHs.

[0159] At this time, since invalid PDSCHs are not involved in PDSCH group division, the corresponding HARQ-ACK bits do not exist in the HARQ-ACK codebook.

[0160] When using grouping method 1, a scheduled PDSCH may be an invalid PDSCH. If all the scheduled PDSCHs corresponding to a certain PDSCH group are invalid PDSCHs, then this PDSCH group is an invalid PDSCH group; otherwise, it is a valid PDSCH group. In this case, one of the following methods (counting method 3-1 or counting method 3-2) may be used to count the DAI.

[0161] Counting method 3-1: Invalid PDSCH groups are not included in the DAI count.

[0162] The C-DAI indicated in a scheduling DCI corresponds to the first or last valid PDSCH group scheduled by this DCI, and the T-DAI indicated in a scheduling DCI indicates the DAI corresponding to the last valid PDSCH group that has been scheduled in the current PUCCH cell group up to the current PDCCH monitoring occasion (including each valid PDSCH group scheduled in each serving cell corresponding to the current PUCCH cell group within the current PDCCH monitoring occasion) and for which HARQ-ACK is fed back within the same UL slot / sub-slot. If a scheduling DCI detection miss occurs, counting must be postponed on the DAI indicated by this scheduling DCI to feed back the next scheduling DCI corresponding to HARQ-ACK for the same PUCCH cell group of the same UE and within the same UL slot / sub-slot.

[0163] For example, assume that a PUCCH cell group is associated with only a single serving cell, and the terminal detects that DCI1 schedules three PDSCH groups, two of which are valid PDSCH groups, and the C-DAI indicated in DCI1 is 1. If there is no DCI detection miss for the first valid scheduled PDSCH group, the terminal expects the next DCI2 to indicate C-DAI=3 (i.e., the two valid PDSCH groups scheduled in DCI1 correspond to DAI=1 and DAI=2, respectively).

[0164] Counting method 3-2: Invalid PDSCH groups are included in the DAI count.

[0165] For each scheduled PDSCH group, the DAI count is performed without considering whether it is a valid PDSCH group or an invalid PDSCH group.

[0166] The UE determines the DCI missed detection situation based on the above certain counting scheme used, and builds the HARQ-ACK codebook accordingly.

[0167] Hereinafter, whether or not time domain binding is used will be distinguished, and bit settings / processing of the HARQ-ACK codebook will be given.

[0168] Case 3-1: No time domain binding is used.

[0169] When using counting method 3-1, an invalid PDSCH group has no corresponding HARQ-ACK bit in the HARQ-ACK codebook.

[0170] When counting method 3-2 is used, invalid PDSCH groups have corresponding HARQ-ACK bits in the HARQ-ACK codebook, and these HARQ-ACK bits are all set to NACK.

[0171] For any counting scheme, if a valid PDSCH group contains invalid PDSCHs, the invalid PDSCHs have corresponding HARQ-ACK bits in the HARQ-ACK codebook, and these HARQ-ACK bits are all set to NACK.

[0172] Case 3-2: Using time domain binding.

[0173] Assume that the granularity of time domain binding is B1 adjacent PDSCHs and time domain binding is performed for (at most) B1 PDSCHs, where B1 is the granularity of time domain binding, which may be specified by a protocol or configured based on higher layer signaling.

[0174] In general, the relationship between M and B1 may use any one of the following:

[0175] Relationship 1: M=B1.

[0176] In this case, the granularity of the DAI count and the granularity of the time-domain binding are the same, and a PDSCH group corresponding to a single DAI corresponds to a single binding group (Bundling group). In this case, the relationship between the DAI and the codebook size can be reused from the conventional Rel-15 / 16 method, but the value of the HARQ-ACK bit needs to be set based on the time-domain binding operation.

[0177] Relationship 2: M is an integer multiple of B1.

[0178] At this time, the PDSCH group corresponding to a single DAI is further divided into bundling groups, and for example, each PDSCH group is divided into M / B1 bundling groups.

[0179] If the number of PDSCHs included in a certain PDSCH group is M, each bundling group into which this PDSCH group is divided will contain B1 adjacent PDSCHs, and if the number of PDSCHs included in a certain PDSCH group is less than M (for example, if the number of PDSCHs scheduled by a certain DCI is not an integer multiple of M, the number included in the last PDSCH group scheduled by this DCI is less than M), the PDSCHs included in this PDSCH group may be divided as evenly as possible among each bundling group, and in this case, the number of PDSCHs included in some bundling groups may be less than B1.

[0180] Time domain binding is performed for the PDSCHs included in each bundling group.

[0181] Relationship 3: B1 is an integer multiple of M.

[0182] A number of (eg, B1 / M) PDSCH groups are bound together in the time domain, and the DAIs corresponding to these PDSCH groups are counted adjacently or consecutively.

[0183] Here, time domain binding may be understood as bundling across DAIs (and may even cross DCI boundaries). That is, bundling is performed for each of B1 / M adjacent DAI / PDSCH groups in the order of the DAI count / number, and if the last DAI / PDSCH group is less than B1 / M, bundling is performed based on the remaining DAI / PDSCH groups. The PDSCHs to be bundled here may form a PDSCH collection or bundling group. For the DAI count / number order, since each DCI can schedule one or multiple PDSCH groups, a PDSCH group traversal dimension can be introduced based on the original DAI count / number order. Specifically, the DAI count / number order may first traverse one or multiple PDSCH groups scheduled by a single DCI (based on the above-mentioned grouping and counting methods), then traverse DCIs scheduled in one or multiple serving cells corresponding to the same PDCCH monitoring occasion (directed to a specified UL slot / sub-slot, which may be based on the cell index when traversing the serving cell), and finally traverse each PDCCH monitoring occasion (based on the order of the start times).

[0184] When counting method 3-2 is used, invalid PDSCH groups have corresponding HARQ-ACK bits in the HARQ-ACK codebook, and these HARQ-ACK bits are all set to NACK.

[0185] For any counting scheme, the HARQ-ACK process corresponding to the valid PDSCH group may use one of the following schemes (Bundling Scheme 3-1 or Bundling Scheme 3-2).

[0186] Bundling method 3-1: Invalid PDSCH is incorporated into the time domain binding calculation range.

[0187] At this time, each PDSCH in the bundling group is involved in the time-domain binding calculation. The decoding result corresponding to the invalid PDSCH may be regarded as NACK or ACK.

[0188] Furthermore, to avoid the impact on HARQ-ACK feedback due to the inability to transmit / receive invalid PDSCH, (1) When using binary AND, the decoding result corresponding to an invalid PDSCH may be assumed as an ACK; (2) When using binary OR, the decoding result corresponding to an invalid PDSCH may be assumed as a NACK.

[0189] Bundling method 3-2: Invalid PDSCHs are excluded from the time domain binding calculation range.

[0190] At this time, only each valid PDSCH in the bundling group participates in the time-domain binding calculation.

[0191] Referring to FIG. 4, an embodiment of the present application provides a dynamic HARQ-ACK codebook processing apparatus, and the apparatus 400 includes: The method includes a first determination module 401 for determining a mapping relationship between a HARQ-ACK bit in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on one or more of a DAI counting method and whether time domain binding is used, when the scheduling PDSCH cannot be transmitted.

[0192] Here, the scheduling PDSCH includes a valid PDSCH or an invalid PDSCH.

[0193] In one embodiment of the present application, the first determination module 401 is further used to map the valid PDSCH to a HARQ-ACK bit in the dynamic HARQ-ACK codebook, or map all of the scheduling PDSCHs to HARQ-ACK bits in the dynamic HARQ-ACK codebook, when the DAI counting method includes performing DAI counting for each downlink control information DCI and time domain binding is not used.

[0194] In one embodiment of the present application, the time domain binding scheme comprises: (1) incorporating the invalid PDSCH into the time-domain binding calculation range; (2) excluding the invalid PDSCH from the time-domain binding calculation range.

[0195] In one embodiment of the present application, the granularity or scope of the time domain binding is: a PDSCH set scheduled by the DCI; and and a PDSCH subset of the PDSCH set scheduled by the DCI.

[0196] In one embodiment of the present application, when the granularity or range of the time domain binding includes a PDSCH set scheduled by the DCI, the PDSCH set division method is: All the scheduling PDSCHs are grouped into a PDSCH set; Or, The method includes one of: making all the valid PDSCHs into a PDSCH set.

[0197] In one embodiment of the present application, when the granularity or scope of the time domain binding includes a PDSCH subset of a PDSCH set scheduled by the DCI, the device further includes a first determination module for determining the number of the PDSCH subsets based on the size of the PDSCH subsets, or for determining the size of the PDSCH subsets based on the number of the PDSCH subsets.

[0198] In one embodiment of the present application, when the granularity or scope of the time domain binding includes a PDSCH subset of a PDSCH set scheduled by the DCI, the device further includes a second determination module for determining a mapping relationship between the scheduling PDSCH or the valid PDSCH and the PDSCH subset.

[0199] In one embodiment of the present application, the mapping relationship is: The first scheduling PDSCH or the first valid PDSCH corresponds to the first PDSCH in the first PDSCH subset, and the remaining scheduling PDSCHs or the remaining valid PDSCHs correspond to the current PDSCH subset or the PDSCH subsets after the current PDSCH subset in order; the last scheduling PDSCH or the last valid PDSCH corresponds to the last PDSCH in the last PDSCH subset, and the remaining scheduling PDSCHs or the remaining valid PDSCHs correspond in order to the current or a PDSCH subset preceding the current PDSCH subset.

[0200] In one embodiment of the present application, the first determination module 401 further comprises: not mapping the invalid PDSCH to a HARQ-ACK bit in the dynamic HARQ-ACK codebook when not using time domain binding and not incorporating the invalid PDSCH into a DAI count; Or, When time domain binding is not used and the invalid PDSCH is incorporated into the DAI count, it is used to map the invalid PDSCH to a HARQ-ACK bit in the dynamic HARQ-ACK codebook.

[0201] In one embodiment of the present application, the first determination module 401 is further used to include the invalid PDSCH in the time-domain binding calculation range or exclude the invalid PDSCH from the time-domain binding calculation range when time-domain binding is used and the DAI counting method includes including the invalid PDSCH in the DAI count.

[0202] In an embodiment of the present application, the first determining module 401 further comprises: dividing a PDSCH group for the scheduling PDSCH; and the counting method of the DAI includes not including an invalid PDSCH group in the PDSCH group in the DAI count; and when time domain binding is not used, not mapping an invalid PDSCH group in the PDSCH group to a HARQ-ACK bit in the dynamic HARQ-ACK codebook; Or, When time domain binding is not used and a PDSCH group is divided for a scheduling PDSCH, and the counting method of the DAI includes including counting an invalid PDSCH group in a PDSCH group in a DAI count, mapping the invalid PDSCH group in the PDSCH group to a HARQ-ACK bit in the dynamic HARQ-ACK codebook, and the HARQ-ACK bit is used to set a negative acknowledgement (NACK); Here, each scheduling PDSCH corresponding to the invalid PDSCH group is an invalid PDSCH.

[0203] In one embodiment of the present application, the first determination module 401 further divides the scheduling PDSCH into PDSCH groups, and the counting manner of the DAI includes performing DAI counting for each of the PDSCH groups scheduled by a single DCI; when an invalid PDSCH is included in a valid PDSCH group in the PDSCH group and time domain binding is not used, the invalid PDSCH in the valid PDSCH group is used to map the invalid PDSCH to a HARQ-ACK bit in the dynamic HARQ-ACK codebook, and the HARQ-ACK bit is set to NACK; Here, at least one scheduling PDSCH corresponding to the valid PDSCH group is a valid PDSCH.

[0204] In one embodiment of the present application, the first determination module 401 is further used to divide PDSCH groups for the scheduling PDSCH, use time domain binding, and when the DAI counting method includes incorporating invalid PDSCH groups into DAI counting, map invalid PDSCH groups in the PDSCH group to HARQ-ACK bits in the dynamic HARQ-ACK codebook, and the HARQ-ACK bits are set to NACK.

[0205] In one embodiment of the present application, the first determination module 401 further divides PDSCH groups for the scheduled PDSCH, and the DAI counting method includes performing DAI counting for each PDSCH group scheduled by a single DCI, and is used to include invalid PDSCHs in valid PDSCH groups in the PDSCH group into the time-domain binding calculation range or exclude invalid PDSCHs in valid PDSCH groups in the PDSCH group from the time-domain binding calculation range when time-domain binding is used.

[0206] In one embodiment of the present application, the device comprises: Further comprising a receiving module for receiving a DAI instruction from the network side device; Here, the DAI instruction is: (1) The network side device does not include the invalid PDSCH in the DAI count; (2) the network side device incorporates the invalid PDSCH into the DAI count; (3) The network side device does not include the PDSCH group in the DAI count; and (4) The network side device includes the PDSCH group in the DAI count, Here, the PDSCH group is divided for the scheduling PDSCH, or the PDSCH group is divided for valid PDSCHs, and the PDSCH group includes up to M scheduling PDSCHs with consecutive numbers or indices, or includes adjacent valid PDSCHs among up to M of the scheduling PDSCHs, where M is 1 or more.

[0207] In one embodiment of the present application, when the granularity or scope of the time domain binding includes a PDSCH subset of a PDSCH set scheduled by the DCI, the PDSCH subset includes up to N scheduling PDSCHs with consecutive numbers or indices, or includes up to N adjacent valid PDSCHs among the scheduling PDSCHs; Here, N is equal to M, or M is an integer multiple of N, or N is an integer multiple of M.

[0208] The apparatus according to the embodiment of the present application can realize each process realized by the embodiment of the method shown in FIG. 2 and achieve the same technical effect, and will not be further described here to avoid repetition.

[0209] Referring to FIG. 5, an embodiment of the present application provides a dynamic HARQ-ACK codebook processing device for use in a network side device, the device 500 comprising: and a second determination module 501 for determining a mapping relationship between a HARQ-ACK bit in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on one or more of a DAI counting method and whether time domain binding is used, when the scheduling PDSCH cannot be transmitted.

[0210] Here, the scheduling PDSCH includes a valid PDSCH or an invalid PDSCH.

[0211] In one embodiment of the present application, the device 500 comprises: When the scheduling PDSCH cannot be transmitted, the processing module for counting the DAI is based on one or more of a DAI counting method and whether or not time domain binding is used; Here, the scheduling PDSCH includes a valid PDSCH or an invalid PDSCH.

[0212] In one embodiment of the present application, the processing module is further used to not include the invalid PDSCH in the DAI count or to include the invalid PDSCH in the DAI count when the DAI counting method includes performing DAI counting for each of the scheduling PDSCHs.

[0213] In one embodiment of the present application, the processing module is further configured to, when the DAI counting method includes performing DAI counting for a PDSCH group scheduled by each DCI, not include the PDSCH group in the DAI count or include the PDSCH group in the DAI count; Here, the PDSCH group is divided for the scheduling PDSCH, or the PDSCH group is divided for valid PDSCHs, and the PDSCH group includes up to M scheduling PDSCHs with consecutive numbers or indices, or includes adjacent valid PDSCHs among up to M of the scheduling PDSCHs, where M is 1 or more.

[0214] In one embodiment of the present application, when the granularity or scope of the time domain binding includes a PDSCH subset of a PDSCH set scheduled by DCI, the PDSCH subset includes up to N scheduling PDSCHs with consecutive numbers or indices, or includes up to N adjacent valid PDSCHs among the scheduling PDSCHs; Here, N is equal to M, or M is an integer multiple of N, or N is an integer multiple of M.

[0215] In one embodiment of the present application, the device comprises: further comprising a sending module for sending a DAI instruction to the terminal; Here, the DAI instruction is: (1) The network side device does not include the invalid PDSCH in the DAI count; (2) the network side device incorporates the invalid PDSCH into the DAI count; (3) The network side device does not include the PDSCH group in the DAI count; and (4) The network side device includes the PDSCH group in the DAI count.

[0216] The apparatus according to the embodiment of the present application can realize each process realized by the embodiment of the method shown in FIG. 3 and achieve the same technical effect, and will not be further described here to avoid repetition of description.

[0217] An embodiment of the present application further provides a terminal, including a processor and a communication interface, where the processor is used to determine, when a scheduling PDSCH cannot be transmitted, a mapping relationship between a HARQ-ACK bit in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on one or more of a DAI counting manner and whether time domain binding is used. This terminal embodiment corresponds to the above-mentioned terminal-side method embodiment, and the implementation processes and realization manners of the above-mentioned method embodiments can all be applied to this terminal embodiment, and the same technical effects can be achieved.

[0218] Specifically, FIG. 6 is a hardware structural schematic diagram of a terminal for implementing an embodiment of the present application, in which the terminal 600 includes at least some components such as, but not limited to, a radio frequency unit 601, a network module 602, an audio output unit 603, an input unit 604, a sensor 605, a display unit 606, a user input unit 607, an interface unit 608, a memory 609, and a processor 610.

[0219] As will be understood by those skilled in the art, the terminal 600 may further include a power source (e.g., a battery) for powering each component, and the power source may be logically connected to the processor 610 by a power management system, thereby enabling the power management system to realize functions such as charge / discharge management and power consumption management. The terminal structure shown in Figure 6 does not constitute a limitation on the terminal, and the terminal may include more or fewer components than those shown, or a combination of some components, or a different arrangement of components, which will not be further described here.

[0220] It should be understood that in the embodiment of the present application, the input unit 604 may include a graphics processing unit (GPU) 6041 and a microphone 6042, and the graphics processor 6041 processes image data of still or video images captured by an image capture device (e.g., a camera) in a video capture mode or an image capture mode. The display unit 606 may include a display panel 6061, which may be configured in the form of a liquid crystal display, an organic light-emitting diode, or the like. The user input unit 607 includes a touch panel 6071 and other input devices 6072. The touch panel 6071 is also called a touch screen. The touch panel 6071 may include two parts: a touch detection device and a touch controller. The other input devices 6072 may include, but are not limited to, a physical keyboard, function keys (e.g., volume control buttons, switch buttons, etc.), a trackball, a mouse, and a control lever, which will not be further described herein.

[0221] In the embodiment of the present application, the radio frequency unit 601 receives downlink data from the network side device, then processes the data in the processor 610, and transmits uplink data to the network side device. Generally, the radio frequency unit 601 includes, but is not limited to, an antenna, at least one amplifier, a transceiver, a coupler, a low-noise amplifier, a duplexer, etc.

[0222] The memory 609 may be used to store software programs or instructions and various data. The memory 609 may primarily include a program or instruction storage area and a data storage area, where the program or instruction storage area can store an operating system, an application program or instructions required for at least one function (e.g., audio playback function, image playback function, etc.), etc. The memory 609 may include high-speed random access memory or nonvolatile memory, where the nonvolatile memory may be read-only memory (ROM), programmable read-only memory (PROM), erasable programmable read-only memory (EPROM), electrically erasable programmable read-only memory (EEPROM), or flash memory. For example, the memory 609 may be at least one magnetic disk memory device, flash memory device, or other nonvolatile solid-state memory device.

[0223] The processor 610 may include one or more processing units. Optionally, the processor 610 may integrate an application processor and a modem processor. Here, the application processor mainly processes an operating system, a user interface, and application programs or instructions, and the modem processor mainly processes wireless communication, such as a baseband processor. The modem processor does not necessarily have to be integrated into the processor 610.

[0224] In an embodiment of the present application, when a scheduling PDSCH cannot be transmitted, the processor 610 is used to determine the mapping relationship between the HARQ-ACK bits in the dynamic HARQ-ACK codebook and the scheduling PDSCH based on one or more of the DAI counting method and whether or not time domain binding is used.

[0225] In an embodiment of the present application, the radio frequency unit 601 receives a DAI indication from a network side device; Here, the DAI instruction is: The network side device does not include the invalid PDSCH in the DAI count; The network side device includes the invalid PDSCH in the DAI count; The network side device does not include the PDSCH group in the DAI count; The network side device includes the PDSCH group in the DAI count, Here, the PDSCH group is divided for the scheduling PDSCH, or the PDSCH group is divided for valid PDSCHs, and the PDSCH group includes up to M scheduling PDSCHs with consecutive numbers or indices, where M is 1 or greater.

[0226] The terminal according to the embodiment of the present application can implement each process implemented by the embodiment of the method shown in Figure 2 and achieve the same technical effect, and will not be further described here to avoid repetition.

[0227] An embodiment of the present application further provides a network-side device, including a processor and a communication interface, where the processor is used to determine, when a scheduling PDSCH cannot be transmitted, a mapping relationship between a HARQ-ACK bit in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on one or more of a DAI counting manner and whether time domain binding is used. This embodiment of the network-side device corresponds to the above-mentioned embodiment of the network-side device method, and the implementation processes and realization manners of the above-mentioned embodiment of the method can be applied to this embodiment of the network-side device, and the same technical effects can be achieved.

[0228] Specifically, an embodiment of the present application further provides a network side device. As shown in Fig. 7, the network side device 700 includes an antenna 701, a radio frequency device 702, and a baseband device 703. The antenna 701 and the radio frequency device 702 are connected to each other. In the uplink direction, the radio frequency device 702 receives information through the antenna 701 and transmits the received information to the baseband device 703 for processing. In the downlink direction, the baseband device 703 processes the information to be transmitted and transmits it to the radio frequency device 702, and the radio frequency device 702 processes the received information and then transmits it through the antenna 701.

[0229] The above frequency band processing device may be located in a baseband device 703, and the method performed by the network side equipment in the above embodiments may be implemented in the baseband device 703, which includes a processor 704 and a memory 705.

[0230] The baseband device 703 may include, for example, at least one baseband board, on which multiple chips are installed, and as shown in FIG. 7, one of the chips is, for example, a processor 704, which is connected to a memory 705, and calls the program in the memory 705 to perform the network equipment operations shown in the above method embodiments.

[0231] The baseband device 703 may further include a network interface 706, which is used to exchange information with the radio frequency device 702, and this interface is, for example, a common public radio interface (abbreviated as CPRI).

[0232] Specifically, the network side device of the embodiment of the present application further includes instructions or programs stored in the memory 705 and operable on the processor 704 .

[0233] In an embodiment of the present application, when a scheduling PDSCH cannot be transmitted, the processor 704 is used to determine a mapping relationship between a HARQ-ACK bit in a dynamic HARQ-ACK codebook and the scheduling PDSCH based on one or more of a DAI counting method and whether time domain binding is used, where the scheduling PDSCH includes a valid PDSCH or an invalid PDSCH.

[0234] In an embodiment of the present application, the processor 704 is further used to count the DAI based on one or more of the following: a DAI counting method; and whether or not time domain binding is used.

[0235] In an embodiment of the present application, the radio frequency device 702 is used to transmit the DAI indication to the terminal, Here, the DAI instruction is: The network side device does not include the invalid PDSCH in the DAI count; The network side device includes the invalid PDSCH in the DAI count; The network side device does not include the PDSCH group in the DAI count; The network side device includes the PDSCH group in the DAI count.

[0236] The processor 704 can call instructions or programs in the memory 705 to execute the methods performed by each module shown in FIG. 5 and achieve the same technical effects, which will not be further described here to avoid repetition.

[0237] An embodiment of the present application further provides a computer program / program product, the computer program / program product being stored in a non-volatile storage medium, and the computer program / program product being executed by at least one processor to realize the steps of the processing method described in FIG. 2 or FIG. 3.

[0238] The embodiments of the present application further provide a readable storage medium, on which a program or instruction is stored, which, when executed by a processor, can realize each process of the method embodiment shown in Figure 2 or Figure 3 and achieve the same technical effect. In order to avoid repetition, no further description will be given here.

[0239] The processor may be the processor in the terminal described in the above embodiment. The readable storage medium may include a computer-readable storage medium, such as a computer read-only memory (ROM), a random access memory (RAM), a magnetic disk, or an optical disk.

[0240] The embodiments of the present application further provide a chip, the chip including a processor and a communication interface, the communication interface being coupled to the processor, the processor running a program or instruction to realize each process of the method embodiment shown in Figure 3 above, and can achieve the same technical effect. In order to avoid repetition, no further description will be given here.

[0241] It should be understood that the chips referred to in the embodiments of this application may be referred to as system level chips, system chips, chip systems, or system-on-chips.

[0242] It should be noted that, in this specification, the terms "comprises," "including," and any other variations thereof are intended to cover the non-exclusive "comprises," whereby a process, method, article, or apparatus comprising a set of elements not only includes those elements but also other elements not expressly listed or inherent in such process, method, article, or apparatus. Absent further limitations, an element limited by the phrase "comprises one of," does not preclude the presence of other identical elements in the process, method, article, or apparatus comprising that element. It should be noted that the scope of the methods and apparatuses in the embodiments of this application is not limited to performing functions in the order shown or discussed, but may include performing functions in an essentially simultaneous manner or in the reverse order based on the functions involved. For example, the described method may be performed in a different order than described, and various steps may be added, omitted, or combined. Furthermore, features described with reference to some examples may be combined in other examples.

[0243] As will be apparent to those skilled in the art from the above description of the embodiments, the methods of the above embodiments can be realized in the form of software and a necessary general-purpose hardware platform. Of course, they can also be realized in hardware, but in many cases the former is a more preferred embodiment. Based on this understanding, the technical proposal of the present application, in substance or in part contributing to the prior art, may be embodied in the form of a computer software product, which is stored in a storage medium (e.g., ROM / RAM, magnetic disk, optical disk) and includes a number of instructions for causing a terminal (which may be a mobile phone, computer, server, air conditioner, network device, etc.) to execute the methods described in each embodiment of the present application.

[0244] Although the embodiments of the present application have been described above in conjunction with the drawings, the present application is not limited to the above specific embodiments. The above specific embodiments are merely illustrative and not limiting. Those skilled in the art can take the teachings of the present application into account and implement many forms without departing from the spirit and scope of the claims, all of which fall within the scope of protection of the present application.

Claims

1. A dynamic hybrid automatic repeat request response (HARQ-ACK) codebook processing method, comprising: When a scheduling physical downlink shared channel (PDSCH) cannot be transmitted due to collision with a semi-static uplink symbol, the terminal determines a mapping relationship between a hybrid automatic repeat request (HARQ-ACK) bit in a dynamic hybrid automatic repeat request (HARQ-ACK) codebook and the scheduling physical downlink shared channel (PDSCH) based on a counting manner of a downlink allocation index (DAI) and whether time domain binding is used; determining a mapping relationship between a hybrid automatic repeat request (HARQ-ACK) bit in a dynamic hybrid automatic repeat request (HARQ-ACK) codebook and the scheduling physical downlink shared channel (PDSCH) based on a counting manner of a downlink allocation index (DAI) and whether time domain binding is used, a step of mapping valid physical downlink shared channels PDSCHs among the scheduling physical downlink shared channels PDSCHs to hybrid automatic repeat request response HARQ-ACK bits in the dynamic hybrid automatic repeat request response HARQ-ACK codebook, or mapping all of the scheduling physical downlink shared channels PDSCHs to hybrid automatic repeat request response HARQ-ACK bits in the dynamic hybrid automatic repeat request response HARQ-ACK codebook, when a counting method of the downlink allocation index DAI includes counting the downlink allocation index DAI for each downlink control information DCI and time domain binding is not used; Or, a step of including all Physical Downlink Shared Channels PDSCHs among the scheduling Physical Downlink Shared Channels PDSCHs in a time-domain binding calculation range and mapping them to a hybrid automatic repeat request response HARQ-ACK bit in the dynamic hybrid automatic repeat request response HARQ-ACK codebook, when the counting method of the downlink allocation index DAI includes performing downlink allocation index DAI counting for each downlink control information DCI, and the method includes a step of including all Physical Downlink Shared Channels PDSCHs among the scheduling Physical Downlink Shared Channels PDSCHs in a time-domain binding calculation range and mapping them to a hybrid automatic repeat request response HARQ-ACK bit in the dynamic hybrid automatic repeat request response HARQ-ACK codebook, when the time-domain binding is used.

2. the number of HARQ-ACK bits in the dynamic HARQ-ACK codebook corresponding to the physical downlink shared channel (PDSCH) scheduled by each downlink control information (DCI) is determined based on a maximum number MAX of physical downlink shared channels (PDSCH) configured for multi-PDSCH DCI of serving cells belonging to the same PUCCH cell group; 2. The dynamic hybrid automatic repeat request response HARQ-ACK codebook processing method according to claim 1, wherein each downlink control information (DCI) corresponds to the maximum set number MAX of positions in the dynamic HARQ-ACK codebook, and each of the positions corresponds to a single physical downlink shared channel (PDSCH).

3. Mapping all of the scheduling physical downlink shared channels (PDSCH) to hybrid automatic repeat request (HARQ-ACK) bits in the dynamic hybrid automatic repeat request (HARQ-ACK) codebook includes:

3. The method for processing a dynamic hybrid automatic repeat request response HARQ-ACK codebook according to claim 2, comprising: mapping, based on a scheduling order, N scheduling physical downlink shared channels (PDSCHs) scheduled by a certain downlink control information (DCI), one by one to first N positions out of the MAX positions corresponding to the certain downlink control information (DCI) in the dynamic hybrid automatic repeat request response HARQ-ACK codebook.

4. 4. The dynamic hybrid automatic repeat request response HARQ-ACK codebook processing method according to claim 3, wherein, when a certain position among the N positions actually mapped among the MAX positions corresponding to the certain downlink control information DCI in the dynamic hybrid automatic repeat request response HARQ-ACK codebook is mapped to an invalid physical downlink shared channel PDSCH, a HARQ-ACK bit corresponding to the certain position is set to NACK.

5. 4. The method for processing a dynamic hybrid automatic repeat request response HARQ-ACK codebook according to claim 3, wherein hybrid automatic repeat request response HARQ-ACK bits corresponding to each of unmapped (MAX-N) positions among the MAX positions corresponding to the one downlink control information (DCI) in the dynamic hybrid automatic repeat request response HARQ-ACK codebook are all set to NACK.

6. When the counting method of the downlink allocation index (DAI) includes counting the downlink allocation index (DAI) for each downlink control information (DCI), and a time domain binding is used, the granularity or range of the time domain binding is: a physical downlink shared channel (PDSCH) set scheduled by downlink control information (DCI) consisting of all the scheduling physical downlink shared channels (PDSCH); a physical downlink shared channel PDSCH subset of a physical downlink shared channel PDSCH set scheduled by the downlink control information DCI; 2. The method of claim 1, wherein a size of the PDSCH subset is determined based on a number of the PDSCH subsets, and the number of the PDSCH subsets is configured based on higher layer signaling.

7. When the granularity or range of the time domain binding includes a physical downlink shared channel (PDSCH) subset of a physical downlink shared channel (PDSCH) set scheduled by the downlink control information (DCI), the dynamic hybrid automatic repeat request response (HARQ-ACK) codebook processing method comprises: determining a mapping relationship between the scheduling physical downlink shared channel PDSCH or an effective physical downlink shared channel PDSCH among the scheduling physical downlink shared channels PDSCH and the physical downlink shared channel PDSCH subset; The mapping relationship is: a first scheduling physical downlink shared channel PDSCH or a first valid physical downlink shared channel PDSCH corresponds to a first physical downlink shared channel PDSCH in a first physical downlink shared channel PDSCH subset, and the remaining scheduling physical downlink shared channels PDSCH or the remaining valid physical downlink shared channels PDSCH correspond in order to the first physical downlink shared channel PDSCH subset or the physical downlink shared channel PDSCH subset following the first physical downlink shared channel PDSCH subset; a last scheduled physical downlink shared channel PDSCH or a last valid physical downlink shared channel PDSCH corresponds to a last physical downlink shared channel PDSCH in a last physical downlink shared channel PDSCH subset, and a remaining scheduled physical downlink shared channel PDSCH or a remaining valid physical downlink shared channel PDSCH corresponds in order to the last physical downlink shared channel PDSCH subset or a physical downlink shared channel PDSCH subset preceding the last physical downlink shared channel PDSCH subset.

8. If there is at least one invalid physical downlink shared channel (PDSCH) in a specific binding group, when the time-domain binding operation uses binary AND, assume that the decoding result corresponding to the invalid physical downlink shared channel (PDSCH) in the specific binding group is an ACK, and set a HARQ-ACK bit corresponding to the specific binding group in the dynamic HARQ-ACK codebook according to a binding output; If no scheduling physical downlink shared channel (PDSCH) or no valid physical downlink shared channel (PDSCH) is mapped to the specific binding group, setting all HARQ-ACK bits corresponding to the specific binding group in the dynamic HARQ-ACK codebook to NACK; 7. The dynamic hybrid automatic repeat request response HARQ-ACK codebook processing method according to claim 6, wherein the specific binding group is the physical downlink shared channel (PDSCH) set, or the specific binding group is one physical downlink shared channel (PDSCH) subset.

9. 2. The dynamic hybrid automatic repeat request response HARQ-ACK codebook processing method according to claim 1, wherein at least one of the scheduling physical downlink shared channels PDSCHs scheduled by a certain downlink control information DCI does not collide with a semi-static uplink symbol.

10. A dynamic hybrid automatic repeat request response (HARQ-ACK) codebook processing method, comprising: When a scheduling physical downlink shared channel (PDSCH) cannot be transmitted due to collision with a semi-static uplink symbol, a network side device determines a mapping relationship between a hybrid automatic repeat request (HARQ-ACK) bit in a dynamic hybrid automatic repeat request (HARQ-ACK) codebook and the scheduling physical downlink shared channel (PDSCH) based on a counting manner of a downlink allocation index (DAI) and whether time domain binding is used; determining a mapping relationship between a hybrid automatic repeat request (HARQ-ACK) bit in a dynamic hybrid automatic repeat request (HARQ-ACK) codebook and the scheduling physical downlink shared channel (PDSCH) based on a counting manner of a downlink allocation index (DAI) and whether time domain binding is used, a step of mapping valid physical downlink shared channels PDSCHs among the scheduling physical downlink shared channels PDSCHs to hybrid automatic repeat request response HARQ-ACK bits in the dynamic hybrid automatic repeat request response HARQ-ACK codebook, or mapping all of the scheduling physical downlink shared channels PDSCHs to hybrid automatic repeat request response HARQ-ACK bits in the dynamic hybrid automatic repeat request response HARQ-ACK codebook, when a counting method of the downlink allocation index DAI includes counting the downlink allocation index DAI for each downlink control information DCI and time domain binding is not used; Or, a step of including all Physical Downlink Shared Channels PDSCHs among the scheduling Physical Downlink Shared Channels PDSCHs in a time-domain binding calculation range and mapping them to a hybrid automatic repeat request response HARQ-ACK bit in the dynamic hybrid automatic repeat request response HARQ-ACK codebook, when the counting method of the downlink allocation index DAI includes performing downlink allocation index DAI counting for each downlink control information DCI, and the method includes a step of including all Physical Downlink Shared Channels PDSCHs among the scheduling Physical Downlink Shared Channels PDSCHs in a time-domain binding calculation range and mapping them to a hybrid automatic repeat request response HARQ-ACK bit in the dynamic hybrid automatic repeat request response HARQ-ACK codebook, when the time-domain binding is used.

11. The hybrid automatic repeat request response (HARQ-ACK) codebook processing method includes: The network side device further includes counting the downlink assignment index DAI according to a counting manner of the downlink assignment index DAI; The step of counting the downlink assignment index DAI by the network side device according to a counting method of the downlink assignment index DAI includes: When the counting method of the downlink allocation index DAI includes counting the downlink allocation index DAI for each of the scheduling physical downlink shared channels PDSCH, the network side device does not include an invalid physical downlink shared channel PDSCH among the scheduling physical downlink shared channels PDSCH in the downlink allocation index DAI count, or includes an invalid physical downlink shared channel PDSCH among the scheduling physical downlink shared channels PDSCH in the downlink allocation index DAI count, Or, The step of counting the downlink assignment index DAI by the network side device according to a counting method of the downlink assignment index DAI includes: When the counting method of the downlink allocation index (DAI) includes counting the downlink allocation index (DAI) for a physical downlink shared channel (PDSCH) group scheduled by each downlink control information (DCI), the network side device does not include the physical downlink shared channel (PDSCH) group in the downlink allocation index (DAI) count, or includes including the physical downlink shared channel (PDSCH) group in the downlink allocation index (DAI) count, 11. The dynamic hybrid automatic repeat request response HARQ-ACK codebook processing method according to claim 10, wherein the scheduling physical downlink shared channel PDSCH is divided into physical downlink shared channel PDSCH groups, or valid physical downlink shared channels PDSCH among the scheduling physical downlink shared channels PDSCH are divided into physical downlink shared channel PDSCH groups, and the physical downlink shared channel PDSCH group includes up to M scheduling physical downlink shared channels PDSCH with consecutive numbers or indices, or includes up to M adjacent valid physical downlink shared channels PDSCH among the scheduling physical downlink shared channels PDSCH, where M is 1 or more.

12. 10. A terminal comprising: a processor; a memory; and a program stored in the memory and operable on the processor, the program, when executed by the processor, implementing the steps of the dynamic hybrid automatic repeat request response HARQ-ACK codebook processing method according to any one of claims 1 to 9.

13. 12. A network side device comprising: a processor; a memory; and a program stored in the memory and operable on the processor, the network side device realizing the steps of the dynamic hybrid automatic repeat request response HARQ-ACK codebook processing method according to claim 10 or 11 when the program is executed by the processor.

Images