CN115941134A - Codebook determination method, device, terminal and network side equipment - Google Patents

Abstract

The application discloses a codebook determination method, a codebook determination 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: a terminal determines a time domain resource allocation record set corresponding to a downlink service cell; determining a transmission opportunity set corresponding to the downlink service cell according to the time domain resource allocation record set; and determining a HARQ-ACK semi-static codebook according to the transmission opportunity set.

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, some redundant transmission opportunities often exist in the transmission opportunity set obtained in this way, and 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 determination method is provided, including:

a terminal determines a time domain resource allocation record set corresponding to a downlink service cell;

the terminal determines a transmission opportunity set corresponding to the downlink service cell according to the time domain resource allocation record set;

and the terminal determines the HARQ-ACK semi-static codebook according to the transmission opportunity set.

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 according to a transmission opportunity set corresponding to a downlink service cell, and the transmission opportunity set is determined by the terminal according to a time domain resource allocation record set corresponding to the downlink service cell.

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

the first determining module is used for determining a time domain resource allocation record set corresponding to the downlink serving cell;

a second determining module, configured to determine, according to the time domain resource allocation record set, a transmission opportunity set corresponding to the downlink serving cell;

a third determining module, configured to determine a HARQ-ACK semi-static codebook according to the transmission opportunity set.

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 by the terminal according to a transmission opportunity set corresponding to a downlink service cell, and the transmission opportunity set is determined by the terminal according to a time domain resource allocation record set corresponding to the downlink service cell.

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 determine a time domain resource allocation record set corresponding to a downlink serving cell; determining a transmission opportunity set corresponding to the downlink service cell according to the time domain resource allocation record set; determining the number of time domain resource allocation records corresponding to each transmission opportunity in the transmission opportunity set; and determining the HARQ-ACK semi-static codebook according to the time domain resource allocation record number.

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 by the terminal according to a transmission opportunity set corresponding to a downlink service cell, and the transmission opportunity set is determined by the terminal according to a time domain resource allocation record set corresponding to the downlink service cell.

In a ninth aspect, there is provided a readable storage medium having stored thereon a program or instructions which, when executed by a processor, carries out the steps of the method of the first 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 method according to the first 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 implement the steps of the method according to the first aspect.

In the embodiment of the application, the terminal may determine a time domain resource allocation record set corresponding to the downlink serving cell, determine a transmission opportunity set corresponding to the downlink serving cell according to the time domain resource allocation record set, and determine the HARQ-ACK semi-static codebook according to the determined transmission opportunity set. Therefore, when the transmission opportunity set is determined, redundant transmission opportunities can be reduced/avoided, 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.

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 diagram of a fourth time slot in an example of the present application;

FIG. 7 is a fifth illustration of a time slot in an example of the present application;

FIG. 8 shows a sixth exemplary time slot in an example of the present application;

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

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

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

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

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

fig. 14 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 that can be derived from the embodiments given herein by a person of ordinary skill in the art are intended to be within the scope of the present disclosure.

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), 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,the techniques described may 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 enodeb, 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 home enodeb, a WLAN access Point, a WiFi node, a Transmit Receive Point (TRP), or some other suitable term 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 the specific type of the Base Station is not limited.

The codebook determining method, apparatus, terminal and readable storage medium provided in the embodiments of the present application are described in detail below with reference to the accompanying drawings by using 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 determines a time domain resource allocation record set corresponding to the downlink service cell.

In this embodiment, when the HARQ-ACK semi-static codebook relates to multiple downlink Serving cells (DL Serving cells), a transmission opportunity set may be independently determined for each downlink Serving cell. The HARQ-ACK semi-static codebook may be referred to as Type-1codebook.

In some embodiments, the reference to the Type-1codebook to the plurality of DL Serving cells may be understood as that a Physical Uplink Control Channel (PUCCH) cell group (cell group) of the Type-1codebook currently transmitted by the UE to be constructed/determined relates to the plurality of DL Serving cells.

Step 22: and the terminal determines a transmission opportunity set corresponding to the downlink service cell according to the time domain resource allocation record set.

In some embodiments, the transmission opportunity (occupancy) may be selected as a Physical Downlink Shared Channel (PDSCH) receiver opportunity, or the transmission opportunity may correspond to a PDSCH receiver opportunity. Accordingly, the set of transmission opportunities is a set of PDSCH receiver opportunities.

Step 23: and the terminal determines the HARQ-ACK semi-static codebook according to the transmission opportunity set.

Illustratively, the HARQ-ACK semi-static codebook is constructed/determined from the perspective of possible transmission opportunities, and a corresponding HARQ-ACK bit is reserved for each possible transmission opportunity based on a configured time domain feedback offset Set, such as K1 Set, and a HARQ-ACK feedback time, i.e., a time unit in which the semi-static codebook is transmitted. Each possible transmission opportunity is determined based on a time domain resource allocation Table configured by a higher layer, 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.

According to the codebook determining method, the terminal can determine the time domain resource allocation record set corresponding to the downlink service cell, determine the transmission opportunity set corresponding to the downlink service cell according to the time domain resource allocation record set, and determine the HARQ-ACK semi-static codebook according to the determined transmission opportunity set. Therefore, when the transmission opportunity set is determined, redundant transmission opportunities can be reduced/avoided, 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 use efficiency is further improved.

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.

It should be noted that, 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 an 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.

A typical occupancy set determination method may be selected as: for a SLIV set corresponding to a certain DL Slot, pruning and planning are carried out based on the conflict situation with Semi-static UL symbols, when residual SLIVs exist, a residual SLIV set is formed, if UE supports receiving more than one PDSCH in a single DL Slot, grouping the residual SLIV set based on a time domain overlapping rule, each SLIV Group is corresponding to a single Ocvasation, and therefore an Ocvasation subset corresponding to the DL Slot is determined. Otherwise, if the UE does not support receiving more than one PDSCH in a single DL Slot, the remaining set of SLIVs directly corresponds to a single occupancy, thereby determining that the occupancy subset corresponding to the DL Slot contains only a single occupancy. 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-1codebook.

It can be understood that, when the terminal constructs the HARQ-ACK semi-static codebook, if the transmission opportunity set for determining the HARQ-ACK bit sequence corresponding to the codebook is obtained based on the SLIV set corresponding to each downlink Slot DL Slot of the DL Serving cell, it will not be considered that the time domain resource allocation table always performs overall scheduling according to one row thereof. In this case, if a codebook supporting multiple Physical Downlink Shared Channels (PDSCHs), i.e., multi-PDSCH scheduling, is constructed by using this method, the association between SLIVs corresponding to/included in a certain row will not be considered, and scheduling cannot be actually performed simultaneously between two rows where any overlapping exists in the time domain after scheduling is performed, so that some redundant errors often exist in the obtained transmission opportunity set, and further, redundant HARQ-ACK bits exist in the constructed HARQ-ACK semi-static codebook.

In order to reduce or avoid the redundancy occupancy caused by the above situation, the terminal may determine the transmission opportunity set corresponding to the DL Serving cell in any of the following manners to reduce or avoid the redundant HARQ-ACK bits in the codebook, which is described below.

< determination mode 1>

In the determination mode 1, after determining a SLIV set corresponding to a DL Slot of a DL Serving cell, the terminal may determine a transmission opportunity subset corresponding to the DL Slot by considering a time domain overlapping condition between TDRA Table rows where the SLIVs are located, and further determine a transmission opportunity set corresponding to the DL Serving cell.

Optionally, when determining the transmission opportunity set corresponding to the DL Serving cell, the terminal may first: determining a DL Slot set corresponding to the DL Serving cell, and determining a SLIV set corresponding to each DL Slot in the DL Slot sets; and then, determining a transmission opportunity subset corresponding to each DL Slot according to the SLIV set corresponding to each DL Slot, and determining a transmission opportunity set corresponding to the DL Serving cell according to the transmission opportunity subset corresponding to each DL Slot.

In some embodiments, the union of the transmission opportunity subsets corresponding to each DL Slot in the DL Slot set may be determined as the transmission opportunity occupancy set corresponding to the DL Serving cell.

Optionally, when determining the transmission opportunity subset corresponding to each DL Slot according to the SLIV set corresponding to each DL Slot, the terminal may cyclically execute the following processes, i.e., S1 to S3, for the SLIV set corresponding to each DL Slot until the updated SLIV set is empty, and determine the mapped reference transmission opportunity set as the transmission opportunity subset corresponding to each DL Slot:

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

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

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

