Codebook construction method, apparatus, communication device, storage medium, and system

Abstract

The present application discloses a codebook construction method, an apparatus, a communication device, a storage medium and a system, the codebook construction method including: constructing a semi-static HARQ-ACK codebook; and transmitting a semi-static HARQ-ACK codebook, where the constructing a semi-static HARQ-ACK codebook includes: performing time-domain binding based on first information after determining a transmission occasion set, and constructing a semi-static HARQ-ACK codebook based on a time-domain binding result; and constructing a semi-static HARQ-ACK codebook according to a last time-domain resource allocation record of each row in a time-domain resource allocation table based on second information, the first information being a boundary of transmission occasions in the transmission occasion set or a candidate PDSCH receiving occasion union corresponding to the transmission occasion set, and the second information being used for indicating whether there is a collision between at least one time-domain resource allocation record of a first target row in the time-domain resource allocation table and the semi-static time-domain configuration information.

Description

Technical Field

[0001] (Cross - reference to related applications) This application claims the priority of Chinese Patent Application No. 202110513688.3, filed in China on May 11, 2021, and the entire content of the said application is incorporated herein by reference.

[0002] This application belongs to the field of communication technologies, and specifically relates to a codebook construction method, apparatus, communication device, storage medium, and system.

Background Art

[0003] Currently, in order to fully utilize carrier time - domain resources, multi - physical downlink shared channel (Multi - PDSCH) scheduling has been introduced. Multi - PDSCH scheduling means that a single downlink control information (DCI) can schedule multiple PDSCH transmissions on the same carrier at one time. For a semi - static hybrid automatic repeat request - acknowledgement (HARQ - ACK) codebook that supports Multi - PDSCH scheduling, how to construct this semi - static HARQ - ACK codebook is a problem that urgently needs to be solved.

Summary of the Invention

Problems to be Solved by the Invention

[0004] Embodiments of this application provide a codebook construction method, apparatus, communication device, storage medium, and system that can solve the problem of how to construct a semi - static HARQ - ACK codebook for a semi - static HARQ - ACK codebook that supports Multi - PDSCH scheduling.

Means for Solving the Problems

[0005] The first aspect provides a codebook construction method, which includes the steps of a user equipment (UE) constructing a semi-static HARQ-ACK codebook and the UE transmitting the semi-static HARQ-ACK codebook. Here, the step of the UE constructing the semi-static HARQ-ACK codebook includes the UE performing time-domain binding based on first information after determining a set of transmission occasions, and constructing a semi-static HARQ-ACK codebook based on the time-domain binding result, and the UE constructing a semi-static HARQ-ACK codebook according to the last time-domain resource allocation record in each row of the time-domain resource allocation table based on second information. Here, the first information is either the boundary of the transmission occasion in the set of transmission occasions or the union of candidate PDSCH reception occasions corresponding to the set of transmission occasions. The union of candidate PDSCH reception occasions is a union of candidate PDSCH reception occasions obtained by cascading each candidate PDSCH reception occasion in the set of candidate PDSCH reception occasions corresponding to each transmission occasion in the set of transmission occasions in a preset order. The second information is used to indicate whether there is a conflict between at least one time-domain resource allocation record in the first target row of the time-domain resource allocation table and the semi-static time-domain configuration information. The first target row is any row in the time-domain resource allocation table.

[0006] A second aspect provides a codebook construction method, which includes a step in which a network-side device receives a semi-static HARQ-ACK codebook. Here, the semi-static HARQ codebook is constructed based on a time-domain binding result, or the semi-static HARQ-ACK codebook is constructed according to the last time-domain resource allocation record in each row of a time-domain resource allocation table based on second information. Here, the time-domain binding result is obtained by performing time-domain binding based on first information after determining a set of transmission occasions. The first information is either the boundary of a transmission occasion in the set of transmission occasions or the union of candidate PDSCH reception occasion sets corresponding to the set of transmission occasions. The union of candidate PDSCH reception occasion sets is a union of candidate PDSCH reception occasions obtained by cascading the candidate PDSCH reception occasions in each candidate PDSCH reception occasion set corresponding to each transmission occasion in the set of transmission occasions in a preset order. The second information is used to indicate whether there is a conflict between at least one time-domain resource allocation record in a first target row in the time-domain resource allocation table and semi-static time-domain configuration information. The first target row is any row in the time-domain resource allocation table.

[0007] A third aspect provides a codebook construction apparatus, which includes a construction module and a transmission module. Here, the construction module is used to construct a semi-static HARQ-ACK codebook. The transmission module is used to transmit the semi-static HARQ-ACK codebook. Here, constructing the semi-static HARQ-ACK codebook specifically includes either, after determining a set of transmission occasions, performing time-domain binding based on first information and constructing the semi-static HARQ-ACK codebook based on the time-domain binding result; or constructing the semi-static HARQ-ACK codebook according to the last time-domain resource allocation record in each row of the time-domain resource allocation table based on second information. Here, the first information is either one of the boundary of the transmission occasion in the set of transmission occasions and the union of candidate PDSCH reception occasions corresponding to the set of transmission occasions. The union of candidate PDSCH reception occasions is a union of candidate PDSCH reception occasions obtained by cascading each candidate PDSCH reception occasion in the set of candidate PDSCH reception occasions corresponding to each transmission occasion in the set of transmission occasions in a head-to-tail manner according to a preset order. The second information is used to indicate whether there is a conflict between at least one time-domain resource allocation record in the first target row of the time-domain resource allocation table and the semi-static time-domain configuration information. The first target row is any row in the time-domain resource allocation table.

[0008] The fourth aspect provides a codebook construction device, which includes a receiving module. Here, the receiving module is used to receive a semi-static HARQ-ACK codebook. Here, the semi-static HARQ codebook is constructed based on a time-domain binding result, or the semi-static HARQ-ACK codebook is constructed according to the last time-domain resource allocation record in each row of the time-domain resource allocation table based on second information. Here, the time-domain binding result is obtained by performing time-domain binding based on first information after determining a set of transmission occasions. The first information is either the boundary of a transmission occasion in the set of transmission occasions or the union of candidate PDSCH reception occasion sets corresponding to the set of transmission occasions. The union of candidate PDSCH reception occasion sets is a union of candidate PDSCH reception occasions obtained by cascading each candidate PDSCH reception occasion in each candidate PDSCH reception occasion set corresponding to each transmission occasion in the set of transmission occasions in a preset order. The second information is used to indicate whether there is a conflict between at least one time-domain resource allocation record in a first target row in the time-domain resource allocation table and semi-static time-domain configuration information. The first target row is any row in the time-domain resource allocation table.

[0009] The fifth aspect provides a UE, which includes a processor, a memory, and a program or instruction stored in the memory and executable on the processor. When the program or instruction is executed by the processor, the steps of the method described in the first aspect are realized.

[0010] The sixth aspect provides a network-side device, which includes a processor, a memory, and a program or instruction stored in the memory and executable on the processor. When the program or instruction is executed by the processor, the steps of the method described in the second aspect are realized.

[0011] A seventh aspect provides a UE including a processor and a communication interface, where the processor constructs a semi-static HARQ-ACK codebook and is used to transmit the semi-static HARQ-ACK codebook. Here, constructing the semi-static HARQ-ACK codebook specifically includes either executing time-domain binding based on first information after determining a set of transmission occasions and constructing the semi-static HARQ-ACK codebook based on the time-domain binding result, or constructing the semi-static HARQ-ACK codebook according to the last time-domain resource allocation record in each row of the time-domain resource allocation table based on second information. Here, the first information is either the boundary of a transmission occasion in the set of transmission occasions or the union of candidate PDSCH reception occasions corresponding to the set of transmission occasions. The union of candidate PDSCH reception occasions is a union of candidate PDSCH reception occasions obtained by cascading each candidate PDSCH reception occasion in the set of candidate PDSCH reception occasions corresponding to each transmission occasion in the set of transmission occasions in a preset order. The second information is used to indicate whether there is a conflict between at least one time-domain resource allocation record in a first target row in the time-domain resource allocation table and the semi-static time-domain configuration information, and the first target row is any row in the time-domain resource allocation table.

[0012] The eighth aspect provides a network-side device including a processor and a communication interface, where the processor is used to receive a semi-static HARQ-ACK codebook, where the semi-static HARQ codebook is constructed based on a time-domain binding result, or the semi-static HARQ-ACK codebook is constructed according to the last time-domain resource allocation record in each row of the time-domain resource allocation table based on second information. Here, the time-domain binding result is obtained by performing time-domain binding based on first information after determining a set of transmission occasions, and the first information is either the boundary of a transmission occasion in the set of transmission occasions or the union of candidate PDSCH reception occasion sets corresponding to the set of transmission occasions. The union of candidate PDSCH reception occasion sets is a union of candidate PDSCH reception occasions obtained by cascading the candidate PDSCH reception occasions in each candidate PDSCH reception occasion set corresponding to each transmission occasion in the set of transmission occasions in a preset order. The second information is used to indicate whether there is a conflict between at least one time-domain resource allocation record in a first target row in the time-domain resource allocation table and semi-static time-domain configuration information, and the first target row is any row in the time-domain resource allocation table.

[0013] The ninth aspect provides a readable storage medium on which a program or instruction is stored. When the program or instruction is executed by a processor, the steps of the method described in the first aspect are realized, or the steps of the method described in the second aspect are realized.

[0014] The tenth aspect provides a chip including a processor and a communication interface, where the communication interface is coupled to the processor, and the processor runs a program or instruction and is used to realize the method described in the first aspect or the method described in the second aspect.

[0015] The eleventh aspect provides a computer program / program product, the computer program / program product being stored in a non-transitory storage medium, the computer program / program product being executed by at least one processor to implement the steps of the codebook construction method described in the first aspect or to implement the steps of the codebook construction method described in the second aspect.

Advantages of the Invention

[0016] In the embodiments of the present application, for a semi-static HARQ-ACK codebook that supports Multi-PDSCH scheduling, when constructing the semi-static HARQ-ACK codebook, the UE can perform time-domain binding based on the boundary of the transmission occasion in the transmission occasion set or the union of candidate PDSCH reception occasions corresponding to the transmission occasion set, thereby realizing the construction of the semi-static HARQ-ACK codebook, eliminating the need to determine the binding granularity in advance, avoiding the influence of the binding granularity on the determination of the transmission occasion, enhancing the generality of the codebook construction flow, and reducing the complexity of constructing the codebook. Alternatively, when constructing the semi-static HARQ-ACK codebook, the UE can construct the semi-static HARQ-ACK codebook according to the last time-domain resource allocation record of each row based on the collision situation between any row of time-domain resource allocation records in the time-domain resource allocation table and the semi-static time-domain configuration information, avoiding the situation where there is no HARQ-ACK bit that needs to be used in the codebook, thereby avoiding affecting the performance of HARQ transmission or bringing unnecessary restrictions to downlink scheduling.

Brief Description of the Drawings

[0017]

Figure 1

Figure 2

Figure 3

Figure 4

Figure 5

Figure 6

Figure 7

Embodiments for Carrying Out 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 some of the embodiments of the present application, not all of them. Based on the embodiments in the present application, all other embodiments obtained by those skilled in the art shall fall within the protection scope of the present application.

[0019] Terms such as "first" and "second" in the specification and claims of the present application are used to distinguish similar objects and are not for describing a specific order or sequence. It should be understood that such terms are interchangeable when appropriate, so that the embodiments of the present application can be implemented in an order other than that illustrated or described herein, and the objects distinguished by "first" and "second" generally belong to the same type and do not limit the number of objects. For example, the first object may be one or a plurality. Note that "and / or" in the specification and claims represents at least one of the connected objects, and the character " / " generally represents that the related objects before and after are in an "or" relationship.

