CN115941135A

CN115941135A - Codebook determination method, device, terminal and network side equipment

Info

Publication number: CN115941135A
Application number: CN202110904336.0A
Authority: CN
Inventors: 曾超君
Original assignee: Vivo Mobile Communication Co Ltd
Current assignee: Vivo Mobile Communication Co Ltd
Priority date: 2021-08-06
Filing date: 2021-08-06
Publication date: 2023-04-07

Abstract

The application discloses a codebook determining method, a codebook determining device, a terminal and network side equipment, and belongs to the technical field of communication. The codebook determining method of the embodiment of the application comprises the following steps: the terminal generates a first record set in a traversing mode based on a time domain feedback offset set and a time domain resource allocation table, wherein each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table; determining a transmission opportunity of each first record mapping; the terminal determines the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunity; and determining a HARQ-ACK semi-static codebook according to the number of the candidate PDSCH receiving opportunities.

Description

Codebook determination method, device, terminal and network side equipment

Technical Field

The application belongs to the technical field of communication, and particularly relates to a codebook determination method, a codebook determination device, a terminal and network side equipment.

Background

In the prior art, when a terminal constructs a Hybrid Automatic Repeat reQuest-acknowledgement (HARQ-ACK) semi-static codebook, a transmission opportunity set for determining a HARQ-ACK bit sequence corresponding to the HARQ-ACK semi-static codebook is usually obtained based on an initial symbol and a Symbol Length Indication (SLIV) set corresponding to each downlink slot in a downlink slot set of a given serving cell. However, the method for constructing the HARQ-ACK semi-static codebook does not consider that the time domain resource allocation table is always scheduled integrally according to one row of the time domain resource allocation table, and in this case, when a codebook supporting Multi-PDSCH (Physical Downlink Shared Channel, PDSCH) scheduling is constructed, the correlation between SLIVs corresponding to/included in one row is not considered, and after scheduling is performed, simultaneous scheduling cannot be actually performed between two rows with any overlapping time domain, so that some redundant transmission opportunities often exist in the obtained transmission opportunity set, and further redundant HARQ-ACK bits exist in the constructed HARQ-ACK semi-static codebook.

Disclosure of Invention

The embodiment of the application provides a codebook determining method, a codebook determining device, a terminal and network side equipment, and aims to solve the problem that redundant HARQ-ACK bits exist in a currently constructed HARQ-ACK semi-static codebook.

In a first aspect, a codebook determining method is provided, including:

the terminal generates a first record set in a traversing mode based on a time domain feedback offset set and a time domain resource allocation table, wherein each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table;

the terminal determines a transmission opportunity mapped by each first record in the first record set;

the terminal determines the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunity;

and the terminal determines a HARQ-ACK semi-static codebook according to the number of the candidate PDSCH receiving opportunities.

In a second aspect, a codebook determination method is provided, including:

the network side equipment receives the HARQ-ACK semi-static codebook from the terminal; the HARQ-ACK semi-static codebook is determined by the terminal based on a time domain feedback offset set and a time domain resource allocation table, generating a first record set in a traversing manner, determining a transmission opportunity mapped by each first record based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, determining the number of candidate PDSCH (physical downlink shared channel) receiving opportunities corresponding to the transmission opportunity, and determining the number of the candidate PDSCH receiving opportunities according to the number of the candidate PDSCH receiving opportunities.

In a third aspect, an apparatus for determining a codebook is provided, including:

a generating module, configured to generate a first record set in a traversal manner based on a time domain feedback offset set and a time domain resource allocation table, where each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table;

a first determining module for determining a transmission opportunity mapped by each first record in the first set of records;

a second determining module, configured to determine a number of candidate PDSCH receiver opportunities corresponding to the transmission opportunity;

a third determining module, configured to determine a HARQ-ACK semi-static codebook according to the number of candidate PDSCH receiving opportunities.

In a fourth aspect, an apparatus for determining a codebook is provided, including:

a receiving module, configured to receive a HARQ-ACK semi-static codebook from a terminal; the HARQ-ACK semi-static codebook is determined according to the number of candidate PDSCH (physical Downlink shared channel) receiving opportunities after the terminal determines the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunities based on a time domain feedback offset set and a time domain resource allocation table and generates a first record set in a traversing manner by the terminal, wherein each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, the transmission opportunity mapped by each first record is determined, and the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunities is determined.

In a fifth aspect, there is provided a terminal comprising a processor, a memory, and a program or instructions stored on the memory and executable on the processor, which when executed by the processor, performs the steps of the method according to the first aspect.

A sixth aspect provides a terminal, including a processor and a communication interface, where the processor is configured to generate a first record set in a traversal manner based on a time domain feedback offset set and a time domain resource allocation table, and each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table; determining a transmission opportunity of each first record mapping; the terminal determines the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunity; and determining a HARQ-ACK semi-static codebook according to the number of the candidate PDSCH receiving opportunities.

In a seventh aspect, a network-side device is provided, which includes a processor, a memory, and a program or an instruction stored on the memory and executable on the processor, and when executed by the processor, the program or the instruction implements the steps of the method according to the second aspect.

In an eighth aspect, a network side device is provided, which includes a processor and a communication interface, where the communication interface is configured to receive a HARQ-ACK semi-static codebook from a terminal; the HARQ-ACK semi-static codebook is determined according to the number of candidate PDSCH (physical Downlink shared channel) receiving opportunities after the terminal determines the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunities based on a time domain feedback offset set and a time domain resource allocation table and generates a first record set in a traversing way by the terminal, wherein each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, the transmission opportunities mapped by each first record are determined, and the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunities is determined.

In a ninth aspect, there is provided a readable storage medium on which is stored a program or instructions which, when executed by a processor, carries out the steps of the method of the first aspect or the steps of the method of the second aspect.

In a tenth aspect, a chip is provided, the chip comprising a processor and a communication interface, the communication interface being coupled to the processor, the processor being configured to execute a program or instructions to implement the steps of the method according to the first aspect or to implement the steps of the method according to the second aspect.

In an eleventh aspect, there is provided a computer program/program product stored on a non-transitory storage medium, the program/program product being executable by at least one processor to perform the steps of the method according to the first aspect or to implement the steps of the method according to the second aspect.

In this embodiment of the application, a terminal may generate a first record set in a traversal manner based on a time domain feedback offset set and a time domain resource allocation table, where each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, a transmission opportunity mapped by each first record is determined, the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunity is determined, and a HARQ-ACK semi-static codebook is determined according to the determined number of candidate PDSCH receiving opportunities, so that it may be realized to uniformly determine the transmission opportunity based on the records of the time domain feedback offset and the row in the time domain resource allocation table, and thus when constructing a codebook supporting Multi-PDSCH scheduling, without paying attention to or breaking a DL Slot boundary, considering the situations such as the existence of correlation among SLIVs corresponding to/included in a certain row in the time domain resource allocation table, thereby reducing/avoiding redundant transmission opportunities, and reducing/avoiding redundant HARQ-ACK bits in the HARQ-ACK semi-static codebook, thereby improving HARQ feedback efficiency.

Drawings

FIG. 1 is a block diagram of a wireless communication system to which embodiments of the present application are applicable;

fig. 2 is a flowchart of a codebook determination method provided in an embodiment of the present application;

FIG. 3 is one of the schematic time slot diagrams in the present application example;

FIG. 4 is a second schematic diagram of a timeslot in an example of the present application;

FIG. 5 is a third schematic diagram of a timeslot in an example of the present application;

FIG. 6 is a flowchart of another codebook determination method provided in an embodiment of the present application;

fig. 7 is a schematic structural diagram of a codebook determination apparatus according to an embodiment of the present application;

fig. 8 is a schematic structural diagram of a codebook determination apparatus according to an embodiment of the present application;

fig. 9 is a schematic structural diagram of a communication device according to an embodiment of the present application;

fig. 10 is a schematic structural diagram of a terminal according to an embodiment of the present application;

fig. 11 is a schematic structural diagram of a network-side device according to an embodiment of the present application.

