Codebook determination method, apparatus, terminal and network-side device

Abstract

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

Description

TECHNICAL FIELD

[0001] The present application belongs to the technical field of communication, and particularly relates to a codebook determination method and device, a terminal and a network side device. BACKGROUND

[0002] In the prior art, when constructing a hybrid automatic repeat request-acknowledgement (HARQ-ACK) semi-static codebook, a terminal usually obtains a transmission opportunity set for determining a HARQ-ACK bit sequence corresponding to the HARQ-ACK semi-static codebook based on a starting symbol corresponding to each downlink slot in a given downlink slot set of a serving cell and a set of symbol length indicators (SLIVs). However, this method for constructing a HARQ-ACK semi-static codebook does not consider that a time domain resource allocation table is always scheduled as a whole according to one row. In this case, when constructing a codebook supporting Multi-Physical Downlink Shared Channel (PDSCH) scheduling, the method does not consider the correlation between the SLIVs corresponding to / contained in a row, and it is actually impossible to schedule two rows with any overlap in the time domain at the same time after scheduling, so that there are often redundant transmission opportunities in the obtained transmission opportunity set, and thus there are redundant HARQ-ACK bits in the constructed HARQ-ACK semi-static codebook. SUMMARY

[0003] Embodiments of the present application provide a codebook determination method, device, terminal and network side device to solve the problem of redundant HARQ-ACK bits in the constructed HARQ-ACK semi-static codebook.

[0004] In a first aspect, a codebook determination method is provided, comprising:

[0005] The terminal traverses to generate a first record set based on a time domain feedback offset set and a time domain resource allocation table, each first record in the first record set being determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table;

[0006] The terminal determines a transmission opportunity mapped by each first record in the first record set;

[0007] The terminal determines a number of candidate PDSCH reception opportunities corresponding to the transmission opportunity;

[0008] The terminal determines a HARQ-ACK semi-static codebook according to the number of candidate PDSCH reception opportunities.

[0009] In a second aspect, a codebook determination method is provided, comprising:

[0010] The network-side device receives a HARQ-ACK semi-static codebook from a terminal; wherein the HARQ-ACK semi-static codebook is generated by the terminal based on a time domain feedback offset set and a time domain resource allocation table, a first record set is generated by traversing, each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, a transmission opportunity mapped by each first record is determined, a number of candidate PDSCH reception opportunities corresponding to the transmission opportunity is determined, and the HARQ-ACK semi-static codebook is determined according to the number of candidate PDSCH reception opportunities.

[0011] In a third aspect, a codebook determination apparatus is provided, comprising:

[0012] The generating module is configured to generate a first record set by traversing based on a time domain feedback offset set and a time domain resource allocation table, each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table;

[0013] The first determining module is configured to determine a transmission opportunity mapped by each first record in the first record set;

[0014] The second determining module is configured to determine a number of candidate PDSCH reception opportunities corresponding to the transmission opportunity;

[0015] The third determining module is configured to determine a HARQ-ACK semi-static codebook according to the number of candidate PDSCH reception opportunities.

[0016] In a fourth aspect, a codebook determination apparatus is provided, comprising:

[0017] The receiving module is configured to receive a HARQ-ACK semi-static codebook from a terminal; wherein the HARQ-ACK semi-static codebook is generated by the terminal based on a time domain feedback offset set and a time domain resource allocation table, a first record set is generated by traversing, each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, a transmission opportunity mapped by each first record is determined, a number of candidate PDSCH reception opportunities corresponding to the transmission opportunity is determined, and the HARQ-ACK semi-static codebook is determined according to the number of candidate PDSCH reception opportunities.

[0018] In a fifth aspect, a terminal is provided, comprising a processor, a memory, and a program or instructions stored in the memory and executable on the processor, when executed by the processor, the program or instructions implement the steps of the method according to the first aspect.

[0019] In a sixth aspect, a terminal is provided, comprising a processor and a communication interface, wherein the processor is configured to generate a first record set based on a time domain feedback offset set and a time domain resource allocation table, each first record in the first record set being determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table; determine a transmission opportunity mapped by the each first record; determine a number of candidate PDSCH reception opportunities corresponding to the transmission opportunity by the terminal; and determine a HARQ-ACK semi-static codebook according to the number of candidate PDSCH reception opportunities.

[0020] In a seventh aspect, a network side device is provided, comprising a processor, a memory, and a program or instructions stored in the memory and executable in the processor, the program or instructions, when executed by the processor, implement the steps of the method according to the second aspect.

[0021] In an eighth aspect, a network side device is provided, comprising a processor and a communication interface, wherein the communication interface is configured to receive a HARQ-ACK semi-static codebook from a terminal, the HARQ-ACK semi-static codebook being determined by the terminal according to a number of candidate PDSCH reception opportunities corresponding to a transmission opportunity, the number of candidate PDSCH reception opportunities being determined by the terminal after generating a first record set based on a time domain feedback offset set and a time domain resource allocation table, each first record in the first record set being determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, and determining the transmission opportunity mapped by the each first record.

[0022] In a ninth aspect, a readable storage medium is provided, the readable storage medium storing a program or instructions, the program or instructions, when executed by a processor, implement the steps of the method according to the first aspect, or implement the steps of the method according to the second aspect.

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

[0024] In an eleventh aspect, a computer program / program product is provided, the computer program / program product being stored in a non-transitory storage medium, the program / program product being executed by at least one processor to implement the steps of the method according to the first aspect, or implement the steps of the method according to the second aspect.

[0025] In an embodiment of the present application, the terminal can traverse and generate a first record set based on a time domain feedback offset set and a time domain resource allocation table. Each first record in the first record set is determined based on a time domain feedback offset in the time domain feedback offset set and a row in the time domain resource allocation table. The transmission opportunity mapped by each first record is determined, the number of candidate PDSCH reception opportunities corresponding to the transmission opportunity is determined, and the HARQ-ACK semi-static codebook is determined based on the determined number of candidate PDSCH reception opportunities. Thus, the transmission opportunity can be uniformly determined based on the time domain feedback offset and the records in the row of the time domain resource allocation table. Therefore, when constructing a codebook supporting Multi-PDSCH scheduling, the DL Slot boundary is not paid attention to or broken, and the correlation between the SLIVs corresponding to / contained in a row in the time domain resource allocation table is considered, thereby reducing / avoiding redundant transmission opportunities, reducing / avoiding redundant HARQ-ACK bits in the HARQ-ACK semi-static codebook, and thus improving the HARQ-ACK feedback efficiency. BRIEF DESCRIPTION OF THE DRAWINGS

[0026] Figure 1 is a block diagram of a wireless communication system to which embodiments of the present application may be applied;

[0027] Figure 2 This is a flowchart of a codebook determination method provided by an embodiment of the present application;

[0028] Figure 3 This is one of the time slot diagrams in the example of this application;

[0029] Figure 4 This is the second time slot diagram in the example of this application;

[0030] Figure 5 This is the third time slot diagram in the example of this application;

[0031] Figure 6 This is a flowchart of another codebook determination method provided by an embodiment of the present application;

[0032] Figure 7 This is a schematic structural diagram of a codebook determination device provided in an embodiment of the present application;

[0033] Figure 8 This is a schematic structural diagram of a codebook determination device provided in an embodiment of the present application;

[0034] Figure 9 This is a schematic diagram of the structure of a communication device provided in an embodiment of the present application;

[0035] Figure 10 This is a schematic diagram of the structure of a terminal provided in an embodiment of the present application;

[0036] Figure 11 is a structural schematic diagram of a network side device provided by an embodiment of the present application. DETAILED DESCRIPTION

[0037] The technical solutions in the embodiments of the present application will be clearly described below with reference to the drawings in the embodiments of the present application. Obviously, the described embodiments are some of the embodiments of the present application, rather than all the embodiments of the present application. Based on the embodiments in the present application, all other embodiments obtained by a person of ordinary skill in the art belong to the scope of protection of the present application.

[0038] The terms "first", "second", and the like in the specification and claims of the present application are used to distinguish similar objects, and are not used to describe a specific order or sequence. It should be understood that the terms used in this way can be interchanged under appropriate circumstances, so that the embodiments of the present application can be implemented in an order other than that illustrated or described herein, and the objects distinguished by "first", "second" are generally of a kind, and are not limited to the number of objects, for example, the first object can be one or more. In addition, "and / or" in the specification and claims means at least one of the connected objects, and the character " / " generally represents an "or" relationship between the front and rear associated objects.

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