[0020] It should be noted that the technology described in the embodiments of the present application is not limited to the Long Term Evolution (LTE) / LTE-Advanced (LTE-A) system, 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 technology may be used in the systems and radio technologies mentioned above, or in other systems and radio technologies. The following description describes the New Radio (NR) system for illustrative purposes and uses NR terms in most of the following descriptions, but these technologies may also be applied to applications other than NR system applications, such as the 6th Generation (6G) communication system.

[0021] FIG. 1 shows a block diagram of a wireless communication system to which an embodiment of the present application is applicable. The wireless communication system includes a terminal 11 and a network-side device 12. Here, the terminal 11 may also be referred to as a terminal device or a user equipment (UE). The terminal 11 may be a terminal-side device such as a mobile phone, a tablet personal computer, a laptop computer (or called a notebook computer), a personal digital assistant (PDA), a palm-top computer, a netbook, an ultra-mobile personal computer (UMPC), a mobile internet device (MID), a wearable device, or an in-vehicle device (VUE), a pedestrian terminal (PUE), etc. The wearable device includes a smartwatch, a bracelet, earphones, glasses, etc. It should be noted that the embodiments of the present application do not limit the specific type of the terminal 11. The network-side device 12 may be a base station or a core network. Here, 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 WLAN access point, a WiFi node, a transmitting receiving point (TRP), or other appropriate terms in the art. As long as the same technical effect is achieved, the base station is not limited to a specific technical term. It should be noted that in the embodiments of the present application, only the base station in the NR system is taken as an example, but the specific type of the base station is not limited.

[0022] The following explains some concepts and / or terms related to the codebook construction method, apparatus, communication device, storage medium, and system according to the embodiments of the present application.

[0023] 1. Multi-PDSCH Scheduling Currently, it is confirmed that for new NR deployment frequency bands, it is necessary to introduce new sub-carrier spacings (SCSs) including 480 kHz and 960 kHz. For these newly introduced SCSs, corresponding adjustments or enhancements need to be made for physical downlink control channel (PDCCH) monitoring. For example, it is necessary to avoid the UE having to monitor the PDCCH in each slot (a very short time duration) to reduce the implementation complexity of the UE. Accordingly, to make full use of the carrier time-domain resources, Multi-PDSCH scheduling and multi-physical uplink shared channel (Multi-PUSCH) scheduling are introduced.

[0024] Multi-PDSCH scheduling means that a single DCI can schedule multiple PDSCH transmissions on the same carrier at one time. Based on the NR protocol regulations, these PDSCHs do not overlap with each other in the time domain. Currently, a single DCI supports scheduling multiple PDSCHs. Each PDSCH is restricted within a single slot range, corresponds to each transport block (TB), and a single TB cannot perform joint rate matching across multiple PDSCHs, nor can it occupy multiple PDSCHs for repeated transmission.

[0025] 2. HARQ-ACK Semi-static Codebook When creating the HARQ-ACK bit sequence that the UE needs to report at a certain feedback time, based on predefined rules and the scheduling status of single / multiple carrier uplink and downlink PDSCH transmissions for which HARQ-ACK needs to be reported at this feedback time, determine the correspondence between each downlink PDSCH transmission and a certain bit in the created HARQ-ACK bit sequence. Such an operation is called constructing a HARQ-ACK codebook or a HARQ-ACK codebook scheme. Currently, two HARQ-ACK codebook schemes are adopted: the semi-static codebook (Type-1) and the dynamic codebook (Type-2).

[0026] The semi-static codebook is constructed from the perspective of possible PDSCH reception occasions. It reserves corresponding HARQ-ACK bits for each possible PDSCH reception occasion (determined based on the time domain resource assignment (TDRA) table configured by the upper layer) based on the feedback time (Timing) configuration table (i.e., the K1 Set configured by the upper layer) and the HARQ-ACK feedback time (i.e., the uplink slot with semi-static codebook transmission). For a certain PDSCH reception occasion, if the UE has not actually received / detected the corresponding PDSCH, set the corresponding HARQ-ACK bit to a negative response (Non-Acknowledge, NACK); otherwise, set the corresponding HARQ-ACK bit based on the decoding result of this PDSCH.

[0027] When supporting Multi-PDSCH scheduling, in order to support HARQ-ACK feedback corresponding to Multi-PDSCH scheduling, it is necessary to perform corresponding reinforcement on the HARQ-ACK semi-static codebook. For example, it is necessary to ensure that for each scheduling of Multi-PDSCH, there are HARQ-ACK bits corresponding to the PDSCH in the HARQ-ACK codebook.

[0028] 3. Time Domain Bundling of HARQ-ACK Feedback Time domain bundling for HARQ-ACK feedback performs bundling (generally adopting a binary AND operation) on the decoding results of PDSCH received at different times to form a single fused decoding result, reducing the feedback bits. It may be understood that the bundling mechanism of HARQ-ACK feedback in the LTE Time Division Duplexing (TDD) mode has already been adopted.

[0029] For Multi-PDSCH scheduling, it is proposed to perform HARQ-ACK feedback based on a dynamic codebook and adopt a time domain bundling mechanism. The time domain bundling mechanism includes performing time domain bundling within one to multiple PDSCH ranges of a single DCI scheduling, or grouping one to multiple PDSCHs of a single DCI scheduling and performing time domain bundling within the PDSCH range corresponding to a single PDSCH packet.

[0030] Hereinafter, in conjunction with the drawings, the codebook construction method according to the embodiments of the present application will be described in detail by means of several embodiments and their application scenarios.

[0031] In one scenario, when applying time-domain binding to a semi-static HARQ-ACK codebook that supports Multi-PDSCH scheduling, the prior art solution is as follows. First, determine the binding granularity, then map the PDSCH binding group (Bundling Group) determined based on the binding granularity to a set of transmission occasions, determine the HARQ-ACK bit sequence corresponding to this set of transmission occasions. At this time, the binding granularity adopted deeply affects the determination of transmission occasions, resulting in a certain degree of complexity and affecting the generality of the codebook construction flow.

[0032] In the embodiments of the present application, when adopting time-domain binding for a semi-static HARQ-ACK codebook that supports Multi-PDSCH scheduling, after determining the set of transmission occasions, the corresponding processing solution is introduced. By enhancing the generality of the codebook construction flow, the complexity of constructing the codebook can be reduced.

[0033] In another scenario, when adopting the determination of the candidate PDSCH reception occasion set (i.e., Option 2 in the following embodiments) based on the last time domain resource allocation record in each row of the TDRA table for a semi-static HARQ-ACK codebook that supports Multi-PDSCH scheduling, the prior art solution is as follows. When the last time domain resource allocation record of a certain row collides with the semi-static time domain configuration information and this row is ignored in the construction process of the semi-static codebook, if there is at least one time domain resource allocation record that does not collide with the semi-static time domain configuration information in this row and the downlink scheduling DCI instructs this row, the PDSCH (which can actually be transmitted) corresponding to these time domain resource allocation records that do not collide with the semi-static time domain configuration information has corresponding HARQ-ACK bits that do not exist in the semi-static codebook, thereby affecting the performance of HARQ transmission (when blind retransmission is not performed based on HARQ-ACK feedback, it will reduce the downlink transmission efficiency, and when feedback is performed depending on other subsequent HARQ-ACK codebooks, it will introduce further HARQ-ACK feedback delay), or bring unnecessary restrictions to the downlink scheduling.

[0034] In the embodiments of the present application, when constructing a codebook for a semi-static HARQ-ACK codebook that supports Multi-PDSCH scheduling based on the last time domain resource allocation record, by introducing different processing methods for the determination of collisions with the semi-static time domain configuration information, it is possible to avoid a situation where there are no HARQ-ACK bits that need to be used in the codebook, thereby avoiding affecting the performance of HARQ transmission or bringing unnecessary restrictions to the downlink scheduling.

[0035] It should be noted that the following describes, by way of example, the collision between the time domain resource allocation record and the semi-static uplink symbol with respect to the collision between the time domain resource allocation record and the semi-static time domain configuration information, but does not limit the adoption of the solution in this application when there is a collision between the time domain resource allocation record and other semi-static time domain configuration information (resulting in the inability to actually transmit the physical channel corresponding to this time domain resource allocation record).

[0036] The embodiments of this application provide a codebook construction method. FIG. 2 shows a flowchart of the codebook construction method according to the embodiments of this application. As shown in FIG. 2, the codebook construction method according to the embodiments of this application may include the following steps 21 to 23.

[0037] In step 21, the UE constructs a semi-static HARQ-ACK codebook.

[0038] In step 22, the UE transmits the semi-static HARQ-ACK codebook.

[0039] Here, the step in which the UE constructs the semi-static HARQ-ACK codebook includes either one of the following steps: the UE executes time domain binding based on the first information after determining the set of transmission occasions, and constructs the semi-static HARQ-ACK codebook based on the time domain binding result; and the UE constructs the semi-static HARQ-ACK codebook according to the last time domain resource allocation record in each row of the time domain resource allocation table based on the second information.

[0040] Here, the first information is either the boundary of the transmission occasion in the transmission occasion set or the union of candidate PDSCH reception occasions corresponding to the transmission occasion set. The union of candidate PDSCH reception occasions is the union of candidate PDSCH reception occasions obtained by cascading the candidate PDSCH reception occasions in the candidate PDSCH reception occasion sets corresponding to each transmission occasion in the transmission occasion set in a head-to-tail manner according to a preset order. The second information is used to indicate whether there is a collision between at least one time domain resource allocation record in the first target row in the time domain resource allocation table and the semi-static uplink symbol. The first target row is any row in the time domain resource allocation table.

[0041] In step 23, the network-side device receives a semi-static HARQ-ACK codebook.

[0042] Here, the semi-static HARQ codebook is constructed based on the time domain binding result, or the semi-static HARQ-ACK codebook is constructed according to the last time domain resource allocation record in each row in the time domain resource allocation table based on the second information. Here, the time-domain binding result is obtained by performing time-domain binding based on first information after determining a set of transmission occasions. The first information is either the boundary of a transmission occasion in the set of transmission occasions or the union set of candidate PDSCH reception occasions corresponding to the set of transmission occasions. The union set of candidate PDSCH reception occasions is a union set of candidate PDSCH reception occasions obtained by cascading, head to tail, each candidate PDSCH reception occasion in the set of candidate PDSCH reception occasions corresponding to each transmission occasion in the set of transmission occasions in a preset order. The second information is used to indicate whether there is a conflict between at least one time-domain resource allocation record in the first target row in the time-domain resource allocation table and the semi-static uplink symbol. The first target row is any row in the time-domain resource allocation table.

[0043] Optionally, in an embodiment of the present application, before the step of the network-side device receiving the semi-static HARQ-ACK codebook, the method further includes a step of the network-side device determining the length of the HARQ-ACK bit sequence corresponding to the semi-static HARQ-ACK codebook and the mapping relationship between each HARQ-ACK bit in the HARQ-ACK bit sequence and the candidate PDSCH reception occasion.

[0044] Hereinafter, by way of specific embodiments, the step of a UE constructing a semi-static HARQ-ACK codebook in the codebook construction method according to the embodiments of the present application will be described.

[0045] Embodiment 1 In an embodiment of the present application, the method steps for a UE to construct a semi-static HARQ-ACK codebook may include the following step 201 and step 202.

[0046] In step 201, the UE determines a set of transmission occasions.

[0047] In step 202, after determining the set of transmission occasions, the UE performs time-domain binding based on the first information.