Detailed Description

The technical solutions in the embodiments of the present application will be described below clearly with reference to the drawings in the embodiments of the present application, and it is obvious that the described embodiments are some, but not all, embodiments of the present application. All other embodiments obtained by a person of ordinary skill in the art based on the embodiments in the present application are within the scope of protection of the present application.

The terms first, second and the like in the description and in the claims of the present application are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It is to be understood that the terms so used are interchangeable under appropriate circumstances such that the embodiments of the application are capable of operation in other sequences than those illustrated or otherwise described herein, and that the terms "first" and "second" used herein generally refer to a class and do not limit the number of objects, for example, a first object can be one or more. In addition, "and/or" in the specification and the claims means at least one of connected objects, and a character "/" generally means that a preceding and succeeding related objects are in an "or" relationship.

It is noted that the techniques described in the embodiments of the present application are not limited to Long Term Evolution (LTE)/LTE-Advanced (LTE-a) systems, but may also be used in 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), or the likeOFDMA, single-carrier Frequency-Division Multiple Access (SC-FDMA), and other systems. The terms "system" and "network" in the embodiments of the present application are often used interchangeably, and the described techniques can be used for both the above-mentioned systems and radio technologies, as well as for other systems and radio technologies. The following description describes a New Radio (NR) system for purposes of example, and NR terminology is used in much of the description below, but the techniques may also be applied to applications other than NR system applications, such as generation 6 (6) ^th Generation, 6G) communication system.

Fig. 1 shows a block diagram of a wireless communication system to which embodiments of the present application are applicable. The wireless communication system includes a terminal 11 and a network-side device 12. Wherein, the terminal 11 may also be referred to as a terminal Device or a User Equipment (UE), the terminal 11 may be a Mobile phone, a Tablet Personal Computer (Tablet Personal Computer), a Laptop Computer (Laptop Computer) or a notebook Computer, a Personal Digital Assistant (PDA), a palm Computer, a netbook, a super Mobile Personal Computer (UMPC), a Mobile Internet Device (MID), an Augmented Reality (AR)/Virtual Reality (VR) Device, a robot, a Wearable Device (Wearable Device), a vehicle mounted Device (VUE), a pedestrian terminal (PUE), a smart home (a Device with wireless communication function, such as a refrigerator, a television, a washing machine, or furniture, etc.), and the Wearable Device includes: smart watch, smart bracelet, smart earphone, smart glasses, smart jewelry (smart bracelet, smart ring, smart necklace, smart anklet, etc.), smart wristband, smart garment, game console, etc. It should be noted that the embodiment of the present application does not limit the specific type of the terminal 11. The network-side device 12 may be a Base Station or a core network, where the Base Station may be referred to as 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 node B, an evolved node B (eNB), a home node B, a WLAN access Point, a WiFi node, a Transmit Receiving Point (TRP), or some other suitable terminology in the field, as long as the same technical effect is achieved, the Base Station is not limited to a specific technical vocabulary, and it should be noted that, in the embodiment of the present application, only the Base Station in the NR system is taken as an example, but a specific type of the Base Station is not limited.

The codebook determining method, apparatus, terminal and network side device provided in the embodiments of the present application are described in detail below with reference to the drawings and some embodiments and application scenarios thereof.

Referring to fig. 2, fig. 2 is a flowchart of a codebook determination method provided in an embodiment of the present application, where the method is executed by a terminal, and as shown in fig. 2, the method includes the following steps:

step 21: and the terminal generates a first record set in a traversing manner based on the time domain feedback offset set and the time domain resource allocation table.

In this embodiment, each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table.

It should be noted that an example form of the time domain feedback offset Set is K1 Set, and an example form of the time domain feedback offset is K1, which is used to indicate the offset of the time domain position of HARQ-ACK feedback with respect to the time domain position of PDSCH transmission. The unit of offset is a time unit, which may be a slot or a sub-slot. The time domain feedback offset mentioned later can be described by taking K1 as an example, but other expressions of the time domain feedback offset are not limited thereby.

For example, the first record may be represented as a (K1 Index, r) record, or equivalently a (K1, row) record. K1 Index can be understood as the Index of K1 Set. K1 may be understood as a certain K1 in the K1 Set, and it is presently understood that no repeated K1 occurs in the K1 Set. r can be understood as the index of the TDRA Table row, i.e. a certain row in the TDRA Table.

Optionally, the time domain feedback offset set and the time domain resource allocation Table TDRA Table may be configured by a network side device, or may be specified by a protocol. For example, downlink Control Information (DCI) format 1.0, that is, K1 Set corresponding to DCI format 1_0, is directly defined by the protocol.

The above traversal may be understood as determining corresponding (K1, row) records based on each K1 in the K1 Set and each row in the TDRA Table, and forming these (K1, row) records into a (K1, row) record Set. Each (K1, row) record corresponds to a single scheduling row. The scheduling row may be understood as a TDRA Table row, where a specific position is given in the time domain based on a certain K1, so as to determine the start-stop time positions of the SLIVs in the TDRA Table row, and a union of the time periods spanned by the start-stop time positions of the SLIVs in the row is used as a time period or an interval spanned by the row in the time domain, which may be used to determine whether any time domain overlap exists between rows, and/or whether any SLIV included in/corresponding to the row conflicts with the Semi-static last symbol Semi-static uplink timeslot Semi-static UL symbol.

Optionally, for a certain row in the TDRA Table, when the different (K1, row) records are combined with different K1 in the K1 Set and correspond to different (K1, row) records, the time domain positions of the scheduling rows corresponding to the respective (K1, row) records are different, and for a certain SLIV in the TDRA Table row, it will also be located in different DL slots based on different K1.

Optionally, for each (K1, row) record in the (K1, row) record set, the SLIV list corresponding to/contained in its corresponding scheduling row may be revised/updated based on a case of conflict with Semi-static UL symbol. For example, for each SLIV in the SLIV list corresponding to/contained in a (K1, row) record corresponding to the scheduling row, when the SLIV collides with Semi-static UL symbol, the SLIV may be deleted from the SLIV list. When the SLIV list corresponding to/included in the scheduling row corresponding to a certain (K1, row) record is empty, the (K1, row) record may be directly deleted from the (K1, row) record set.

Step 22: the terminal determines a transmission opportunity to which each first record in the first set of records maps.

In some embodiments, the transmission opportunity occupancy may be selected as a Physical Downlink Shared Channel (PDSCH) receiver opportunity.

Step 23: the terminal determines the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunity.

Note that, the candidate PDSCH reception opportunity (candidate PDSCH reception occupancy) can be divided into two cases:

1) Each candidate PDSCH receiver opportunity corresponds to a single time domain resource allocation record;

2) Each candidate PDSCH receiver opportunity corresponds to a single downlink time Slot, DL Slot, where at most only a single PDSCH transmission is allowed to be scheduled or configured within each DL Slot.

As a typical expression, the time domain resource allocation record in this embodiment may refer to a start symbol and a symbol length indication SLIV. In order to better understand the technical solution of the embodiment of the present application, the time domain resource allocation record in the following embodiment will be specifically described by taking SLIV as an example. Of course, the time domain resource allocation record may also be in other forms, which is not illustrated in the present application.

Step 24: and the terminal determines the HARQ-ACK semi-static codebook according to the number of the candidate PDSCH receiving opportunities.

It should be noted that, the HARQ-ACK semi-static codebook is constructed/determined from the perspective of possible transmission opportunities, and corresponding HARQ-ACK bits are reserved for each possible transmission opportunity based on a configured time domain feedback offset Set, for example, K1 Set, and the HARQ-ACK feedback time, that is, a time unit in which the semi-static codebook is transmitted. Each possible transmission opportunity is determined based on a higher layer configured time domain resource allocation Table, such as a TDRA Table. If the terminal does not actually receive/detect the corresponding downlink information such as the PDSCH for a certain transmission opportunity, the corresponding HARQ-ACK bit is set to NACK, otherwise the corresponding HARQ-ACK bit is set based on the decoding result.