It is to be understood that S1 is only performed when the SLIV set is not empty, i.e. the time domain reference value is determined from each SLIV in the SLIV set. In the process of executing S1 to S3 for a certain DL Slot cycle, the SLIV set corresponding to this DL Slot is always in the process of updating/deleting.

Before the above loop is executed in S1 to S3, it is not considered that the SLIV may collide with the Semi-static time division duplex configuration information, for example, there may be time domain overlap between the SLIV and Semi-static UL symbol, but the SLIV in the SLIV set corresponding to the DL Slot is directly mapped.

Optionally, considering that the SLIVs may collide with the Semi-static time division duplex configuration information, before performing S1 to S3 cyclically, the terminal may delete each SLIV that collides with the Semi-static time division duplex configuration information from the SLIV set corresponding to each downlink timeslot, for example, delete the SLIVs that have time domain overlap with Semi-static UL symbol, so as to avoid redundant transmission opportunities.

In some embodiments, if for a certain DL Slot, a SLIV that conflicts with Semi-static UL symbol is not deleted before S1 to S3 are executed in a loop, any occupancy that meets a preset condition may be deleted from the occupancy subset corresponding to the DL Slot after S1 to S3 are executed in a loop. The preset conditions here may be: any SLIV mapped to Occasion conflicts with Semi-static UL symbol. Or, for a certain occupancy, if at least one SLIV mapped to the occupancy does not conflict with Semi-static UL symbol, the occupancy is kept in the occupancy subset corresponding to the DL Slot, otherwise, the occupancy is deleted from the occupancy subset corresponding to the DL Slot.

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

the earliest value of the ending time of each SLIV in the SLIV set; that is, the end time of the SLIV with the earliest end time in the SLIV set;

a minimum value of ending symbol index (smallest last OFDM symbol index) for each SLIV in the SLIV set; i.e. the ending symbol index of the SLIV with the smallest ending symbol index in the SLIV 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 each SLIV in the SLIV set may be based; alternatively, when an end symbol index is used, it may be based on the position or index of the last symbol of each SLIV in the SLIV set. The purpose of determining the time domain reference value in this way is to determine the maximum number of transmission opportunities (occusions) that are possible to transmit in parallel, or in other words, the maximum number of SLIVs that do not overlap each other, within the current DL Slot.

In some embodiments, when performing S2 and S3, the terminal may first map each SLIV in the SLIV set that satisfies the first condition to the reference occupancy; these SLIV are subsequently called the first mapped SLIV, which is a subset of SLIVs, comprising 1 to several SLIVs; then, mapping each not-yet-mapped (i.e. excluding the aforementioned first mapped SLIV) SLIV in the SLIV set that satisfies the second condition to the reference occupancy; these SLIVs are subsequently referred to as second mapped SLIVs, which comprise 0, 1 to a plurality of SLIVs as a subset of SLIVs; and deleting each SLIV corresponding to the first mapped SLIV and the second mapped SLIV from the SLIV set so as to update the SLIV set.

In other embodiments, when performing S2 and S3, the terminal may first map each SLIV in the SLIV set that meets the first condition to the reference occupancy, and delete the mapped SLIV from the SLIV set; then, each SLIV meeting the second condition in the updated SLIV set is mapped to the reference Occasion, and the mapped SLIV is deleted from the SLIV set. That is, for an SLIV that has been judged to map to the reference Occasion, it is immediately deleted from the SLIV set.

It is to be understood that for a mapped SLIV, it may be understood as any SLIV in the union of the first mapped SLIV and the second mapped SLIV. Upon determining the second mapped SLIV, the first mapped SLIV has been fully determined, but the second mapped SLIV is in the process of being continuously updated.

Optionally, the first condition includes: the start time instant or start symbol index is less than or equal to the time domain reference value. The second condition described above includes: the mapped SLIV does not exist in the scheduling row corresponding to any associated first record (hereinafter, referred to as condition 1), and the scheduling row corresponding to any associated first record has time domain overlap with any scheduling row in which the mapped SLIV exists (hereinafter, referred to as condition 2). The first record is determined based on one time domain feedback offset in the set of time domain feedback offsets and one row in the time domain resource allocation Table, TDRA 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.

In some embodiments, for a SLIV that satisfies the second condition, it may be understood that: any (K1 Index, r) record of the SLIV association does not have a mapped SLIV in the corresponding scheduling row, and any (K1 Index, r) record of the SLIV association does not have any time-domain overlap with any mapped row, which can be understood as a scheduling row with a mapped SLIV.

It should be noted that, when an SLIV is associated with a certain (K1 Index, r) record, the SLIV is a TDRA Table row corresponding to a certain downlink scheduling DCI scheduling r, and when a K1 corresponding to the K1 Index is indicated, a SLIV appears in the current DL Slot in the corresponding scheduling row. This SLIV is also referred to as being from this (K1 Index, r) record.

Optionally, the scheduling row may be understood as a specific location given in the time domain by a certain TDRA Table row, so as to determine the start-stop time positions of the SLIVs in the TDRA Table row, and the union of the time periods spanned by the start-stop time positions of the SLIVs in the row is used as the time period or interval spanned in the time domain by the row, and may be used to determine whether there is any time domain overlap between rows, and/or whether any SLIV included in/corresponding to the row conflicts with the Semi-static uplink symbol Semi-static UL symbol.

In some embodiments, when considering conflicts with Semi-static UL symbols, any of the SLIVs that conflict with Semi-static UL symbols may be excluded from the scheduling row inclusion/correspondence SLIVs, i.e., a scheduling row does not include/correspond to any SLIV that conflicts with Semi-static UL symbols, even if such SLIV is in the TDRA Table row to which the scheduling row corresponds.

Optionally, for a certain row in the TDRA Table, when the (K1 Index, r) records correspond to different (K1 Index, r) records in combination with different K1 in the K1 Set, the time domain position of the scheduling row corresponding to each (K1 Index, r) record is different. For a certain SLIV in this TDRA Table row, it will also be located in a different DL Slot based on a different K1.

It will be appreciated that for any one of the SLIV sets, it may associate at least a single (K1 Index, r) record, and possibly multiple (K1 Index, r) records, because when determining the SLIV set corresponding to each DL Slot, the same SLIV in the SLIV set is merged/uniquely processed, i.e. redundant SLIVs are removed, and each unique SLIV value appears only once in the SLIV set.

As for condition 1 in the second condition, it can be understood that: when a certain scheduling line already has a mapped SLIV, one SLIV of the scheduling line in the current DL Slot is already mapped to the reference Ocvasion, and no other SLIV can be mapped to the reference Ocvasion, namely, each scheduling line can only have one SLIV mapped to the reference Ocvasion at most in one DL Slot.

As for condition 2 in the second condition, it can be understood that: if there is no any time-domain overlap between a certain (K1 Index, r) record associated with the SLIV (assumed to be scheduled row 1) and a certain mapped row (assumed to be scheduled row 2), then the scheduled row 1 and the scheduled row 2 may actually be scheduled at the same time, and at this time, if the SLIV is also mapped to the reference occupancy, the problem that more than one actually scheduled SLIV is mapped to the same occupancy may be caused. To avoid this problem, the SLIV can no longer map to the reference Ocvasion.

In some embodiments, the decision whether there is any time-domain overlap between any two scheduling rows may be: as long as there is time-domain overlap at any position of a given two scheduling rows, i.e. there is at least partial overlap of time periods or intervals spanned by the two scheduling rows, it is decided that there is time-domain overlap between the two scheduling rows.

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 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;

mode 2: 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.

It should be noted that an exemplary form of the Semi-static tdd configuration information is Semi-static uplink symbols 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 scheduling rows may be more than that in the case of adopting the above method 2, so that more SLIVs may share an occupancy, that is, map to the same occupancy, so as to 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 SLIVs 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 SLIV therein, or the decoding results corresponding to all detected PDSCH transmissions corresponding to occupancy are bundled and the HARQ-ACK bit corresponding to the 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.

Optionally, in order to ensure that, for any scheduling row, the precedence order of the occupancy of each SLIV map included in the scheduling row is always consistent with the precedence order of the presence/occurrence of the SLIV, that is, the SLIV with an earlier appearance/start time maps the occupancy first, or the number/index of the mapped occupancy is small, the second condition may further include: in the scheduling row corresponding to any associated first record, there is no SLIV before the corresponding SLIV that is not mapped to any transmission opportunity (hereinafter, referred to as condition 3). That is, when the above-described condition 1 and condition 2 are satisfied simultaneously, and this condition 3 is satisfied, it can be considered that the second condition is satisfied.