[0040] Figure 1 A block diagram of a wireless communication system to which embodiments of the present application can be applied is shown. The wireless communication system includes a terminal 11 and a network side device 12. The terminal 11 can also be referred to as a terminal device or a user terminal (User Equipment, UE). The terminal 11 can be a terminal side device such as a mobile phone, a tablet personal computer, a laptop computer, a personal digital assistant (PDA), a palm computer, a netbook, an ultra-mobile personal computer (UMPC), a mobile Internet device (MID), an augmented reality (AR) / virtual reality (VR) device, a robot, a wearable device, a vehicle-mounted device (VUE), a pedestrian terminal (PUE), a smart home (a home device with a wireless communication function, such as a refrigerator, a television, a washing machine, or furniture, etc.), and the like. The wearable device includes a smart watch, a smart bracelet, a smart earphone, smart glasses, smart jewelry (a smart bracelet, a smart necklace, a smart ring, a smart necklace, a smart ankle bracelet, a smart ankle chain, etc.), a smart wristband, smart clothing, a game console, and the like. It should be noted that the specific type of the terminal 11 is not limited in the embodiments of the present application. The network side device 12 can be a base station or a core network. The base station can be referred to as a node B, an evolved node B, an access point, a base transceiver station (BTS), a radio base station, a radio transceiver, a basic service set (BSS), an extended service set (ESS), a node B, an evolved node B (eNB), a home node B, a home evolved node B, a WLAN access point, a WiFi node, a transmitting receiving point (TRP), or some other appropriate terminology in the art, as long as the same technical effects are achieved. The base station is not limited to a specific technical term, and it should be noted that only a base station in an NR system is taken as an example in the embodiments of the present application, but the specific type of the base station is not limited.

[0041] The codebook determination method, apparatus, terminal and network side device provided by the embodiments of the present application will be described in detail below in combination with the accompanying drawings and some embodiments and application scenarios.

[0042] Please refer to Figure 2 , Figure 2 is a flowchart of a codebook determination method provided by an embodiment of the present application, which is performed by a terminal, as shown in Figure 2 , the method comprises the following steps:

[0043] Step 21: The terminal traverses to generate a first record set based on a time domain feedback offset set and a time domain resource allocation table.

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

[0045] It should be noted that one example form of the time domain feedback offset set is K1 Set, and one 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 relative to the time domain position of PDSCH transmission. The unit of the offset is time unit, which can be slot or sub-slot. The time domain feedback offset mentioned later can be described by taking K1 as an example, but this does not limit other forms of representation of the time domain feedback offset.

[0046] For example, the first record can be represented as a (K1 Index, r) record, or equivalently as a (K1, row) record. K1 Index can be understood as the index of K1 Set. K1 can be understood as a certain K1 in K1 Set, which can be understood as K1 in K1 Set without repetition at present. r can be understood as the index of the row of TDRA Table, and the row is a certain row in TDRA Table.

[0047] Optionally, the above-mentioned time domain feedback offset set and time domain resource allocation table TDRA Table can be configured by a network side device, or can be specified by a protocol. For example, the K1 Set corresponding to the downlink control information (Downlink Control Information, DCI) format 1.0, i.e. DCI format 1_0, is directly specified by the protocol.

[0048] The above iteration can be understood as follows: based on each K1 in the K1 Set and each row in the TDRA Table, a corresponding (K1, row) record is determined, and these (K1, row) records form a (K1, row) record set. Each (K1, row) record corresponds to a single scheduling row. The scheduling row here can be understood as a certain TDRA Table row giving a specific position in the time domain based on a certain K1, thereby determining the start and end time positions of each SLIV in this TDRA Table row, and the union of the time periods spanned by the start and end time positions of each SLIV in this row is taken as the time period or interval spanned by this row in the time domain, which can be used to determine whether there is any time domain overlap between rows and / or whether any SLIV included / corresponding to this row conflicts with the semi-static last symbol semi-static uplink slot Semi-static UL symbol.

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

[0050] Optionally, for each (K1, row) record in the (K1, row) record set, the list of SLIVs corresponding / contained by the scheduling row corresponding to the (K1, row) record can be modified / updated based on the case of conflict with the Semi-static UL symbol. For example, for each SLIV in the list of SLIVs corresponding / contained by the scheduling row corresponding to a certain (K1, row) record, when this SLIV conflicts with the Semi-static UL symbol, it can be deleted from the SLIV list. When the list of SLIVs corresponding / contained by the scheduling row corresponding to a certain (K1, row) record is empty, this (K1, row) record can be directly deleted from the (K1, row) record set.

[0051] Step 22: The terminal determines a transmission opportunity corresponding to each first record in the first record set.

[0052] In some embodiments, the transmission opportunity Occasion can be a physical downlink shared channel (PDSCH) reception opportunity.

[0053] Step 23: The terminal determines the number of candidate PDSCH reception opportunities corresponding to the transmission opportunity.

[0054] It should be noted that the candidate PDSCH reception occasion can be distinguished into two cases:

[0055] 1) Each candidate PDSCH reception occasion corresponds to a single time domain resource allocation record;

[0056] 2) Each candidate PDSCH reception occasion corresponds to a single downlink slot (DL Slot), and in this case, only a single PDSCH transmission is allowed to be scheduled or configured in each DL Slot.

[0057] As a typical form, the time domain resource allocation record in the embodiment can be a start symbol and a symbol length indication (SLIV). To better understand the technical solution of the embodiment of the present application, the time domain resource allocation record in the following embodiment will be specifically described by taking SLIV as an example. Of course, the time domain resource allocation record can also be in other forms, and the present application does not make too many examples.

[0058] Step 24: The terminal determines a HARQ-ACK semi-static codebook according to the number of candidate PDSCH reception occasions.

[0059] It should be noted that the HARQ-ACK semi-static codebook is constructed / determined from the perspective of possible transmission opportunities, which is based on a configured time domain feedback offset set such as K1 Set, and a time unit in which a HARQ-ACK feedback time, i.e., a semi-static codebook transmission, is located. A corresponding HARQ-ACK bit is reserved for each possible transmission opportunity. Each possible transmission opportunity is determined based on a high-level configured time domain resource allocation table such as a TDRA Table. If the terminal does not actually receive / detect corresponding downlink information such as a 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.

[0060] The codebook determination method of the embodiments of the present application can be used to determine the transmission opportunities based on the time domain feedback offset set and the time domain resource allocation table, traverse to generate a first record set, each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, determine the transmission opportunity mapped by each first record, determine the number of candidate PDSCH reception opportunities corresponding to the transmission opportunity, and determine the HARQ-ACK semi-static codebook according to the determined number of candidate PDSCH reception opportunities. In this way, the transmission opportunities can be determined based on the records in the time domain feedback offset and the rows in the time domain resource allocation table, so that when constructing the codebook supporting Multi-PDSCH scheduling, the DL Slot boundary is not concerned or broken, the correlation between the SLIVs corresponding to / included in a row in the time domain resource allocation table is considered, and the like, so that the redundant transmission opportunities are reduced / avoided, the redundant HARQ-ACK bits in the HARQ-ACK semi-static codebook are reduced / avoided, and the HARQ-ACK feedback efficiency is improved.

[0061] Optionally, a typical occasion set determination method can be selected as follows: for the SLIV set corresponding to a certain DL Slot, the SLIV set is pruned based on the conflict with the semi-static UL symbol, when there are still remaining SLIVs, a remaining SLIV set is formed, if the UE supports receiving more than one PDSCH in a single DL Slot, the remaining SLIV set is grouped based on the time domain overlap rule, each SLIV group is mapped to a single occasion, and the occasion 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 SLIV set directly corresponds to a single occasion, and the occasion subset corresponding to the DL Slot is determined, that is, only contains a single occasion. Then, the occasion subsets corresponding to the respective DL Slots are taken as the union set, for example, based on the order of the DL Slots, the occasion subsets corresponding to the respective DL Slots are concatenated at the head and tail, and the occasion set used to determine the HARQ-ACK bit sequence corresponding to the Type-1 codebook is obtained.