In the codebook determining method of the embodiment of the application, a terminal may generate a first record set in a traversing manner based on a time domain feedback offset set and a time domain resource allocation table, each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, a transmission opportunity mapped by each first record is determined, the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunity is determined, and a HARQ-ACK semi-static codebook is determined according to the determined number of candidate PDSCH receiving opportunities, so that the transmission opportunity can be determined uniformly based on the time domain feedback offset and the record of the row in the time domain resource allocation table, and thus when a codebook supporting Multi-PDSCH scheduling is constructed, a DL Slot boundary is not concerned or broken, the situations that correlation exists among SLIVs corresponding to/contained in a certain row in the time domain resource allocation table are considered, and the transmission opportunity of redundancy is reduced/avoided, the HARQ-ACK bits in the HARQ-ACK semi-static codebook are reduced/avoided, and the HARQ-feedback efficiency is improved.

Alternatively, a typical occupancy set determination method may be selected as: and for an SLIV set corresponding to a certain DL Slot, pruning and planning based on the conflict situation with Semi-static UL symbols, forming a residual SLIV set when residual SLIVs exist, grouping the residual SLIV set based on a time domain overlapping rule if the UE supports that more than one PDSCH is received in a single DL Slot, and corresponding each SLIV Group with a single Occasion so as to determine an Occasion subset corresponding to the DL Slot. Otherwise, if the UE does not support receiving more than one PDSCH in a single DL Slot, the remaining SLIV set directly corresponds to a single Occasion, so as to determine that the Occasion subset corresponding to the DL Slot contains only a single Occasion. And then, taking a union set of the Occasion subsets corresponding to the DL slots, for example, performing head-to-tail cascade on the Occasion subsets corresponding to the DL slots based on the sequence of the DL slots to obtain an Occasion set for determining the HARQ-ACK bit sequence corresponding to the Type-1 codebook.

In some embodiments, the terminal may traverse the transmission opportunities determined for each first record map according to a predefined direction when determining the transmission opportunities for each first record map. The predefined direction here may be a direction in which the time advances, or a direction in which the time unit number/index is incremented.

Optionally, after determining the HARQ-ACK semi-static codebook, the terminal may send the HARQ-ACK semi-static codebook to the network side device. The network side device needs to determine, based on the same rule, a transmission opportunity set corresponding to each downlink serving cell in the HARQ-ACK semi-static codebook, a HARQ-ACK bit number and a bit position corresponding to each transmission opportunity, and a length of a HARQ-ACK bit sequence corresponding to the entire semi-static codebook.

Optionally, when determining the transmission opportunity of each first record mapping, the terminal may cyclically perform the following processes until the updated first record set is empty, and determine the transmission opportunity of each first record mapping according to the mapped reference transmission opportunity:

s1: determining a time domain reference value according to each first record in the first record set;

s2: mapping each first record meeting a first condition in the first record set to a reference transmission opportunity corresponding to the time domain reference value, sequentially traversing the first records which are not mapped to the reference transmission opportunity in the first record set, and mapping each first record meeting a second condition to the reference transmission opportunity;

s3: and deleting each first record mapped to the reference transmission opportunity from the first record set to obtain an updated first record set.

It will be appreciated that S1 is only performed when the first set of records is not empty, i.e. the time domain reference values are determined from the SLIVs in the first set of records. This first set of records is always in the process of updating/pruning during the execution of S1 to S3 for the first record cycle.

In some embodiments, in executing S2 and S3, the terminal may first map each (K1, line) record in the (K1, line) record set that satisfies the first condition to the reference occupancy; then, mapping each unmapped (K1, row) record in the (K1, row) record set satisfying the second condition, i.e. excluding the aforementioned (K1, row) records mapped to the reference occupancy, to the reference occupancy; thereafter, each (K1, line) record mapped to the reference occupancy is deleted from the (K1, line) record set to update the (K1, line) record set.

In other embodiments, when performing S2 and S3, the terminal may first map each (K1, row) record in the (K1, row) record set that satisfies the first condition to the reference occupancy, and delete the mapped (K1, row) record from the (K1, row) record set; then, each (K1, line) record in the updated (K1, line) record set that satisfies the second condition is mapped to the reference occupancy and deleted from the (K1, line) record set. That is, the (K1, line) record mapped to the reference occupancy is immediately deleted from the (K1, line) record set for which it has been judged.

Optionally, the time domain reference value may include any one of the following:

the earliest value of the ending time of the scheduling row corresponding to each first record in the first record set; that is, the end time of the scheduling row corresponding to the first record with the earliest end time of the corresponding scheduling row in the first record set;

a minimum value (small last OFDM symbol index) of an ending symbol index of a scheduling row corresponding to each first record in the first record set; that is, the end symbol index of the scheduling row corresponding to the first record having the smallest end symbol index of the corresponding scheduling row in the first record set.

That is, the time domain reference value in the present embodiment may be selected as a reference time instant or a reference symbol index. For determining the time domain reference value, when the end time is used, the absolute end time of the scheduling row corresponding to each first record in the first record set may be based; alternatively, when an end symbol index is used, the position or index may be based on the last symbol of the scheduling row corresponding to each first record in the first set of records. The purpose of determining the time domain reference value in this way is to determine the maximum number of collisions that are possible to transmit in parallel within the HARQ-ACK feedback window, or in other words, the maximum number of collisions that do not overlap each other in time domain.

Optionally, the first condition includes: the end time or end symbol index of the corresponding scheduling row is equal to the time domain reference value. For the first record satisfying the first condition, it can be understood that: the ending time or ending symbol index of the scheduling row corresponding to the first record is equal to the time domain reference value.

The second condition includes: there is a time-domain overlap of the corresponding scheduling row with the scheduling row corresponding to any first record that has been mapped to a reference transmission opportunity. For the first record satisfying the second condition, it can be understood that: there is any temporal overlap of the scheduling rows corresponding to the first record with the scheduling rows corresponding to any first record that has been mapped to a reference transmission opportunity. In this way, when determining the occupancy, the relevance between SLIVs in the TDRA Table row and the time-domain overlapping condition between different scheduling rows can be considered, thereby reducing or avoiding the redundant occupancy.

It is noted that after each first record of the first set of records satisfying the first condition has been mapped to the reference Ocvasion, all first records mapped to the reference Ocvasion may constitute a reference first subset of records. And then, further traversing each unmapped first record in the first record set to judge whether the unmapped first record meets a second condition, mapping the unmapped first record to a reference Ocvasion when the unmapped first record meets the second condition, and simultaneously adding the unmapped first record to the reference first record subset, wherein the reference first record subset needs to be updated in real time when other remaining first records are traversed.

The second condition mentioned above can be understood as: for a certain reference first record subset, only when any time domain overlap exists between scheduling lines corresponding to any two first records in the subset, each first record in the subset (or the subset) can be mapped to the same Occasion; otherwise, when there is no arbitrary time domain overlap between scheduling rows corresponding to two first records in the subset, the two first records may actually be scheduled at the same time, which may cause a problem that more than one first record that may actually be scheduled in parallel is mapped to the same Occasion.

Optionally, the decision manner that time domain overlapping exists between two scheduling rows, that is, the decision manner that any time domain overlapping exists between any two scheduling rows, may include any of the following:

1) When two scheduling rows have time domain overlapping at any position, judging that the two scheduling rows have time domain overlapping; that is, as long as there is time-domain overlap in any position of a given two scheduling rows, that is, there is at least partial overlap in the time period or interval spanned by the two scheduling rows, it can be determined that there is time-domain overlap between the two scheduling rows;

2) When two scheduling rows have time domain resource allocation records such as SLIV in at least one same downlink time slot, judging that time domain overlapping exists between the two scheduling rows; that is, as long as a given two scheduling rows both have a SLIV within at least one same DL Slot, it can be decided that there is a time-domain overlap between the two scheduling rows, regardless of whether there is a time-domain overlap between SLIVs from two scheduling rows within this DL Slot.