In some embodiments, for a SLIV satisfying this condition 3, it may be understood that: any (K1 Index, r) record associated with the SLIV corresponds to a scheduling line, and any SLIV not mapped with occupancy does not exist before the SLIV.

It should be noted that when at least one SLIV has been mapped to Occasion before a given SLIV in a scheduling row corresponding to a certain (K1 Index, r) record associated with the given SLIV, the Occasion is not necessarily the reference Occasion when the requirement of satisfying the above condition 1 is satisfied.

Mapping the SLIVs satisfying the first condition to the reference Occasion as described above can be considered to continue the local operation in the prior art. The mapping of each unmapped SLIV satisfying the second condition to the reference occupancy can be understood as optimization of the occupancy mapping relationship based on the time domain overlapping condition between the scheduling rows, and based on the optimization, introduction of redundant occupancy can be avoided, thereby reducing the size of the HARQ-ACK codebook and the feedback overhead.

Optionally, the above traversal order for determining whether each not-yet-mapped SLIV in the SLIV set satisfies the second condition may affect the determination of the mapping relationship from the SLIV to the occupancy, so as to affect the size of the HARQ-ACK semi-static codebook. When sequentially traversing SLIVs in the SLIV set that are not mapped to Occasion, the traversing manner may include 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 associated with the SLIV.

For example, this 1) may be expressed as traversing based on the K1 Index and/or r in the (K1 Index, r) record of the SLIV association. 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.

In some embodiments, when a certain SLIV association is larger than one (K1 Index, r) record, the (K1 Index, r) record with the smallest/largest K1 Index among the (K1 Index, r) records of the associations may be used for traversal, and/or the (K1 Index, r) record with the smallest/largest r among the (K1 Index, r) records of the associations may be used for traversal.

2) Traversal is performed based on the start time and/or start symbol index of the SLIV.

In some embodiments, when traversing based on the start time/start symbol index of an SLIV, it may be considered that SLIV starting earlier maps Ocvasion more preferentially, and thus, may traverse in an ascending order based on the start time/start symbol index. Alternatively, a descending traversal may be employed.

In some embodiments, when the start time/start symbol indices of more than one SLIV are the same or equal, traversal mode 1) may be further employed for the SLIVs to determine a traversal order of each other.

3) Traversal is performed based on the end time and/or end symbol index of the SLIV.

In some embodiments, when traversing based on the end time/end symbol index of an SLIV, it may be considered that an earlier-ended SLIV preferentially maps an occupancy to avoid interfering with mapping of a later SLIV, or it may be considered that SLIVs with closer/concentrated time-domain spans are mapped to the same occupancy to reduce the number of occussions to be finally mapped, 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 indices of more than one SLIV are the same or equal, traversal mode 1) may be further employed for the SLIVs to determine a traversal order with respect to each other.

4) Traversal is based on the number of time cells that the SLIV spans/occupies before or after the temporal reference value.

In some embodiments, the time unit in 4) may be a symbol, such as an Orthogonal Frequency Division Multiplexing (OFDM) symbol.

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

5) The traversal is based on a proportion of the number of time cells that the SLIV spans/occupies before and after the temporal reference value.

The above proportions can 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 time units spanned/occupied. In calculating the ratio, if the denominator is 0, the ratio can be directly set to a predefined value.

In some embodiments, the time unit in 5) may be a symbol, such as an OFDM symbol

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

It is understood that the foregoing embodiment mainly aims at the operation of a single DL Slot, but in addition, when determining a set of transport machines corresponding to a DL Serving cell, the present application may also uniformly/jointly execute for multiple DL slots, such as the following determination mode 2.

< determination mode 2>

In the determination mode 2, after determining the SLIV set corresponding to each DL Slot, the terminal determines, for more than one DL Slot, an occupancy subset corresponding to the more than one DL Slot by using the method in the determination mode 1. It can be understood that the determination manner 2 is to extend the operation for a single DL Slot in the determination manner 1 to be uniformly/jointly executable for a plurality of DL slots.

Optionally, when determining the transmission opportunity set corresponding to the DL Serving cell, the terminal may first: determining a DL Slot set corresponding to the DL Serving cell, and determining a SLIV set corresponding to each DL Slot in the DL Slot set; then, dividing the DL Slot set into at least one DL Slot subset, and determining a SLIV set corresponding to each DL Slot subset according to the SLIV set corresponding to each DL Slot; and then, according to the SLIV set corresponding to each DL Slot subset, determining a transmission opportunity subset corresponding to each DL Slot subset, and according to the transmission opportunity subset corresponding to each DL Slot subset, determining a transmission opportunity set corresponding to the DL Serving cell.

In some embodiments, the union of the transmission opportunity subsets corresponding to each DL Slot subset may be determined as the transmission opportunity occupancy set corresponding to the DL Serving cell.

It can be understood that, in this embodiment, the method for determining the transmission opportunity subset corresponding to each DL Slot subset according to the SLIV set corresponding to each DL Slot subset is the same as the method for determining the transmission opportunity subset corresponding to each DL Slot according to the SLIV set corresponding to each DL Slot in the determination manner 1 described above, except that the operation on a single DL Slot is extended to the operation on the DL Slot subset, and in order to avoid repetition, the method for determining the transmission opportunity subset corresponding to the DL Slot subset is not described in detail here, and corresponding contents in the determination manner 1 may be referred to.

In some embodiments, for a certain DL Slot subset, a union of SLIV sets corresponding to DL slots in the DL Slot subset may be taken, and based on the SLIV union, the loop process of S1 to S3 in the above determination mode 1 is performed to determine an occupancy subset corresponding to the DL Slot subset.

It should be noted that the loop process of S1 to S3 in the determination manner 1 relates to the start/end symbol index of a single SLIV, and when the determination manner 2 compares the start/end symbol indexes of any two SLIVs in the loop process similar to the above S1 to S3, the time domain offset between the DL slots corresponding to the two SLIVs needs to be considered. For example, the start/end symbol index for each SLIV may be determined/updated as: the start/end symbol index of this SLIV within a single DL Slot + M x offset. Wherein the offset is an offset of the DL Slot corresponding to the SLIV with respect to the DL Slot level of the earliest DL Slot or the first DL Slot in the current DL Slot subset. M may be understood as the number of symbols corresponding to a single DL Slot, e.g. M is 14 or 12.

In some embodiments, after determining the cccasion subsets corresponding to the DL Slot subsets, when the number of the DL Slot subsets is greater than 1, a union set may be taken from the cccasion subsets corresponding to the DL Slot subsets to obtain an cccasion set used for determining the HARQ-ACK bit sequence corresponding to Type-1codebook. For example, the manner of the union set may be: and performing head-to-tail cascading on the Ocvasion subsets corresponding to the DL Slot subsets based on the sequence of the DL Slot subsets or the size sequence of the numbers/indexes.

Optionally, when dividing the DL Slot set corresponding to the DL Serving cell into at least one DL Slot subset, the terminal may adopt at least one of the following dividing manners:

the division mode 1: and dividing the time slot based on the number N of preset time slots contained in the downlink time slot subset.

In some embodiments, assuming that the DL Slot sets are an ordered set, for example, ascending/descending order is performed based on the starting/ending time of DL slots, the adjacent N DL slots in the set may be sequentially divided into a DL Slot subset from the first DL Slot in the DL Slot set; when the number of the DL slots remaining at the tail is less than or equal to N, the DL slots are divided into a single DL Slot subset.

Optionally, N is an integer greater than 1. N may be specified by a protocol or configured based on higher layer signaling.

The division mode 2: and dividing based on a preset Pattern.

Optionally, the preset Pattern indicates a mapping relationship between DL slots and DL Slot subsets. For example, the preset Pattern indicates that the first N1 DL slots in the DL Slot set correspond to a first DL Slot subset, the next N2 DL slots correspond to a second DL Slot subset, and so on. Compared with the division mode 1, the division mode 2 can realize more flexible division of the DL Slot subset.

Alternatively, pattern may be specified by a protocol or configured based on higher layer signaling, or dynamically indicated. For example, the higher layer signaling configures a Pattern list, and Downlink Control Information (DCI) indicates a certain Pattern in the Pattern list to be applied.

A division mode 3: the set of downlink timeslots is divided into a single subset of downlink timeslots, i.e. the set of DL slots directly corresponds/is a single subset of DL slots.