[0048] In the embodiments of the present application, the above first information is either the boundary of the transmission occasion in the set of transmission occasions or the union set of candidate PDSCH reception occasions corresponding to the set of transmission occasions. The union set of candidate PDSCH reception occasions is a union set of candidate PDSCH reception occasions obtained by cascading each candidate PDSCH reception occasion in the set of candidate PDSCH reception occasions corresponding to each transmission occasion in the set of transmission occasions in a head-to-tail manner according to a preset order.

[0049] In the embodiments of the present application, when the UE adopts time-domain binding after determining the set of transmission occasions, it may be adopted to perform time-domain binding based on the boundary of the transmission occasion or to perform time-domain binding based on the union set of candidate PDSCH reception occasions, and the boundary of the transmission occasion may not be noted / can be crossed.

[0050] It should be noted that as a typical performance format, the time-domain resource allocation record may be a Start and length indicator value (SLIV). To better understand the technical solution of the embodiments of the present application, in the following embodiments, the time-domain resource allocation record will be specifically described by taking the SLIV as an example. Of course, the time-domain resource allocation record may be in other formats, and the present application will not give more examples.

[0051] It should be noted that one exemplary form of the feedback time offset is K1, which is used to indicate the offset of the time domain position of the HARQ-ACK feedback with respect to the time domain position of the PDSCH transmission. The unit of the offset is a time unit, which may be a slot or a sub-slot. The feedback time offset mentioned subsequently may be described by taking K1 as an example, but it does not limit other expression forms of the feedback time offset thereby.

[0052] It should be noted that a transmission occasion generally means that the transmission occasion corresponds to a certain K1 or an equivalent K1 (Effective K1), and it may be understood as an independent downlink transmission occasion that can be used within the time unit corresponding to this K1 / equivalent K1 (or related to this time unit). Different transmission occasions corresponding to this K1 / equivalent K1 may be occupied independently of each other (for example, occupied simultaneously, or one transmission occasion is occupied while another transmission occasion is not occupied). Therefore, in the constructed semi-static codebook, it is necessary to reserve corresponding HARQ-ACK bits for each transmission occasion. Generally, each transmission occasion may be further related to one or more candidate PDSCH reception occasions (or semi-persistent scheduling (SPS) PDSCH releases). At this time, in the semi-static codebook, when reserving corresponding HARQ-ACK bits for a certain transmission occasion, it is necessary to reserve corresponding HARQ-ACK bits for each candidate PDSCH reception occasion (or SPS PDSCH release) related to this transmission occasion.

[0053] Candidate PDSCH reception or SPS PDSCH release (the following description is explained by taking candidate PDSCH reception as an example and can be extended to SPS PDSCH release in all cases) means that when a certain transmission occasion is occupied, this transmission occasion is used to transmit / receive a single PDSCH or a single SPS PDSCH release. Here, the single PDSCH or SPS PDSCH release may be understood as candidate PDSCH reception, and there is a one-to-one relationship between the transmission occasion and the candidate PDSCH reception occasion. Since the UE is not allowed to receive any two or more overlapping PDSCHs in the time domain on the same serving cell, in the semi-static codebook construction flow, two or more SLIVs (a single SLIV corresponds one-to-one to a single PDSCH) that overlap in the time domain can be mapped to the same candidate PDSCH reception occasion, and for each K1, when ensuring that the corresponding candidate PDSCH reception occasions do not overlap in the time domain, reserve the maximum number of independently occupiable transmission occasions (the transmission occasions correspond one-to-one to the candidate PDSCH reception occasions). When introducing multi-PDSCH scheduling, optionally, each transmission occasion may correspond to more than one candidate PDSCH reception occasion. At this time, a certain candidate PDSCH reception occasion among them (for example, the last PDSCH of a single DCI scheduling in multi-PDSCH scheduling may correspond to the last candidate PDSCH reception occasion) is related to this transmission occasion based on a preset rule, and other candidate PDSCH reception occasions (for example, other PDSCHs except the last PDSCH of a single DCI scheduling in multi-PDSCH scheduling may correspond one-to-one to other candidate PDSCH reception occasions except the last candidate PDSCH reception occasion based on the scheduling order) also continue to use this related relationship and are related to this transmission occasion.Some or all of the candidate PDSCH reception occasions in the set of candidate PDSCH reception occasions corresponding to this transmission occasion are generally occupied simultaneously, and each occupied candidate PDSCH reception occasion corresponds to a single PDSCH for a single DCI scheduling in Multi-PDSCH scheduling. Currently, based on the discussion status of semi-static codebook enhancement for Multi-PDSCH scheduling, the correspondence between the transmission occasion and the candidate PDSCH reception occasion for each enhancement Option is as follows.

[0054] Option 1: For each K1 in the extended K1 set, determine a subset of transmission occasions. When determining the subset of transmission occasions corresponding to a certain K1, the corresponding operation can be performed based on the SLIV set related to this K1. At this time, the transmission occasion and the candidate PDSCH reception occasion may have a one-to-one relationship.

[0055] Option 1a: Without expanding the K1 set, for each K1 in the K1 set, determine the subset of transmission occasions corresponding to this K1 based on each SLIV configured for each row in the TDRA table. At this time, in order to ensure that there are HARQ-ACK bits corresponding to each SLIV, generally, a one-to-many relationship may occur between the transmission occasion and the candidate PDSCH reception occasion.

[0056] Option 2: Without expanding the K1 set, for each K1 in the K1 set, based on the last SLIV configured for each row in the TDRA table, determine the transmission occasion subset corresponding to this K1. At this time, all other SLIVs in the same row are related to the transmission occasion related to the last SLIV (that is, multiple PDSCHs that do not overlap in the time domain with each other are all related to the same transmission occasion, where SLIV and PDSCH correspond one-to-one). In order to ensure that there are HARQ-ACK bits corresponding to each SLIV, generally, the transmission occasion and the candidate PDSCH reception occasion may have a one-to-many relationship.

[0057] Optionally, in one implementation manner of the embodiments of the present application, the above first information is the boundary of the transmission occasion in the transmission occasion set. The above step 202 may be specifically implemented by the following step 202a.

[0058] In step 202a, after determining the transmission occasion set, the UE performs time domain binding within the range of the candidate PDSCH reception occasion set corresponding to each transmission occasion.

[0059] Optionally, in the embodiments of the present application, when each transmission occasion is related to at least one candidate PDSCH reception occasion, the UE may perform time domain binding within the range of the candidate PDSCH reception occasion set corresponding to each transmission occasion. That is, such an implementation manner can be applied to the scenario where a single transmission occasion is related to one or more candidate PDSCH reception occasions, and may include Option 1a and Option 2 in the above embodiments.

[0060] Optionally, in the embodiments of the present application, for each transmission occasion in the set of transmission occasions, the set of candidate PDSCH reception occasions corresponding to one transmission occasion is a set of candidate PDSCH reception occasions consisting of at least one candidate PDSCH reception occasion related to this one transmission occasion.

[0061] As can be understood, for the set of candidate PDSCH reception occasions corresponding to each transmission occasion, at this time, one or more candidate PDSCH reception occasions related to each transmission occasion constitute the set of candidate PDSCH reception occasions, and for this set of candidate PDSCH reception occasions, time domain binding is performed, that is, the following target operation is performed.

[0062] Optionally, in the embodiments of the present application, step 202a above may be specifically implemented by the following step 202a1 or step 202a2.

[0063] In step 202a1, after determining the set of transmission occasions, the UE performs time domain binding on the set of candidate PDSCH reception occasions corresponding to each transmission occasion.

[0064] In step 202a2, after determining the set of transmission occasions, the UE performs time domain binding on one subset of candidate PDSCH reception occasions in the set of candidate PDSCH reception occasions corresponding to each transmission occasion.

[0065] Optionally, in the embodiments of the present application, for each transmission occasion in the set of transmission occasions, the candidate PDSCH reception occasion subset corresponding to one transmission occasion includes at least one of at least one first subset and a second subset. Here, each first subset is one candidate PDSCH reception occasion subset consisting of N candidate PDSCH reception occasions with adjacent or consecutive indexes / numbers in the set of candidate PDSCH reception occasions consisting of at least one candidate PDSCH reception occasion related to this one transmission occasion. The above second subset is one candidate PDSCH reception occasion subset consisting of the remaining candidate PDSCH reception occasions at the end when the number of the remaining candidate PDSCH reception occasions at the end of the set of candidate PDSCH reception occasions is smaller than N, and N is a positive integer.

[0066] As can be understood, the UE constructs one candidate PDSCH reception occasion subset for every N candidate PDSCH reception occasions with adjacent indexes / numbers in the set of candidate PDSCH reception occasions consisting of one or more candidate PDSCH reception occasions related to a single transmission occasion, and when the number of the remaining candidate PDSCH reception occasions at the end of the set of candidate PDSCH reception occasions is less than N, these remaining candidate PDSCH reception occasions constitute one single candidate PDSCH reception occasion subset. For each candidate PDSCH reception occasion subset, time domain binding is performed, that is, the following target operation is performed. N may be defined by the protocol or may be configured by upper layer signaling.

[0067] Optionally, in the embodiments of the present application, the first information is the boundary of the transmission occasion in the set of transmission occasions. The time-domain binding result is obtained by performing time-domain binding on the set of candidate PDSCH reception occasions corresponding to each transmission occasion after determining the set of transmission occasions, or the time-domain binding result is obtained by performing time-domain binding on one candidate PDSCH reception occasion subset in the set of candidate PDSCH reception occasions corresponding to each transmission occasion after determining the set of transmission occasions.

[0068] Optionally, in another implementation manner of the embodiments of the present application, the first information is the boundary of the transmission occasion in the set of transmission occasions. Step 202 may be specifically implemented by the following step 202b.

[0069] In step 202b, after determining the set of transmission occasions, the UE performs time-domain binding on each candidate PDSCH reception occasion related to each transmission occasion in each transmission occasion group among at least one transmission occasion group.

[0070] Optionally, in the embodiments of the present application, the at least one transmission occasion group includes at least one of at least one first transmission occasion group and a second transmission occasion group. Here, each first transmission occasion group is a transmission occasion group composed of every M transmission occasions with adjacent or consecutive indexes / numbers in the set of transmission occasions or a subset of transmission occasions. The second transmission occasion group is a transmission occasion group composed of the remaining transmission occasions at the end when the number of remaining transmission occasions at the end of the set of transmission occasions or a subset of transmission occasions is smaller than M, and this subset of transmission occasions is a subset of transmission occasions obtained after dividing the set of transmission occasions based on a preset rule, and M is a positive integer.

[0071] For better understanding, the UE can perform time-domain binding based on the granularity of the transmission occasion (corresponding candidate PDSCH reception occasion). The UE can form one transmission occasion group for every M transmission occasions with adjacent / consecutive indexes / numbers in the transmission occasion set / transmission occasion subset. When the number of remaining transmission occasions at the end of the transmission occasion set / transmission occasion subset is less than M, these remaining transmission occasions form one single transmission occasion group. The UE performs time-domain binding for each candidate PDSCH reception occasion related to each transmission occasion in each transmission occasion group, that is, performs the following target operations for all candidate PDSCH reception occasions related to this transmission occasion group. M may be defined by the protocol or configured by upper layer signaling.

[0072] In such a manner, this solution does not limit the number of candidate PDSCH reception occasions corresponding to a single transmission occasion and can be applied to Option 1, Option 1a and Option 2 in the above embodiments, where Option 1 is more suitable (at this time each transmission occasion is only related to a single candidate PDSCH reception occasion).

[0073] Optionally, in the embodiments of the present application, the above transmission occasion subset may specifically be a transmission occasion subset obtained by dividing the transmission occasion set based on K1 or equivalent K1. Of course, a transmission occasion subset may also be obtained based on other classification methods, which are not limited in the embodiments of the present application.