It should be noted that, for the decision manner in 1) above, the number of scheduled or configured PDSCH transmissions in a single DL Slot may be allowed to exceed 1. When scheduling or configuration of more than 1 PDSCH transmission is not allowed in each DL Slot, i.e. scheduling or configuration of only a single PDSCH transmission is allowed at most in each DL Slot, the decision method in 2) above needs to be adopted, and the reason for adopting decision method 2) can be understood as follows: if scheduling row 1 is actually scheduled or configured, because one PDSCH transmission is already scheduled or configured within the overlapping DL slots, another scheduling row 2 that satisfies the condition can no longer be scheduled or configured.

Optionally, when determining whether there is time domain overlap between two scheduling rows, for determining whether a SLIV conflicting with the semi-static time division duplex configuration information includes the time domain overlap, any one of the following manners may be adopted:

mode 1: the SLIV conflicted with the semi-static time division duplex configuration information is included in the judgment whether time domain overlapping exists between the two scheduling rows;

mode 2: the SLIV that conflicts with the semi-static time division duplex configuration information does not incorporate a decision whether there is time domain overlap between two scheduling rows.

It should be noted that an exemplary form of the Semi-static tdd configuration information is Semi-static uplink symbol Semi-static UL symbol. Herein, the conflict between the SLIV and the Semi-static tdd configuration information is described by taking the conflict between the SLIV and the Semi-static UL symbol as an example, but the scheme in the present application is not limited to be adopted when there is a conflict between the SLIV and other Semi-static tdd configuration information (and the physical channel corresponding to the SLIV cannot be actually transmitted).

In some embodiments, a SLIV colliding with Semi-static UL symbol may be understood as at least one symbol corresponding to the SLIV being Semi-statically configured as UL symbol.

With respect to the above mode 1, it can be understood that: the effect of Semi-static UL symbol is not considered when deciding whether there is a time-domain overlap between two scheduling rows. At this time, the determined overlapping situation between the scheduling rows may be more than that in the case of the method 2, so that more first records may share the occupancy, that is, map to the same occupancy, and share the HARQ-ACK bit corresponding to the occupancy in the HARQ-ACK codebook, but there may be a problem of HARQ-ACK bit collision, that is, when two or more first records mapped to the same occupancy are actually scheduled, there may be a problem in setting the HARQ-ACK bit corresponding to the occupancy. In this case, it may be considered that the corresponding HARQ-ACK bit is set based on the decoding result corresponding to the PDSCH transmission corresponding to a single first record therein, or the decoding results corresponding to all detected PDSCH transmissions corresponding to occupancy are bundled and the HARQ-ACK bit corresponding to this occupancy is set.

For the above mode 2, since the SLIV colliding with the Semi-static UL symbol is not actually scheduled, and the corresponding HARQ-ACK does not need to be fed back, the time domain overlapping judgment between the scheduling rows is not affected, and the time domain overlapping judgment can also be understood as a scheduling collision judgment. At this time, only SLIVs that do not collide with Semi-static UL symbols participate in the decision of time-domain overlap between scheduling lines.

It can be understood that the overlapping

decision manners

1 and 2 described above are applicable both when the number of scheduled or configured PDSCH transmissions within a single DL Slot is allowed to exceed 1, and when no scheduling or configuration of more than 1 PDSCH transmission is allowed within each DL Slot.

Optionally, the above sequence of traversal for determining whether each of the first records that are not yet mapped satisfies the second condition may affect the determination of the mapping relationship from the first record to the occupancy, thereby affecting the size of the HARQ-ACK codebook. When sequentially traversing first records in the first record set that are not mapped to the reference transmission opportunity, the traversing manner includes at least one of:

1) And traversing based on the time domain feedback offset index and/or the row index corresponding to the first record.

For example, this 1) may be expressed as traversing based on the Index of the (K1, row) record corresponding K1 Index, such as K1 Set, and/or r, i.e., the Index of the TDRA Table row. For the traversal of the K1 Index and/or r, the K1 Index may be traversed from small to large or from large to small, or the r may be traversed from small to large or from large to small, or the K1 Index may be traversed first and then the r may be traversed as needed, or the r may be traversed first and then the K1 Index may be traversed as needed.

2) And traversing based on the starting time and/or the starting symbol index of the scheduling row corresponding to the first record.

In some embodiments, when traversing based on the start time/start symbol index of the corresponding scheduling row of the (K1, row) record, it may be considered that the earlier the (K1, row) record starts, the more prioritized the occupancy is mapped, and therefore, the ascending traversal may be performed based on the start time/start symbol index. Alternatively, a descending traversal may be employed.

In some embodiments, when the start time/start symbol indexes of the scheduling rows corresponding to more than one (K1, row) record are the same or equal, the traversal order between the (K1, row) records may be determined by further adopting the traversal mode 1).

3) And traversing based on the ending time and/or the ending symbol index of the scheduling row corresponding to the first record.

In some embodiments, when performing traversal based on the end time/end symbol index of the corresponding scheduling row of the (K1, row) record, it may be considered that the earlier the (K1, row) record ends, the priority of mapping the Occasion is increased to avoid interfering with the mapping of the later (K1, row) record, or the (K1, row) records with closer/concentrated time domain span are mapped to the same Occasion as much as possible to reduce the number of occasions of the final mapping, and therefore, the traversal may be performed in an ascending order based on the end time/end symbol index. Alternatively, a descending traversal may be employed.

In some embodiments, when the end time/end symbol indexes of the scheduling rows corresponding to more than one (K1, row) record are the same or equal, the traversal order between the (K1, row) records may be determined by further adopting the traversal mode 1).

4) And traversing based on the corresponding SLIV number of the scheduling row corresponding to the first record before or after the time domain reference value.

Optionally, in 4), ascending traversal or descending traversal may be adopted, and traversal mode 1) may be locally introduced/combined when needed.

5) The traversal is performed based on the number of time cells that the scheduling row corresponding to the first record spans before or after the temporal reference value.

Alternatively, the time unit may be a time slot or a sub-time slot. For the number of time units spanned, when the time unit spanned/occupied by the SLIV corresponding to/included in the scheduled row is not consecutive, the time unit is located between two adjacent SLIVs corresponding to/included in the scheduled row, and the unoccupied time unit may be included in the time unit count or not. In this 5), ascending or descending traversal can be adopted, and the traversal mode 1) can be locally introduced/combined when needed.

6) The traversal is performed based on a ratio of the corresponding number of SLIVs of the scheduling row corresponding to the first record before and after the time-domain reference value.

In some embodiments, the above 6) may adopt ascending order traversal or descending order traversal. Furthermore, the traversal pattern 1) described above can be locally introduced/incorporated when needed.

7) The traversal is based on a ratio of the number of time cells spanned by the scheduling row corresponding to the first record before and after the temporal reference value.

Alternatively, the above proportions may be understood as: the ratio of the value before the reference time to the value after the reference time, or the ratio of the value after the reference time to the value before the reference time. The value here is the number of SLIV, or the number of time units spanned. See traversal pattern 5 for the correlation operation for the number of time cells). In calculating the ratio, if the denominator is 0, the ratio can be directly set to a predefined value.

In some embodiments, the above 7) may adopt an ascending traversal or a descending traversal. Furthermore, traversal pattern 1 described above can be introduced/incorporated locally as needed).

In the embodiment of the application, after the occupancy mapped by each first record is determined, the occupancy set corresponding to the first record set and the mapping relationship between each first record and each occupancy can be determined, so that the number of candidate PDSCH receiving opportunities corresponding to each transmission opportunity is determined.

Optionally, the number of candidate PDSCH receiving opportunities corresponding to each occupancy may be: and the maximum value of SLIV contained in the scheduling line corresponding to each first record of each Occasion map. In this case, the number of scheduled or configured PDSCH transmissions within a single DL Slot may be allowed to exceed 1.