[0062] In some embodiments, the terminal can traverse to determine the transmission opportunity mapped by each first record according to a predefined direction when determining the transmission opportunity mapped by each first record. The predefined direction can be the direction of time advancement, or the direction of time unit number / index increment.

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

[0064] Optionally, when determining the transmission opportunity mapped by each first record, the terminal can perform the following process in a loop until the updated first record set is empty, and determine the transmission opportunity mapped by each first record according to the mapped reference transmission opportunity:

[0065] S1: determining the time domain reference value according to each first record in the first record set;

[0066] S2: mapping each first record in the first record set that satisfies the first condition to the reference transmission opportunity corresponding to the time domain reference value, and sequentially traversing the first records in the first record set that have not been mapped to the reference transmission opportunity, and mapping each first record that satisfies the second condition to the reference transmission opportunity;

[0067] S3: deleting each first record that has been mapped to the reference transmission opportunity from the first record set to obtain an updated first record set.

[0068] It can be understood that S1 is performed only when the first record set is not empty, that is, the time domain reference value is determined according to each SLIV in the first record set. In the process of performing S1 to S3 in a loop for the first record, the first record set is always in the process of updating / deleting.

[0069] In some embodiments, when performing S2 and S3, the terminal can first map each (K1, row) record in the (K1, row) record set that satisfies the first condition to the reference Occasion; then, map each (K1, row) record in the (K1, row) record set that satisfies the second condition and has not been mapped, that is, exclude each (K1, row) record that has been mapped to the reference Occasion, to the reference Occasion; and then, delete each (K1, row) record that has been mapped to the reference Occasion from the (K1, row) record set to update the (K1, row) record set.

[0070] In some embodiments, when performing S2 and S3, the terminal can first map each (K1, row) record satisfying the first condition in the (K1, row) record set to the reference Occasion, and delete the mapped (K1, row) record from the (K1, row) record set; then map each (K1, row) record satisfying the second condition in the updated (K1, row) record set to the reference Occasion, and delete the mapped (K1, row) record from the (K1, row) record set. That is, the (K1, row) record that has been judged to be mapped to the reference Occasion is immediately deleted from the (K1, row) record set.

[0071] Optionally, the time domain reference value can include any of the following:

[0072] The earliest value of the ending time of the scheduling row corresponding to each first record in the first record set; that is, the ending time of the scheduling row corresponding to the first record with the earliest ending time of the scheduling row in the first record set.

[0073] The smallest value (smallest last OFDM symbol index) of the ending symbol index of the scheduling row corresponding to each first record in the first record set; that is, the ending symbol index of the scheduling row corresponding to the first record with the smallest ending symbol index of the scheduling row in the first record set.

[0074] That is, the time domain reference value in the present embodiment can be optionally a reference time or a reference symbol index. For determining the time domain reference value, when using the ending time, the absolute ending time of the scheduling row corresponding to each first record in the first record set can be used; or when using the ending symbol index, the position or index of the last symbol of the scheduling row corresponding to each first record in the first record set can be used. The purpose of using this way to determine the time domain reference value is to determine the number of Occasions that can be most possibly transmitted in parallel within the HARQ-ACK feedback window, or in other words, the maximum number of Occasions that do not overlap in time domain.

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

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

[0077] It should be noted that after the first records in the first record set that satisfy the first condition have been mapped to the reference Occasion, all the first records mapped to the reference Occasion can constitute a reference first record subset. At this time, the first records in the first record set that have not been mapped are further traversed to determine whether they satisfy the second condition, and when they satisfy the second condition, they are mapped to the reference Occasion and added to the reference first record subset. Subsequently, when the other remaining first records are traversed, the reference first record subset needs to be updated in real time.

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

[0079] Optionally, the determination of whether there is time domain overlap between two scheduling rows, that is, the determination of whether there is time domain overlap between any two scheduling rows, can include any one of the following:

[0080] 1) When there is time domain overlap between the two scheduling rows at any position, it is determined that there is time domain overlap between the two scheduling rows; that is, as long as the given two scheduling rows have time domain overlap at any position, that is, the time periods or intervals spanned by the two scheduling rows at least partially overlap, it is determined that there is time domain overlap between the two scheduling rows;

[0081] 2) When both scheduling rows have time domain resource allocation records such as SLIVs in at least one same downlink time slot, it is determined that there is time domain overlap between the two scheduling rows; that is, as long as the given two scheduling rows have SLIVs in at least one same DL Slot, it is determined that there is time domain overlap between the two scheduling rows, regardless of whether there is time domain overlap between the SLIVs from the two scheduling rows in the DL Slot.

[0082] It should be noted that for the determination manner in 1) above, the number of PDSCH transmissions scheduled or configured in a single DL Slot can be allowed to exceed 1. When the number of PDSCH transmissions scheduled or configured in each DL Slot is not allowed to exceed 1, that is, only a single PDSCH transmission is allowed to be scheduled or configured in each DL Slot, the determination manner in 2) above needs to be used, and the reason for using the determination manner 2) can be understood as follows: if scheduling row 1 is actually scheduled or configured, because a PDSCH transmission has been scheduled or configured in the DL Slot in which overlap occurs, another scheduling row 2 that meets the conditions cannot be scheduled or configured.

[0083] Optionally, when determining whether there is time domain overlap between two scheduling rows, whether the SLIVs that conflict with the semi-static time division duplex configuration information are included in the time domain overlap determination can be determined in any of the following manners:

[0084] Manner 1: The SLIVs that conflict with the semi-static time division duplex configuration information are included in the determination of whether there is time domain overlap between two scheduling rows.

[0085] Manner 2: The SLIVs that conflict with the semi-static time division duplex configuration information are not included in the determination of whether there is time domain overlap between two scheduling rows.

[0086] It should be noted that an example form of the semi-static time division duplex configuration information is a semi-static uplink symbol (Semi-static UL symbol). In this article, the conflict between the SLIV and the semi-static time division duplex configuration information is described by taking the conflict between the SLIV and the Semi-static UL symbol as an example, but it does not limit the use of the scheme in this application when the SLIV and other semi-static time division duplex configuration information conflict (and cause the physical channel corresponding to the SLIV to be unable to be actually transmitted).

[0087] In some embodiments, the conflict between the SLIV and the Semi-static UL symbol can be understood as at least one symbol corresponding to the SLIV being semi-statically configured as an UL symbol.

[0088] For the above-mentioned method 1, it can be understood that when determining whether there is a time domain overlap between two scheduling rows, the influence of the semi-static UL symbol is not considered. At this time, the overlap between the determined scheduling rows may be more than when using method 2, so that more first records can share Occasion, that is, mapped to the same Occasion, thereby sharing the HARQ-ACK bit corresponding to this Occasion in the HARQ-ACK codebook, but there may be a problem of HARQ-ACK bit conflict, that is, when two or more first records mapped to the same Occasion are actually scheduled, it will cause problems in setting the HARQ-ACK bit corresponding to the Occasion. In this case, it can be considered to set the corresponding HARQ-ACK bit based on the decoding result corresponding to the PDSCH transmission corresponding to a single first record, or to bundle the decoding results corresponding to all detected PDSCH transmissions corresponding to the Occasion and set the HARQ-ACK bit corresponding to this Occasion.

[0089] In the above method 2, since the SLIV that conflicts with the semi-static UL symbol is not actually scheduled and does not need to feedback the corresponding HARQ-ACK, it does not affect the time domain overlap judgment between scheduling rows. This time domain overlap judgment can also be understood as a scheduling conflict judgment. In this case, only the SLIV that does not conflict with the semi-static UL symbol participates in the time domain overlap judgment between scheduling rows.

[0090] It is understandable that the above overlap determination methods 1 and 2 are applicable regardless of whether the number of PDSCH transmissions scheduled or configured in a single DL Slot is allowed to exceed 1, or when scheduling or configuring more than 1 PDSCH transmission in each DL Slot is not allowed.

[0091] Optionally, the order of traversal for determining whether each unmapped first record meets the second condition may affect the determination of the mapping relationship between the first record and the Occasion, thereby affecting the size of the HARQ-ACK codebook. When sequentially traversing the first record in the first record set that is not mapped to the reference transmission opportunity, the traversal method includes at least one of the following:

[0092] 1) Traverse based on the time domain feedback offset index and / or row index corresponding to the first record.

[0093] For example, 1) can be expressed as traversing the K1 Index corresponding to the (K1, row) record, such as the index of the K1 Set, and / or r, the index of the TDRA Table row. The traversal of K1 Index and / or r can be performed from small to large or from large to small, or from small to large or from large to small, or first traverse K1 Index and then traverse r as needed, or first traverse r and then traverse K1 Index as needed.

[0094] 2) Traverse based on the start time and / or start symbol index of the schedule row corresponding to the first record.

[0095] In some embodiments, when traversing based on the start time / start symbol index of the schedule row corresponding to the (K1, row) record, it can be considered that the earlier the (K1, row) record starts, the higher the priority for mapping the Occasion. Therefore, the traversal can be performed in ascending order based on the start time / start symbol index. Alternatively, a descending order traversal can also be used.

[0096] In some embodiments, when there are more than one (K1, row) records corresponding to the same or equal start time / start symbol index of the scheduling rows, the traversal method 1) can be further used for these (K1, row) records to determine the traversal order between them.

[0097] 3) Traverse based on the end time and / or end symbol index of the schedule row corresponding to the first record.

[0098] In some embodiments, when traversing based on the end time / end symbol index of the scheduling row corresponding to the (K1, row) record, it can be considered that the (K1, row) record that ends earlier has higher priority in mapping the Occasion to avoid interfering with the mapping of the later (K1, row) records. Alternatively, (K1, row) records with relatively close / concentrated time domain spans can be mapped to the same Occasion as much as possible to reduce the number of ultimately mapped Occasions. Therefore, ascending traversal can be performed based on the end time / end symbol index. Alternatively, descending traversal can also be used.

[0099] In some embodiments, when there are more than one (K1, row) records corresponding to the same or equal end time / end symbol index of the scheduling rows, the traversal method 1) can be further used for these (K1, row) records to determine the traversal order between them.

[0100] 4) Traverse based on the number of SLIVs corresponding to the schedule row corresponding to the first record before or after the time domain reference value.

[0101] Optionally, ascending traversal or descending traversal may be adopted in 4), and traversal method 1) may be partially introduced / combined when necessary.

[0102] 5) Traverse based on the number of time units spanned by the scheduling line corresponding to the first record before or after the time domain reference value.

[0103] Optionally, the time unit here can be a time slot or a sub-time slot. For the number of time units spanned, when the SLIV corresponding / contained by the scheduling line is discontinuous, the time unit located between the adjacent two SLIVs corresponding / contained by the scheduling line and not occupied can be included in the above-mentioned time unit counting or not. Ascending traversal or descending traversal can be used in 5), and traversal mode 1) can be locally introduced / combined when needed.

[0104] 6) Traverse based on the proportion of the number of SLIVs corresponding to the scheduling line corresponding to the first record before and after the time domain reference value.

[0105] In some embodiments, ascending traversal or descending traversal can be used in 6). In addition, traversal mode 1) can be locally introduced / combined when needed.

[0106] 7) Traverse based on the proportion of the number of time units spanned by the scheduling line corresponding to the first record before and after the time domain reference value.

[0107] Optionally, the proportion 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 SLIVs or the number of time units spanned. For the operation related to the number of time units, refer to traversal mode 5). When calculating the proportion, if the denominator is 0, the proportion can be directly set to a predefined value.

[0108] In some embodiments, ascending traversal or descending traversal can be used in 7). In addition, traversal mode 1) can be locally introduced / combined when needed.

[0109] In the embodiments of the present application, after determining the Occasion mapped by each first record, the Occasion set corresponding to the first record set and the mapping relationship between each first record and each Occasion can be determined, so as to determine the number of candidate PDSCH reception opportunities corresponding to each transmission opportunity.

[0110] Optionally, the number of candidate PDSCH reception opportunities corresponding to each Occasion can be the maximum value of the SLIV contained in the scheduling line corresponding to each first record mapped by each Occasion. In this case, the number of PDSCH transmissions scheduled or configured in a single DL Slot can be allowed to exceed 1.

[0111] In some embodiments, for a certain Occasion, when a certain (K1, row) record mapped by it is actually scheduled, based on the aforementioned time domain overlap restriction, at most only a single (K1, row) record can be actually scheduled, and the (K1, row) record corresponds to a scheduling row corresponding to / containing each SLIV (assuming N SLIVs) that can be mapped in a preset order to the first / last / specified N SLIVs in the M SLIVs (M >= N) corresponding to the Occasion. In typical cases, the preset order can be from front to back / left to right, and optionally, it can also be from back to front / right to left.

[0112] Optionally, when no more than 1 PDSCH transmission is allowed to be scheduled or configured in each DL Slot, i.e., at most only a single PDSCH transmission is allowed to be scheduled or configured in each DL Slot, the number of candidate PDSCH reception opportunities corresponding to each Occasion can be the maximum value of the number of first downlink slots contained in the scheduling row corresponding to each first record mapped by each Occasion, the first downlink slot being any downlink slot satisfying a third condition. The third condition is that the corresponding scheduling row has at least one SLIV in the downlink slot. The reason for setting the number of candidate PDSCH reception opportunities corresponding to each Occasion in this way can be understood as follows: for a certain scheduling row, at most only a single PDSCH transmission can be scheduled or configured in a certain DL Slot corresponding to / containing the SLIV, and then this DL Slot is counted as a single candidate PDSCH reception opportunity. Therefore, for this scheduling row, the number of candidate PDSCH reception opportunities corresponding to it is the number of DL Slots corresponding to / containing the SLIV. In order to ensure that the Occasion corresponding to this scheduling row reserves sufficient candidate PDSCH reception opportunities for any scheduling row corresponding to it, it is necessary to take the maximum value of the number of DL Slots in all scheduling rows corresponding to this Occasion.

[0113] In order to better understand the embodiments of the present application, the present application will be described in detail below in conjunction with examples.

[0114] Example 1

[0115] In Example 1, as shown in FIG. 1, a TDRA Table contains 2 rows, and a K1 Set contains 3 K1s, K1,0, K1,1 and K1,2. At most only a single PDSCH can be scheduled in each DL Slot, and the time domain is allocated continuously. Figure 3 In

[0116] Figure 3 ​In the present invention, when the conventional / existing method is adopted, because 10 DL slots are involved in the HARQ-ACK feedback window, a single schedulable PDSCH in each DL slot can be mapped to a single Occasion. Therefore, the HARQ-ACK codebook requires a total of 10 HARQ-ACK bits corresponding to the PDSCH.

[0117] exist Figure 3 In the embodiment, when the method in this solution is adopted, a record set containing 6 (K1, row) records can be traversed and generated, and when determining the Occasion set, the above S1 to S3 can be executed three times: when S1 to S3 are executed for the first time, the two (K1, row) records corresponding to K1,2 that meet the first condition are mapped to Occasion1; when S1 to S3 are executed for the second time, the two (K1, row) records corresponding to K1,1 that meet the first condition are first mapped to Occasion2, and then the one (K1, row) record corresponding to K1,0 that meets the second condition is mapped to Occasion2; when S1 to S3 are executed for the third time, the one (K1, row) record corresponding to K1,0 that meets the first condition is mapped to Occasion3. Since Occasion 1 corresponds to 4 candidate PDSCH reception opportunities, Occasion 2 corresponds to 4 candidate PDSCH reception opportunities, and Occasion 3 corresponds to 1 candidate PDSCH reception opportunity, Occasion 1, Occasion 2, and Occasion 3 correspond to a total of 9 candidate PDSCH reception opportunities. The HARQ-ACK feedback window only needs to map 9 candidate PDSCH reception opportunities, so that the HARQ-ACK codebook requires a total of 9 HARQ-ACK bits corresponding to candidate PDSCH reception opportunities. Compared with the prior art, the HARQ-ACK bits corresponding to a single candidate PDSCH reception opportunity can be saved (the single candidate PDSCH reception opportunity here can correspond to a single transmission opportunity in the prior art).

[0118] Example 2