It should be noted that, in the above determination method 1 and the determination method 2, the number of PDSCH transmissions scheduled or configured in a single DL Slot may be allowed to exceed 1, and the HARQ-ACK semi-static codebook may be determined in consideration of the association between SLIVs in a TDRA Table line and the time-domain overlapping condition between different scheduling lines, so as to reduce or avoid redundant occupancy/redundant HARQ-ACK bits in the codebook, thereby improving HARQ-ACK feedback efficiency.

In a case that scheduling or configuration of more than 1 PDSCH transmission is not allowed 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 terminal may allocate/map a single occupancy to each corresponding SLIV set as a non-empty DL Slot, so as to determine an occupancy set corresponding to a corresponding DL Serving cell, for example, in the following determination manner 3.

< determination mode 3>

In the determination mode 3, scheduling or configuration is not allowed to exceed 1 PDSCH transmission in each DL Slot, and after the terminal determines the SLIV set corresponding to each DL Slot, the occupancy set corresponding to the current DL Serving cell is determined.

Optionally, when determining the transmission opportunity set corresponding to the DL Serving cell, the terminal may first: determining a DL Slot set corresponding to the DL Serving cell, and determining a SLIV set corresponding to each DL Slot in the DL Slot set; then, allocating/mapping transmission opportunity for the first DL Slot, and determining a transmission opportunity set according to the allocated/mapped transmission opportunity; and the first DL Slot is any DL Slot of which the corresponding SLIV set in the DL Slot set is a non-empty set.

It can be understood that: compared with the determination method 1, this method is to directly map each corresponding SLIV set to a single Occasion for a non-empty DL Slot. The determination method 1 needs to determine an occupancy subset based on the SLIV set corresponding to the DL Slot, where the subset may include more than one occupancy.

In some embodiments, assuming that the DL Slot sets are an ordered set, for example, ascending/descending order is performed based on the starting/ending time of the DL slots, when a SLIV set corresponding to a certain DL Slot in the DL Slot sets is empty, the DL Slot may be skipped when a single corresponding occupancy is sequentially allocated/mapped for each DL Slot. Optionally, the DL slots in the DL Slot set that are empty corresponding to the SLIV sets may be deleted from the DL Slot set, and then a single corresponding occupancy may be sequentially allocated/mapped to each DL Slot in the updated DL Slot set. In this case, each corresponding SLIV set in the DL Slot set allocates/maps a single corresponding occupancy for the non-empty DL Slot.

In some embodiments, the precedence order of each corresponding SLIV set in the DL Slot set as a non-empty DL Slot is consistent with the precedence order of the Occasion of the corresponding allocation/mapping.

It is understood that before the transmission opportunity is allocated/mapped to the first DL Slot, it is not considered that the SLIVs in the SLIV set corresponding to the first DL Slot may collide with the Semi-static time division duplex configuration information, for example, there may be a time domain overlap with Semi-static UL symbol, but the transmission opportunity is directly allocated/mapped to the first DL Slot.

Optionally, considering that the SLIVs in the SLIV set corresponding to the first DL Slot may collide with the Semi-static time division duplex configuration information, for example, there may be time domain overlap with Semi-static UL symbol, before allocating/mapping the transmission opportunity to the first DL Slot, the terminal may delete each SLIV that collides with the Semi-static time division duplex configuration information from the SLIV set corresponding to each downlink Slot, for example, delete each SLIV that has time domain overlap with Semi-static UL symbol, and after the deletion operation, allocate/map the transmission opportunity to any DL Slot that is not empty for the first DL Slot, that is, the corresponding SLIV set, so as to avoid redundant transmission opportunity.

Optionally, when determining the set of transmission opportunities according to the allocated/mapped transmission opportunities, the terminal may perform any one of the following:

determining a set of allocated/mapped transmission opportunities as a set of transmission opportunities; in this case, it is preferred that before the transmission opportunity is allocated/mapped, each SLIV that collides with the Semi-static UL symbol has been deleted, and each corresponding set of SLIVs is a null DL Slot;

determining a set of other transmission opportunities except the first transmission opportunity in the allocated transmission opportunities as a transmission opportunity set; wherein the first transmission opportunity collides with Semi-static time division duplex configuration information such as Semi-static UL symbol. In this case, prior to allocating/mapping a transmission opportunity, individual SLIVs that collide with Semi-static UL symbols are not deleted, and DL slots whose corresponding SLIV sets are empty are not deleted.

In some embodiments, if SLIV conflicting with Semi-static UL symbol is not deleted for the SLIV set corresponding to a DL Slot before allocating/mapping Ocvasion, the terminal may delete Ocvasion corresponding to any SLIV conflicting with Semi-static UL symbol within the SLIV set corresponding to a DL Slot from the Ocvasion set after allocating/mapping Ocvasion.

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 includes 4 rows, the K1 Set includes 3K 1, and the corresponding K1 value can be obtained by time-domain shifting the corresponding Slot number. For the SLIV set corresponding to each DL Slot, sequentially and cyclically executing S1 to S3 in the determination mode 1, where a time domain reference value determined each time S1 is executed, such as the earliest value of the end time of each SLIV, is marked by a bold dashed line, and a round/index of cyclic execution is marked at the same time, and the round/index of cyclic execution corresponding to each DL Slot is numbered from 1. A certain number is simultaneously applied to the round/index executed by a certain loop, the time domain reference value determined by the loop, the reference occupancy corresponding to the time domain reference value, and the SLIV mapped to the reference occupancy, that is, the objects corresponding to the same loop are labeled with the same number.

For example, S1 to S3 are executed 1,2 times for DL Slot 5363, and 2 occasions are obtained respectively based on the reference occasions corresponding to the first condition mapping; the mapping procedures corresponding to DL Slot 2, DL Slot 3, DL Slot 6, DL Slot 7, DL Slot 8 and DL Slot 10 are similar to this. For another example, for DL Slot4,2 times, S1 to S3 are executed, when S1 to S3 are executed for the 1 st time, first, one SLIV (corresponding to the box numbered in DL Slot4 and not explicitly labeled with a background pattern; assuming SLIV 1) satisfying the first condition is mapped to Occasion 1 (as the reference Occasion for the 1 st execution), and then one SLIV (corresponding to the box numbered in DL Slot4 and explicitly labeled with a background pattern; assuming SLIV 2) satisfying the second condition is mapped to Occasion 1, where the mapping SLIV2 can be understood as an additional mapping made with respect to the prior art; when S1 to S3 are executed for the 2 nd time, mapping two SLIVs (corresponding to two boxes numbered as 2 in the DL Slot4 and not explicitly labeled with a background pattern) meeting the first condition to occupancy 2 (serving as a reference occupancy for the 2 nd execution), so as to map corresponding 2 occussions in the DL Slot 4; the mapping procedure corresponding to DL Slot 9 and DL Slot 11 is similar to this. Based on the extra mappings, the number of occupancy in each of the DL Slot4, the DL Slot 9 and the DL Slot 11 can be reduced to 2 from 3 based on the prior art, and no extra limitation is brought to scheduling, so that unnecessary occupancy mapping is reduced, and HARQ-ACK feedback overhead is reduced.

In addition, if there is no SLIV meeting the second condition in the SLIV set corresponding to each DL Slot of a DL Serving cell, that is, when S1 to S3 in the determination method 1 are sequentially and cyclically executed on the SLIV set corresponding to each DL Slot, reference occupancy corresponding to the mapping based on the first condition, such as DL Slot 1 to DL Slot4 and DL Slot 6 to DL Slot 11 shown in fig. 4, is mapped, no additional mapping is brought, and reduction of occupancy and reduction of HARQ-ACK feedback overhead are also not brought. In fig. 4, the TDRA Table contains 5 rows and the K1 Set contains 3K 1 s.

Example 2

In example 2, as shown in fig. 5, the TDRA Table includes 4 rows, and the K1 Set includes 3K 1, which is the same as the slot structure shown in fig. 3. The DL Slot set is divided in a subset division manner 1 and N =2, that is, every two DL slots are divided into one DL Slot subset, as indicated by a dashed box in fig. 5. For the SLIV set corresponding to each DL Slot subset, sequentially and circularly executing S1 to S3 in the determination mode 1, the time domain reference value determined each time when S1 is executed is marked with a bold dashed line, and the round/index of circular execution is marked at the same time, and the round/index of circular execution corresponding to each DL Slot subset is numbered from 1. A certain number is simultaneously applied to the round/index executed by a certain loop, the time domain reference value determined by the loop, the reference occupancy corresponding to the time domain reference value, and the SLIV mapped to the reference occupancy, that is, the objects corresponding to the same loop are labeled with the same number.