In some embodiments, for a certain occupancy, when a certain (K1, row) record mapped by the certain occupancy is actually scheduled, only a single (K1, row) record at most can be actually scheduled based on the aforementioned limitation of time-domain overlap, and each SLIV (assumed to be N) corresponding to/contained in the corresponding scheduling row may be sequentially mapped to the most starting/last/specified N SLIVs in the slim (M > = N) corresponding to the occupancy in a preset order. The preset sequence here can typically be from front to back/from left to right, and alternatively, can also be from back to front/from right to left.

Optionally, when more than 1 PDSCH transmission is not allowed to be scheduled or configured in each DL Slot, that is, only a single PDSCH transmission is allowed to be scheduled or configured at most in each DL Slot, the number of candidate PDSCH receiving opportunities corresponding to each occupancy may be: the maximum value of the number of first downlink time slots contained in the scheduling row corresponding to each first record mapped by each Ocvasion is any downlink time slot meeting a third condition; the third condition is: at least one SLIV exists in the corresponding scheduling row in the downlink time slot. The reason for setting the number of candidate PDSCH receiving opportunities corresponding to each Occasion in this way may be understood as follows: for a certain scheduling row, in a certain DL Slot corresponding to/containing the SLIV, only a single PDSCH transmission can be scheduled or configured at most, and the DL Slot is counted as a single candidate PDSCH receiving opportunity. Therefore, for this scheduling row, the number of candidate PDSCH receiver opportunities it corresponds to is the number of DL slots corresponding/containing SLIVs for this scheduling row. In order to ensure that enough candidate PDSCH receiving opportunities are reserved for any scheduling line corresponding to the scheduling line by the occupancy corresponding to the scheduling line, the maximum value of the number of DL slots needs to be taken in all scheduling lines corresponding to the occupancy.

For a better understanding of the embodiments of the present application, the present application will be described in detail with reference to the following examples.

Example 1

In example 1, as shown in fig. 3, the TDRA Table contains 2 rows and the K1 Set contains 3K 1, which are K1,0, K1,1 and K1,2, respectively. Only a single PDSCH can be scheduled at most within each DL Slot and allocated continuously in the time domain.

In fig. 3, when the conventional/existing method is adopted, since 10 DL slots are involved in the HARQ-ACK feedback window, a single schedulable PDSCH in each DL Slot can be mapped to a single occupancy, and thus, the HARQ-ACK codebook requires 10 HARQ-ACK bits corresponding to the PDSCH in total.

In fig. 3, when the method in this scheme is adopted, a record set including 6 (K1, row) records may be generated in a traversal manner, and when determining the Occasion set, the above S1 to S3 may be executed 3 times: mapping 2 (K1, row) records corresponding to K1,2 meeting a first condition to Occasion1 when S1 to S3 are executed for the 1 st time; when executing S1 to S3 for the 2 nd time, map 2 (K1, row) records corresponding to K1,1 that satisfy the first condition to Occasion2, and then map 1 (K1, row) records corresponding to K1,0 that satisfy the second condition to Occasion2; the 3 rd time S1 to S3 are executed, 1 (K1, row) record corresponding to K1,0 satisfying the first condition is mapped to the Occasion3. Since the occupancy 1 corresponds to 4 candidate PDSCH receiving opportunities, the occupancy 2 corresponds to 4 candidate PDSCH receiving opportunities, and the occupancy 3 corresponds to 1 candidate PDSCH receiving opportunity, the occupancy 1, the occupancy 2, and the occupancy 3 correspond to 9 candidate PDSCH receiving opportunities in total, and the HARQ-ACK feedback window only needs to map 9 candidate PDSCH receiving opportunities, so that the HARQ-ACK codebook needs 9 HARQ-ACK bits corresponding to the candidate PDSCH receiving opportunities in total, and compared with the prior art, the HARQ-ACK bit corresponding to a single candidate PDSCH receiving opportunity can be saved (the single candidate PDSCH receiving opportunity here can correspond to a single transmission opportunity in the prior art).

Example 2

In example 2, as shown in fig. 4, the TDRA Table contains 2 rows and the K1 Set contains

3K

1,0, K1,1 and K1,2 respectively. Only a single PDSCH can be scheduled at most within each DL Slot, and the time domain is not allocated continuously.

In fig. 4, when the conventional/existing method is adopted, because 6 DL slots are involved in the HARQ-ACK feedback window, a single schedulable PDSCH in each DL Slot can be mapped to a single occupancy, and thus, the HARQ-ACK codebook requires a total of HARQ-ACK bits corresponding to 6 PDSCHs.

In fig. 4, when the method in this scheme is adopted, a record set including 6 (K1, row) records may be generated in a traversal manner, and when determining the Occasion set, the above S1 to S3 may be executed 3 times: mapping 2 (K1, row) records corresponding to K1,2 meeting a first condition to Occasion1 when S1 to S3 are executed for the 1 st time; mapping 2 (K1, row) records corresponding to K1,1 meeting the first condition to occupancy 2 when S1 to S3 are executed for the 2 nd time; the 3 rd time S1 to S3 are executed, 2 (K1, row) records corresponding to K1,0 satisfying the first condition are mapped to the Occasion3. Since the Ocvasion 1 corresponds to 2 candidate PDSCH receiving opportunities, the Ocvasion 2 corresponds to 2 candidate PDSCH receiving opportunities, and the Ocvasion 3 corresponds to 2 candidate PDSCH receiving opportunities, the Ocvasion 1, the Ocvasion 2 and the Ocvasion 3 correspond to 6 candidate PDSCH receiving opportunities in total, a HARQ-ACK feedback window needs to map 6 candidate PDSCH receiving opportunities, a HARQ-ACK codebook needs 6 HARQ-ACK bits corresponding to the candidate PDSCH receiving opportunities in total, and compared with the prior art, the reduction of the HARQ-ACK bits is not brought. It can be understood that whether there are redundant HARQ-ACK bits in the constructed HARQ-ACK codebook related to K1 Set and/or TDRA Table when the conventional/existing method is employed.

Example 3

In example 3, as shown in fig. 5, the TDRA Table contains 5 rows and the K1 Set contains 3K 1, which are K1,0, K1,1 and K1,2, respectively. 0/1/multiple PDSCHs can be scheduled in each DL Slot, and the time domain is not allocated continuously.

In fig. 5, when the conventional/existing method is adopted, since 19 SLIVs are involved in the HARQ-ACK feedback window, the HARQ-ACK codebook requires a total of 19 HARQ-ACK bits corresponding to the SLIVs.

In fig. 5, when the method in this scheme is adopted, a record set including 15 (K1, lines) records may be generated in a traversal manner, and when determining the Occasion set, the above S1 to S3 may be executed 6 times: when executing S1 to S3 for the 1 st time, map 1 (K1, line) record (corresponding to the line which is numbered 1 and not explicitly labeled with the background pattern) corresponding to K1,2 satisfying the first condition to the Occasion1, and then map 1 (K1, line) record (corresponding to the line which is numbered 1 and explicitly labeled with the background pattern) corresponding to K1,2 satisfying the second condition to the Occasion1; when S1 to S3 are executed for the 2 nd time, 3 (K1, row) records (corresponding to the row which is numbered 2 and not explicitly labeled with a background pattern) corresponding to K1,2 satisfying the first condition are mapped to the Occasion2; when executing S1 to S3 for the 3 rd time, first mapping 1 (K1, line) record (corresponding to the line which is numbered 3 and not explicitly labeled with the background pattern) corresponding to K1,1 satisfying the first condition to Occasion3, and then mapping 1 (K1, line) record (corresponding to the line which is numbered 3 and explicitly labeled with the background pattern) corresponding to K1,1 and 1 (K1, line) record (corresponding to the line which is numbered 3 and explicitly labeled with the background pattern) corresponding to K1,0 satisfying the second condition to Occasion3; when S1 to S3 are executed for the 4 th time, 3 (K1, row) records (corresponding to rows which are numbered 4 and not explicitly labeled with a background pattern) corresponding to K1,1 satisfying the first condition are mapped to occupancy 4; when executing S1 to S3 for the 5 th time, map 1 (K1, line) record (corresponding to the line which is numbered 5 and not explicitly labeled with the background pattern) corresponding to K1,0 satisfying the first condition to the Occasion5, and then map 1 (K1, line) record (corresponding to the line which is numbered 5 and explicitly labeled with the background pattern) corresponding to K1,0 satisfying the second condition to the Occasion5; the 6 th execution of S1 to S3 maps 2 (K1, row) records corresponding to K1,0 (corresponding to the row numbered 6 and not explicitly labeled with a background pattern) satisfying the first condition to occupancy 6.