[0074] Optionally, in the embodiments of the present application, the at least one transmission occasion group is obtained when allowing crossing the boundary of the transmission occasion subset, and the at least one transmission occasion group is one or more transmission occasion groups obtained by dividing the transmission occasion set based on M.

[0075] Optionally, in the embodiments of the present application, the at least one transmission occasion group is obtained when not allowing crossing the boundary of the transmission occasion subset, and the at least one transmission occasion group is one or more transmission occasion groups obtained by dividing one transmission occasion subset in the transmission occasion set based on M.

[0076] As can be understood, in the process of dividing the above transmission occasion groups, it may be considered whether to allow crossing the boundary of the transmission occasion subset corresponding to K1 or equivalent K1, and accordingly, one of the following methods may be adopted.

[0077] In Method 1, the transmission occasion group can cross the boundary of the transmission occasion subset corresponding to a certain K1 or equivalent K1.

[0078] In Method 1, the UE divides the transmission occasion set corresponding to a certain serving cell into one or more transmission occasion groups based on M.

[0079] In Method 2, the transmission occasion group cannot cross the boundary of the transmission occasion subset corresponding to a certain K1 or equivalent K1.

[0080] In Method 2, the UE divides the transmission occasion subset corresponding to a certain K1 or equivalent K1 in the transmission occasion set corresponding to a certain serving cell into one or more transmission occasion groups.

[0081] Optionally, in the embodiments of the present application, the first information is the boundary of the transmission occasion in the set of transmission occasions. After determining the set of transmission occasions, the time-domain binding result is obtained by performing time-domain binding on each candidate PDSCH reception occasion related to each transmission occasion in each transmission occasion group among at least one transmission occasion group.

[0082] In the embodiments of the present application, when determining the candidate PDSCH reception occasion group for which time-domain binding is to be performed (as a Bundling group), based on the candidate PDSCH reception occasion set range corresponding to each transmission occasion, the range for performing time-domain binding may be restricted within the candidate PDSCH reception occasion set range corresponding to a certain transmission occasion, or time-domain binding may be performed based on the granularity of the transmission occasion (the corresponding candidate PDSCH reception occasion set).

[0083] Optionally, in another implementation manner of the embodiments of the present application, the first information is the union of candidate PDSCH reception occasions corresponding to the set of transmission occasions. Step 202 may be specifically implemented by the following step 202c.

[0084] In step 202c, after determining the set of transmission occasions, the UE performs time-domain binding on all candidate PDSCH reception occasions in each candidate PDSCH reception occasion group among at least one candidate PDSCH reception occasion group.

[0085] Optionally, in the embodiments of the present application, the at least one candidate PDSCH reception occasion group includes at least one of at least one first candidate PDSCH reception occasion group and a second candidate PDSCH reception occasion group. Here, each first candidate PDSCH reception occasion group is one candidate PDSCH reception occasion group consisting of L candidate PDSCH reception occasions with adjacent or consecutive indexes / numbers in the union of candidate PDSCH reception occasions. The second candidate PDSCH reception occasion group is one candidate PDSCH reception occasion group consisting of the remaining candidate PDSCH reception occasions at the end when the number of the remaining candidate PDSCH reception occasions at the end of the union of candidate PDSCH reception occasions is less than L, and L is a positive integer.

[0086] As can be understood, the UE can perform time-domain binding based on candidate PDSCH reception occasions and can ignore / cross the boundary of the transmission occasion. The UE cascades each candidate PDSCH reception occasion in the set of candidate PDSCH reception occasions corresponding to each transmission occasion in the set of transmission occasions corresponding to a certain serving cell in a preset order to obtain a union of candidate PDSCH reception occasions, and may form one candidate PDSCH reception occasion group for every L candidate PDSCH reception occasions with adjacent / consecutive indexes / numbers in this union of candidate PDSCH reception occasions. When the number of the remaining candidate PDSCH reception occasions at the end of the union is less than L, these remaining candidate PDSCH reception occasions form one single candidate PDSCH reception occasion group. The UE performs time-domain binding on all candidate PDSCH reception occasions in each candidate PDSCH reception occasion group, that is, performs the following target operation. L may be defined by the protocol or may be configured by upper-layer signaling.

[0087] Optionally, in the embodiments of the present application, the first information is a set of candidate PDSCH reception occasions corresponding to a set of transmission occasions. The time domain binding result is obtained by performing time domain binding on all candidate PDSCH reception occasions in each of at least one candidate PDSCH reception occasion group after determining the set of transmission occasions.

[0088] In the embodiments of the present application, the target operation is to perform time domain binding on at least one candidate PDSCH reception occasion. Among this at least one candidate PDSCH reception occasion, the PDSCH corresponding to 0, 1, or a plurality of candidate PDSCH reception occasions is actually transmitted, and the PDSCH corresponding to the remaining candidate PDSCH reception occasions is not actually transmitted.

[0089] It should be noted that each candidate PDSCH reception occasion may be mapped to one or more SLIV / PDSCHs. At this time, when only one SLIV / PDSCH that is mapped actually transmits, it is considered that the PDSCH corresponding to this candidate PDSCH reception occasion actually transmits. The UE may determine whether a certain SLIV / PDSCH to be mapped actually transmits based on the detection status of the downlink scheduling DCI and / or the configured SPS PDSCH transmission. For example, for downlink dynamic scheduling, when the UE detects that a certain SLIV in a certain row in the TDRA table indicated by a certain downlink scheduling DCI corresponds to the SLIV / PDSCH to be mapped (that is, the SLIV values are the same, located in the same DL slot, and the corresponding HARQ-ACK is feedback in the semi-static codebook currently constructed), the UE considers that this SLIV / PDSCH actually transmits. For downlink SPS, when the UE determines that the SLIV corresponding to a certain SPS PDSCH corresponds to the SLIV / PDSCH to be mapped based on the uplink grant (DL grant) of the semi-static configuration, the UE considers that this SLIV / PDSCH actually transmits (optionally, when the UE needs to detect the skipped SPS PDSCH, when the UE considers that this SPS PDSCH is not skipped, it is considered that this SLIV / PDSCH actually transmits).

[0090] As can be understood, for each candidate PDSCH reception occasion, at most only one SLIV / PDSCH that is mapped actually transmits. When the PDSCH corresponding to a certain candidate PDSCH reception occasion actually transmits, the decoding result corresponding to the SLIV / PDSCH that is mapped to this candidate PDSCH reception occasion and actually transmits is used as the input of the time domain binding operation.

[0091] In binding method 1, candidate PDSCH reception occasions that are not actually transmitted are incorporated into the calculation range of time-domain binding. At this time, each candidate PDSCH reception occasion among the at least one candidate PDSCH reception occasion does not participate in the time-domain binding calculation, and the decoding result corresponding to the candidate PDSCH reception occasion that is not actually transmitted may be assumed as NACK or ACK.

[0092] Furthermore, in order to avoid the influence on HARQ-ACK feedback by candidate PDSCH reception occasions that are not actually transmitted, when adopting binary AND, the decoding result corresponding to the candidate PDSCH reception occasion that is not actually transmitted may be assumed as ACK, and when adopting binary OR, the decoding result corresponding to the candidate PDSCH reception occasion that is not actually transmitted may be assumed as NACK.

[0093] In binding method 2, candidate PDSCH reception occasions that are not actually transmitted are excluded from the calculation range of time-domain binding. At this time, among the at least one candidate PDSCH reception occasion, only each candidate PDSCH reception occasion that is actually transmitted participates in the time-domain binding calculation.

[0094] For each candidate PDSCH reception occasion incorporated into the calculation range of time-domain binding, the HARQ-ACK information corresponding to its decoding result is compressed / packaged into one or two HARQ-ACK bits and included in the HARQ-ACK codebook for transmission.

[0095] Time domain binding may be understood as follows. Binary AND or binary OR is performed on the decoding results of the corresponding codewords of two or more candidate PDSCH reception occasions, and a combined decoding result (which may be represented by 1 bit) corresponding to this codeword is obtained. When configured to adopt debut codeword transmission, each codeword corresponds to its respective combined decoding result, and further operations may be performed based on a specific binding configuration.

[0096] When there is only one candidate PDSCH reception occasion incorporated in the operation range of time domain binding, the decoding result corresponding to this candidate PDSCH reception occasion is directly used to set the corresponding HARQ-ACK bit in the HARQ-ACK codebook. When any candidate PDSCH reception occasion is not incorporated in the operation range of time domain binding (for example, when adopting binding method 2 and all candidate PDSCH reception occasions are not actually transmitted), the corresponding HARQ-ACK bit in the HARQ-ACK codebook can be directly set to NACK.

[0097] It should be noted that the number of candidate PDSCH reception occasions related to each transmission occasion may vary. When a semi-static codebook is related to multiple serving cells, the above selective scheme / method (the above transmission occasion set may be understood as being for a certain serving cell) is executed for each serving cell respectively, and the execution outputs of each serving cell are cascaded in a preset manner, for example, cascaded in ascending order of the serving cell index.

[0098] Optionally, in the embodiments of the present application, step 202 may be specifically realized by the following step 202d or step 202e.

[0099] In step 202d, after determining the set of transmission occasions, for at least one candidate PDSCH reception occasion corresponding to the set of transmission occasions, when PDSCHs corresponding to K candidate PDSCH reception occasions among the at least one candidate PDSCH reception occasion are actually being transmitted and PDSCHs corresponding to P candidate PDSCH reception occasions are not actually being transmitted, the UE performs time-domain binding on the K candidate PDSCH reception occasions and the P candidate PDSCH reception occasions.

[0100] In an embodiment of the present application, the above P candidate PDSCH reception occasions are candidate PDSCH reception occasions other than the K candidate PDSCH reception occasions among the at least one candidate PDSCH reception occasion, K is an integer, and P is an integer.

[0101] Optionally, in an embodiment of the present application, when the UE performs time-domain binding on the K candidate PDSCH reception occasions and the P candidate PDSCH reception occasions, the decoding results corresponding to the above P candidate PDSCH reception occasions are negative acknowledgment NACK or acknowledgment ACK.

[0102] Optionally, in an embodiment of the present application, when binary AND is adopted, the decoding results corresponding to the above P candidate PDSCH reception occasions are ACK, and when binary OR is adopted, the decoding results corresponding to the above P candidate PDSCH reception occasions are NACK.

[0103] In step 202e, after determining the set of transmission occasions, when for at least one candidate PDSCH reception occasion corresponding to the set of transmission occasions, the PDSCH corresponding to K of the at least one candidate PDSCH reception occasions has been actually transmitted, and the PDSCH corresponding to P of the candidate PDSCH reception occasions has not been actually transmitted, the UE performs time-domain binding on the K candidate PDSCH reception occasions.

[0104] Optionally, in the embodiments of the present application, when the UE performs time-domain binding on K candidate PDSCH reception occasions, it further includes compressing / packaging the target HARQ-ACK information into one or more HARQ-ACK bits and then including it in the HARQ-ACK codebook for transmission. This target HARQ-ACK information is the HARQ-ACK information corresponding to the decoding result of each candidate PDSCH reception occasion among the K candidate PDSCH reception occasions.

[0105] Optionally, in the embodiments of the present application, when the K candidate PDSCH reception occasions are one candidate PDSCH reception occasion, it further includes the step of setting the corresponding HARQ-ACK bit in the HARQ-ACK codebook using the decoding result corresponding to the one candidate PDSCH reception occasion by the UE, and when K is 0, the step of setting the corresponding HARQ-ACK bit in the HARQ-ACK codebook to NACK by the UE.