For example, S1 to S3 are executed 1,3 times for DL Slot subset 5363, and 3 occasions are obtained based on the reference occasions corresponding to the first condition mapping, respectively; the mapping procedure corresponding to DL Slot subset 3 is exactly the same. For another example, for DL Slot subset 2,3 times, S1 to S3 are executed, 2 SLIVs satisfying the first condition are mapped to occupancy 1 (as a reference occupancy for the 1 st execution) when S1 to S3 are executed for the 1 st time, one SLIV satisfying the first condition (corresponding to a frame numbered 2 in DL Slot4 and not explicitly labeled with a background pattern; assuming SLIV 1) is mapped to occupancy 2 (as a reference occupancy for the 2 nd execution) when S2 is executed, and then one SLIV satisfying the second condition (corresponding to a frame numbered 2 in DL Slot4 and explicitly labeled with a background pattern; assuming SLIV 2) is mapped to occupancy 2, where mapping v2 can be understood as an additional mapping made with respect to the prior art; when S1 to S3 are executed for the 3 rd time, mapping two SLIVs (corresponding to two boxes numbered as 3 in DL Slot4 and not explicitly labeled with a background pattern) meeting the first condition to occupancy 3 (serving as a reference occupancy for the 3 rd time execution), so as to map 3 occussions in DL Slot subset 2 (including DL Slot 3 and DL Slot 4); the mapping procedure corresponding to the DL Slot subset 4 and the DL Slot subset 5 is similar to this.

As can be seen from fig. 5, the number of occusions it determines/maps, and the mapping relationship between each SLIV and the occusion are completely consistent with fig. 3.

In addition, if the DL Slot set is divided by the subset division method 3 based on the Slot structure shown in fig. 3, that is, the DL Slot set is a single DL Slot subset, S1 to S3 in the determination method 1 may be executed circularly on the SLIV set corresponding to the DL Slot set, for example, as shown in fig. 6, S1 to S3 may be executed 15 times to obtain a corresponding Occasion, the time domain reference value determined each time S1 is marked by a bold dashed line, and the round/index of circular execution is marked at the same time.

As can be seen from fig. 6, the number of occasions determined/mapped by the method can be reduced from 16 in fig. 3 to 15, compared with fig. 3, thereby further reducing the single Occasion.

Example 3

In example 3, as shown in fig. 7, the TDRA Table includes 2 rows, the K1 Set includes 3K 1, and any row in the TDRA Table configures only a single PDSCH transmission or a single SLIV at most in each DL Slot. If a subset dividing mode 3 is adopted to divide the DL Slot set, namely the DL Slot set is a single DL Slot subset, S1 to S3 can be executed 10 times to obtain corresponding Occasion, the time domain reference value determined by executing S1 each time is marked by a bold dotted line, and the cycle execution round/index is marked at the same time; as shown in fig. 7, 10 occasions can be determined in sequence to obtain an Occasion set.

In addition, as shown in fig. 8, assuming that the TDRA Table includes 2 rows, the K1 Set includes 3K 1, and any row in the TDRA Table configures only a single PDSCH transmission or a single SLIV at most in each DL Slot, it may sequentially allocate an occupancy to a non-empty DL Slot as a SLIV Set to obtain an occupancy Set.

Referring to fig. 9, fig. 9 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. 9, the method includes the following steps:

step 91: and 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 according to a transmission opportunity set corresponding to the downlink service cell, and the transmission opportunity set is determined by the terminal according to a time domain resource allocation record set corresponding to the downlink service cell. It can be understood that, the specific determination manner of the terminal for the transmission opportunity set can be referred to the embodiment shown in fig. 2, and is not described herein again.

Therefore, redundant transmission opportunities can be reduced/avoided when a transmission opportunity set is 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 analyze the received HARQ-ACK semi-static codebook, the network side device may determine a time domain resource allocation record set corresponding to the downlink serving cell, and determine a transmission opportunity set corresponding to the downlink serving cell according to the time domain resource allocation record set. And then, according to the determined transmission opportunity set, determining the length of the HARQ-ACK bit sequence corresponding to the HARQ-ACK semi-static codebook.

Optionally, when determining the transmission opportunity set corresponding to the DL Serving cell, the network side device may first: determining a DL Slot set corresponding to the DL Serving cell, and determining a SLIV set corresponding to each DL Slot in the DL Slot set; and then, determining a transmission opportunity subset corresponding to each DL Slot according to the SLIV set corresponding to each DL Slot, and determining a transmission opportunity set corresponding to the DL Serving cell according to the transmission opportunity subset corresponding to each DL Slot.

Further, when determining the transmission opportunity subset corresponding to each DL Slot according to the SLIV set corresponding to each DL Slot, the network side device may cyclically execute the following processes, i.e., S1 to S3, for the SLIV set corresponding to each DL Slot until the updated SLIV set is empty, and determine the mapped reference transmission opportunity set as the transmission opportunity subset corresponding to each DL Slot:

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

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

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

Wherein the first condition comprises: the start time instant or start symbol index is less than or equal to the time domain reference value. The second condition includes: the mapped SLIV does not exist in the scheduling row corresponding to any associated first record, and the scheduling row corresponding to any associated first record and any scheduling row with the mapped SLIV exist time domain overlapping. The first record is determined based on one time domain feedback offset in the time domain feedback offset set and one row in a time domain resource allocation Table, TDRA, table.

Optionally, when determining the transmission opportunity set corresponding to the DL Serving cell, the network side device may first: determining a DL Slot set corresponding to the DL Serving cell, and determining a SLIV set corresponding to each DL Slot in the DL Slot set; then, dividing the DL Slot set into at least one DL Slot subset, and determining a SLIV set corresponding to each DL Slot subset according to the SLIV set corresponding to each DL Slot; and then, determining a transmission opportunity subset corresponding to each DL Slot subset according to the SLIV set corresponding to each DL Slot subset, and determining a transmission opportunity set corresponding to the DL Serving cell according to the transmission opportunity subset corresponding to each DL Slot subset.

Optionally, when determining the transmission opportunity set corresponding to the DL Serving cell, the network side device may first: determining a DL Slot set corresponding to the DL Serving cell, and determining a SLIV set corresponding to each DL Slot in the DL Slot set; then, allocating/mapping transmission opportunity for the first DL Slot, and determining a transmission opportunity set according to the allocated/mapped transmission opportunity; and the first DL Slot is any DL Slot of which the corresponding SLIV set in the DL Slot set is a non-empty set.

It should be noted that the way for the network side device to determine the transmission opportunity set corresponding to the DL Serving cell is the same as the way for the terminal to determine the transmission opportunity set corresponding to the DL Serving cell 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 apparatus, or a control module in the codebook determining apparatus 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. 10, fig. 10 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. 10, a codebook determining apparatus 100 includes:

a first determining module 101, configured to determine a time domain resource allocation record set corresponding to a downlink serving cell;

a second determining module 102, configured to determine, according to the time domain resource allocation record set, a transmission opportunity set corresponding to the downlink serving cell;

a third determining module 103, configured to determine a HARQ-ACK semi-static codebook according to the transmission opportunity set.

Optionally, the first determining module 101 is specifically configured to: determining a downlink time slot set corresponding to the downlink service cell, and determining a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set;

the second determining module 102 is specifically configured to: and determining a transmission opportunity subset corresponding to each downlink time slot according to the time domain resource allocation record set corresponding to each downlink time slot, and determining the transmission opportunity set according to the transmission opportunity subset corresponding to each downlink time slot.

Optionally, the second determining module 102 is further configured to: for the time domain resource allocation record set corresponding to each downlink time slot, the following processes are executed in a circulating manner until the updated time domain resource allocation record set is empty, and the mapped reference transmission opportunity set is determined as the transmission opportunity subset corresponding to each downlink time slot:

determining a time domain reference value according to each time domain resource allocation record in the time domain resource allocation record set; mapping each time domain resource allocation record meeting a first condition in the time domain resource allocation record set to a reference transmission opportunity corresponding to the time domain reference value, sequentially traversing the time domain resource allocation records which are not mapped to the reference transmission opportunity in the time domain resource allocation record set, and mapping each time domain resource allocation record meeting a second condition to the reference transmission opportunity; deleting each time domain resource allocation record mapped to the reference transmission opportunity from the time domain resource allocation record set to obtain an updated time domain resource allocation record set;

wherein the first condition comprises: a start time or start symbol index is less than or equal to the time domain reference value; the second condition includes: the corresponding scheduling row of any associated first record does not have a mapped time domain resource allocation record, and the corresponding scheduling row of any associated first record and the corresponding scheduling row of any mapping time domain resource allocation record have time domain overlapping;