Since Occasion1 corresponds to 5 SLIVs, occasion2 corresponds to 2 SLIVs, occasion3 corresponds to 5 SLIVs, occasion4 corresponds to 2 SLIVs, occasion5 corresponds to 2 SLIVs, and Occasion6 corresponds to 2 SLIVs, that is, occasion1 to Occasion6 correspond to 18 SLIVs in total, 18 SLIVs are involved in the HARQ-ACK feedback window, which can bring about a reduction in HARQ-ACK bits corresponding to 1 SLIV compared to the prior art.

Referring to fig. 6, fig. 6 is a flowchart of a codebook determining method provided in an embodiment of the present application, where the method is executed by a network side device, and as shown in fig. 6, the method includes the following steps:

step 61: and the network side equipment receives the HARQ-ACK semi-static codebook from the terminal.

The HARQ-ACK semi-static codebook is determined according to the number of candidate PDSCH (physical downlink shared channel) receiving opportunities after a terminal traverses and generates a first record set based on a time domain feedback offset set and a time domain resource allocation table, each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, the transmission opportunity mapped by each first record is determined, and the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunity is determined.

Therefore, redundant transmission opportunities can be reduced/avoided when the transmission opportunities are determined, so that redundant HARQ-ACK bits in the HARQ-ACK semi-static codebook are reduced/avoided, the HARQ-ACK feedback efficiency is improved, and the data transmission performance/system resource utilization efficiency is further improved.

It can be understood that, for the HARQ-ACK semi-static codebook, the network side device needs to determine, based on the same rule as the terminal, a transmission opportunity set corresponding to each downlink serving cell in the HARQ-ACK semi-static codebook, a HARQ-ACK bit number and a bit position corresponding to each transmission opportunity, and a length of a HARQ-ACK bit sequence corresponding to the entire semi-static codebook.

Optionally, in order to parse the received HARQ-ACK semi-static codebook, the network side device may generate the first record set in a traversal manner based on the time domain feedback offset set and the time domain resource allocation table, determine a transmission opportunity mapped by each first record in the first record set, and determine the number of candidate PDSCH reception opportunities corresponding to the transmission opportunity. And then, according to the determined number of the candidate PDSCH receiving opportunities, determining the length of the HARQ-ACK bit sequence corresponding to the HARQ-ACK semi-static codebook.

Optionally, when determining the transmission opportunity of each first record map, the network side device may cyclically perform the following processes until the updated first record set is empty, and determine the transmission opportunity of each first record map according to the mapped reference transmission opportunity:

Wherein the first condition comprises: the end time or end symbol index of the corresponding scheduling row is equal to the time domain reference value; the second condition includes: there is a time-domain overlap of the corresponding scheduling row with the scheduling row corresponding to any first record that has been mapped to a reference transmission opportunity.

It should be noted that, a manner of determining the transmission opportunity of each first record map by the network side device is the same as that of determining the transmission opportunity of each first record map by the terminal in the embodiment shown in fig. 2, and for avoiding repeated description, details are not repeated here.

It should be noted that, in the codebook determining method provided in the embodiment of the present application, the execution subject may be a codebook determining device, or a control module in the codebook determining device for executing the codebook determining method. In the embodiment of the present application, a codebook determining apparatus for performing a codebook determining method is taken as an example, and the codebook determining apparatus provided in the embodiment of the present application is described.

Referring to fig. 7, fig. 7 is a schematic structural diagram of a codebook determining apparatus provided in an embodiment of the present application, where the codebook determining apparatus is applied to a terminal, and as shown in fig. 7, a codebook determining apparatus 70 includes:

a generating module 71, configured to generate a first record set in a traversal manner based on a time domain feedback offset set and a time domain resource allocation table, where each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table;

a first determining module 72, configured to determine a transmission opportunity of each first record map;

a second determining module 73, configured to determine the number of candidate PDSCH receiver opportunities corresponding to the transmission opportunity;

a third determining module 74, configured to determine a hybrid automatic repeat request-acknowledgement HARQ-ACK semi-static codebook according to the number of candidate PDSCH receiving opportunities.

Optionally, the first determining module 72 is specifically configured to: circularly executing the following processes until the updated first record set is empty, and determining the transmission opportunity mapped by each first record according to the mapped reference transmission opportunity:

determining a time domain reference value according to each first record in the first record set;

mapping each first record meeting a first condition in the first record set to a reference transmission opportunity corresponding to the time domain reference value, sequentially traversing the first records which are not mapped to the reference transmission opportunity in the first record set, and mapping each first record meeting a second condition to the reference transmission opportunity;

deleting each first record mapped to the reference transmission opportunity from the first record set to obtain an updated first record set;

Optionally, the time domain reference value comprises any one of:

the earliest value of the ending time of the scheduling row corresponding to each first record in the first record set;

and the minimum value of the ending symbol index of the scheduling row corresponding to each first record in the first record set.

Optionally, the manner of determining whether there is a time-domain overlap between two scheduling rows includes any one of the following:

the time domain resource allocation record which conflicts with the semi-static time division duplex configuration information is contained in the judgment whether time domain overlapping exists between the two scheduling rows;

and the time domain resource allocation record which conflicts with the semi-static time division duplex configuration information is not included in the judgment whether time domain overlapping exists between the two scheduling rows.

Optionally, the manner of determining that there is a time-domain overlap between two scheduling rows includes any one of:

when two scheduling rows have time domain overlapping at any position, judging that the two scheduling rows have time domain overlapping;

and when the two scheduling rows have time domain resource allocation records in at least one same downlink time slot, judging that time domain overlapping exists between the two scheduling rows.

Optionally, when sequentially traversing first records in the first record set that are not mapped to the reference transmission opportunity, the traversal pattern includes at least one of:

traversing based on a time domain feedback offset index and/or a row index corresponding to the first record;

traversing based on the starting time and/or the starting symbol index of the scheduling row corresponding to the first record;

traversing based on the end time and/or the end symbol index of the scheduling row corresponding to the first record;

traversing based on the number of corresponding time domain resource allocation records of the scheduling row corresponding to the first record before or after the time domain reference value;

traversing based on the number of time units spanned by the scheduling row corresponding to the first record before or after the time domain reference value;

traversing based on the proportion of the number of the corresponding time domain resource allocation records of the scheduling row corresponding to the first record before and after the time domain reference value;

the traversal is based on a ratio of the number of time cells spanned by the scheduling row corresponding to the first record before and after the temporal reference value.

Optionally, the number of candidate PDSCH receiver opportunities corresponding to the transmission opportunity is: the maximum value of the number of the time domain resource allocation records contained in the scheduling row corresponding to each first record mapped by the transmission opportunity;

or, the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunity is: the maximum value of the number of first downlink time slots included in the scheduling row corresponding to each first record mapped by the transmission opportunity is the maximum value of the number of first downlink time slots included in the scheduling row corresponding to each first record mapped by the transmission opportunity, the first downlink time slot is any downlink time slot which meets a third condition, and the third condition is that: and at least one time domain resource allocation record exists in the downlink time slot of the scheduling row.

Optionally, the first determining module 72 is specifically configured to: and determining the transmission opportunity of each first record mapping in a traversing mode according to the predefined direction.

Optionally, the codebook determining device 70 further includes:

and the sending module is used for sending the HARQ-ACK semi-static codebook to network side equipment.