[0106] Embodiments of this application provide a codebook construction method. After determining a set of transmission occasions, a UE can perform time-domain binding based on first information, where the first information is either the boundary of a transmission occasion in the set of transmission occasions or the union of candidate PDSCH reception occasions corresponding to the set of transmission occasions. In this solution, for a semi-static HARQ-ACK codebook that supports Multi-PDSCH scheduling, after determining the set of transmission occasions, the UE performs time-domain binding based on the boundary of a transmission occasion in the set of transmission occasions or the union of candidate PDSCH reception occasions corresponding to the set of transmission occasions, thereby realizing the construction of the semi-static HARQ-ACK codebook. There is no need to determine the binding granularity in advance, avoiding the influence of the binding granularity on the determination of transmission occasions, enhancing the generality of the codebook construction flow, and reducing the complexity of constructing the codebook.

[0107] Embodiment 2 In an embodiment of this application, the method steps for a UE to construct a semi-static HARQ-ACK codebook may include step 301 and step 302 below.

[0108] In step 301, the UE determines second information.

[0109] In step 302, the UE constructs a semi-static HARQ-ACK codebook according to the last time-domain resource allocation record in each row of the time-domain resource allocation table based on the second information.

[0110] In an embodiment of this application, the above second information is used to indicate whether there is a collision between at least one SLIV in the first target row of the time-domain resource allocation table and the semi-static uplink symbol, where the first target row is any row in the time-domain resource allocation table.

[0111] Optionally, in the embodiments of the present application, step 302 may be specifically implemented by the following step 302a, step 302b, or step 302c.

[0112] In step 302a, when there is a collision between the last SLIV of the first target row and the semi-static uplink symbol, the UE determines that the first target row is a row that is not used to determine the transmission occasion set; otherwise, the UE determines that the first target row is a row for determining the transmission occasion set.

[0113] In step 302b, whether there is a collision between the last SLIV of the first target row and the semi-static uplink symbol or not, the UE determines that the first target row is a row for determining the transmission occasion set.

[0114] In step 302c, the UE determines whether the first target row is a row for determining the transmission occasion set based on the collision situation between each SLIV of the first target row and the semi-static uplink symbol.

[0115] As can be understood, when there is a collision between the last SLIV of the first target row and the semi-static uplink symbol, the first target row is not used to determine the transmission occasion set; otherwise, the first target row is used to determine the transmission occasion set, or the first target row is often for determining the transmission occasion set, or the UE determines whether the first target row is used to determine the transmission occasion set based on the collision situation between each SLIV of the first target row and the semi-static uplink symbol.

[0116] Optionally, in the embodiments of the present application, step 302c may be specifically implemented by the following step 302c1 or step 302c2.

[0117] In step 302c1, if there is a collision between at least one SLIV of the first target row and the semi-static uplink symbol, the UE determines that the first target row is a row not used to determine the set of transmission occasions.

[0118] In step 302c2, if there is no collision between at least one SLIV of the first target row and the semi-static uplink symbol, the UE determines that the first target row is a row for determining the set of transmission occasions.

[0119] Optionally, in the embodiments of the present application, when the first target row is a row for determining the set of transmission occasions, it further includes that the UE maps the first SLIV in the first target row to the target transmission occasion. Here, the target transmission occasion is the transmission occasion corresponding to the last SLIV of the first target row, and this first SLIV is any one SLIV that does not collide with the semi-static uplink symbol in the first target row.

[0120] Optionally, in the embodiments of the present application, the target transmission occasion corresponds to X candidate PDSCH reception occasions, where X is the maximum value of the number of SLIVs that do not collide with the semi-static uplink symbol in the second target row. This second target row is any one row corresponding to the target transmission occasion in the time domain resource allocation table, and X is an integer.

[0121] Optionally, in the embodiments of the present application, when Q is smaller than X, Q SLIVs correspond one by one to the first Q or the last Q of the X candidate PDSCH reception occasions in sequence. Q is the number of SLIVs that do not collide with the semi-static uplink symbol in the third target row. This third target row is the row corresponding to the target transmission occasion in the time domain resource allocation table, and Q is an integer.

[0122] Optionally, in the embodiments of the present application, when X is 0, in the constructed HARQ-ACK codebook, there are no corresponding HARQ-ACK bits for the target transmission occasion.

[0123] In the embodiments of the present application, the UE traverses each K1 in the K1 set, extracts the last SLIV for each row for a given K1, and can determine the transmission occasion subset corresponding to this given K1 according to the splitting method described in the above embodiments. Here, each last SLIV group corresponds to a single transmission occasion.

[0124] Before performing splitting for a given K1, when considering whether each row collides with the semi-static uplink symbol, one of the following methods can be adopted.

[0125] In collision handling method 1, consider the collision between the last SLIV and the semi-static uplink symbol.

[0126] When the last SLIV of a certain row collides with the semi-static uplink symbol (i.e., there is a time domain overlap), this last SLIV and this row are deleted and do not participate in subsequent operations. That is, for this last SLIV / this row, the corresponding transmission occasion has not been determined, and for this last SLIV / this row, the corresponding HARQ-ACK bit does not exist in the semi-static codebook.

[0127] In collision handling method 2, do not consider the collision between the last SLIV and the semi-static uplink symbol.

[0128] Optionally, when subsequently determining the number of candidate PDSCH reception occasions related to the transmission occasion, the collision between each SLIV in a certain row and the semi-static uplink symbol may be considered.

[0129] In collision handling method 3, consider the collision between each SLIV in any row and the semi-static uplink symbol.

[0130] In collision handling method 3-1, when any one SLIV collides with a semi-static uplink symbol, this line is deleted.

[0131] In collision handling method 3-2, when any one SLIV does not collide with a semi-static uplink symbol, this line is reserved.

[0132] After executing the split flow to determine the transmission occasion subset corresponding to each K1, each SLIV in each line may be made to correspond to the transmission occasion corresponding to the last SLIV in this line (i.e., the transmission occasion corresponding to the last SLIV group where the last SLIV is located).

[0133] For the above collision handling method 1, the line where the last SLIV collides with the semi-static uplink symbol is not mapped to any transmission occasion.

[0134] For the above collision handling method 2, for each line among one or more lines corresponding to a certain transmission occasion based on the last SLIV, check the SLIVs that do not collide with the semi-static uplink symbol in this line and form a subset (assuming that the size of the subset is the number of SILVs included in the subset), and the maximum value of the sizes of the subsets corresponding to each line may be used as the number of candidate PDSCH reception occasions related to this transmission occasion.

[0135] When the size Q of the subset corresponding to a certain line < the maximum value of the number of candidate PDSCH reception occasions corresponding to the corresponding transmission occasion, it corresponds to the first Q or the last Q candidate PDSCH reception occasions of this transmission occasion, that is, the HARQ-ACK bits corresponding to these Q candidate PDSCH reception occasions in the HARQ-ACK codebook may be used.

[0136] When the number of candidate PDSCH reception occasions corresponding to a transmission occasion is 0, for this transmission occasion, the corresponding HARQ-ACK bit does not actually exist in the HARQ-ACK codebook.

[0137] For the above collision handling method 3-1, any row where any one SLIV collides with a semi-static uplink symbol is not mapped to any transmission occasion. At this time, it is similar to the scheduling limit of collision handling method 1.

[0138] For the above collision handling method 3-2, its processing is basically the same as the above collision handling method 2. The difference is that in this method, there is no situation where the number of candidate PDSCH reception occasions corresponding to a transmission occasion is 0.

[0139] The embodiments of the present application provide a codebook construction method. The UE constructs a semi-static HARQ-ACK codebook according to the last SLIV in each row in the time-domain resource allocation table based on the second information. This second information is used to indicate whether there is a collision between at least one SLIV in the first target row in the time-domain resource allocation table and a semi-static uplink symbol. In this solution, for the semi-static HARQ-ACK codebook that supports Multi-PDSCH scheduling, the UE constructs a semi-static HARQ-ACK codebook according to the last SLIV in each row based on the collision situation between the SLIV in any row in the time-domain resource allocation table and the semi-static uplink symbol, so as to avoid the situation where the HARQ-ACK bits that need to be used in the codebook do not exist, thereby avoiding affecting the performance of HARQ transmission or bringing unnecessary restrictions to downlink scheduling.

[0140] It should be noted that the execution entity of the codebook construction method according to the embodiments of the present application may be a UE, or a codebook construction device, or a control module for executing the codebook construction method in this codebook construction device. In the embodiments of the present application, taking the UE as an example of executing the codebook construction method, the codebook construction method according to the embodiments of the present application will be described.

[0141] FIG. 3 shows a schematic diagram of a possible structure of a codebook construction device according to an embodiment of the present application. As shown in FIG. 3, this codebook construction device 30 may include a construction module 31 and a transmission module 32.

[0142] Here, the construction module 31 is used to construct a semi-static HARQ-ACK codebook. The transmission module 32 is used to transmit the semi-static HARQ-ACK codebook. Here, constructing the semi-static HARQ-ACK codebook specifically includes, after determining the set of transmission occasions, performing time-domain binding based on the first information, and constructing the semi-static HARQ-ACK codebook based on the time-domain binding result; and constructing the semi-static HARQ-ACK codebook according to the last time-domain resource allocation record in each row of the time-domain resource allocation table according to the second information. Here, the first information is either one of the boundary of the transmission occasion in the set of transmission occasions and the union of candidate PDSCH reception occasions corresponding to the set of transmission occasions. The union of candidate PDSCH reception occasions is a union of candidate PDSCH reception occasions obtained by cascading the candidate PDSCH reception occasions in each candidate PDSCH reception occasion set corresponding to each transmission occasion in the set of transmission occasions in a preset order. The second information is used to indicate whether there is a conflict between at least one time-domain resource allocation record in the first target row in the time-domain resource allocation table and the semi-static time-domain configuration information. The first target row is any row in the time-domain resource allocation table.

[0143] In one possible implementation manner, the above first information is the boundary of the transmission occasion in the set of transmission occasions. After specifically determining the set of transmission occasions, the above construction module 31 is used to perform time-domain binding within the range of the set of candidate PDSCH reception occasions corresponding to each transmission occasion.

[0144] In one possible implementation manner, after specifically determining the set of transmission occasions, the above construction module 31 performs time-domain binding on the set of candidate PDSCH reception occasions corresponding to each transmission occasion, or after determining the set of transmission occasions, it is used to perform time-domain binding on one candidate PDSCH reception occasion subset in the set of candidate PDSCH reception occasions corresponding to each transmission occasion.

[0145] In one possible implementation manner, the set of candidate PDSCH reception occasions corresponding to one transmission occasion is a set of candidate PDSCH reception occasions composed of at least one candidate PDSCH reception occasion related to one transmission occasion. The candidate PDSCH reception occasion subset corresponding to one transmission occasion includes at least one of at least one first subset and a second subset. Here, each first subset is one candidate PDSCH reception occasion subset composed of N candidate PDSCH reception occasions with adjacent or consecutive indexes / numbers in the set of candidate PDSCH reception occasions composed of at least one candidate PDSCH reception occasion related to one transmission occasion. The second subset is one candidate PDSCH reception occasion subset composed of the remaining candidate PDSCH reception occasions at the end when the number of the remaining candidate PDSCH reception occasions at the end of the set of candidate PDSCH reception occasions is smaller than N. N is a positive integer.

[0146] In one possible implementation, the above first information is the boundary of the transmission occasion in the set of transmission occasions. After specifically determining the set of transmission occasions, the above construction module 31 is used to perform time-domain binding on each candidate PDSCH reception occasion related to each transmission occasion in each transmission occasion group among at least one transmission occasion group.

[0147] In one possible implementation, the above at least one transmission occasion group includes at least one of at least one first transmission occasion group and a second transmission occasion group. Here, each first transmission occasion group is a transmission occasion group consisting of every M transmission occasions with adjacent or consecutive indexes / numbers in the set of transmission occasions or a subset of transmission occasions. The second transmission occasion group is a transmission occasion group consisting of the remaining transmission occasions at the end when the number of remaining transmission occasions at the end of the set of transmission occasions or a subset of transmission occasions is smaller than M. The subset of transmission occasions is a subset of transmission occasions obtained after dividing the set of transmission occasions based on a preset rule, and M is a positive integer.