[0119] In Example 2, Figure 4 As shown in Figure 1, the TDRA Table contains two rows, and the K1 Set contains three K1s, namely K1,0, K1,1, and K1,2. At most, only one PDSCH can be scheduled in each DL Slot, and the allocation is discontinuous in the time domain.

[0120] exist Figure 4In the case of the conventional / legacy method, because 6 DL Slots are involved in the HARQ-ACK feedback window, a single schedulable PDSCH in each DL Slot can be mapped to a single Occasion, thus the HARQ-ACK codebook needs 6 HARQ-ACK bits corresponding to 6 PDSCHs in total.

[0121] In the case of the conventional / legacy method, because 6 DL Slots are involved in the HARQ-ACK feedback window, a single schedulable PDSCH in each DL Slot can be mapped to a single Occasion, thus the HARQ-ACK codebook needs 6 HARQ-ACK bits corresponding to 6 PDSCHs in total. Figure 4 In the case of the conventional / legacy method, because 6 DL Slots are involved in the HARQ-ACK feedback window, a single schedulable PDSCH in each DL Slot can be mapped to a single Occasion, thus the HARQ-ACK codebook needs 6 HARQ-ACK bits corresponding to 6 PDSCHs in total.

[0122] Example 3

[0123] In Example 3, as shown in FIG. 3, the TDRA Table contains 5 rows, and the K1 Set contains 3 K1s, K1,0, K1,1 and K1,2. 0 / 1 / multiple PDSCHs can be scheduled in each DL Slot, and the time domain is not continuously allocated. Figure 5 In the case of the conventional / legacy method, because 6 DL Slots are involved in the HARQ-ACK feedback window, a single schedulable PDSCH in each DL Slot can be mapped to a single Occasion, thus the HARQ-ACK codebook needs 6 HARQ-ACK bits corresponding to 6 PDSCHs in total.

[0124] Figure 5 In the case of the conventional / legacy method, because 6 DL Slots are involved in the HARQ-ACK feedback window, a single schedulable PDSCH in each DL Slot can be mapped to a single Occasion, thus the HARQ-ACK codebook needs 6 HARQ-ACK bits corresponding to 6 PDSCHs in total.

[0125] In the case of the conventional / legacy method, because 6 DL Slots are involved in the HARQ-ACK feedback window, a single schedulable PDSCH in each DL Slot can be mapped to a single Occasion, thus the HARQ-ACK codebook needs 6 HARQ-ACK bits corresponding to 6 PDSCHs in total. Figure 5 ​When the method in the present solution is adopted, a record set containing 15 (K1, row) records can be generated, and when the Occasion set is determined, the above S1-S3 can be executed 6 times: when S1-S3 is executed for the first time, 1 (K1, row) record corresponding to K1,2 that meets the first condition (the row corresponding to the number 1 and not explicitly marked by the background pattern) is mapped to Occasion 1 first, and then 1 (K1, row) record corresponding to K1,2 that meets the second condition (the row corresponding to the number 1 and explicitly marked by the background pattern) is mapped to Occasion 1; when S1-S3 is executed for the second time, 3 (K1, row) records corresponding to K1,2 that meet the first condition (the rows corresponding to the number 2 and not explicitly marked by the background pattern) are mapped to Occasion 2; when S1-S3 is executed for the third time, 1 (K1, row) record corresponding to K1,1 that meets the first condition (the row corresponding to the number 3 and not explicitly marked by the background pattern) is mapped to Occasion 3 first, and then 1 (K1, row) record corresponding to K1,1 that meets the second condition (the row corresponding to the number 3 and explicitly marked by the background pattern) and 1 (K1, row) record corresponding to K1,0 that meets the second condition (the row corresponding to the number 3 and explicitly marked by the background pattern) are mapped to Occasion 3; when S1-S3 is executed for the fourth time, 3 (K1, row) records corresponding to K1,1 that meet the first condition (the rows corresponding to the number 4 and not explicitly marked by the background pattern) are mapped to Occasion 4; when S1-S3 is executed for the fifth time, 1 (K1, row) record corresponding to K1,0 that meets the first condition (the row corresponding to the number 5 and not explicitly marked by the background pattern) is mapped to Occasion 5 first, and then 1 (K1, row) record corresponding to K1,0 that meets the second condition (the row corresponding to the number 5 and explicitly marked by the background pattern) is mapped to Occasion 5; when S1-S3 is executed for the sixth time, 2 (K1, row) records corresponding to K1,0 that meet the first condition (the rows corresponding to the number 6 and not explicitly marked by the background pattern) are mapped to Occasion 6.

[0126] Since Occasion 1 corresponds to 5 SLIVs, Occasion 2 corresponds to 2 SLIVs, Occasion 3 corresponds to 5 SLIVs, Occasion 4 corresponds to 2 SLIVs, Occasion 5 corresponds to 2 SLIVs, and Occasion 6 corresponds to 2 SLIVs, i.e., Occasion 1 to Occasion 6 correspond to a total of 18 SLIVs, therefore, 18 SLIVs are involved in the HARQ-ACK feedback window, which can bring a reduction of 1 SLIV corresponding HARQ-ACK bit compared to the prior art.

[0127] Please refer toFigure 6 , Figure 6 is a flowchart of a codebook determination method provided by an embodiment of the present application, which is performed by a network-side device, as shown in Figure 6 , the method comprises the following steps:

[0128] Step 61: The network-side device receives a HARQ-ACK semi-static codebook from a terminal.

[0129] The HARQ-ACK semi-static codebook is generated by the terminal based on a time-domain feedback offset set and a time-domain resource allocation table, a first record set is generated by traversing, each first record in the first record set is determined based on one time-domain feedback offset in the time-domain feedback offset set and one row in the time-domain resource allocation table, a transmission opportunity mapped by each first record is determined, a number of candidate PDSCH reception opportunities corresponding to the transmission opportunity is determined, and the HARQ-ACK semi-static codebook is determined according to the number of candidate PDSCH reception opportunities.

[0130] In this way, redundant transmission opportunities can be reduced / avoided when determining transmission opportunities, thereby reducing / avoiding redundant HARQ-ACK bits in the HARQ-ACK semi-static codebook, improving HARQ-ACK feedback efficiency, and further improving data transmission performance / system resource use efficiency.

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

[0132] Optionally, in order to parse the received HARQ-ACK semi-static codebook, the network-side device can generate a first record set by traversing based on a time-domain feedback offset set and a time-domain resource allocation table, determine a transmission opportunity mapped by each first record in the first record set, and determine a number of candidate PDSCH reception opportunities corresponding to the transmission opportunity. Then, the length of the HARQ-ACK bit sequence corresponding to the HARQ-ACK semi-static codebook can be determined according to the determined number of candidate PDSCH reception opportunities.

[0133] Optionally, when determining the transmission opportunity mapped by each first record, the network-side device can perform the following process in a loop until the updated first record set is empty, and determine the transmission opportunity mapped by each first record according to the mapped reference transmission opportunity:

[0134] S1: Determine a time-domain reference value according to each first record in the first record set;

[0135] S2: mapping each first record in the first record set satisfying the first condition to a reference transmission opportunity corresponding to the time domain reference value, and sequentially traversing each first record in the first record set that is not mapped to a reference transmission opportunity, and mapping each first record satisfying the second condition to a reference transmission opportunity.

[0136] S3: deleting each first record in the first record set that is mapped to a reference transmission opportunity, to obtain an updated first record set.

[0137] The first condition includes that an ending moment or an ending symbol index of a corresponding scheduling row is equal to the time domain reference value, and the second condition includes that there is a time domain overlap between a corresponding scheduling row and any first record mapped to a reference transmission opportunity.

[0138] It should be noted that the manner in which the network side device determines the transmission opportunity to which each first record is mapped is the same as the manner in which the terminal determines the transmission opportunity to which each first record is mapped in the above Figure 2 embodiment, and thus will not be described again here.

[0139] It should be noted that the execution subject of the codebook determination method provided in the embodiments of the present application can be a codebook determination apparatus, or a control module in the codebook determination apparatus for executing the codebook determination method. In the embodiments of the present application, the codebook determination apparatus executing the codebook determination method is taken as an example to illustrate the codebook determination apparatus provided in the embodiments of the present application.