The codebook determining apparatus 70 in the embodiment of the present application may be an apparatus, an apparatus or an electronic device having an operating system, or a component, an integrated circuit, or a chip in a terminal. The device or the electronic equipment can be a mobile terminal or a non-mobile terminal. For example, the mobile terminal may include, but is not limited to, the above-listed type of terminal 11, and the non-mobile terminal may be a server, a Network Attached Storage (NAS), a Personal Computer (PC), a Television (TV), a teller machine, a kiosk, or the like, and the embodiments of the present application are not limited in particular.

The codebook determining device 70 provided in the embodiment of the present application can implement each process implemented in the method embodiment of fig. 2, and achieve the same technical effect, and for avoiding repetition, details are not described here again.

Referring to fig. 8, fig. 8 is a schematic structural diagram of a codebook determining apparatus provided in an embodiment of the present application, where the apparatus is applied to a network device, and as shown in fig. 8, a codebook determining apparatus 80 includes:

a receiving module 81, configured to receive a HARQ-ACK semi-static codebook from a terminal; the HARQ-ACK semi-static codebook is determined according to the number of candidate PDSCH (physical Downlink shared channel) receiving opportunities after the terminal determines the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunities based on a time domain feedback offset set and a time domain resource allocation table and generates a first record set in a traversing manner by the terminal, wherein each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, the transmission opportunity mapped by each first record is determined, and the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunities is determined.

Optionally, the codebook determining apparatus 80 further includes:

a fourth determining module, configured to generate a first record set in a traversal manner based on the time domain feedback offset set and the time domain resource allocation table, and determine a transmission opportunity mapped by each first record in the first record set;

a fifth determining module, configured to determine a number of candidate PDSCH receiver opportunities corresponding to the transmission opportunity;

a sixth determining module, configured to determine, according to the number of candidate PDSCH receiving opportunities, a length of a HARQ-ACK bit sequence corresponding to the HARQ-ACK semi-static codebook.

Optionally, the fourth determining module is further configured to: circularly executing the following processes until the updated first record set is empty, and determining the transmission opportunity mapped by each first record according to the mapped reference transmission opportunity:

The codebook determining apparatus 80 provided in the embodiment of the present application can implement each process implemented in the method embodiment of fig. 6, and achieve the same technical effect, and for avoiding repetition, details are not repeated here.

Optionally, as shown in fig. 9, an embodiment of the present application further provides a communication device 90, which includes a processor 91, a memory 92, and a program or instruction stored in the memory 92 and executable on the processor 91, for example, when the communication device 90 is a terminal, the program or instruction is executed by the processor 91 for several times to implement the processes in the embodiment in fig. 2, and the same technical effect can be achieved. When the communication device 90 is a network-side device, the program or the instruction is executed by the processor 91 for several times to implement the processes in the embodiment in fig. 6, and the same technical effect can be achieved.

The embodiment of the present application further provides a terminal, which includes a processor and a communication interface, where the processor is configured to generate a first record set in a traversal manner based on a time domain feedback offset set and a time domain resource allocation table, and each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table; determining a transmission opportunity mapped by each first record; the terminal determines the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunity; and determining a HARQ-ACK semi-static codebook according to the number of the candidate PDSCH receiving opportunities. The terminal embodiment corresponds to the terminal-side method embodiment, and all implementation processes and implementation manners of the method embodiment can be applied to the terminal embodiment and can achieve the same technical effect.

Specifically, fig. 10 is a schematic diagram of a hardware structure of a terminal implementing the embodiment of the present application.

The terminal 1000 includes, but is not limited to: a radio frequency unit 1001, a network module 1002, an audio output unit 1003, an input unit 1004, a sensor 1005, a display unit 1006, a user input unit 1007, an interface unit 1008, a memory 1009, a processor 1010, and the like.

Those skilled in the art will appreciate that terminal 1000 can further include a power supply (e.g., a battery) for powering the various components, and the power supply can be logically coupled to processor 1010 via a power management system, such that functions of managing charging, discharging, and power consumption are performed via the power management system. The terminal structure shown in fig. 10 does not constitute a limitation of the terminal, and the terminal may include more or less components than those shown, or combine some components, or have a different arrangement of components, and thus will not be described again.

It should be understood that in the embodiment of the present application, the input Unit 1004 may include a Graphics Processing Unit (GPU) 10041 and a microphone 10042, and the Graphics Processing Unit 10041 processes image data of still pictures or videos obtained by an image capturing device (such as a camera) in a video capturing mode or an image capturing mode. The display unit 1006 may include a display panel 10061, and the display panel 10061 may be configured in the form of a liquid crystal display, an organic light emitting diode, or the like. The user input unit 1007 includes a touch panel 10071 and other input devices 10072. The touch panel 10071 is also referred to as a touch screen. The touch panel 10071 may include two parts, a touch detection device and a touch controller. Other input devices 10072 may include, but are not limited to, a physical keyboard, function keys (e.g., volume control keys, switch keys, etc.), a trackball, a mouse, and a joystick, which are not described in detail herein.

In this embodiment of the application, the radio frequency unit 1001 receives downlink data from a network side device and then processes the downlink data to the processor 1010; in addition, the uplink data is sent to the network side equipment. In general, radio frequency unit 1001 includes, but is not limited to, an antenna, at least one amplifier, a transceiver, a coupler, a low noise amplifier, a duplexer, and the like.

The memory 1009 may be used to store software programs or instructions and various data. The memory 1009 may mainly include a program or instruction storage area and a data storage area, wherein the program or instruction storage area may store an operating system, an application program or instruction (such as a sound playing function, an image playing function, and the like) required for at least one function, and the like. Further, the Memory 1009 may include a high-speed random access Memory, and may further include a nonvolatile Memory, which may be a Read-Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Programmable Read-Only Memory (erasab PROM, EPROM), an Electrically Erasable Programmable Read-Only Memory (EEPROM), or a flash Memory. Such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device.

Processor 1010 may include one or more processing units; alternatively, processor 1010 may integrate an application processor that handles primarily the operating system, user interface, and application programs or instructions, and a modem processor that handles primarily wireless communications, such as a baseband processor. It will be appreciated that the modem processor described above may not be integrated into processor 1010.

The processor 1010 is configured to generate a first record set through traversal based on a time domain feedback offset set and a time domain resource allocation table, where each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table; determining a transmission opportunity mapped by each first record; the terminal determines the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunity; determining HARQ-ACK semi-static codebook according to the number of the candidate PDSCH receiving opportunities

Optionally, the processor 1010 is further configured to perform the following processes in a loop until the updated first record set is empty, and determine a transmission opportunity mapped by each first record according to the mapped reference transmission opportunity: determining a time domain reference value according to each first record in the first record set; mapping each first record meeting a first condition in the first record set to a reference transmission opportunity corresponding to the time domain reference value, sequentially traversing the first records which are not mapped to the reference transmission opportunity in the first record set, and mapping each first record meeting a second condition to the reference transmission opportunity; deleting each first record mapped to the reference transmission opportunity from the first record set to obtain an updated first record set;

The terminal 1000 provided in the embodiment of the present application can implement each process implemented in the method embodiment of fig. 2, and achieve the same technical effect, and for avoiding repetition, details are not described here again.

The embodiment of the application also provides network side equipment, which comprises a processor and a communication interface, wherein the communication interface is used for receiving the HARQ-ACK semi-static codebook from a terminal; the HARQ-ACK semi-static codebook is determined according to the number of candidate PDSCH (physical Downlink shared channel) receiving opportunities after the terminal determines the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunities based on a time domain feedback offset set and a time domain resource allocation table and generates a first record set in a traversing way by the terminal, wherein each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, the transmission opportunities mapped by each first record are determined, and the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunities is determined. The embodiment of the network side device corresponds to the embodiment of the method of the network side device, and all implementation processes and implementation modes of the embodiment of the method can be applied to the embodiment of the network side device and can achieve the same technical effect.