[0148] In one possible implementation, the above at least one transmission occasion group is obtained when allowing crossing the boundary of the subset of transmission occasions. The at least one transmission occasion group is one or more transmission occasion groups obtained by dividing the set of transmission occasions based on M. Or, the above at least one transmission occasion group is obtained when not allowing crossing the boundary of the subset of transmission occasions. The at least one transmission occasion group is one or more transmission occasion groups obtained by dividing one subset of transmission occasions in the set of transmission occasions based on M.

[0149] In one possible implementation manner, the above first information is the union of candidate PDSCH reception occasions corresponding to the set of transmission occasions. After specifically determining the set of transmission occasions, the above construction module 31 is used to perform time-domain binding on all candidate PDSCH reception occasions in each of at least one group of candidate PDSCH reception occasions.

[0150] In one possible implementation manner, the above at least one group of candidate PDSCH reception occasions includes at least one of at least one first group of candidate PDSCH reception occasions and a second group of candidate PDSCH reception occasions. Here, each first group of candidate PDSCH reception occasions is a group of candidate PDSCH reception occasions composed of every L candidate PDSCH reception occasions with adjacent or consecutive indexes / numbers in the union of candidate PDSCH reception occasions. The second group of candidate PDSCH reception occasions is a group of candidate PDSCH reception occasions composed of the remaining candidate PDSCH reception occasions at the end when the number of the remaining candidate PDSCH reception occasions at the end of the union of candidate PDSCH reception occasions is smaller than L, and L is a positive integer.

[0151] In one possible implementation manner, after specifically determining the set of transmission occasions, when the PDSCH corresponding to K of the at least one candidate PDSCH reception occasions among the at least one candidate PDSCH reception occasions corresponding to the set of transmission occasions has actually been transmitted, and the PDSCH corresponding to P candidate PDSCH reception occasions has not been actually transmitted, the above construction module 31 performs time-domain binding on the K candidate PDSCH reception occasions and the P candidate PDSCH reception occasions, or is used to perform time-domain binding on the K candidate PDSCH reception occasions. Here, the P candidate PDSCH reception occasions are candidate PDSCH reception occasions other than the K candidate PDSCH reception occasions among at least one candidate PDSCH reception occasion, where K is an integer and P is an integer.

[0152] In one possible implementation, when the UE performs time-domain binding for the K candidate PDSCH reception occasions and the P candidate PDSCH reception occasions as described above, the decoding results corresponding to the P candidate PDSCH reception occasions are NACK or ACK.

[0153] In one possible implementation, when binary AND is adopted as described above, the decoding results corresponding to the P candidate PDSCH reception occasions are ACK, and when binary OR is adopted, the decoding results corresponding to the P candidate PDSCH reception occasions are NACK.

[0154] In one possible implementation, it further includes a setting module. Here, the setting module is used to set the corresponding HARQ-ACK bit in the HARQ-ACK codebook using the decoding result corresponding to one candidate PDSCH reception occasion when the K candidate PDSCH reception occasions are one candidate PDSCH reception occasion, or to set the corresponding HARQ-ACK bit in the HARQ-ACK codebook to NACK when K is 0.

[0155] In one possible implementation manner, specifically when there is a conflict between the last time domain resource allocation record of the first target row and the semi-static time domain configuration information, the construction module 31 determines that the first target row is a row not to be used for determining the transmission occasion set; otherwise, the UE determines that the first target row is a row for determining the transmission occasion set, or, whether there is a conflict between the last time domain resource allocation record of the first target row and the semi-static time domain configuration information, the construction module 31 determines that the first target row is a row for determining the transmission occasion set, or, based on the conflict situation between each time domain resource allocation record of the first target row and the semi-static time domain configuration information, it is used to determine whether the first target row is a row for determining the transmission occasion set.

[0156] In one possible implementation manner, specifically when there is a conflict between at least one time domain resource allocation record of the first target row and the semi-static time domain configuration information, the construction module 31 determines that the first target row is a row not to be used for determining the transmission occasion set; otherwise, it is used to determine that the first target row is a row for determining the transmission occasion set.

[0157] In one possible implementation manner, it further includes a mapping module. Here, when the first target row is a row for determining the transmission occasion set, the mapping module is used to map the first time domain resource allocation record in the first target row to the target transmission occasion. Here, the target transmission occasion is the transmission occasion corresponding to the last time domain resource allocation record of the first target row, and the first time domain resource allocation record is any one of the time domain resource allocation records that do not conflict with the semi-static time domain configuration information in the first target row.

[0158] In one possible implementation manner, the above target transmission occasion corresponds to X candidate PDSCH reception occasions, where X is the maximum value of the number of time domain resource allocation records that do not conflict with the semi-static time domain configuration information in the second target row. The second target row is any one row corresponding to the target transmission occasion in the time domain resource allocation table, and X is an integer.

[0159] In one possible implementation manner, when Q is smaller than X, Q time domain resource allocation records respectively correspond to the first Q or the last Q of the X candidate PDSCH reception occasions one by one. Q is the number of time domain resource allocation records that do not conflict with the semi-static time domain configuration information in the third target row. The third target row is the row corresponding to the target transmission occasion in the time domain resource allocation table, and Q is an integer.

[0160] In one possible implementation manner, when X is 0, there are no corresponding HARQ-ACK bits in the constructed HARQ-ACK codebook for the above target transmission occasion.

[0161] Embodiments of the present application provide a codebook construction device. For a semi-static HARQ-ACK codebook that supports Multi-PDSCH scheduling, when constructing the semi-static HARQ-ACK codebook, time-domain binding can be performed based on the boundary of the transmission occasion in the transmission occasion set or the union of candidate PDSCH reception occasions corresponding to the transmission occasion set, thereby realizing the construction of the semi-static HARQ-ACK codebook, eliminating the need to determine the binding granularity in advance, avoiding the influence of the binding granularity on the determination of the transmission occasion, enhancing the generality of the codebook construction flow, and reducing the complexity of constructing the codebook. Or, when constructing the semi-static HARQ-ACK codebook, based on the collision situation between any row of time-domain resource allocation records in the time-domain resource allocation table and the semi-static time-domain configuration information, the semi-static HARQ-ACK codebook can be constructed according to the last time-domain resource allocation record of each row, avoiding the situation where there are no HARQ-ACK bits that need to be used in the codebook, thereby avoiding affecting the performance of HARQ transmission or bringing unnecessary restrictions to downlink scheduling.

[0162] FIG. 4 shows a schematic diagram of a possible structure of a codebook construction device according to an embodiment of the present application. As shown in FIG. 4, this codebook construction device 40 may include a receiving module 41.

[0163] Here, the receiving module 41 is used to receive a semi-static HARQ-ACK codebook. Here, the semi-static HARQ codebook is constructed based on a time-domain binding result, or the semi-static HARQ-ACK codebook is constructed according to the last time-domain resource allocation record in each row of the time-domain resource allocation table based on second information. Here, the time-domain binding result is obtained by performing time-domain binding based on first information after determining a set of transmission occasions. The first information is either the boundary of a transmission occasion in the set of transmission occasions or the union of candidate PDSCH reception occasion sets corresponding to the set of transmission occasions. The union of candidate PDSCH reception occasion sets is a union of candidate PDSCH reception occasions obtained by cascading candidate PDSCH reception occasions in each candidate PDSCH reception occasion set corresponding to each transmission occasion in the set of transmission occasions in a preset order. The second information is used to indicate whether there is a conflict between at least one time-domain resource allocation record in a first target row in the time-domain resource allocation table and semi-static time-domain configuration information. The first target row is any row in the time-domain resource allocation table.

[0164] In one possible implementation manner, the above first information is the boundary of a transmission occasion in the set of transmission occasions. The above time-domain binding result is obtained by performing time-domain binding on a candidate PDSCH reception occasion set corresponding to each transmission occasion after determining the set of transmission occasions, or the above time-domain binding result is obtained by performing time-domain binding on one candidate PDSCH reception occasion subset in the candidate PDSCH reception occasion set corresponding to each transmission occasion after determining the set of transmission occasions.

[0165] In one possible implementation manner, the set of candidate PDSCH reception occasions corresponding to one transmission occasion is a set of candidate PDSCH reception occasions consisting of at least one candidate PDSCH reception occasion related to one transmission occasion. The subset of candidate PDSCH reception occasions corresponding to one transmission occasion includes at least one of at least one first subset and a second subset. Here, each first subset is a subset of candidate PDSCH reception occasions consisting of N candidate PDSCH reception occasions with adjacent or consecutive indexes / numbers in the set of candidate PDSCH reception occasions consisting of at least one candidate PDSCH reception occasion related to one transmission occasion. The second subset is a subset of candidate PDSCH reception occasions consisting of the remaining candidate PDSCH reception occasions at the end when the number of remaining candidate PDSCH reception occasions at the end of the set of candidate PDSCH reception occasions is smaller than N. N is a positive integer.

[0166] In one possible implementation manner, the above first information is the boundary of the transmission occasion in the set of transmission occasions. The above time-domain binding result is obtained by performing time-domain binding on each candidate PDSCH reception occasion related to each transmission occasion in each transmission occasion group among at least one transmission occasion group after determining the set of transmission occasions.

[0167] In one possible implementation manner, the at least one transmission occasion group includes at least one of at least one first transmission occasion group and a second transmission occasion group. Here, each first transmission occasion group is one transmission occasion group composed of every M transmission occasions with adjacent or consecutive indexes / numbers in a transmission occasion set or a transmission occasion subset. The second transmission occasion group is one transmission occasion group composed of the remaining transmission occasions at the end when the number of the remaining transmission occasions at the end of the transmission occasion set or the transmission occasion subset is smaller than M. The transmission occasion subset is a transmission occasion subset obtained after dividing the transmission occasion set based on a preset rule, and M is a positive integer.

[0168] In one possible implementation manner, the at least one transmission occasion group is obtained when allowing to cross the boundary of the transmission occasion subset. The at least one transmission occasion group is one or more transmission occasion groups obtained by dividing the transmission occasion set based on M. Or, the at least one transmission occasion group is obtained when not allowing to cross the boundary of the transmission occasion subset. The at least one transmission occasion group is one or more transmission occasion groups obtained by dividing one transmission occasion subset of the transmission occasion set based on M.

[0169] In one possible implementation manner, the first information is a candidate PDSCH reception occasion sum set corresponding to the transmission occasion set. After determining the transmission occasion set, the time domain binding result is obtained by performing time domain binding on all candidate PDSCH reception occasions in each candidate PDSCH reception occasion group among at least one candidate PDSCH reception occasion group.

[0170] In one possible implementation manner, the at least one candidate PDSCH reception occasion group includes at least one of at least one first candidate PDSCH reception occasion group and a second candidate PDSCH reception occasion group. Here, each first candidate PDSCH reception occasion group is a candidate PDSCH reception occasion group composed of L candidate PDSCH receptions with adjacent or consecutive indexes / numbers in the union of candidate PDSCH reception occasions. The second candidate PDSCH reception occasion group is a candidate PDSCH reception occasion group composed of the remaining candidate PDSCH receptions at the end when the number of the remaining candidate PDSCH receptions at the end of the union of candidate PDSCH reception occasions is smaller than L, and L is a positive integer.