[0140] Please refer to Figure 7 , Figure 7 is a structural schematic diagram of a codebook determination apparatus provided in the embodiments of the present application, which is applied to a terminal, as shown in Figure 7 The codebook determination apparatus 70 includes:

[0141] A generation module 71 is configured to traverse and generate a first record set based on a time domain feedback offset set and a time domain resource allocation table, each first record in the first record set being determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table.

[0142] A first determination module 72 is configured to determine a transmission opportunity to which each first record is mapped.

[0143] A second determination module 73 is configured to determine a number of candidate PDSCH reception opportunities corresponding to the transmission opportunity.

[0144] A third determination module 74 is configured to determine a hybrid automatic repeat request-acknowledgement (HARQ-ACK) semi-static codebook according to the number of candidate PDSCH reception opportunities.

[0145] Optionally, the first determining module 72 is specifically configured to: cyclically execute the following process until the updated first record set is empty, and determine the transmission opportunity mapped by each first record according to the mapped reference transmission opportunity:

[0146] determine a time domain reference value according to each first record in the first record set;

[0147] map each first record in the first record set satisfying a first condition to a reference transmission opportunity corresponding to the time domain reference value, and sequentially traverse the first records in the first record set that are not mapped to the reference transmission opportunity, and map each first record satisfying a second condition to the reference transmission opportunity;

[0148] delete each first record in the first record set that is mapped to the reference transmission opportunity to obtain an updated first record set;

[0149] The first condition includes that the ending time or ending symbol index of the corresponding scheduling row is equal to the time domain reference value; and the second condition includes that the corresponding scheduling row and any first record mapped to the reference transmission opportunity have time domain overlap.

[0150] Optionally, the time domain reference value includes any one of the following:

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

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

[0153] Optionally, the determination method of whether there is time domain overlap between two scheduling rows includes any one of the following:

[0154] whether the time domain resource allocation record conflicting with the semi-static time division duplex configuration information is included in the determination of whether there is time domain overlap between two scheduling rows;

[0155] whether the time domain resource allocation record conflicting with the semi-static time division duplex configuration information is not included in the determination of whether there is time domain overlap between two scheduling rows.

[0156] Optionally, the determination method of whether there is time domain overlap between two scheduling rows includes any one of the following:

[0157] when there is time domain overlap between two scheduling rows at any position, it is determined that there is time domain overlap between the two scheduling rows;

[0158] when there are time domain resource allocation records in at least one same downlink time slot, it is determined that there is time domain overlap between the two scheduling rows.

[0159] Optionally, when sequentially traversing the first records in the first record set that are not mapped to the reference transmission opportunity, the traversal manner comprises at least one of the following:

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

[0161] traversing based on a start time and / or a start symbol index of a scheduling row corresponding to the first record;

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

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

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

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

[0166] traversing based on a proportion of the number of time units spanned by the scheduling row corresponding to the first record before and after the time domain reference value.

[0167] Optionally, the number of candidate PDSCH reception opportunities corresponding to the transmission opportunity is a maximum value of a number of time domain resource allocation records contained in the scheduling row corresponding to each first record mapped by the transmission opportunity.

[0168] Alternatively, the number of candidate PDSCH reception opportunities corresponding to the transmission opportunity is a maximum value of a number of first downlink slots contained in the scheduling row corresponding to each first record mapped by the transmission opportunity, the first downlink slot being any downlink slot satisfying a third condition, the third condition being that the scheduling row contains at least one time domain resource allocation record in the downlink slot.

[0169] Optionally, the first determining module 72 is specifically configured to traverse, according to a predefined direction, to determine the transmission opportunity mapped by each first record.

[0170] Optionally, the codebook determining apparatus 70 further comprises:

[0171] a sending module, configured to send the HARQ-ACK semi-static codebook to a network side device.

[0172] The codebook determination apparatus 70 in the embodiments of the present applicationapplicationbe a device, a device with an operating system, or an electronic device, andapplicationalso be a component in a terminal, an integrated circuit, or a chip. The device or electronic deviceapplicationbe a mobile terminal or a non-mobile terminal. Exemplarily, the mobile terminalapplicationinclude, but is not limited to, the types of the terminal 11 listed above, and the non-mobile terminalapplicationbe a server, a network attached storage (NAS), a personal computer (PC), a television (TV), a teller machine, or a self-service machine, and the like, without specific limitation in the embodiments of the present application.

[0173] The codebook determination apparatus 70 provided in the embodiments of the present applicationapplicationimplement the various processes of the method embodiments and achieve the same technical effects, and thus repeated description is omitted herein. Figure 2

[0174] Please refer to Figure 8 , Figure 8 is a structural schematic diagram of a codebook determination apparatus provided in the embodiments of the present application, whichapplicationbe applied to a network side device, such as a base station. Figure 8 As shown in FIG. 8, the codebook determination apparatus 80applicationinclude the following components.

[0175] A receiving module 81applicationbe configured to receive a HARQ-ACK semi-static codebook from a terminal. The HARQ-ACK semi-static codebookapplicationbe generated by the terminal based on a time domain feedback offset set and a time domain resource allocation table, by traversing to generate a first record set, determining each first record in the first record set based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, determining a transmission opportunity mapped by each first record, determining a number of candidate PDSCH reception opportunities corresponding to the transmission opportunity, and determining the HARQ-ACK semi-static codebook according to the number of candidate PDSCH reception opportunities.

[0176] Optionally, the codebook determination apparatus 80applicationfurther include the following components.

[0177] A fourth determination moduleapplicationbe configured to generate a first record set by traversing based on a time domain feedback offset set and a time domain resource allocation table, and determine a transmission opportunity mapped by each first record in the first record set.

[0178] A fifth determination moduleapplicationbe configured to determine a number of candidate PDSCH reception opportunities corresponding to the transmission opportunity.

[0179] A sixth determination moduleapplicationbe configured to determine a length of a HARQ-ACK bit sequence corresponding to the HARQ-ACK semi-static codebook according to the number of candidate PDSCH reception opportunities.

[0180] ​Optionally, the fourth determining module is further configured to: loop through the following process until the updated first record set is empty, and determine the transmission opportunity mapped to each first record based on the mapped reference transmission opportunity:

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

[0182] Mapping each first record in the first record set that meets the first condition to a reference transmission opportunity corresponding to the time domain reference value, and sequentially traversing first records in the first record set that are not mapped to the reference transmission opportunity, and mapping each first record that meets the second condition to the reference transmission opportunity;

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

[0184] Among them, the first condition includes: the end time or end symbol index of the corresponding scheduling row is equal to the time domain reference value; the second condition includes: the corresponding scheduling row has time domain overlap with the scheduling row corresponding to any first record mapped to the reference transmission opportunity.

[0185] The codebook determination device 80 provided in the embodiment of the present application can achieve the above Figure 6 The various processes implemented by the method embodiment achieve the same technical effect and are not described here again to avoid repetition.

[0186] Optional, such as Figure 9 As shown, the embodiment of the present application further provides a communication device 90, including a processor 91, a memory 92, and a program or instruction stored in the memory 92 and executable on the processor 91. For example, when the communication device 90 is a terminal, the program or instruction is executed by the processor 91 to implement the above Figure 2 When the communication device 90 is a network side device, the program or instruction is executed by the processor 91 for the first time to achieve the above Figure 6 The various processes of the embodiments in the present invention can achieve the same technical effects, and to avoid repetition, they will not be described here.

[0187] The embodiment of the application further provides a terminal, comprising a processor and a communication interface, the processor is used for traversing to generate a first record set based on a time domain feedback offset set and a time domain resource allocation table, each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table; determining a transmission opportunity mapped by the each first record; the terminal determines a number of candidate PDSCH receiving opportunities corresponding to the transmission opportunity; determining a HARQ-ACK semi-static codebook according to the number of candidate PDSCH receiving opportunities. The terminal embodiment is corresponding to the terminal side method embodiment described above, each implementation process and implementation manner of the method embodiment can be applied to the terminal embodiment, and the same technical effects can be achieved.

[0188] Specifically, Figure 10 A hardware structure diagram of a terminal for implementing the embodiment of the application.

[0189] The terminal 1000 includes, but is not limited to, at least part of components such as a radio frequency unit 1001, a network module 1002, an audio output unit 1003, an input unit 1004, a sensor 1005, a display unit 1006, a user input unit 1007, an interface unit 1008, a memory 1009, and a processor 1010.