Specifically, the embodiment of the application further provides a network side device. As shown in fig. 11, the network-side device 110 includes: antenna 111, radio frequency device 112, baseband device 113. The antenna 111 is connected to a radio frequency device 112. In the uplink direction, the rf device 112 receives information through the antenna 111 and sends the received information to the baseband device 113 for processing. In the downlink direction, the baseband device 113 processes information to be transmitted and transmits the information to the rf device 112, and the rf device 112 processes the received information and transmits the processed information through the antenna 111.

The above-mentioned band processing apparatus may be located in the baseband apparatus 113, and the method performed by the network side device in the above embodiment may be implemented in the baseband apparatus 113, where the baseband apparatus 113 includes the processor 114 and the memory 115.

The baseband device 113 may include at least one baseband board, for example, and a plurality of chips are disposed on the baseband board, as shown in fig. 11, where one of the chips, for example, the processor 114, is connected to the memory 115 to call the program in the memory 115 to perform the network side device operation shown in the above method embodiment.

The baseband device 113 may further include a network interface 116, for exchanging information with the radio frequency device 112, for example, a Common Public Radio Interface (CPRI).

Specifically, the network side device in the embodiment of the present application further includes: the instructions or programs stored in the memory 115 and capable of being executed on the processor 114, and the processor 114 calls the instructions or programs in the memory 115 to execute the method executed by each module shown in fig. 8, and achieve the same technical effect, and are not described herein in detail to avoid repetition.

The embodiments of the present application further provide a readable storage medium, where a program or an instruction is stored on the readable storage medium, and when the program or the instruction is executed by a processor, the program or the instruction implements each process of the above codebook determination method, and can achieve the same technical effect, and in order to avoid repetition, details are not repeated here.

Wherein, the processor is the processor in the terminal described in the above embodiment. The readable storage medium includes a computer readable storage medium, such as a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and so on.

The embodiment of the present application further provides a chip, where the chip includes a processor and a communication interface, the communication interface is coupled to the processor, and the processor is configured to execute a program or an instruction to implement each process of the above codebook determination method embodiment, and the same technical effect can be achieved, and is not described here again to avoid repetition.

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

It should be noted that, in this document, the terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, an element defined by the phrase "comprising a … …" does not exclude the presence of another identical element in a process, method, article, or apparatus that comprises the element. Further, it should be noted that the scope of the methods and apparatus of the embodiments of the present application is not limited to performing the functions in the order illustrated or discussed, but may include performing the functions in a substantially simultaneous manner or in a reverse order based on the functions involved, e.g., the methods described may be performed in an order different than that described, and various steps may be added, omitted, or combined. In addition, features described with reference to certain examples may be combined in other examples.

Through the description of the foregoing embodiments, it is clear to those skilled in the art that the method of the foregoing embodiments may be implemented by software plus a necessary general hardware platform, and certainly may also be implemented by hardware, but in many cases, the former is a better implementation. Based on such understanding, the technical solutions of the present application may be embodied in the form of a computer software product, which is stored in a storage medium (e.g., ROM/RAM, magnetic disk, optical disk) and includes instructions for enabling a terminal (e.g., a mobile phone, a computer, a server, an air conditioner, or a network-side device) to execute the method according to the embodiments of the present application.

While the present embodiments have been described with reference to the accompanying drawings, it is to be understood that the invention is not limited to the precise embodiments described above, which are meant to be illustrative and not restrictive, and that various changes may be made therein by those skilled in the art without departing from the spirit and scope of the invention as defined by the appended claims.

Claims

1. A method of codebook determination, comprising:

the terminal determines the number of candidate Physical Downlink Shared Channel (PDSCH) receiving opportunities corresponding to the transmission opportunities;

and the terminal determines a hybrid automatic repeat request-acknowledgement HARQ-ACK semi-static codebook according to the number of the candidate PDSCH receiving opportunities.

2. The method of claim 1, wherein determining the transmission opportunity for each first record map in the first set of records comprises:

the terminal circularly executes the following processes until the updated first record set is empty, and determines the transmission opportunity mapped by each first record according to the mapped reference transmission opportunity:

3. The method according to claim 2, wherein the time domain reference value comprises any one of:

4. The method of claim 2, wherein the determining whether there is time domain overlap between two scheduling rows comprises any one of:

5. The method of claim 2, wherein the determination that there is a time-domain overlap between two scheduling rows comprises any one of:

6. The method of claim 2, wherein traversing sequentially first records in the first set of records that are not mapped to the reference transmission opportunity comprises at least one of:

the traversal is based on a ratio of a number of time cells that the scheduling row corresponding to the first record spans before and after the time-domain reference value.

7. The method of claim 1, wherein the number of candidate PDSCH receiver opportunities for the transmission opportunity is: the maximum value of the number of the time domain resource allocation records contained in the scheduling row corresponding to each first record mapped by the transmission opportunity;

alternatively, the first and second electrodes may be,

the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunity is: the maximum value of the number of first downlink time slots included in the scheduling row corresponding to each first record mapped by the transmission opportunity is the maximum value of the number of first downlink time slots included in the scheduling row corresponding to each first record mapped by the transmission opportunity, the first downlink time slot is any downlink time slot which meets a third condition, and the third condition is that: and at least one time domain resource allocation record exists in the downlink time slot of the scheduling row.

8. The method of claim 1, wherein the determining a transmission opportunity to which each first record in the first set of records is mapped comprises:

and the terminal determines the transmission opportunity mapped by each first record in the first record set in a traversing way according to a predefined direction.

9. The method of claim 1,

and the terminal sends the HARQ-ACK semi-static codebook to network side equipment.

10. A method of codebook determination, comprising:

the network side equipment receives the HARQ-ACK semi-static codebook from the terminal; the HARQ-ACK semi-static codebook is determined according to the number of candidate PDSCH (physical Downlink shared channel) receiving opportunities after the terminal determines the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunities based on a time domain feedback offset set and a time domain resource allocation table and generates a first record set in a traversing manner by the terminal, wherein each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, the transmission opportunity mapped by each first record is determined, and the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunities is determined.

11. The method of claim 10, further comprising:

the network side equipment generates a first record set in a traversing mode based on a time domain feedback offset set and a time domain resource allocation table, and determines a transmission opportunity mapped by each first record in the first record set;

the network side equipment determines the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunities;

and the network side equipment determines the length of the HARQ-ACK bit sequence corresponding to the HARQ-ACK semi-static codebook according to the number of the candidate PDSCH receiving opportunities.

12. The method of claim 11, wherein the determining the transmission opportunity for each first record map comprises:

the network side device circularly executes the following processes until the updated first record set is empty, and determines the transmission opportunity mapped by each first record according to the mapped reference transmission opportunity:

13. A codebook determination device, comprising:

a third determining module, configured to determine a hybrid automatic repeat request-acknowledgement HARQ-ACK semi-static codebook according to the number of candidate PDSCH receiving opportunities.

14. A codebook determination device, comprising:

a receiving module, configured to receive a HARQ-ACK semi-static codebook from a terminal; the HARQ-ACK semi-static codebook is determined by the terminal based on a time domain feedback offset set and a time domain resource allocation table, generating a first record set in a traversing manner, determining a transmission opportunity mapped by each first record based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, determining the number of candidate PDSCH (physical downlink shared channel) receiving opportunities corresponding to the transmission opportunity, and determining the number of the candidate PDSCH receiving opportunities according to the number of the candidate PDSCH receiving opportunities.

15. A terminal comprising a processor, a memory and a program or instructions stored on the memory and executable on the processor, the program or instructions when executed by the processor implementing the steps of the codebook determination method as defined in any one of claims 1 to 9.

16. A network-side device comprising a processor, a memory, and a program or instructions stored on the memory and executable on the processor, wherein the program or instructions, when executed by the processor, implement the steps of the codebook determination method as defined in any one of claims 10 to 12.

17. A readable storage medium, characterized in that it stores thereon a program or instructions which, when executed by a processor, implement the steps of the codebook determination method as defined in any of the claims 1 to 9 or the steps of the codebook determination method as defined in any of the claims 10 to 12.