[0171] In one possible implementation manner, the above semi-static HARQ-ACK codebook is constructed according to the last time domain resource allocation record in each row in the time domain resource allocation table based on the second information. When there is a conflict between the last time domain resource allocation record of the first target row and the semi-static time domain configuration information, the first target row is a row that is not used to determine the transmission occasion set. Otherwise, the first target row is a row for determining the transmission occasion set. Or, whether there is a conflict or no conflict between the last time domain resource allocation record of the first target row and the semi-static time domain configuration information, the first target row is a row for determining the transmission occasion set. Or, whether the first target row is a row for determining the transmission occasion set is determined based on the conflict situation between each time domain resource allocation record of the first target row and the semi-static time domain configuration information.

[0172] In one possible implementation manner, when there is a conflict between at least one time domain resource allocation record of the first target row and the semi-static time domain configuration information, the first target row is a row that is not used to determine the transmission occasion set. Or, When there is no conflict between at least one time domain resource allocation record of the first target row and the semi-static time domain configuration information, the first target row is a row for determining a set of transmission occasions.

[0173] In one possible implementation, it further includes a determination module. Here, the determination module is used to determine the length of the HARQ-ACK bit sequence corresponding to the semi-static HARQ-ACK codebook and the mapping relationship between each HARQ-ACK bit in the HARQ-ACK bit sequence and the candidate PDSCH reception occasion before the reception module 41 receives the semi-static HARQ-ACK codebook.

[0174] The embodiments of the present application provide a codebook construction device. The semi-static HARQ-ACK codebook received by the codebook construction device is constructed based on the time domain binding result or constructed according to the last time domain resource allocation record of each row in the time domain resource allocation table based on the second information. When constructing the semi-static HARQ-ACK codebook, time domain binding is performed based on the boundary of the transmission occasions in the set of transmission occasions or the union of the candidate PDSCH reception occasions corresponding to the set of transmission occasions, thereby realizing the construction of the semi-static HARQ-ACK codebook, eliminating the need to determine the binding granularity in advance, avoiding the influence of the binding granularity on the determination of transmission occasions, enhancing the generality of the codebook construction flow, and reducing the complexity of constructing the codebook. Or, based on the conflict situation between the time domain resource allocation record of any row in the time domain resource allocation table and the semi-static time domain configuration information, construct the semi-static HARQ-ACK codebook according to the last time domain resource allocation record of each row, avoiding the situation where there are no HARQ-ACK bits required to be used in the codebook, thereby avoiding affecting the performance of HARQ transmission or bringing unnecessary restrictions to downlink scheduling.

[0175] The codebook construction device in the embodiments of this application may be a device, a device having an operating system, or a UE, and may also be a member, an integrated circuit, or a chip in a UE. This device or UE may be a mobile terminal or a non-mobile terminal. Exemplarily, the mobile terminal may include, but is not limited to, the types of UE 11 listed above. The non-mobile terminal may be a server, a Network Attached Storage (NAS), a Personal Computer (PC), a Television (TV), a deposit and payment machine, or a self-service machine, etc., and the embodiments of this application are not specifically limited.

[0176] The codebook construction device according to the embodiments of this application realizes each process realized by the embodiments of the above method and can achieve the same technical effects. To avoid repetition of the description, it will not be further described here.

[0177] Optionally, as shown in FIG. 5, the embodiments of this application further provide a communication device 500, including a processor 501, a memory 502, and a program or instruction stored in the memory 502 and executable on the processor 501. For example, when this communication device 500 is a UE, when this program or instruction is executed by the processor 501, each process of the embodiments of the above method can be realized and the same technical effects can be achieved. When this communication device 500 is a network-side device, when this program or instruction is executed by the processor 501, each process of the embodiments of the above method can be realized and the same technical effects can be achieved. To avoid repetition of the description, it will not be further described here.

[0178] Embodiments of this application further provide a UE, which includes a processor and a communication interface. The processor is used to construct a semi-static HARQ-ACK codebook. The communication interface is used to transmit the semi-static HARQ-ACK codebook. Here, constructing the semi-static HARQ-ACK codebook specifically includes either executing time-domain binding based on first information after determining a set of transmission occasions and constructing the semi-static HARQ-ACK codebook based on the time-domain binding result, or constructing the semi-static HARQ-ACK codebook according to the last time-domain resource allocation record in each row of the time-domain resource allocation table according to second information. Here, the first information is either the boundary of a transmission occasion in the set of transmission occasions or the union of candidate PDSCH reception occasions corresponding to the set of transmission occasions. The union of candidate PDSCH reception occasions is a union of candidate PDSCH reception occasions obtained by cascading each candidate PDSCH reception occasion in the set of candidate PDSCH reception occasions corresponding to each transmission occasion in the set of transmission occasions in a preset order. The second information is used to indicate whether there is a conflict between at least one time-domain resource allocation record in the first target row of the time-domain resource allocation table and the semi-static time-domain configuration information. The first target row is any row in the time-domain resource allocation table. Embodiments of this UE correspond to embodiments of the above UE-side method. Each implementation process and realization method of the embodiments of the above method can be applied to embodiments of this UE and can achieve the same technical effect. Specifically, FIG. 6 is a schematic hardware structure diagram for realizing the UE of the embodiment of this application.

[0179] This UE100 includes, but is not limited to, at least some of the components such as a radio frequency unit 101, a network module 102, an audio output unit 103, an input unit 104, a sensor 105, a display unit 106, a user input unit 107, an interface unit 108, a memory 109, and a processor 110.

[0180] As can be understood by those skilled in the art, the UE100 may further include a power source (e.g., a battery) for powering each component. The power source may be logically connected to the processor 110 by a power management system, thereby enabling functions such as charge and discharge management and power consumption management to be realized by the power management system. The UE structure shown in FIG. 6 does not constitute a limitation on the UE. The UE 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 herein.

[0181] It should be understood that in the embodiments of the present application, the input unit 104 may include a graphics processing unit (GPU) 1041 and a microphone 1042. The graphics processing unit 1041 processes the image data of still images or videos obtained by an image capture device (e.g., a camera) in a video capture mode or an image capture mode. The display unit 106 may include a display panel 1061, and the display panel 1061 may be configured in the form of a liquid crystal display, an organic light-emitting diode, etc. The user input unit 107 includes a touch panel 1071 and other input devices 1072. The touch panel 1071 is also called a touch screen. The touch panel 1071 may include two parts: a touch detection device and a touch controller. The other input devices 1072 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 an operation lever, which will not be further described herein.

[0182] In an embodiment of the present application, after the radio frequency unit 101 receives downlink data from a network-side device, it causes the processor 110 to process it, and also transmits uplink data to the network-side device. Generally, the radio frequency unit 101 includes, but is not limited to, an antenna, at least one amplifier, a transceiver, a coupler, a low-noise amplifier, a duplexer, etc.

[0183] The memory 109 may be used to store software programs or instructions and various data. The memory 109 may mainly include a program or instruction storage area and a data storage area. Here, the program or instruction storage area may store an operating system, an application program or instruction required for at least one function (for example, a voice playback function, an image playback function, etc.). Note that the memory 109 may include a high-speed random access memory and may also include a non-volatile memory. Here, the non-volatile memory may be a read-only memory (ROM), a programmable ROM (PROM), an erasable programmable ROM (EPROM), an electrically erasable programmable ROM (EEPROM), or a flash memory. For example, it may be at least one magnetic disk memory device, a flash memory device, or other non-volatile solid-state memory devices.

[0184] The processor 110 may include one or more processing units. Optionally, the processor 110 may integrate an application processor and a modem processor. Here, the application processor mainly processes an operating system, a user interface, an application program or instruction, etc., and the modem processor mainly processes wireless communication, for example, a baseband processor. As can be understood, the above modem processor may not be integrated into the processor 110.

[0185] Here, the processor 110 is used to construct a semi-static HARQ-ACK codebook.

[0186] The radio frequency unit 101 is used to transmit a semi-static HARQ-ACK codebook. Here, constructing the semi-static HARQ-ACK codebook specifically includes either executing time-domain binding based on first information after determining a set of transmission occasions and then constructing the semi-static HARQ-ACK codebook based on the time-domain binding result, or constructing the semi-static HARQ-ACK codebook according to the last time-domain resource allocation record in each row of the time-domain resource allocation table in response to second information. Here, the first information is either the boundary of a transmission occasion in the set of transmission occasions or the union of candidate PDSCH reception occasions corresponding to the set of transmission occasions. The union of candidate PDSCH reception occasions is a union of candidate PDSCH reception occasions obtained by cascading each candidate PDSCH reception occasion in the set of candidate PDSCH reception occasions corresponding to each transmission occasion in the set of transmission occasions in a preset order. The second information is used to indicate whether there is a conflict between at least one time-domain resource allocation record in the first target row in the time-domain resource allocation table and the semi-static time-domain configuration information, and the first target row is any row in the time-domain resource allocation table.

[0187] Embodiments of the present application provide a UE. For a semi-static HARQ-ACK codebook that supports Multi-PDSCH scheduling, when constructing the semi-static HARQ-ACK codebook, the UE can perform time-domain binding based on the boundaries of the transmission occasions in the transmission occasion set or the union of candidate PDSCH reception occasions corresponding to the transmission occasion set, thereby realizing the construction of the semi-static HARQ-ACK codebook, eliminating the need to determine the binding granularity in advance, avoiding the influence on the determination of transmission occasions due to the binding granularity, enhancing the generality of the codebook construction flow, and reducing the complexity of constructing the codebook. Alternatively, when constructing the semi-static HARQ-ACK codebook, the UE can construct the semi-static HARQ-ACK codebook according to the last time-domain resource allocation record in each row based on the collision situation between any row of time-domain resource allocation records in the time-domain resource allocation table and the semi-static time-domain configuration information, avoiding the situation where there are no HARQ-ACK bits that need to be used in the codebook, thereby avoiding affecting the performance of HARQ transmission or bringing unnecessary restrictions to downlink scheduling.

[0188] Optionally, in embodiments of the present application, the first information is the boundary of the transmission occasions in the transmission occasion set. After specifically determining the transmission occasion set, the processor 110 is used to perform time-domain binding within the range of the set of candidate PDSCH reception occasions corresponding to each transmission occasion.

[0189] Optionally, in embodiments of the present application, after specifically determining the transmission occasion set, the processor 110 performs time-domain binding on the set of candidate PDSCH reception occasions corresponding to each transmission occasion, or is used to perform time-domain binding on one subset of candidate PDSCH reception occasions in the set of candidate PDSCH reception occasions corresponding to each transmission occasion after determining the transmission occasion set.

[0190] Optionally, in the embodiments of the present application, the above first information is the boundary of the transmission occasion in the set of transmission occasions. After specifically determining the set of transmission occasions, the processor 110 is used to perform time-domain binding on each candidate PDSCH reception occasion related to each transmission occasion in each transmission occasion group among at least one transmission occasion group.

[0191] Optionally, in the embodiments of the present application, the above first information is the union of candidate PDSCH reception occasions corresponding to the set of transmission occasions. After specifically determining the set of transmission occasions, the processor 110 is used to perform time-domain binding on all candidate PDSCH reception occasions in each candidate PDSCH reception occasion group among at least one candidate PDSCH reception occasion group.

[0192] Optionally, in the embodiments of the present application, after specifically determining the set of transmission occasions, when the PDSCH corresponding to K candidate PDSCH reception occasions among at least one candidate PDSCH reception occasion corresponding to the set of transmission occasions has actually been transmitted, and the PDSCH corresponding to P candidate PDSCH reception occasions has not actually been transmitted, the processor 110 performs time-domain binding on the K candidate PDSCH reception occasions and the P candidate PDSCH reception occasions, or is used to perform time-domain binding on the K candidate PDSCH reception occasions, where the P candidate PDSCH reception occasions are candidate PDSCH reception occasions other than the K candidate PDSCH reception occasions among at least one candidate PDSCH reception occasion, K is an integer, and P is an integer.