[0190] Those skilled in the art can understand that the terminal 1000 can further include a power supply (such as a battery) for supplying power to each component, and the power supply can be logically connected to the processor 1010 through a power management system, so as to realize functions such as management of charging, discharging, and power consumption management through the power management system. Figure 10 The terminal structure shown in the figure does not constitute a limitation on the terminal, and the terminal can include more or fewer components than the figure, or combine certain components, or different component arrangements, which are not described here.

[0191] It should be understood that in the embodiments of the present application, the input unit 1004 can include a graphics processing unit (GPU) 10041 and a microphone 10042. The graphics processing unit 10041 processes image data of a still picture or a video obtained by an image capture device (such as a camera) in a video capture mode or an image capture mode. The display unit 1006 can include a display panel 10061, which can be configured in the form of a liquid crystal display, an organic light-emitting diode, etc. The user input unit 1007 includes a touch panel 10071 and other input devices 10072. The touch panel 10071 is also called a touch screen. The touch panel 10071 can include two parts of a touch detection device and a touch controller. The other input devices 10072 can include, but are not limited to, a physical keyboard, function keys (such as volume control keys, on-off keys, etc.), trackballs, mice, joysticks, etc., which will not be described here.

[0192] In the embodiments of the present application, the radio frequency unit 1001 receives the downlink data from the network side device and processes it by the processor 1010. In addition, the radio frequency unit 1001 sends the uplink data to the network side device. Generally, the radio frequency unit 1001 includes, but is not limited to, an antenna, at least one amplifier, a transceiver, a coupler, a low noise amplifier, a duplexer, etc.

[0193] The memory 1009 can be used to store software programs or instructions and various data. The memory 1009 can mainly include a storage program or instruction area and a storage data area, wherein the storage program or instruction area can store an operating system, at least one application program or instruction required by a function (such as a sound playing function, an image playing function, etc.), etc. In addition, the memory 1009 can include a high-speed random access memory, and can also include a non-volatile memory, which can 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. For example, at least one magnetic disk storage device, a flash memory device, or other non-volatile solid-state memory device.

[0194] The processor 1010 can include one or more processing units; optionally, the processor 1010 can integrate an application processor and a modem processor, wherein the application processor mainly processes an operating system, a user interface and an application program or instruction, etc., and the modem processor mainly processes wireless communication, such as a baseband processor. It can be understood that the above-mentioned modem processor can also not be integrated into the processor 1010.

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

[0196] Optionally, the processor 1010 is further configured to perform the following process in a loop until the updated first record set is empty, and determine the number of candidate PDSCH reception opportunities corresponding to the transmission opportunity according to the mapped reference transmission opportunity: determine a time domain reference value according to each first record in the first record set; map each first record in the first record set that satisfies a first condition to a reference transmission opportunity corresponding to the time domain reference value, and traverse each first record in the first record set that is not mapped to the reference transmission opportunity in sequence, and map each first record that satisfies a second condition to the reference transmission opportunity; and delete each first record in the first record set that is mapped to the reference transmission opportunity to obtain an updated first record set.

[0197] The first condition includes that an ending time or an ending symbol index of a corresponding scheduling row is equal to the time domain reference value; and the second condition includes that there is a time domain overlap between a corresponding scheduling row and any first record that is mapped to the reference transmission opportunity.

[0198] The terminal 1000 provided by the embodiments of the present application can implement the method embodiments of the method Figure 2 The method embodiments achieve the same technical effects, and thus details are not repeated here.

[0199] The embodiments of the present application also provide a network side device, which comprises a processor and a communication interface, 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 number of candidate PDSCH reception opportunities corresponding to a transmission opportunity, after the terminal traverses to generate a first record set based on a time domain feedback offset set and a time domain resource allocation table, each first record in the first record set is determined based on one time domain feedback offset in the time domain feedback offset set and one row in the time domain resource allocation table, and determines the transmission opportunity mapped by each first record. The network side device embodiment is corresponding to the network side device method embodiment described above, and each implementation process and implementation manner of the method embodiment described above can be applied to the network side device embodiment, and the same technical effects can be achieved.

[0200] Specifically, the embodiment of the present application further provides a network side device. As shown in the Figure 11 The network side device 110 includes an antenna 111, a radio frequency device 112, and a baseband device 113. The antenna 111 is connected with the radio frequency device 112. In the uplink direction, the radio frequency device 112 receives information through the antenna 111, and sends the received information to the baseband device 113 for processing. In the downlink direction, the baseband device 113 processes the information to be sent, and sends the processed information to the radio frequency device 112. The radio frequency device 112 processes the received information, and sends the processed information through the antenna 111.

[0201] The above frequency band processing device can be located in the baseband device 113. The method performed by the network side device in the above embodiment can be implemented in the baseband device 113, which includes a processor 114 and a memory 115.

[0202] The baseband device 113 can include at least one baseband board, for example, as shown in the Figure 11 One of the chips is, for example, the processor 114, which is connected with the memory 115 to call the program in the memory 115, and perform the operations of the network side device shown in the above method embodiment.

[0203] The baseband device 113 can further include a network interface 116 for interacting information with the radio frequency device 112. The interface is, for example, a common public radio interface (CPRI).

[0204] Specifically, the network side device of the embodiment of the present application further includes instructions or programs stored in the memory 115 and executable on the processor 114. The processor 114 calls the instructions or programs in the memory 115 to perform the method shown in the Figure 8 The modules shown in the above embodiment perform the method, and achieve the same technical effects. To avoid repetition, the details are not described here.

[0205] The embodiment of the present application further provides a readable storage medium, which stores programs or instructions. The programs or instructions are executed by the processor to implement the processes of the above codebook determination method embodiment, and achieve the same technical effects. To avoid repetition, the details are not described here.

[0206] The processor is the processor in the terminal in the above embodiment. The readable storage medium includes a computer readable storage medium, such as a computer readable memory (ROM), a random access memory (RAM), a magnetic disk or an optical disk, etc.

[0207] The chip provided by the embodiment of the present application comprises a processor and a communication interface, the communication interface is coupled with the processor, the processor is used to run programs or instructions, realizes the processes of the codebook determination method embodiments, and can achieve the same technical effects. To avoid repetition, details are not described here.

[0208] It should be understood that the chip mentioned in the embodiment of the present application can also be referred to as a system chip, a system chip, a chip system or a system on chip, etc.

[0209] It should be noted that in this paper, the terms "include", "contain" or any other variants thereof are intended to cover non-exclusive inclusion, so that the process, method, article or device including a series of elements not only includes those elements, but also includes other elements not explicitly listed or inherent to such process, method, article or device. Without more limitations, the element defined by the statement "including a" does not exclude the presence of other identical elements in the process, method, article or device including the element. In addition, it should be pointed out that the scope of the method and device in the embodiment of the present application is not limited to the order of functions shown or discussed, but can also include functions performed in a substantially simultaneous manner or in reverse order according to the functions involved, for example, the described method can be performed in an order different from the described order, and various steps can also be added, omitted or combined. In addition, the features described with reference to some examples can be combined in other examples.

[0210] From the above description of the embodiments, those skilled in the art can clearly understand that the above-mentioned embodiment method can be realized by software and necessary general hardware platform, of course, it can also be realized by hardware, but in many cases, the former is a better embodiment. Based on such understanding, the technical solutions of the present application can be embodied in the form of a computer software product, which is stored in a storage medium (such as ROM / RAM, magnetic disk, optical disk), including a plurality of instructions for making a terminal (which can be a mobile phone, computer, server, air conditioner or network side device, etc.) execute the method described in each embodiment of the present application.

[0211] The embodiments of the present application are described above in combination with the drawings, but the present application is not limited to the above-mentioned specific embodiments, the above-mentioned specific embodiments are only illustrative, not restrictive, and those skilled in the art can make many forms under the inspiration of the present application without departing from the scope of the present application and the protection scope of the claims.

Claims