wherein the first record is determined based on one of a set of time domain feedback offsets and one row in a time domain resource allocation table.

Optionally, the second condition further comprises: in the scheduling row corresponding to any one of the associated first records, there is no time domain resource allocation record that is not mapped to any transmission opportunity before the corresponding time domain resource allocation record.

Optionally, the manner of determining whether there is a time-domain overlap between two scheduling rows may include 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, when traversing time domain resource allocation records in the time domain resource allocation record set that are not mapped to the reference transmission opportunity in sequence, the traversing manner includes at least one of:

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

traversing based on the starting time and/or the starting symbol index of the time domain resource allocation record;

traversing based on the ending time and/or ending symbol index of the time domain resource allocation record;

traversing based on the number of time units spanned by the time domain resource allocation record before or after the time domain reference value;

the traversal is based on a proportion of the number of time cells the time domain resource allocation record spans before and after the time domain reference value.

Optionally, the time-domain reference value includes any one of:

the earliest value of the ending time of each time domain resource allocation record in the time domain resource allocation record set;

a minimum value of an ending symbol index of each time domain resource allocation record in the set of time domain resource allocation records.

Optionally, before the following process is executed in a loop, the determining a subset of transmission opportunities corresponding to each downlink timeslot further includes:

and the terminal deletes each time domain resource allocation record conflicted with the semi-static time division duplex configuration information from the time domain resource allocation record set corresponding to each downlink time slot.

Optionally, the first determining module 101 is specifically configured to: determining a downlink time slot set of the downlink service cell, and determining a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set;

the second determining module 102 is specifically configured to: dividing the downlink time slot set into at least one downlink time slot subset, and determining a time domain resource allocation record set corresponding to each downlink time slot subset according to the time domain resource allocation record set corresponding to each downlink time slot; and determining a transmission opportunity subset corresponding to each downlink time slot subset according to the time domain resource allocation record set corresponding to each downlink time slot subset, and determining the transmission opportunity set according to the transmission opportunity subset corresponding to each downlink time slot subset.

Optionally, the second determining module 102 is further configured to: dividing the downlink time slot set into at least one downlink time slot subset by adopting at least one of the following dividing modes:

dividing based on the number of preset time slots contained in the downlink time slot subset;

dividing based on a preset pattern, wherein the preset pattern indicates a mapping relation between a downlink time slot and a downlink time slot subset;

the set of downlink timeslots is divided into a single subset of downlink timeslots.

Optionally, the second determining module 102 is further configured to: and determining a union set of the time domain resource allocation record sets corresponding to the downlink time slots in each downlink time slot subset as the time domain resource allocation record set corresponding to each downlink time slot subset.

Optionally, the first determining module 101 is specifically configured to: determining a downlink time slot set of the downlink service cell, and determining a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set;

the second determining module 102 is specifically configured to: allocating a transmission opportunity for a first downlink time slot, and determining the transmission opportunity set according to the allocated transmission opportunity; the first downlink time slot is any downlink time slot in which the corresponding time domain resource allocation record set in the downlink time slot set is a non-empty set.

Optionally, the second determining module 102 is further configured to: before allocating a transmission opportunity for the first downlink time slot, deleting each time domain resource allocation record which conflicts with the semi-static time division duplex configuration information from the time domain resource allocation record set corresponding to each downlink time slot.

Optionally, the second determining module 102 is further configured to perform any one of the following:

determining the set of allocated transmission opportunities as the set of transmission opportunities;

determining a set of other transmission opportunities except the first transmission opportunity in the allocated transmission opportunities as the transmission opportunity set; wherein the first transmission opportunity conflicts with semi-static time division duplex configuration information.

The codebook determining apparatus 100 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 type of the terminal 11 listed above, and the non-mobile terminal may be a server, a Network Attached Storage (NAS), a Personal Computer (PC), a television (television), a teller machine (teller machine), a self-service machine (kiosk), or the like, and the embodiments of the present application are not limited in particular.

The codebook determining apparatus 100 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 repeated here.

Referring to fig. 11, fig. 11 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 network device, and as shown in fig. 11, the codebook determining apparatus 110 includes:

a receiving module 110, configured to receive a HARQ-ACK semi-static codebook from a terminal; the HARQ-ACK semi-static codebook is determined by the terminal according to a transmission opportunity set corresponding to a downlink service cell, and the transmission opportunity set is determined by the terminal according to a time domain resource allocation record set corresponding to the downlink service cell.

Optionally, the codebook determining device 110 further includes:

a fourth determining module, configured to determine a time domain resource allocation record set corresponding to the downlink serving cell;

a fifth determining module, configured to determine, according to the time domain resource allocation record set, a transmission opportunity set corresponding to the downlink serving cell;

a sixth determining module, configured to determine, according to the transmission opportunity set, 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: determining a downlink time slot set corresponding to the downlink service cell, and determining a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set;

the fifth determining module is further configured to: and determining a transmission opportunity subset corresponding to each downlink time slot according to the time domain resource allocation record set corresponding to each downlink time slot, and determining the transmission opportunity set according to the transmission opportunity subset corresponding to each downlink time slot.

Optionally, the fifth determining module is further configured to: for the time domain resource allocation record set corresponding to each downlink time slot, the following processes are executed in a circulating manner until the updated time domain resource allocation record set is empty, and the mapped reference transmission opportunity set is determined as the transmission opportunity subset corresponding to each downlink time slot:

determining a time domain reference value according to each time domain resource allocation record in the time domain resource allocation record set; mapping each time domain resource allocation record meeting a first condition in the time domain resource allocation record set to a reference transmission opportunity corresponding to the time domain reference value, sequentially traversing the time domain resource allocation records which are not mapped to the reference transmission opportunity in the time domain resource allocation record set, and mapping each time domain resource allocation record meeting a second condition to the reference transmission opportunity; deleting each time domain resource allocation record mapped to the reference transmission opportunity from the time domain resource allocation record set to obtain an updated time domain resource allocation record set;

wherein the first condition comprises: a start time or start symbol index is less than or equal to the time domain reference value; the second condition includes: the corresponding scheduling row of any associated first record does not have a mapped time domain resource allocation record, and the corresponding scheduling row of any associated first record and the corresponding scheduling row of any mapping time domain resource allocation record have time domain overlapping;

wherein the first record is determined based on one of a set of time domain feedback offsets and one row in a time domain resource allocation table.

Optionally, the fourth determining module is further configured to: determining a downlink time slot set of a downlink service cell, and determining a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set;

the fifth determining module is further configured to: dividing the downlink time slot set into at least one downlink time slot subset, and determining a time domain resource allocation record set corresponding to each downlink time slot subset according to a time domain resource allocation record set corresponding to each downlink time slot; and determining a transmission opportunity subset corresponding to each downlink time slot subset according to the time domain resource allocation record set corresponding to each downlink time slot subset, and determining the transmission opportunity set according to the transmission opportunity subset corresponding to each downlink time slot subset.

Optionally, the fourth determining module is further configured to: determining a downlink time slot set of a downlink service cell, and determining a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set;

the fifth determining module is further configured to: determining the transmission opportunity set according to the transmission opportunity allocated to the first downlink time slot; the first downlink time slot is any downlink time slot in which the corresponding time domain resource allocation record set in the downlink time slot set is a non-empty set.

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

Optionally, as shown in fig. 12, an embodiment of the present application further provides a communication device 120, which includes a processor 121, a memory 122, and a program or an instruction stored in the memory 122 and executable on the processor 121, for example, when the communication device 120 is a terminal, the program or the instruction is executed by the processor 121 to implement the processes of the method embodiment shown in fig. 2, and the same technical effect can be achieved. When the communication device 120 is a network device, the program or the instruction is executed by the processor 121 to implement the processes of the method embodiment shown in fig. 9, and the same technical effects can be achieved, and are not described herein again to avoid repetition.

The embodiment of the application also provides a terminal, which comprises a processor and a communication interface, wherein the processor is used for determining a time domain resource allocation record set corresponding to the downlink serving cell; determining a transmission opportunity set corresponding to the downlink service cell according to the time domain resource allocation record set; determining the number of time domain resource allocation records corresponding to each transmission opportunity in the transmission opportunity set; and determining the HARQ-ACK semi-static codebook according to the number of the time domain resource allocation records. 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. 13 is a schematic diagram of a hardware structure of a terminal for implementing the embodiment of the present application.