[0193] Optionally, in an embodiment of the present application, when K candidate PDSCH reception opportunities are one candidate PDSCH reception opportunity, the processor 110 further uses the decoding result corresponding to one candidate PDSCH reception opportunity to set the corresponding HARQ-ACK bit in the HARQ-ACK codebook, or when K is 0, it is used to set the corresponding HARQ-ACK bit in the HARQ-ACK codebook to NACK.

[0194] Optionally, in an embodiment of the present application, when there is a conflict between the last time domain resource allocation record of the first target row and the semi-static time domain configuration information, the processor 110 specifically determines that the first target row is a row not used to determine the transmission opportunity set. Otherwise, the UE determines that the first target row is a row for determining the transmission opportunity set, or when there is or is no conflict between the last time domain resource allocation record of the first target row and the semi-static time domain configuration information, it is determined that the first target row is a row for determining the transmission opportunity set, or based on the conflict situation between each time domain resource allocation record of the first target row and the semi-static time domain configuration information, it is used to determine whether the first target row is a row for determining the transmission opportunity set.

[0195] Optionally, in an embodiment of the present application, when there is a conflict between at least one time domain resource allocation record of the first target row and the semi-static time domain configuration information, the processor 110 specifically determines that the first target row is a row not used to determine the transmission opportunity set. Otherwise, when there is no conflict between at least one time domain resource allocation record of the first target row and the semi-static time domain configuration information, it is used to determine that the first target row is a row for determining the transmission opportunity set.

[0196] Optionally, in the embodiments of the present application, the processor 110 is further used to map the first time-domain resource allocation record in the first target row to the target transmission occasion when the first target row is the row for determining the set of transmission occasions. Here, the target transmission occasion is the transmission occasion corresponding to the last time-domain resource allocation record in the first target row, and the first time-domain resource allocation record is any one of the time-domain resource allocation records that do not conflict with the semi-static time-domain configuration information in the first target row.

[0197] The UE according to the embodiments of the present application can implement each process realized by the embodiments of the above method and achieve the same technical effect, and thus will not be described herein again to avoid repetition of the description.

[0198] Embodiments of the present application further provide a network-side device including a processor and a communication interface for receiving a semi-static HARQ-ACK codebook, where the semi-static HARQ codebook is constructed based on a time-domain binding result, or the semi-static HARQ-ACK codebook is constructed according to the last time-domain resource allocation record in each row of the time-domain resource allocation table based on second information. Here, the time-domain binding result is obtained by performing time-domain binding based on first information after determining a set of transmission occasions, and the first information is any one of the boundaries of the transmission occasions in the set of transmission occasions and the union of candidate PDSCH reception occasion sets corresponding to the set of transmission occasions. The union of candidate PDSCH reception occasion sets is a union of candidate PDSCH reception occasions obtained by cascading the candidate PDSCH reception occasions in each candidate PDSCH reception occasion set corresponding to each transmission occasion in the set of transmission occasions in a head-to-tail manner according to a preset order. The second information is used to indicate whether there is a conflict between at least one time-domain resource allocation record in the first target row of the time-domain resource allocation table and the semi-static time-domain configuration information, and the first target row is any row in the time-domain resource allocation table. Embodiments of this network-side device correspond to embodiments of the above network-side device method, and each implementation process and realization method of the embodiments of the above method can all be applied to embodiments of this network-side device and can achieve the same technical effects.

[0199] Specifically, the embodiments of the present application further provide a network-side device. As shown in FIG. 7, this network-side device 700 includes an antenna 71, a radio frequency device 72, and a baseband device 73. The antenna 71 and the radio frequency device 72 are connected. In the uplink direction, the radio frequency device 72 receives information via the antenna 71 and transmits the received information to the baseband device 73 for processing. In the downlink direction, the baseband device 73 processes the information to be transmitted, transmits it to the radio frequency device 72, and the radio frequency device 72 processes the received information and then sends it out via the antenna 71.

[0200] The above frequency band processing device may be located in the baseband device 73. In the above embodiments, the method executed by the network-side device may be implemented in the baseband device 73. This baseband device 73 includes a processor 74 and a memory 75.

[0201] The baseband device 73 may include, for example, at least one baseband board. A plurality of chips are installed on this baseband board. As shown in FIG. 7, one of the chips is, for example, the processor 74, which is connected to the memory 75, calls the program in the memory 75, and executes the operations of the network-side device shown in the above method embodiments.

[0202] This baseband device 73 may further include a network interface 76 used for information exchange with the radio frequency device 72. This interface is, for example, a Common Public Radio Interface (CPRI).

[0203] Specifically, the network-side device according to an embodiment of the present invention further includes instructions or programs stored in the memory 75 and executable on the processor 74. The processor 74 calls the instructions or programs in the memory 75, executes the methods executed by the above-mentioned respective modules, and can achieve the same technical effects. To avoid repetition of the description, it will not be further described herein.

[0204] Embodiments of the present application further provide a readable storage medium, on which programs or instructions are stored. When these programs or instructions are executed by a processor, each process of the embodiment of the above codebook construction method is realized, and the same technical effects can be achieved. To avoid repetition of the description, it will not be further described herein.

[0205] Here, the processor is the processor in the UE described in the above embodiment. The readable storage medium includes 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.

[0206] Embodiments of the present application further provide a chip, which includes a processor and a communication interface. The communication interface is coupled to the processor. The processor runs programs or instructions and is used to realize each process of the embodiment of the above codebook construction method, and the same technical effects can be achieved. To avoid repetition of the description, it will not be further described herein.

[0207] It should be understood that the chip mentioned in the embodiments of the present application may also be referred to as a system-level chip, a system-on-chip, a chip system, or a system-on-a-chip, etc.

[0208] It should be noted that in this specification, the term "comprising", "including" or any other variation thereof is intended to cover non-exclusive "including", whereby a process, method, article or apparatus comprising a series of elements includes not only those elements but also other elements not expressly listed or elements specific to such a process, method, article or apparatus. In the case of an element limited by the phrase "comprising one...", in the absence of further limitations, it is not excluded that there are other same elements in the process, method, article or apparatus comprising this element. It should be pointed out that the scope of the method and apparatus in the embodiments of this application is not limited to performing functions in the order illustrated or discussed, but may include performing functions in a substantially simultaneous manner or in a reverse order based on the relevant functions. For example, a method described in a different procedure from the one described can be executed, and various steps can be added, omitted or combined. Also, features described with reference to some examples can be combined in other examples.

[0209] From the description of the above embodiments, it can be clearly understood by those skilled in the art that the method of the above embodiments can be implemented in the form of software and the necessary general-purpose hardware platform. Of course, it may also be implemented by hardware, but in many cases, the former is a more preferred embodiment. Based on such an understanding, the technical solution of this application, in essence or the part that has contributed to the prior art, may be embodied in the form of a computer software product. This computer software product is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), and includes several instructions for causing a terminal (which may be a mobile phone, computer, server, air conditioner, or network-side device, etc.) to execute the methods described in each embodiment of this application.

[0210] The above has described the embodiments of the present application while associating with the drawings. However, the present application is not limited to the above specific embodiments. The above specific embodiments are merely exemplary and not restrictive. Those skilled in the art can also implement many forms based on the suggestions of the present application without departing from the spirit of the present application and the scope of the claims, and all of them belong to the protection scope of the present application.

Claims

1. A codebook construction method, comprising: a step in which a user equipment (UE) constructs a semi-static hybrid automatic repeat request - acknowledgement (HARQ-ACK) codebook; and a step in which the UE transmits the semi-static HARQ-ACK codebook, wherein the step in which the UE constructs the semi-static HARQ-ACK codebook comprises: a step in which the UE constructs a semi-static HARQ-ACK codebook according to the last time domain resource allocation record in each row of a time domain resource allocation table based on second information; wherein the second information is used to indicate whether there is a conflict between at least one time domain resource allocation record in a first target row of the time domain resource allocation table and semi-static time domain configuration information, and the first target row is any row in the time domain resource allocation table. The codebook construction method.

2. The step in which the UE constructs a semi-static HARQ-ACK codebook according to the last time domain resource allocation record in each row of the time domain resource allocation table based on second information comprises: a step in which the UE determines whether the first target row is a row for determining a transmission occasion set based on a conflict situation between each time domain resource allocation record in the first target row and the semi-static time domain configuration information; or a step in which, when there is a conflict between the last time domain resource allocation record in the first target row and the semi-static time domain configuration information, the UE determines that the first target row is not a row used for determining a transmission occasion set, and when there is no such conflict, the UE determines that the first target row is a row used for determining a transmission occasion set; or a step in which, whether there is a conflict or no conflict between the last time domain resource allocation record in the first target row and the semi-static time domain configuration information, the UE determines that the first target row is a row used for determining a transmission occasion set, The method according to claim 1, comprising the above.

3. The step in which the UE determines whether the first target row is a row for determining a transmission occasion set based on a conflict situation between each time domain resource allocation record in the first target row and the semi-static time domain configuration information comprises: When there is no conflict between at least one time domain resource allocation record of the first target row and the semi-static time domain configuration information, the step in which the UE determines that the first target row is a row for determining the transmission occasion set Or When there is a conflict between at least one time domain resource allocation record of the first target row and the semi-static time domain configuration information, the step in which the UE determines that the first target row is a row not used for determining the transmission occasion set The method according to claim 2, comprising:

4. When the first target row is a row for determining the transmission occasion set, the method further includes the step in which the UE maps the first time domain resource allocation record in the first target row to a target transmission occasion Here, the target transmission occasion is a transmission occasion corresponding to the last time domain resource allocation record of the first target row, and the first time domain resource allocation record is any one time domain resource allocation record that does not conflict with the semi-static time domain configuration information in the first target row. The method according to claim 2

5. A codebook construction method, comprising: The step in which a network-side device receives a semi-static hybrid automatic repeat request-acknowledgment HARQ-ACK codebook, where the semi-static HARQ-ACK codebook is constructed according to the last time domain resource allocation record of each row in a time domain resource allocation table based on second information Here, the second information is used to indicate whether there is a conflict between at least one time domain resource allocation record of a first target row in the time domain resource allocation table and semi-static time domain configuration information, and the first target row is any one row in the time domain resource allocation table. A codebook construction method

6. When the semi-static HARQ-ACK codebook is constructed according to the last time domain resource allocation record of each row in the time domain resource allocation table based on the second information Whether the first target row is a row for determining a set of transmission occasions is determined based on a collision situation between each time domain resource allocation record of the first target row and semi-static time domain configuration information. Or If there is a collision between the last time domain resource allocation record of the first target row and the semi-static time domain configuration information, the first target row is not a row used for determining a set of transmission occasions; otherwise, the first target row is a row for determining a set of transmission occasions. Or Whether there is a collision between the last time domain resource allocation record of the first target row and the semi-static time domain configuration information, the first target row is a row for determining a set of transmission occasions. The method according to claim 5.

7. If there is no collision between at least one time domain resource allocation record of the first target row and the semi-static time domain configuration information, the first target row is a row for determining a set of transmission occasions. Or If there is a collision between at least one time domain resource allocation record of the first target row and the semi-static time domain configuration information, the first target row is not a row used for determining a set of transmission occasions. The method according to claim 6.

8. A user equipment UE, comprising a processor, a memory, and a program or instruction stored in the memory and executable on the processor, wherein when the program or instruction is executed by the processor, the steps of the codebook construction method according to any one of claims 1 to 4 are realized.

9. A network-side device, comprising a processor, a memory, and a program or instruction stored in the memory and executable on the processor, wherein when the program or instruction is executed by the processor, the steps of the codebook construction method according to any one of claims 5 to 7 are realized.

Images