1. A codebook determination method, characterized in that: include: The terminal traverses and generates a first record set based on the time domain feedback offset set and the time domain resource allocation table, where each first record in the first record set is determined based on a time domain feedback offset in the time domain feedback offset set and a row in the time domain resource allocation table; determining, by the terminal, a transmission opportunity mapped to each first record in the first record set; The terminal determines the number of candidate physical downlink shared channel PDSCH reception opportunities corresponding to the transmission opportunity; The terminal determines a hybrid automatic repeat request-acknowledgement HARQ-ACK semi-static codebook according to the number of candidate PDSCH reception opportunities, where the HARQ-ACK semi-static codebook is a codebook supporting multi-physical downlink shared channel Multi-PDSCH scheduling.

2. The method according to claim 1, characterized in that The determining a transmission opportunity mapped to each first record in the first record set includes: The terminal cyclically executes the following process until the updated first record set is empty, and determines the transmission opportunity mapped by each first record according to the mapped reference transmission opportunity: determining a time domain reference value according to each first record in the first record set; Mapping each first record in the first record set that meets the first condition to a reference transmission opportunity corresponding to the time domain reference value, and sequentially traversing first records in the first record set that are not mapped to the reference transmission opportunity, and mapping each first record that meets the second condition to the reference transmission opportunity; deleting each first record mapped to the reference transmission opportunity from the first record set to obtain an updated first record set; Among them, the first condition includes: the end time or end symbol index of the corresponding scheduling row is equal to the time domain reference value; the second condition includes: the corresponding scheduling row has time domain overlap with the scheduling row corresponding to any first record mapped to the reference transmission opportunity.

3. The method according to claim 2, characterized in that The time domain reference value includes any one of the following: the earliest value of the end time of the scheduling row corresponding to each first record in the first record set; The minimum value of the end symbol index of the scheduling row corresponding to each first record in the first record set.

4. The method according to claim 2, characterized in that The determination method for whether there is time domain overlap between two scheduling lines includes any of the following: The time domain resource allocation records that conflict with the semi-static time division duplex configuration information are included in the decision of whether there is time domain overlap between two scheduling rows; The time domain resource allocation record that conflicts with the semi-static time division duplex configuration information is not included in the determination of whether there is time domain overlap between two scheduling rows.

5. The method according to claim 2, characterized in that The determination method for the time domain overlap between two scheduling lines includes any of the following: When there is a time domain overlap between two scheduling rows at any position, determining that there is a time domain overlap between the two scheduling rows; When time domain resource allocation records exist in at least one same downlink time slot in two scheduling rows, it is determined that there is a time domain overlap between the two scheduling rows.

6. The method according to claim 2, characterized in that When sequentially traversing the first records in the first record set that are not mapped to the reference transmission opportunity, the traversal manner includes at least one of the following: Traversing based on the time domain feedback offset index and / or row index corresponding to the first record; Traversing based on the start time and / or start symbol index of the schedule row corresponding to the first record; Traversing based on the end time and / or end symbol index of the schedule row corresponding to the first record; Traversing based on the number of time domain resource allocation records corresponding to the scheduling row corresponding to the first record before or after the time domain reference value; Traversing based on the number of time units spanned by the schedule row corresponding to the first record before or after the time domain reference value; Traversing based on the ratio of the number of time domain resource allocation records corresponding to the scheduling row corresponding to the first record before and after the time domain reference value; The traversal is performed based on the ratio of the number of time units spanned by the schedule row corresponding to the first record before and after the time domain reference value.

7. The method according to claim 1, characterized in that The number of candidate PDSCH reception opportunities corresponding to the transmission opportunity is: the maximum number of time domain resource allocation records contained in the scheduling row corresponding to each first record of the transmission opportunity mapping; or, The number of candidate PDSCH receiving opportunities corresponding to the transmission opportunity is: the maximum value of the first downlink time slots contained in the scheduling row corresponding to each first record mapped by the transmission opportunity, and the first downlink time slot is any downlink time slot that meets the third condition, and the third condition is: there is at least one time domain resource allocation record in the downlink time slot of the scheduling row.

8. The method according to claim 1, characterized in that The determining a transmission opportunity mapped to each first record in the first record set includes: The terminal traverses and determines a transmission opportunity mapped to each first record in the first record set according to a predefined direction.

9. The method according to claim 1, characterized in that The terminal sends the HARQ-ACK semi-static codebook to the network side device.

10. A codebook determination method, characterized in that: include: The network side device receives a HARQ-ACK semi-static codebook from the terminal; wherein the HARQ-ACK semi-static codebook is a first record set generated by the terminal based on a time domain feedback offset set and a time domain resource allocation table, each first record in the first record set is determined based on a time domain feedback offset in the time domain feedback offset set and a row in the time domain resource allocation table, and the transmission opportunity mapped to each first record is determined. After determining the number of candidate PDSCH reception opportunities corresponding to the transmission opportunity, the number is determined according to the candidate PDSCH reception opportunities; the HARQ-ACK semi-static codebook is a codebook that supports Multi-PDSCH scheduling.

11. The method according to claim 10, characterized in that The method further comprises: The network-side device traverses and generates a first record set based on the time domain feedback offset set and the time domain resource allocation table, and determines a transmission opportunity mapped to each first record in the first record set; The network side device determines the number of candidate PDSCH reception opportunities corresponding to the transmission opportunity; The network side device determines, according to the number of candidate PDSCH reception opportunities, a length of a HARQ-ACK bit sequence corresponding to the HARQ-ACK semi-static codebook.

12. The method according to claim 11, characterized in that The determining of the transmission opportunity of each first record mapping includes: The network-side device cyclically performs the following process until the updated first record set is empty, and determines the transmission opportunity mapped by each first record based on the mapped reference transmission opportunity: determining a time domain reference value according to each first record in the first record set; Mapping each first record in the first record set that meets the first condition to a reference transmission opportunity corresponding to the time domain reference value, and sequentially traversing first records in the first record set that are not mapped to the reference transmission opportunity, and mapping each first record that meets the second condition to the reference transmission opportunity; deleting each first record mapped to the reference transmission opportunity from the first record set to obtain an updated first record set; Among them, the first condition includes: the end time or end symbol index of the corresponding scheduling row is equal to the time domain reference value; the second condition includes: the corresponding scheduling row has time domain overlap with the scheduling row corresponding to any first record mapped to the reference transmission opportunity.

13. A codebook determination device, characterized in that: include: a generating module, configured to traverse and generate a first record set based on a time domain feedback offset set and a time domain resource allocation table, wherein each first record in the first record set is determined based on a time domain feedback offset in the time domain feedback offset set and a row in the time domain resource allocation table; A first determining module, configured to determine a transmission opportunity mapped to each first record in the first record set; A second determining module is used to determine the number of candidate PDSCH receiving opportunities corresponding to the transmission opportunity; The third determining module is configured to determine a hybrid automatic repeat request-acknowledgement HARQ-ACK semi-static codebook according to the number of candidate PDSCH reception opportunities, where the HARQ-ACK semi-static codebook is a codebook supporting Multi-PDSCH scheduling.

14. A codebook determination device, characterized in that: include: A receiving module, configured to receive a HARQ-ACK semi-static codebook from a terminal; wherein the HARQ-ACK semi-static codebook is generated by the terminal through traversal based on a time domain feedback offset set and a time domain resource allocation table, wherein each first record in the first record set is determined based on a time domain feedback offset in the time domain feedback offset set and a row in the time domain resource allocation table, and after determining a transmission opportunity mapped to each first record and determining the number of candidate PDSCH reception opportunities corresponding to the transmission opportunity, the determination is based on the number of candidate PDSCH reception opportunities; and the HARQ-ACK semi-static codebook is a codebook that supports Multi-PDSCH scheduling.

15. A terminal, characterized in that: The method comprises a processor, a memory, and a program or instruction stored in the memory and executable on the processor, wherein the program or instruction, when executed by the processor, implements the steps of the codebook determination method according to any one of claims 1 to 9.

16. A network side device, characterized in that: The method comprises a processor, a memory, and a program or instruction stored in the memory and executable on the processor, wherein the program or instruction, when executed by the processor, implements the steps of the codebook determination method according to any one of claims 10 to 12.

17. A readable storage medium, characterized in that The readable storage medium stores a program or instruction, and when the program or instruction is executed by the processor, the steps of the codebook determination method according to any one of claims 1 to 9 are implemented, or the steps of the codebook determination method according to any one of claims 10 to 12 are implemented.

Images