The terminal 1300 includes but is not limited to: a radio frequency unit 1301, a network module 1302, an audio output unit 1303, an input unit 1304, a sensor 1305, a display unit 1306, a user input unit 1307, an interface unit 1308, a memory 1309, a processor 1310, and the like.

Those skilled in the art will appreciate that terminal 1300 may also include a power supply (e.g., a battery) for powering the various components, which may be logically coupled to processor 1310 via a power management system to manage charging, discharging, and power consumption management functions via the power management system. The terminal structure shown in fig. 13 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 1304 may include a Graphics Processing Unit (GPU) 13041 and a microphone 13042, and the Graphics processor 13041 processes image data of still pictures or videos obtained by an image capturing apparatus (such as a camera) in a video capturing mode or an image capturing mode. The display unit 1306 may include a display panel 13061, and the display panel 13061 may be configured in the form of a liquid crystal display, an organic light emitting diode, or the like. The user input unit 1307 includes a touch panel 13071 and other input devices 13072. Touch panel 13071, also known as a touch screen. The touch panel 13071 may include two parts, a touch detection device and a touch controller. Other input devices 13072 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 1301 receives downlink data from a network side device and then processes the downlink data to the processor 1310; in addition, the uplink data is sent to the network side equipment. In general, radio unit 1301 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.

Memory 1309 may be used to store software programs or instructions as well as various data. The memory 1309 may mainly include a stored program or instruction area and a stored data area, wherein the stored program or instruction area may store an operating system, an application program or instruction (such as a sound playing function, an image playing function, etc.) required for at least one function, and the like. Further, the Memory 1309 may include a high-speed random access Memory, and may also include a nonvolatile Memory, where the nonvolatile Memory may be a Read-Only Memory (ROM), a Programmable Read-Only Memory (PROM), an Erasable Programmable Read-Only Memory (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 1310 may include one or more processing units; alternatively, the processor 1310 may integrate an application processor, which mainly handles operating systems, user interfaces, and applications or instructions, etc., and a modem processor, which mainly handles wireless communications, such as a baseband processor. It will be appreciated that the modem processor described above may not be integrated into processor 1310.

The processor 1310 is configured to determine a time domain resource allocation record set corresponding to a downlink serving cell; determining a transmission opportunity set corresponding to the downlink service cell according to the time domain resource allocation record set; and determining a HARQ-ACK semi-static codebook according to the transmission opportunity set.

Optionally, the processor 1310 is further configured to: determining a downlink time slot set corresponding to the downlink service cell, and determining a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set; and determining a transmission opportunity subset corresponding to each downlink time slot according to the time domain resource allocation record set corresponding to each downlink time slot, and determining the transmission opportunity set according to the transmission opportunity subset corresponding to each downlink time slot.

Optionally, the processor 1310 is further configured to: for the time domain resource allocation record set corresponding to each downlink time slot, the following processes are executed in a circulating manner until the updated time domain resource allocation record set is empty, and the mapped reference transmission opportunity set is determined as the transmission opportunity subset corresponding to each downlink time slot: determining a time domain reference value according to each time domain resource allocation record in the time domain resource allocation record set; mapping each time domain resource allocation record meeting a first condition in the time domain resource allocation record set to a reference transmission opportunity corresponding to the time domain reference value, sequentially traversing the time domain resource allocation records which are not mapped to the reference transmission opportunity in the time domain resource allocation record set, and mapping each time domain resource allocation record meeting a second condition to the reference transmission opportunity; deleting each time domain resource allocation record mapped to the reference transmission opportunity from the time domain resource allocation record set to obtain an updated time domain resource allocation record set; wherein the first condition comprises: a start time or start symbol index is less than or equal to the time domain reference value; the second condition includes: the corresponding scheduling row of any associated first record does not have a mapped time domain resource allocation record, and the corresponding scheduling row of any associated first record and the corresponding scheduling row of any mapped time domain resource allocation record have time domain overlapping; wherein the first record is determined based on one of a set of time domain feedback offsets and one row in a time domain resource allocation table.

Optionally, the processor 1310 is further configured to: determining a downlink time slot set of the downlink service cell, and determining a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set; dividing the downlink time slot set into at least one downlink time slot subset, and determining a time domain resource allocation record set corresponding to each downlink time slot subset according to a time domain resource allocation record set corresponding to each downlink time slot; and determining a transmission opportunity subset corresponding to each downlink time slot subset according to the time domain resource allocation record set corresponding to each downlink time slot subset, and determining the transmission opportunity set according to the transmission opportunity subset corresponding to each downlink time slot subset.

Optionally, the processor 1310 is further configured to: determining a downlink time slot set of the downlink service cell, and determining a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set; allocating a transmission opportunity for a first downlink time slot, and determining the transmission opportunity set according to the allocated transmission opportunity; the first downlink time slot is any downlink time slot in which the corresponding time domain resource allocation record set in the downlink time slot set is a non-empty set.

The terminal 1300 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 repeated here.

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 by the terminal according to a transmission opportunity set corresponding to the downlink service cell, and the transmission opportunity set is determined by the terminal according to a time domain resource allocation record set corresponding to the downlink service cell. 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. 14, the network-side device 140 includes: antenna 141, radio frequency device 142, baseband device 143. The antenna 141 is connected to the radio frequency device 142. In the uplink direction, the rf device 142 receives information through the antenna 141 and transmits the received information to the baseband device 143 for processing. In the downlink direction, the baseband device 143 processes information to be transmitted and transmits the processed information to the rf device 142, and the rf device 142 processes the received information and transmits the processed information through the antenna 141.

The above-mentioned band processing means may be located in the baseband device 143, and the method performed by the network side device in the above embodiment may be implemented in the baseband device 143, where the baseband device 143 includes the processor 144 and the memory 145.

The baseband device 143 may include, for example, at least one baseband board, on which a plurality of chips are disposed, as shown in fig. 14, where one of the chips, for example, the processor 144, is connected to the memory 145 to call up the program in the memory 145 to perform the network-side device operation shown in the above method embodiment.

The baseband device 143 may further include a network interface 146 for exchanging information with the radio frequency device 142, 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 145 and capable of being executed on the processor 144, the processor 144 invokes the instructions or programs in the memory 145 to execute the methods executed by the modules shown in fig. 11, and achieve the same technical effects, which are not described herein for avoiding 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 codebook determination method embodiment, and can achieve the same technical effect, and the description is omitted here 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 above description of the embodiments, those skilled in the art will clearly understand that the method of the above embodiments can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware, but in many cases, the former is a better implementation manner. 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 present embodiments are not limited to those precise embodiments, which are intended to be illustrative rather than restrictive, and that various changes and modifications may be effected therein by one skilled in the art without departing from the scope of the appended claims.

Claims (26)

1. A method of codebook determination, comprising:

a terminal determines a time domain resource allocation record set corresponding to a downlink service cell;

the terminal determines a transmission opportunity set corresponding to the downlink service cell according to the time domain resource allocation record set;

and the terminal determines a hybrid automatic repeat request-acknowledgement HARQ-ACK semi-static codebook according to the transmission opportunity set.

2. The method of claim 1, wherein the determining the set of time domain resource allocation records corresponding to the downlink serving cell comprises:

the terminal determines a downlink time slot set corresponding to the downlink service cell and determines a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set;

wherein, the determining the transmission opportunity set corresponding to the downlink serving cell according to the time domain resource allocation record set includes:

and the terminal determines a transmission opportunity subset corresponding to each downlink time slot according to the time domain resource allocation record set corresponding to each downlink time slot, and determines the transmission opportunity set according to the transmission opportunity subset corresponding to each downlink time slot.

3. The method according to claim 2, wherein the determining the subset of transmission opportunities corresponding to each downlink timeslot according to the set of time domain resource allocation records corresponding to each downlink timeslot comprises:

the terminal circularly executes the following processes aiming at the time domain resource allocation record set corresponding to each downlink time slot until the updated time domain resource allocation record set is empty, and determines the mapped reference transmission opportunity set as a transmission opportunity subset corresponding to each downlink time slot:

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

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

deleting each time domain resource allocation record mapped to the reference transmission opportunity from the time domain resource allocation record set to obtain an updated time domain resource allocation record set;

wherein the first condition comprises: a start time or start symbol index is less than or equal to the time domain reference value; the second condition includes: the corresponding scheduling row of any associated first record does not have a mapped time domain resource allocation record, and the corresponding scheduling row of any associated first record and the corresponding scheduling row of any mapping time domain resource allocation record have time domain overlapping;

wherein the first record is determined based on one of a set of time domain feedback offsets and one row in a time domain resource allocation table.

4. The method of claim 3, wherein the second condition further comprises: in the scheduling row corresponding to any one of the associated first records, there is no time domain resource allocation record that is not mapped to any transmission opportunity before the corresponding time domain resource allocation record.

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

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.

6. The method of claim 3, wherein when traversing time domain resource allocation records in the set of time domain resource allocation records that are not mapped to the reference transmission opportunity in turn, the traversing comprises at least one of:

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

traversing based on the starting time and/or the starting symbol index of the time domain resource allocation record;

traversing based on the ending time and/or ending symbol index of the time domain resource allocation record;

traversing based on the number of time units spanned before or after the time domain reference value by the time domain resource allocation record;

the traversal is based on a proportion of the number of time cells the time domain resource allocation record spans before and after the time domain reference value.

7. The method of claim 3, wherein the time-domain reference value comprises any one of:

the earliest value of the ending time of each time domain resource allocation record in the time domain resource allocation record set;

a minimum value of an ending symbol index of each time domain resource allocation record in the set of time domain resource allocation records.

8. The method of claim 3, wherein before the cyclically performing the following procedure, the determining the corresponding subset of transmission opportunities for each downlink timeslot further comprises:

and the terminal deletes each time domain resource allocation record conflicted with the semi-static time division duplex configuration information from the time domain resource allocation record set corresponding to each downlink time slot.

9. The method of claim 1, wherein the determining a set of time domain resource allocation records corresponding to a downlink serving cell comprises:

the terminal determines a downlink time slot set of the downlink service cell and determines a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set;

wherein, the determining the transmission opportunity set corresponding to the downlink serving cell according to the time domain resource allocation record set includes:

the terminal divides the downlink time slot set into at least one downlink time slot subset, and determines a time domain resource allocation record set corresponding to each downlink time slot subset according to the time domain resource allocation record set corresponding to each downlink time slot;

and the terminal determines a transmission opportunity subset corresponding to each downlink time slot subset according to the time domain resource allocation record set corresponding to each downlink time slot subset, and determines the transmission opportunity set according to the transmission opportunity subset corresponding to each downlink time slot subset.

10. The method of claim 9, wherein the dividing the set of downlink timeslots into at least one subset of downlink timeslots comprises:

the terminal divides the downlink time slot set into at least one downlink time slot subset by adopting at least one of the following dividing modes:

dividing the time slots based on the number of preset time slots contained in the downlink time slot subset;

dividing based on a preset pattern, wherein the preset pattern indicates a mapping relation between a downlink time slot and a downlink time slot subset;

the set of downlink timeslots is divided into a single subset of downlink timeslots.

11. The method according to claim 9, wherein said determining a set of time domain resource allocation records corresponding to each downlink timeslot subset according to the set of time domain resource allocation records corresponding to each downlink timeslot comprises:

and the terminal determines the union set of the time domain resource allocation record sets corresponding to the downlink time slots in each downlink time slot subset as the time domain resource allocation record set corresponding to each downlink time slot subset.

12. The method of claim 1, wherein the determining the set of time domain resource allocation records corresponding to the downlink serving cell comprises:

the terminal determines a downlink time slot set of the downlink service cell and determines a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set;

wherein, the determining the transmission opportunity set corresponding to the downlink serving cell according to the time domain resource allocation record set includes:

the terminal allocates a transmission opportunity for a first downlink time slot, and determines the transmission opportunity set according to the allocated transmission opportunity; the first downlink time slot is any downlink time slot in which the corresponding time domain resource allocation record set in the downlink time slot set is a non-empty set.

13. The method of claim 12, wherein before allocating the transmission opportunity for the first downlink timeslot, the determining a transmission opportunity set corresponding to the downlink serving cell according to the time domain resource allocation record set further comprises:

and the terminal deletes each time domain resource allocation record conflicted with the semi-static time division duplex configuration information from the time domain resource allocation record set corresponding to each downlink time slot.

14. The method of claim 12, wherein determining the set of transmission opportunities according to the allocated transmission opportunities comprises any one of:

determining the set of allocated transmission opportunities as the set of transmission opportunities;

determining a set of other transmission opportunities except the first transmission opportunity in the allocated transmission opportunities as the transmission opportunity set; wherein the first transmission opportunity conflicts with semi-static time division duplex configuration information.

15. The method of claim 1, further comprising:

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

16. 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 by the terminal according to a transmission opportunity set corresponding to a downlink service cell, and the transmission opportunity set is determined by the terminal according to a time domain resource allocation record set corresponding to the downlink service cell.

17. The method of claim 16, further comprising:

the network side equipment determines a time domain resource allocation record set corresponding to a downlink service cell;

the network side equipment determines a transmission opportunity set corresponding to the downlink service cell according to the time domain resource allocation record set;

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 transmission opportunity set.

18. The method of claim 17, wherein the determining the set of time domain resource allocation records corresponding to the downlink serving cell comprises:

the network side equipment determines a downlink time slot set corresponding to the downlink service cell and determines a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set;

wherein, the determining the transmission opportunity set corresponding to the downlink serving cell according to the time domain resource allocation record set includes:

and the network side equipment determines a transmission opportunity subset corresponding to each downlink time slot according to the time domain resource allocation record set corresponding to each downlink time slot, and determines the transmission opportunity set according to the transmission opportunity subset corresponding to each downlink time slot.

19. The method of claim 18, wherein the determining the subset of transmission opportunities corresponding to each downlink timeslot according to the set of time domain resource allocation records corresponding to each downlink timeslot comprises:

the network side equipment circularly executes the following processes aiming at the time domain resource allocation record set corresponding to each downlink time slot until the updated time domain resource allocation record set is empty, and determines the mapped reference transmission opportunity set as the transmission opportunity subset corresponding to each downlink time slot:

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

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

deleting each time domain resource allocation record mapped to the reference transmission opportunity from the time domain resource allocation record set to obtain an updated time domain resource allocation record set;

wherein the first condition comprises: a start time or start symbol index is less than or equal to the time domain reference value; the second condition includes: the corresponding scheduling row of any associated first record does not have a mapped time domain resource allocation record, and the corresponding scheduling row of any associated first record and the corresponding scheduling row of any mapped time domain resource allocation record have time domain overlapping;

wherein the first record is determined based on one of a set of time domain feedback offsets and one row in a time domain resource allocation table.

20. The method of claim 17, wherein the determining the set of time domain resource allocation records corresponding to the downlink serving cell comprises:

the network side equipment determines a downlink time slot set of the downlink service cell and determines a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set;

wherein, the determining the transmission opportunity set corresponding to the downlink serving cell according to the time domain resource allocation record set includes:

the network side equipment divides the downlink time slot set into at least one downlink time slot subset, and determines a time domain resource allocation record set corresponding to each downlink time slot subset according to a time domain resource allocation record set corresponding to each downlink time slot;

and the network side equipment determines a transmission opportunity subset corresponding to each downlink time slot subset according to the time domain resource allocation record set corresponding to each downlink time slot subset, and determines the transmission opportunity set according to the transmission opportunity subset corresponding to each downlink time slot subset.

21. The method of claim 17, wherein the determining the set of time domain resource allocation records corresponding to the downlink serving cell comprises:

the network side equipment determines a downlink time slot set of the downlink service cell and determines a time domain resource allocation record set corresponding to each downlink time slot in the downlink time slot set;

wherein, the determining the transmission opportunity set corresponding to the downlink serving cell according to the time domain resource allocation record set includes:

the network side equipment determines the transmission opportunity set according to the transmission opportunity allocated to the first downlink time slot; the first downlink time slot is any downlink time slot in which the corresponding time domain resource allocation record set in the downlink time slot set is a non-empty set.

22. A codebook determination device, comprising:

the first determining module is used for determining a time domain resource allocation record set corresponding to the downlink serving cell;

a second determining module, configured to determine, according to the time domain resource allocation record set, a transmission opportunity set corresponding to the downlink serving cell;

a third determining module, configured to determine a HARQ-ACK semi-static codebook according to the transmission opportunity set.

23. 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 according to a transmission opportunity set corresponding to a downlink service cell, and the transmission opportunity set is determined by the terminal according to a time domain resource allocation record set corresponding to the downlink service cell.

24. 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 of the claims 1 to 15.

25. 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 16 to 21.

26. A readable storage medium, on which a program or instructions are stored, which program or instructions, when executed by a processor, carry out the steps of the codebook determination method as defined in any one of claims 1 to 15 or carry out the steps of the codebook determination method as defined in any one of claims 16 to 21.

Images